ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let h(n)h(n) be the largest ℓ\ell such that there is a sequence of primes p1<⋯<pℓp_1<\cdots < p_\ell all dividing nn with pi+1≡1(modpi)p_{i+1}\equiv 1\pmod{p_i}. Let H(n)H(n) be the largest uu such that there is a sequence of integers d1<⋯<dud_1<\cdots < d_u all dividing nn with di+1≡1(moddi)d_{i+1}\equiv 1\pmod{d_i}. Estimate h(n)h(n) and H(n)H(n). Is it true that H(n)/h(n)→∞H(n)/h(n)\to \infty for almost all nn?

Record

Added
Links

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.