Let f(x) return the number of times n appears in Pascal's Triangle. For example,(3)=2 and f(4)=2. If n is a positive integer, what is the minimum value of n ?
\(\text{At a minimum }\dbinom{n}{1}=\dbinom{n}{n-1}=n \text{ both appear}\\ \text{So the minimum number is }2\)
thx! I needed that