prime

Documentation

Index

• func Factorize(n int64) map[int64]int64
• func Generate(limit int) []int
• func GenerateChannel(ch chan<- int)
• func MillerRabinTest(num, rounds int64) (bool, error)
• func MillerTest(d, num int64) (bool, error)
• func NaiveApproach(n int) bool
• func PairApproach(n int) bool
• func Sieve(in <-chan int, out chan<- int, prime int)

Functions

func Factorize

func Factorize(n int64) map[int64]int64

Factorize is a function that computes the exponents of each prime in the prime factorization of n

func Generate

func Generate(limit int) []int

Generate returns a int slice of prime numbers up to the limit

func GenerateChannel

func GenerateChannel(ch chan<- int)

Generate generates the sequence of integers starting at 2 and sends it to the channel `ch`

func MillerRabinTest

func MillerRabinTest(num, rounds int64) (bool, error)

MillerRabinTest Probabilistic test for primality of an integer based of the algorithm devised by Miller and Rabin.

func MillerTest

func MillerTest(d, num int64) (bool, error)

MillerTest This is the intermediate step that repeats within the miller rabin primality test for better probabilitic chances of receiving the correct result.

func NaiveApproach

func NaiveApproach(n int) bool

NaiveApproach checks if an integer is prime or not. Returns a bool.

func PairApproach

func PairApproach(n int) bool

PairApproach checks primality of an integer and returns a bool. More efficient than the naive approach as number of iterations are less.

func Sieve

func Sieve(in <-chan int, out chan<- int, prime int)

Sieve Sieving the numbers that are not prime from the channel - basically removing them from the channels