MathDB
Problems
Contests
National and Regional Contests
USA Contests
USA - College-Hosted Events
CHMMC problems
2014 CHMMC (Fall)
9
9
Part of
2014 CHMMC (Fall)
Problems
(1)
2014 Fall Team #9
Source:
3/26/2022
There is a long-standing conjecture that there is no number with
2
n
+
1
2n + 1
2
n
+
1
instances in Pascal’s triangle for
n
≥
2
n \ge 2
n
≥
2
. Assuming this is true, for how many
n
≤
100
,
000
n \le 100, 000
n
≤
100
,
000
are there exactly
3
3
3
instances of
n
n
n
in Pascal’s triangle?
combinatorics
number theory