combinatorics

combs

combo

fact

factquot

binom

variation

combination

permutation

lfact

lfactquot

lbinom

<ul>
<li><code>permutation</code> computes the number of permutations</li>
<li><code>variation</code> computes the number of variations with and without replication</li>
<li><code>combination</code> computes the number of combinations with and without replication</li>
<li><code>combinatorics</code> computes all combinatorics results for <code>k &lt; n</code> and returns it as list of:<dl>
<dt><code>permutation.n</code></dt>
<dd>\(P(n)\)</dd><dt><code>permutation.k</code></dt>
<dd>\(P(k)\)</dd><dt><code>permutation.nk</code></dt>
<dd>\(P(n; k)\)</dd><dt><code>variation</code></dt>
<dd>\(V(n;k)\)</dd><dt><code>variation.rep</code></dt>
<dd>\(V^W(n;k)\)</dd><dt><code>combination</code></dt>
<dd>\(K(n;k)\)</dd><dt><code>combination.rep</code></dt>
<dd>\(K^W(n;k)\)</dd>
</dl></li>
<li><code>lfact</code> computes the natural logarithm of the factorial of a given number <code>n</code></li>
<li><code>lfactquot</code> calculates the natural logarithm of the quotient of factorials</li>
<li><code>lbinom</code> computes the natural logarithm of the binomial coefficient, "<code>n</code> choose <code>k</code>"</li>
</ul>

The main aim is to further facilitate the creation of exercises based on the package 'exams'
by Grün, B., and Zeileis, A. (2009) <doi:10.18637/jss.v029.i10>. Creating effective student exercises
involves challenges such as creating appropriate data sets and ensuring access to intermediate values
for accurate explanation of solutions. The functionality includes the generation of univariate and
bivariate data including simple time series, functions for theoretical distributions and their approximation,
statistical and mathematical calculations for tasks in basic statistics courses as well as general tasks
such as string manipulation, LaTeX/HTML formatting and the editing of XML task files for 'Moodle'.

Sigbert Klinke

exams.forge

Support for Compiling Examination Tasks using the 'exams'
Package

combinatorics function

<dl><dt>n</dt>
<dd>numeric: total number of elements</dd>
<dt>k</dt>
<dd>numeric: number of elements to choose</dd>
<dt>repl</dt>
<dd>logical: with repetition (default: <code>FALSE</code>)</dd>
<dt>...</dt>
<dd>numeric: further arguments for <code>lfactquot</code></dd></dl>

Arguments

<ul>
<li><code>permutation</code> computes the number of permutations</li>
<li><code>variation</code> computes the number of variations with and without replication</li>
<li><code>combination</code> computes the number of combinations with and without replication</li>
<li><code>combinatorics</code> computes all combinatorics results for <code>k &lt; n</code> and returns it as list of:<dl>
<dt><code>permutation.n</code></dt>
<dd>\(P(n)\)</dd>

<dt><code>permutation.k</code></dt>
<dd>\(P(k)\)</dd>

<dt><code>permutation.nk</code></dt>
<dd>\(P(n; k)\)</dd>

<dt><code>variation</code></dt>
<dd>\(V(n;k)\)</dd>

<dt><code>variation.rep</code></dt>
<dd>\(V^W(n;k)\)</dd>

<dt><code>combination</code></dt>
<dd>\(K(n;k)\)</dd>

<dt><code>combination.rep</code></dt>
<dd>\(K^W(n;k)\)</dd>


</dl></li>
<li><code>lfact</code> computes the natural logarithm of the factorial of a given number <code>n</code></li>
<li><code>lfactquot</code> calculates the natural logarithm of the quotient of factorials</li>
<li><code>lbinom</code> computes the natural logarithm of the binomial coefficient, "<code>n</code> choose <code>k</code>"</li>
</ul>

Combinatorics — combinatorics

<dl>

<dt>n</dt>
<dd>numeric: total number of elements</dd>


<dt>k</dt>
<dd>numeric: number of elements to choose</dd>


<dt>repl</dt>
<dd>logical: with repetition (default: <code>FALSE</code>)</dd>


<dt>...</dt>
<dd>numeric: further arguments for <code>lfactquot</code></dd>

</dl>

combinatorics: Combinatorics

Description

Usage

Value

Arguments

Examples