ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let a(n)a(n) denote the recursive divisor function, and call a positive integer nn ample when a(n)>na(n)>n. Let p1,p2,…p_1,p_2,\ldots be the primes in increasing order. Fink's conjecture. For every positive integer kk, there exists an ample number not divisible by any of p1,…,pkp_1,\ldots,p_k. 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.