MathDB
Problems
Contests
Undergraduate contests
Miklós Schweitzer
1973 Miklós Schweitzer
3
3
Part of
1973 Miklós Schweitzer
Problems
(1)
Miklos Schweitzer 1973_3
Source:
11/12/2008
Find a constant
c
>
1
c > 1
c
>
1
with the property that, for arbitrary positive integers
n
n
n
and
k
k
k
such that
n
>
c
k
n>c^k
n
>
c
k
, the number of distinct prime factors of
(
n
k
)
\binom{n}{k}
(
k
n
)
is at least
k
k
k
. P. Erdos
logarithms
floor function
number theory
prime numbers
number theory proposed