PSSQ Algorithm |
| Description: | The PSSQ Algorithm accepts a prime p congruent to 1 mod 4 and returns the pair [x,y] such that the equality p=2+y^2 is satisfied. There can only be one such pair and this algorithm finds it very quickly, processing a 45-digit prime in less than half a second. Based on the algorithm devised by Stan Wagon with improvements by John Brillhart. |
| Filename: | pssq.zip |
| ID: | 9258 |
| Author: | Jim Cullen |
| Downloaded file size: | 87,510 bytes |
| Size on calculator: | 2 KB |
| Platforms: | Prime |
| User rating: | 10/10 with 1 vote (you must be logged in to vote) |
| Primary category: | Math |
| Languages: | ENG |
| File date: | 2021-03-14 11:10:06 |
| Creation date: | 2021-03-14 |
| Source code: | Not included |
| Download count: | 243 |
| Version history: | 2021-04-10: Added to site
|
| Archive contents: | Length Date Time Name
--------- ---------- ----- ----
1772 2021-03-14 11:52 pssq.hpprgm
9406 2021-03-14 11:52 PSSQ Algorithm.docx
81629 2021-03-14 11:52 PSSQ Algorithm.pdf
--------- -------
92807 3 files |
|
| User comments: | No comments at this time. |
| You must be logged in to add your own comment. |