Fink's conjecture on ample numbers avoiding the first primes
Statement
Let denote the recursive divisor function, and call a positive integer ample when . Let be the primes in increasing order. Fink's conjecture. For every positive integer , there exists an ample number not divisible by any of . This parallels the corresponding known property of abundant numbers, while odd ample numbers and examples avoiding the first prime have been found; the conjecture remains open.
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.