MathDB

Miklos Schweitzer 1973_3

Source:

November 12, 2008

logarithmsfloor functionnumber theoryprime numbersnumber theory proposed

Problem Statement

Find a constant

c > 1

with the property that, for arbitrary positive integers

n

and

k

such that

n>c^k

, the number of distinct prime factors of

\binom{n}{k}

is at least

k

. P. Erdos