加载中…
For a prime number , we denote by the greatest odd divisor of . Tonelli–Shanks algorithm is a classical algorithm to compute a square root of a quadratic residue modulo as the product of , which we call {\it Tonelli–Shanks power of }, and a correction term given as a power of a quadratic non-residue modulo . We prove the transcendence over of the images of the following in the ring of integers modulo infinitely large primes: the greatest odd divisor of , the composite of any injective map and the greatest -power dividing , Tonelli–Shanks power of any , and the correction term of Tonelli–Shanks algorithm for such .

生成讲解博客的中文版本

生成AI智能校验的中文版本