Documentation
¶
Index ¶
- func Convergent[T common.Integers](n T, fn convergentSeries) (*big.Int, *big.Int)
- func DigitSum[T common.Integers](n T) T
- func DigitsToInt(digits []int8) int
- func Divisors[T common.Integers](n T) []T
- func E[T common.Integers](n T) int64
- func Factors(n int) []int
- func FactorsCounted(n int) map[int]int
- func GCD[T common.Integers](a, b T) T
- func GCDBigInt(a, b *big.Int) *big.Int
- func Hamming(n int) bool
- func Hammings(n int) []int
- func Harshad[T common.Integers](n T) bool
- func IntToDigits[T common.Integers](n T) []int8
- func IsCube[T common.Integers](n T) bool
- func IsInt[T common.Floats](n T) bool
- func IsSquare[T common.Integers](n T) bool
- func KSmooth(n, k int) bool
- func KSmooths(n, k int) []int
- func LCM[T common.Integers](a, b T) T
- func LCMBigInt(a, b *big.Int) *big.Int
- func MaxBigInt(a, b *big.Int) *big.Int
- func MinBigInt(a, b *big.Int) *big.Int
- func MulFraction[T common.Integers](n1, d1, n2, d2 T) (T, T)
- func MulFractionBigInt(n1, d1, n2, d2 *big.Int) (*big.Int, *big.Int)
- func NextSquare[T common.Numbers](n T) (uint, uint)
- func PascalTriangle(max int) [][]int
- func PowerMod(base, exp, mod int) int
- func PythagoreanTriples(upper int) [][3]int
- func ReduceFraction[T common.Integers](n, d T) (T, T)
- func ReduceFractionBigInt(n, d *big.Int) (*big.Int, *big.Int)
- func Sqrt2[T common.Integers](n T) int64
- func SquareFree(n int) bool
- func SumFraction[T common.Integers](n1, d1, n2, d2 T) (T, T)
- func SumFractionBigInt(n1, d1, n2, d2 *big.Int) (*big.Int, *big.Int)
- func Totient(n int) int
- func Totients(upper int) []int
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
func Convergent ¶
Convergent returns the nth convergence of whichever series you pass in a function for
func DigitsToInt ¶
DigitsToInt converts a slice of digits to an int
func FactorsCounted ¶
FactorsCounted returns counts of how many times each factor divides into n
func IntToDigits ¶
IntToDigits converts an integer into a slice of its component digits
func MulFraction ¶
MulFraction returns the product of the two fractions, still in fraction form
func MulFractionBigInt ¶ added in v0.0.11
MulFractionBigInt returns the product of the two fractions, still in fraction form
func NextSquare ¶
NextSquare returns the next highest square and its square root
func PascalTriangle ¶
PascalTriangle returns a triangle of the max depth specified
func PythagoreanTriples ¶ added in v0.15.0
PythagoreanTriples returns Pythagorean Triple primitives [a,b,c] where c <= upper
func ReduceFraction ¶
ReduceFraction returns the lowest that n and d reduce to
func ReduceFractionBigInt ¶ added in v0.0.11
ReduceFractionBigInt returns the lowest that n and d reduce to
func SquareFree ¶
SquareFree returns true if no square of a prime divides n
func SumFraction ¶
SumFraction returns the sum of the two fractions, still in fraction form
func SumFractionBigInt ¶ added in v0.0.11
SumFractionBigInt returns the sum of the two fractions, still in fraction form
Types ¶
This section is empty.
Source Files