User talk:Delmania
Welcome!
[edit]Hello Delmania, welcome to Wikipedia! Thank you for your contributions. I hope you like the place and decide to stay. Our intro page contains a lot of helpful material for new users - please check it out! If you need help, visit Wikipedia:Questions, ask me on my talk page, or place {{helpme}} on this page and someone will show up shortly to answer your questions.
Ironholds 14:11, 1 July 2008 (UTC)
Integrated banner for WikiProject Computer science
[edit]I have made a proposal for a integrated banner for the project here . I invite you for your valuable comments in the discussion. You are receiving this note as you are a member of the project. Thanks -- Tinu Cherian - 12:56, 5 August 2008 (UTC)
Hi. We're into the last five days of the Women in Red World Contest. There's a new bonus prize of $200 worth of books of your choice to win for creating the most new women biographies between 0:00 on the 26th and 23:59 on 30th November. If you've been contributing to the contest, thank you for your support, we've produced over 2000 articles. If you haven't contributed yet, we would appreciate you taking the time to add entries to our articles achievements list by the end of the month. Thank you, and if participating, good luck with the finale!
Both Tonelli-Shanks and Cipolla's modular square root algorithms can handle powers of prime modula (not just primes)
[edit]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: