ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let pp be a prime and let n≥3n\geq 3. A Farey sequence of Γ0(pn)\Gamma_0(p^n) is denoted by {ei}\{e_i\}. Optimal upper-bound conjecture. The group Γ0(pn)\Gamma_0(p^n) has a Farey sequence {ei}\{e_i\} such that

ei≤pn−1.e_i\leq p^{n-1}.

The preceding algorithm achieves the analogous optimal upper bound 2n−12^{n-1} for Γ0(2n)\Gamma_0(2^n), motivating the expectation that a suitable modification works for Γ0(pn)\Gamma_0(p^n) in many cases; the asserted bound for all primes pp and n≥3n\geq 3 is not established here.

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.