Jim Cullen

First Name:Jim
Last Name:Cullen
Web Address:http://members.bex.net/jtcullen515
Last Change:2021-04-10
Number of Files:3 (544th most prolific)
Number of Downloads:1,993 (2,152nd most downloaded)

Baillie-PSW Primality Test Variant 1.1   (details) Prime ENG   155KB/6KB
The Baillie-BPSW Primality Test is a probabilistic algorithm to determine the primality of a given integer up to several hundred decimal digits. This implementation is a fast efficient variant of that algorithm that has no known pseudoprimes.
By Jim Cullen. 2021/04/10

Generalized Fibonacci Numbers 1.5   (details) 49/50 ENG   8KB/1KB
Very fast System RPL functions for calculating the full integer values of Fibonacci Numbers, Lucas Numbers, and other Generalized Fibonacci recursive sequences. Source code, help text, and algorithm details included.
By Jim Cullen. 2009/08/29

PSSQ Algorithm   (details) Prime ENG   86KB/2KB
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.
By Jim Cullen. 2021/04/10

Part of the HP Calculator Archive,
Copyright 1997-2023 Eric Rechlin.