User talk:Cosmic Quasar

 Hello, and Welcome to Wikipedia!  Welcome to Wikipedia! I hope you enjoy the encyclopedia and want to stay. As a first step, you may wish to read the Introduction.

If you have any questions, feel free to ask me at my talk page — I'm happy to help. Or, you can ask your question at the New contributors' help page.

--- Here are some more resources to help you as you explore and contribute to the world's largest encyclopedia...

Finding your way around:


 * Table of Contents


 * Department directory

Need help?


 * Questions — a guide on where to ask questions.
 * Cheatsheet — quick reference on Wikipedia's mark-up codes.
 * Wikipedia's 5 pillars — an overview of Wikipedia's foundations
 * Article Wizard - a Wizard to help you create articles


 * The Simplified Ruleset — a summary of Wikipedia's most important rules.
 * Guide to Wikipedia — A thorough step-by-step guide to Wikipedia.

How you can help:


 * Contributing to Wikipedia — a guide on how you can help.


 * Community Portal — Wikipedia's hub of activity.

Additional tips...


 * Please sign your messages on talk pages with four tildes ( ~ ). This will automatically insert your "signature" (your username and a date stamp). The [[Image:Signature_icon.png]] button, on the tool bar above Wikipedia's text editing window, also does this.


 * If you would like to play around with your new Wiki skills the Sandbox is for you.

, good luck, and have fun.

Women in Red World Contest
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)
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) 04:57, 13 February 2018 (UTC)