Lesson plan
Cipolla's algorithm
In computational number theory, Cipolla's algorithm is a technique for solving a congruence of the form : x^2\equiv n \pmod{p}, where x,n \in \mathbf{F}_{p} , so n is the square of x, and where p is an odd prime. Here \mathbf{F}_p denotes the finite field with p elements; \{0,1,\dots,p-1\} . The algorithm is named after Michele Cipolla, an Italian mathematician who discovered it in 1907. Apart from prime moduli, Cipolla's algorithm is also able to take square roots modulo prime powers.
Article summary
In computational number theory, Cipolla's algorithm is a technique for solving a congruence of the form : x^2\equiv n \pmod{p}, where x,n \in \mathbf{F}_{p} , so n is the square of x, and where p is an odd prime. Here \mathbf{F}_p denotes the finite field with p elements; \{0,1,\dots,p-1\} . The algorithm is named after Michele Cipolla, an Italian mathematician who discovered it in 1907. Apart from prime moduli, Cipolla's algorithm is also able to take square roots modulo prime powers.
Key claims
No claims recorded.
Discussion questions
- Summarise the article in your own words. Which single claim would you verify first, and why?
- Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
- If two sources disagreed about one of these facts, what would you need in order to trust one over the other?
Bibliography
No sources recorded.
Key claims and bibliography are generated from the same tracked claims and sources as the article page.