image thumbnail

updated almost 3 years ago

Method to find prime numbers by Gabriel Kasser

The goal is to present an algorithm that provides the prime numbers in an extremely simple way (math, prime, number)

fnc(x,b)

primeclassique.m

primemethod3.m

image thumbnail

updated almost 3 years ago

Extended Euclidean Algorithm by Michael Chan

Extended Euclidean algorithm is particularly useful when a and b are coprime, since x is the multip (extended euclidean al..., prime)

extendedEuclidean_backSubstitution (d, q, a, b, f)

extendedEuclidean_forward(p, q)

usage_extendedEuclidean.m

image thumbnail

updated almost 3 years ago

This program finds prime numbers manually by nathanial hapeman

matlab already has a function to do this but i wanted to see if i could code it manually (prime, for, while)

prime_numbers.m

image thumbnail

updated almost 10 years ago

ISPR - Use Java to determine arbitrarily large probable primes by Michael Kleder

Use a Java to rapidly determine whether an arbitrarily large positive integer is a prime (symbolic math, probable, prime)

q=ispr(varargin)

Contact us