Search results
61 packages found
Compute the gcd and solve Bezout's identity using the extended Euclidean algorithm.
glsl implementation of the Euclid's algorithm for the calculation of the greatest common divisor.
Use this package for simple computation purpose
greater common divisor (gcd) of two BigInt values using Lehmer's GCD algorithm
Common typescript ready prototypes available in both CommonJS and ECMAScript
- server-side
- client-side
- common
- typescript
- prototype
- array
- all
- any
- append
- average
- chunk
- clone
- compact
- contains
- View more
Tools used to understand or work with numbers in Node.JS, Javascript and derivatives.
- number
- numbers
- math
- theory
- abundant
- adaptive simpson
- addition
- affine
- arithmetic
- basic
- bates
- binomial
- box muller
- box muller transform
- View more
Lightweight utils for every project
- utils
- clean-obj
- object
- array
- lodash
- ramda
- get-enum-values
- unnest
- plain-object
- odd
- alphanumeric
- between
- cpf
- cnpj
- View more
Some common functions for modular arithmetic using native JS implementation of BigInt
Integers for JavaScript
- abitrary
- addition
- algorithm
- arithmetic
- big
- big-int
- big-integer
- big-integers
- big-num
- big-number
- big-numbers
- bigint
- biginteger
- bigintegers
- View more
A JavaScript library that provides a bunch of useful, optimized and often math-related functions
JS/TS number utilities
- number-slayer
- fp
- number
- utility
- javascript
- typescript
- range
- addCommasToNumber
- zeroPad
- nthRoot
- gcd
- greatest-common-divisor
- lcm
- least-common-multiple
- View more
Brain games are set of console mini-games.
games of the brains
Brain Games Hexlet project №1
Lightweight and modular math toolbox
educational projecton on JS, contains mini-games
There are 5 games: brain-even, brain-calc, brain-gcd, brain-progression, brain-prime