The optimal upper-bound conjecture for Farey sequences of Γ_0(p^n)
Statement
Let be a prime and let . A Farey sequence of is denoted by . Optimal upper-bound conjecture. The group has a Farey sequence such that
The preceding algorithm achieves the analogous optimal upper bound for , motivating the expectation that a suitable modification works for in many cases; the asserted bound for all primes and 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.