Collection of algorithm implementations for Go.

Damm
Damm64 (using quasigroups for character base from 3 to 64 characters)
Luhn

Greatest common divisor (Euclid)

Implementation of error detection algorithm for numeric codes from H. Michael Damm.

import "github.com/petoc/algo/damm"

damm.Calculate("123456789") // 4
damm.Validate("1234567894") // true

Based on error detection algorithm from H. Michael Damm. Uses pre-generated quasigroups for character base from 3 to 64 characters.

import "github.com/petoc/algo/damm64"

base := "0123456789ABCDEFGHIJKLMNOPQRSTUV"
damm64.Calculate(base, "G12Q") // F
damm64.Validate(base, "G12QF") // true

Implementation of error detection algorithm for numeric codes from Hans Peter Luhn.

import "github.com/petoc/algo/luhn"

luhn.Calculate("123456789") // 7
luhn.Validate("1234567897") // true

import "github.com/petoc/algo/gcd"

gcd.Euclid(8, 12) // 4

Damm Quasigroups (https://www.md-software.de/math/DAMM_Quasigruppen.txt)

Licensed under MIT license.