Erdős Problem #700 — Let f(n)=min_1<k≤ n/2gcd(n,binomnk). - Characterise those composite n such that f(n)=n/P(n), where P(n) is the largest prime dividing n.
Statement
Let
-
Characterise those composite such that , where is the largest prime dividing .
-
Are there infinitely many composite such that ?
-
Is it true that, for every composite , for every ?
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.