ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let H(n)H(n) be the smallest integer ll such that there exist k<lk<l with (kn−1,ln−1)=1(k^n-1,l^n-1)=1. Is it true that H(n)=3H(n)=3 infinitely often? (That is, (2n−1,3n−1)=1(2^n-1,3^n-1)=1 infinitely often?) Estimate H(n)H(n). Is it true that there exists some constant c>0c>0 such that, for all ϵ>0\epsilon>0, H(n)>exp⁡(n(c−ϵ)/log⁡log⁡n)H(n) > \exp(n^{(c-\epsilon)/\log\log n}) for infinitely many nn and H(n)<exp⁡(n(c+ϵ)/log⁡log⁡n)H(n) < \exp(n^{(c+\epsilon)/\log\log n}) for all large enough nn? Does a similar upper bound hold for the smallest kk such that (kn−1,2n−1)=1(k^n-1,2^n-1)=1?

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.