Let \(A\) be a
set with \(n\)
mutually different elements. If we add one element to the set
\(A\), the number of
\(3\)-combinations
of a set \(A\) is
increased by \(21\).
Find \(n\).
Let \(A\) be set with
\(n\) mutually different
elements. If \(n\) is increased
by \(2\), then number
of \(3\)-permutations
is increased by \(384\).
Find \(n\). (The term
„\(k\)-permutation” stands for
an ordered arrangement of \(k\)
objects from a set of \(n\)
objects.)
Assuming \(x\in \mathbb{N}\),
find the solution set of the following equation.
\[
\left({11\above 0.0pt
4} \right) =\left ({11\above 0.0pt
x} \right)
\]
The international alphabet contains \(26\)
letters. The letters of this alphabet and the digits from
\(0\) to
\(9\) are used to form a
code of the length \(4\)
(a code contains \(4\)
characters). The characters may repeat through the code and the code is not case
sensitive (uppercase letters are equivalent to lowercase letters). How many codes can
be obtained?