Conjecture on prime powers and the Pratt-tree function
Statement
Let denote primes. For a prime , construct a tree rooted at by linking each prime power exactly dividing to , and recursively linking each to the prime powers exactly dividing . Let be the largest proper prime power occurring in , with when no proper prime power occurs. Prime-power tree conjecture. For every prime power , there is a prime with
and
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.