User talk:Carlton25

Erika Sutter
Your edit was not removed because anyone thought that you were a troll or a sockpuppet. There was trolling, vandalism, and possibly sockpuppetry by another editor, and it appears that your edit may have been removed by accident in the process of cleaning up behind the vandalism. I suggest that you discuss your edit, which was a small factual correction, on the article talk page, Talk:Erika Sutter. Robert McClenon (talk) 00:47, 30 January 2018 (UTC)

→Thank you Robert McClenon, I appreciate you helping me understand this. I'll do what you suggest. Also the other links and helpful resources are very welcome and I'll get reading. In the meantime I'll see if I am able to make any edits without them being reversed by this Dawnseeker2000 account, as so far he has reversed every single one. Carlton25 (talk) 11:05, 30 January 2018 (UTC)

Both Tonelli-Shanks and Cipolla's modular square root algorithms can handle powers of prime modula (not just primes)
I looked up Dickson's History of Numbers vol 1 p215(Tonelli) and p218(Cipolla) and Dickson clearly shows that both modular square root algorithms can handle powers of prime modula (whereas the Wiki articles say they can only do prime modula).

I've updated the TALK pages of both articles with the relevant Dickson math, along with numeric runthroughs with Mathematica code.

However, I am not a professional mathematician so I hesitate to update the articles.

Perhaps yourself, or someone else in the Computer science field could update the relevant articles with this information from Dickson.

The articles in question are:


 * Tonelli–Shanks algorithm


 * Cipolla's algorithm

Endo999 (talk) 20:20, 14 February 2018 (UTC)


 * Unfortunately I would not class myself as a professional mathematician either, so wouldn't feel comfortable updating these pages. Carlton25 (talk) 13:23, 26 February 2018 (UTC)