Combinatorics

9000141501

Level: 
B
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.)
\(8\)
\(64\)
\(32\)

9000139706

Level: 
A
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?
\(36^{4}=1\:679\:616\)
\(10\cdot 26^{4}=4\:569\:760\)
\(\frac{36!} {32!\, 4!}=58\:905\)
\(\frac{26!} {22!\, 4!}=14\:950\)