prime-numbers

Prime numbers, you can Validate, get list or get multiply table.

Versions

Stable Version GitHub Release

Features

Validate number if it’s a prime number.
Generate list of prime numbers (by size).
Create Multiply table of prime numbers.

Installation

go get -u github.com/gouef/prime-numbers

Usages

Validate

function Validate returns bool.

package main

import (
	"log"
	primeNumbers "github.com/gouef/prime-numbers"
)

func main() {
	num := 13
	isPrime := primeNumbers.Validate(num)
	if isPrime == false {
		log.Fatalf("Number : %v is not a prime number", num)
	}
}

Generator

function Generator returns []int of prime numbers.

package main

import (
	"log"
	primeNumbers "github.com/gouef/prime-numbers"
)

func main() {
	size := 3
	listPrimeNumbers := primeNumbers.Generate(size) // returns []int{2, 3, 5}
	
	if len(listPrimeNumbers) == 3 {
		// ...
    }
}

MultiplyTable

function MultiplyTable returns map[int]map[int]int of prime numbers.

package main

import (
	"log"
	primeNumbers "github.com/gouef/prime-numbers"
)

func main() {
	size := 3
	numberTable := primeNumbers.MultiplyTable(size) 
	// returns map[int]map[int]int{
	//  2: {2: 4, 3: 6, 5: 10},
	//  3: {2: 6, 3: 9, 5: 15},
	//  5: {2: 10, 3: 15, 5: 25},
    // }

	for i1, l := range numberTable {
		for i2, m := range l {
            log.Printf("Number %v x %v = %v", i1, i2, m)
		}
	}
}