+0  
 
0
663
1
avatar+49 

Hi there! I'm working on some practice problems in my workbook for a class, and I came across this problem:

 

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 ?

 

But I cannot seem to get the write answer out of it. Every time I submit an answer it's wrong. Please help! Tysm!

 Jun 26, 2020
 #1
avatar+23246 
0

I believe that the number 2 is found only once; in the line 1  2   1.

 

Unless what is meant the number of times a digit is found (which can be part of a longer number) ...

 Jun 26, 2020

6 Online Users

avatar
avatar
avatar