Clangin

Welcome!

Hello, Clangin! Welcome to Wikipedia! Thank you for your contributions to this free encyclopedia. If you decide that you need help, check out Getting Help below, ask me on my talk page, or place {{helpme}} on your talk page and ask your question there. Please remember to sign your name on talk pages by clicking or using four tildes (~~~~); this will automatically produce your username and the date. Finally, please do your best to always fill in the edit summary field. Below are some useful links to facilitate your involvement. Happy editing! -- Levine2112 discuss 02:26, 10 July 2008 (UTC) Getting started A tutorial • Our five pillars • Getting mentored How to: edit a page • upload and use images Getting help Frequently asked questions • Tips Where to ask questions or make comments Request administrator attention Policies and guidelines Neutral point of view • No original research Verifiability • Reliable sources • Citing sources What Wikipedia is not • Biographies of living persons Manual of Style • Three-revert rule • Sock puppetry Copyrights • Policy for non-free content • Image use policy External links • Spam • Vandalism Deletion policy • Conflict of interest • Notability The community Build consensus • Resolve disputes Assume good faith • Civility • Etiquette No personal attacks • No legal threats Community Portal • Village pump Signpost • IRC channels • Mailing lists Writing articles Be bold in editing • Develop an article The perfect article • Manual of style Stubs • Categories • Disambiguation Pages needing attention • Peer review Miscellaneous User name • User pages • Talk pages Clean up: General - Spam - Vandalism Join a WikiProject • Translation Useful templates • Tools • User scripts

Integrated banner for WikiProject Computer science

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 - 09:50, 3 August 2008 (UTC)

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, 14 February 2018 (UTC)