Algorithm for determining whether certain numbers appear in Pascal's triangle

47 Views Asked by At

Is there any easy characterisation for the numbers which appear in Pascal's triangle that ARE NOT $\dbinom{n}{1}$, $\dbinom{n}{n-1}$?

Is there a fast way to determine if some number (given its prime factorisation) appears in the described manner?

Thanks!!!!!