ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let n≥2n\geq 2 be an integer, let pp range over primes, and let hc(x)=xn+c mod ph_c(x)=x^n+c\bmod{p}. The total periodic diagram TPD⁡(hc,m)\operatorname{TPD}(h_c,m) is the diagram for the first mm primes, plotting the number of periodic points of hch_c for each prime. Branch-count conjecture. The diagram contains as many branches as there are possible values of gcd⁡(n,p−1)\gcd(n,p-1). This predicts that the observed periodic-point counts separate according to the possible gcd values; the supplied text gives computational examples motivating the claim but does not state a proof or resolution.

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.