Let \(A\) be a
set with \(n\)
mutually different elements. If two elements are removed from
\(A\), the number of all
permutations of set \(A\)
decreases \(20\)-times.
Find \(n\).
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.)
The phone number contains nine digits. A witness does not remember
the full number, but he remembers that the phone number starts by
\(728\), ends
by \(01\)
and there is no repeating digit in the number. How many phone numbers meet these
conditions?
The shooting club has \(25\)
members. Among the members it is necessary to vote a board: a president, a cashier
and a webmaster. One person cannot have more than one of these positions and there
is only one member skilled enough to be a webmaster. How many possibilities exist to
set up the board?