Level:
Project ID:
9000141501
Source Problem:
Accepted:
1
Clonable:
1
Easy:
0
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\)