Basics Archives Community Services Programming
Hardware Help About Search Your Account
   Home :: Archives :: File Archives :: Probabilistic Primality Test
Probabilistic Primality Test


Ranked as 30689 on our all-time top downloads list with 1750 downloads.
Ranked as 6535 on our top downloads list for the past seven days with 2 downloads.

Filename ppt.zip (Download)
Title Probabilistic Primality Test
Description This program is based on Fermat's theorem. You enter a number P and a base A such that (P,A)=1. If P fails for any base than it is composite. If P passes than it is probably prime. A prime will pass for all bases. The program can handle numbers up to around 2000000. It can prove 2029039=1013*2003 is composite in less than 3sec! Under 200 bytes
Author Derek Blair (wcis@canada.com)
Category TI-83/84 Plus BASIC Math Programs (Factoring, Primes)
File Size 333 bytes
File Date and Time Fri Aug 20 03:49:53 2004
Documentation Included? No


There are no reviews for this file.


Questions, comments, and problems regarding the file itself should be sent directly to the author(s) listed above.

Write a review for this file (requires a free account)

Report inappropriate or miscategorized file (requires an account; or you may email us directly)

If you have downloaded and tried this program, please rate it on the scale below
1  2  3  4  5  6  7  8  9  10  


Archive Contents
Name Size
PPT.8XP   237

  Copyright © 1996-2019, the ticalc.org project. All rights reserved. | Contact Us | Disclaimer