a_k_s_primality_test

A pure Elixir implementation of the AKS (Agrawal-Kayal-Saxena) primality test algorithm.

zacky1972
Algorithms and Data structures

Package Resources

a_k_s_primality_test
zacky1972/a_k_s_primality_test
Documentation
Changelog

Stars

1

Unreleased Activity

Unknown

First Release

9

months ago

Last Release

9

months ago

Downloads

99.7k

last 90 days

Last Stable Version

1.1.1

Activity

last year

Pull Requests

Open 0
Merged 0

Latest Merged Pull Requests

No Github activity

Issues

Open 0
Closed 0

Version 1.1.1

Published Jul 2025 •
Elixir Version Requirement ~> 1.14
Documentation for 1.1.1

Dependencies

4
lehmer_gcd ~> 1.0

An efficient implementation of the Lehmer GCD algorithm for computing the greatest common divisor of large integers in Elixir.

nstandard ~> 0.1

A standard library setup based on the Nerves project standard practices.

perfect_power ~> 1.0

A mathematical library for detecting perfect powers in Elixir.

prime_factorization ~> 1.0

A fast and efficient Elixir library for prime factorization of integers.

Changelog for 1.1.1
Inspect source for 1.1.1

Community

Looks like this space is still empty… Want to be the first to contribute?

Share an article, talk, or podcast by adding resources to this package.

Related Packages

91 packages

jumper

1.0.2

Jump consistent hash implementation in Elixir

ex_hash_ring

7.0.0

A fast consistent hash ring implementation in Elixir.

ra

3.1.5

Raft library

flow

1.2.4

Computational parallel flows for Elixir