ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For an integer kk, let CkC_k be the set of positive integers nn such that n>max⁡(k,0)n > \max(k,0) and an−k+1≡a(modn)a^{n-k+1} \equiv a \pmod{n} for all integers aa. For squarefree k>0k>0, define the generalized Carmichael numbers by

Nk=Ck∖{kp:p≡1(modλ(k)gcd⁡(λ(k),k))},N_k=C_k\setminus\left\{kp:p\equiv 1\pmod{\frac{\lambda(k)}{\gcd(\lambda(k),k)}}\right\},

and set Nk=CkN_k=C_k for the other values of kk. Let

Nk(X)=∣Nk∩(0,X]∣.N_k(X)=\lvert N_k\cap(0,X]\rvert.

Generalized Carmichael symmetry conjecture. For all integers kk,

lim⁡X→∞N−k(X)Nk(X)=1.\lim_{X\to\infty}\frac{N_{-k}(X)}{N_k(X)}=1.

The conjecture is based on numerical comparisons of the counting functions and concerns the asymptotic relationship between generalized Carmichael numbers for opposite parameters. The source gives no resolution, so it 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.