ticalc.org
Basics Archives Community Services Programming
Hardware Help About Search Your Account
   Home :: Archives :: File Archives :: Brent-Pollard Rho Algorithm
Brent-Pollard Rho Algorithm

FILE INFORMATION

Ranked as 35515 on our all-time top downloads list with 1076 downloads.

primebp.zip
Filename primebp.zip (Download)
Title Brent-Pollard Rho Algorithm
Description APRIMEBP: This is the Brent-Pollard rho algorithm. It is a monte carlo method for factoring composite numbers. Its speed varies because some of the constants are randomized, so the time differs for the same number. In average though, it is a very fast algorithm. It will only give you one factor, which won't always be the smallest one. APRIMEP: This is Pollards monte carlo method which Brent improved upon. It's a lot simpler, but a bit slower. Brent says that he's algorithm is about 24% faster, and that seems correct. APRIMBPT: This is a simplification of Brent's algorithm for which I am responsible. It is not as fast, but it seems to fail less often, ( i.e. retreat to using Pollard's algorithm ).
Author Anders Tiberg (anders.tiberg@telia.com)
Category TI-83/84 Plus BASIC Math Programs (Factoring, Primes)
File Size 2,135 bytes
File Date and Time Thu Oct 6 05:06:46 2011
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
APRIMBPT.8xp   235
APRIMEBP.8xp   297
APRIMEP,BP&BPT.rtf   2288
APRIMEP.8xp   178

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