Jump to content

User talk:Caleb Stanford/Archive 1

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

Skyline math competitions

[edit]

hey cstanford i checked the links you posted about the math competitions, they are out of date and don't work. do you want to update? (john from skyline) Jch22 (talk) 23:23, 15 March 2011 (UTC)[reply]

[edit]

Hi. Thank you for your recent edits. Wikipedia appreciates your help. We noticed though that when you edited Projective Set (game), you added a link pointing to the disambiguation page Vectors. Such links are almost always unintended, since a disambiguation page is merely a list of "Did you mean..." article titles. Read the FAQ • Join us at the DPL WikiProject.

It's OK to remove this message. Also, to stop receiving these messages, follow these opt-out instructions. Thanks, DPL bot (talk) 09:24, 15 March 2015 (UTC)[reply]

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:

Tonelli–Shanks algorithm
Cipolla's algorithm

Endo999 (talk) 04:54, 13 February 2018 (UTC)[reply]