+0

# Why is nobody helping me?

+1
38
2
+63

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 ?

May 16, 2019

#1
+5018
+2

$$\text{At a minimum }\dbinom{n}{1}=\dbinom{n}{n-1}=n \text{ both appear}\\ \text{So the minimum number is }2$$

.

May 16, 2019
#2
+63
+1

thx! I needed that

ProffesorNobody  May 17, 2019