Skip to main content
MathOverflow

Return to Question

Post Reopened by Igor Rivin, Stefan Kohl♦, Yemon Choi, Alexey Ustinov, Wolfgang
deleted 33 characters in body
Source Link
Alexey Ustinov
Alexey Ustinov
  • 12.3k
  • 7
  • 87
  • 119

There is a number $n \in \mathbb{N}, \ n > 1, n < 2^k$. How to prove this statement:
$n$ is included into Pascal triangle not more than $2k -2$ times? I have no idea how to solve this.

There is a number $n \in \mathbb{N}, \ n > 1, n < 2^k$. How to prove this statement:
$n$ is included into Pascal triangle not more than $2k -2$ times? I have no idea how to solve this.

There is a number $n \in \mathbb{N}, \ n > 1, n < 2^k$. How to prove this statement:
$n$ is included into Pascal triangle not more than $2k -2$ times?

Post Closed as "Not suitable for this site" by Will Jagy, Lucia, Steven Landsburg, Andrés E. Caicedo, Gerry Myerson
Source Link
Secondflooroffice
Secondflooroffice
  • 53
  • 4

A question about Pascal triangle

There is a number $n \in \mathbb{N}, \ n > 1, n < 2^k$. How to prove this statement:
$n$ is included into Pascal triangle not more than $2k -2$ times? I have no idea how to solve this.