I was preparing my self before an exam and I found this question:
For each of the following equations, find a positive integer $n$ that satisfies the equation. The notation $p(n,r)$ stands for $n(n-1)\ldots(n-r+1).$
$p(n,2) = 30$
$p(n,3)=24p(n,2)$
$10p(n,2)=p(3n-1,2)+40$
How can I solve this?
Any help will be appreciated!
Presumably this is not a single problem, but three separate problems. The notation $p(n,r)$ most likely stands for $n(n-1)(n-2)\ldots(n-r+1),$ the number of ways to fill $r$ slots with elements taken from a set of size $n.$ Each exercise then boils down to some algebra.