Обсуждение:Алгоритм Гельфонда — Шенкса

Последнее сообщение: 4 года назад от Adamant.pwn в теме «dickson's work on tonelli says the algorithm will work on mod p^k»


вопрос по алгоритму править

почему в статье в пункте 3.2. алгоритма используется    , а не    ?

dickson's work on tonelli says the algorithm will work on mod p^k править

I'm not a professional mathematician but I just read Dickson's "History of Numbers" [1] where it says on page 215 that

A. Tonelli[2] gave an explicit formula for the roots of  

Perhaps some mathematician should work out if the Tonelli algorithm takes modular square roots for powers of primes as well as for primes This Wiki article says the algorithm only works for prime modula.

After reading the Dickson text a couple of times on p215,216 I came across this formula for the square root of  .

when  , or   and  
for   then
  where  

Noting that   and noting that   then

 

So Tonelli's math does seem to take modular square roots of prime powers!


Here's another equation:   and

 


On page 215-216 of the Dickson book, the equation is given of Tonelli's:

  where   and  ;

Using   and using the modulus of   the math follows (in mathematica):

Mod[1115^2, 23 23 23]=2191
 
Mod[1115^2, 23]=6
PowerMod[6, 1/2, 23]=11

Mod[11^(23 23) 2191^((23 23 23 - 2 23 23 + 1)/2), 23 23 23] =1115

Thus Tonelli's work can work for a 3 mod 4 prime power.

Endo999 (обс.) 23:33, 31 января 2018 (UTC)Ответить

I don't recall posting, if I did, sorry. It definitely belongs on the tonelli-shank modular square root article
  1. "History of the Theory of Numbers" Volume 1 by Leonard Eugene Dickson, p215 url=https://ia800209.us.archive.org/12/items/historyoftheoryo01dick/historyoftheoryo01dick.pdf
  2. "AttiR. Accad. Lincei, Rendiconti, (5), 1, 1892, 116-120."