Jump to content

User talk:Eriksilkensen

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia

This is the current revision of this page, as edited by Endo999 (talk | contribs) at 16:01, 1 February 2018 (Cipolla's algorithm and Tonelli's algorithm are able to find square roots of powers of prime modula: new section). The present address (URL) is a permanent link to this version.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)


Welcome

[edit]

Welcome!

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

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! ~ AmeIiorate U T C @ 04:09, 1 September 2008 (UTC)[reply]

Hi. There's a question for you at Talk:A-normal form. Cheers, —Ruud 11:19, 16 November 2012 (UTC)[reply]

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!

Cipolla's algorithm and Tonelli's algorithm are able to find square roots of powers of prime modula

[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:

Tonelli–Shanks algorithm
Cipolla's algorithm

By the way I used to live in Boston, I attended Boston University in the 1980s, and I used to visit friends at NorthEastern University.

Endo999 (talk) 16:01, 1 February 2018 (UTC)[reply]