ticalc.org
Basics Archives Community Services Programming
Hardware Help About Search Your Account
   Home :: Archives :: File Archives :: Primes with Fermat
Primes with Fermat

FILE INFORMATION

Ranked as 38186 on our all-time top downloads list with 58 downloads.
Ranked as 4819 on our top downloads list for the past seven days with 4 downloads.

primferm.zip
Filename primferm.zip (Download)
Title Primes with Fermat
Description This program utilizes the fact that if you have two positive numbers A and B, and sqrt(B^2 - A) is a positive integer, then B - sqrt(B^2 - A) and B + sqrt(B^2 - A) are factors in A. If A has two factors, ( which may or may not be prime numbers ), B is ( F1 + F2)/2, where F1 is the smallest factor. This is known as Fermats factorisation method. So B is always bigger than or equal to sqrt A and smaller than or equal to F2. Therefore this method is extremely fast when the two factors are of similar size. However it is just as slow a way, when there is a big difference in size, compared to an ordinary program, and so this program also features a very fast conventional program, which counts up much faster than the ordinary one. Enclosed is a link to a Wikipedia article on the subject.
Author Anders Tiberg (anders.tiberg@telia.com)
Category TI-83/84 Plus BASIC Math Programs (Factoring, Primes)
File Size 2,298 bytes
File Date and Time Sat Aug 17 16:05:08 2019
Documentation Included? Yes

SCREEN SHOTS

REVIEWS

There are no reviews for this file.

LEAVE FEEDBACK

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
BadGood
1  2  3  4  5  6  7  8  9  10  

ARCHIVE CONTENTS

Archive Contents
Name Size
PRIMFERM.8xp   331
PRIMFERM.rtf   1556
PRIMFERM-1.png   867

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