ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let pp be a prime, and let IpI_p denote the number of parameters aa for which the functional graph associated with the quadratic polynomial faf_a is connected. The computations use the connectedness-testing algorithm described above and the corresponding values of IpI_p. Asymptotic conjecture.

Ip∼2pas p→∞.I_p \sim \sqrt{2p}\quad\text{as }p\to\infty.

This conjecture is based on computational data for selected primes and predicts the asymptotic growth of the number of connected functional graphs in this family. The supplied text gives no proof or resolution, so its status 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.