Susumu Yamazaki
zacky1972
Total Packages
35
Total Downloads
140 436+
Packages
lehmer_gcd
1.0.2An efficient implementation of the Lehmer GCD algorithm for computing the greatest common divisor of large integers in Elixir.
garnet
0.0.0Garnet: uses Hastega and Cockatoris
galgan
0.0.0Gulgan
quezacotl
0.0.0Quezacotl
quetzalli
0.1.0Quetzalli
sabotender
0.0.0Sabotender: efficient multi-tasking mechanism
prime_factorization
1.1.0A fast and efficient Elixir library for prime factorization of integers.
trailing_zeros
1.0.1A fast and efficient Elixir library for counting trailing zeros in the binary representation of integers.
common_twos
1.0.0A utility library for finding common factors of 2 between two numbers using efficient bitwise operations.
nerves_system_kd240
0.1.0Nerves System - Kria KD240
binary_lehmer_gcd
1.0.0A high-performance implementation of the greatest common divisor (GCD) algorithm that combines binary GCD with Lehmer's algorithm for optimal performance on large integers.
crandall_reduction
1.0.0A pure Elixir implementation of the Crandall reduction algorithm for efficient modular arithmetic.
bit_length
1.0.0A utility library for calculating the bit length of integers in Elixir.
fermat_primality_test
1.0.0A probabilistic primality test implementation in Elixir based on Fermat's Little Theorem.
perfect_power
1.0.0A mathematical library for detecting perfect powers in Elixir.