Cryptproject

Welcome!

Hello, Cryptproject, and welcome to Wikipedia! Thank you for your contributions. I hope you like the place and decide to stay. Here are some pages that you might find helpful:

• The five pillars of Wikipedia
• Tutorial
• How to edit a page and How to develop articles
• How to create your first article (using the Article Wizard if you wish)
• Manual of Style

I hope you enjoy editing here and being a Wikipedian! Please sign your messages on discussion pages using four tildes (~~~~); this will automatically insert your username and the date. If you need help, check out Wikipedia:Questions, ask me on my talk page, or ask your question on this page and then place {{helpme}} before the question. Again, welcome! — Emil J. 14:07, 1 February 2010 (UTC)

Shared account

Please, make yourself familiar with our username policy. In particular, only individual accounts are permitted on Wikipedia, sharing accounts is not allowed. If you are two people, as you claim on your user page, you should each create your own account. — Emil J. 14:07, 1 February 2010 (UTC)

dickson's work on tonelli says the algorithm will work on mod p^k

With regards to the Tonelli-Shanks modular square root algorithm which you edited some time ago.

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

A. Tonelli gave an explicit formula for the roots of $x^{2}=c({\bmod {p^{\lambda }}})$

Perhaps some mathematician, like you guys, 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. Endo999 (talk) 05:23, 1 September 2017 (UTC)