ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let p,q,r,sp,q,r,s denote primes. For a prime qq, construct a tree T(q)T(q) rooted at qq by linking each prime power pep^e exactly dividing q−1q-1 to qq, and recursively linking each pep^e to the prime powers rbr^b exactly dividing p−1p-1. Let f(q)f(q) be the largest proper prime power occurring in T(q)T(q), with f(q)=1f(q)=1 when no proper prime power occurs. Prime-power tree conjecture. For every prime power pap^a, there is a prime qq with

pa∣(q−1)p^a\mid(q-1)

and

f(q)<pa+1.f(q)<p^{a+1}.

This condition is intended to support the iterative argument toward the conjecture that every positive integer has another integer with the same Carmichael value; the source provides no proof or resolution of this auxiliary claim.

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.