Multiple solutions for same number of combinations

24 Views Asked by At

Can we have distinct pairs of integers, say (n,r) and (N,R) such that number of combinations for each pair ( first integer is higher) has the same numerical value ? C(n,r) = C(N,R)

1

There are 1 best solutions below

0
On

An example: $C(4 , 2)=C(6,1)$.