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.)
There are \(20\) tablets in an
e-shop. From this amount \(18\)
tablets are new and \(2\)
tablets have been returned by customers. The e-shop manager gets an order
containing three tablets and he wants to get rid of the returned tablets first. How
many possibilities exist to complete the order?
A DJ's playlist contains \(18\)
songs. In this list there are \(7\)
rap songs, \(5\)
oldies and \(6\)
rock songs. The opening part should consist of one rap song, two oldies and one rock
song. The order of the songs does not matter. Find the number of possible ways how
to put the opening together.
There are \(20\) tablets in an
e-shop. From this amount \(18\)
tablets are new and \(2\)
tablets have been returned by customers. The e-shop manager gets an order
containing three tablets and he wants to use only the new tablets for this order. How
many possibilities exist to complete the order?
There are \(15\)
athletes in an athletic meeting. Determine in how many ways it is possible to
obtain the results on the first six places of the scoreboard if the place on
scoreboard cannot be shared (one athlete per one place on scoreboard).