Skip to content

Transcendence of Tonelli--Shanks Power Modulo Infinitely Large Primes

Tomoki Mihara

math.NTarXiv:2608.24932

Abstract

For a prime number p, we denote by kp the greatest odd divisor of p-1. Tonelli--Shanks algorithm is a classical algorithm to compute a square root of a quadratic residue n ∈ Z modulo p as the product of nkp+12, which we call Tonelli--Shanks power of n, and a correction term given as a power of a quadratic non-residue modulo p. We prove the transcendence over Q of the images of the following in the ring A of integers modulo infinitely large primes: the greatest odd divisor kp of p-1, the composite f(p - 1kp) of any injective map f Z Z and the greatest 2-power p - 1kp dividing p-1, Tonelli--Shanks power np+12 of any n ∈ Z \-1,0,1\, and the correction term of Tonelli--Shanks algorithm for such n.

Create a lesson