Menu
Search

Forums

Forum Index

Thread overview
Does D have any number theory libraries?
Nov 08, 2021
Enjoys Math
Nov 08, 2021
Imperatorn
Nov 08, 2021
Imperatorn
November 08, 2021
Gravatar of Enjoys MathPosted by Enjoys MathReply
Enjoys Math
Gravatar of Enjoys Math


Reply

In particular what I need are the fast implementations of:

  1. The Nth prime number.
  2. Prime Omega and/or Mobius function.
  3. Works with some type of BigInt.
  4. Primorial.
  5. Divisors of N.
  6. Extended GCD algorithm.

They don't have to be the state-of-the art, but it would be nice if they didn't simply do the bruteforce algorithm everywhere.

November 08, 2021
Gravatar of ImperatornPosted by Imperatorn
in reply to Enjoys Math		Reply
Imperatorn
Gravatar of Imperatorn
Posted in reply to Enjoys Math


Reply

On Monday, 8 November 2021 at 19:59:35 UTC, Enjoys Math wrote:

>

In particular what I need are the fast implementations of:

  1. The Nth prime number.
  2. Prime Omega and/or Mobius function.
  3. Works with some type of BigInt.
  4. Primorial.
  5. Divisors of N.
  6. Extended GCD algorithm.

They don't have to be the state-of-the art, but it would be nice if they didn't simply do the bruteforce algorithm everywhere.

Check out Mir:
https://github.com/libmir

And std.numeric:
https://dlang.org/library/std/numeric.html

Primes:
https://code.dlang.org/packages/math-primes

Möbius:
https://rosettacode.org/wiki/M%C3%B6bius_function#D

November 08, 2021
Gravatar of ImperatornPosted by Imperatorn
in reply to Imperatorn		Reply
Imperatorn
Gravatar of Imperatorn
Posted in reply to Imperatorn


Reply

On Monday, 8 November 2021 at 20:09:26 UTC, Imperatorn wrote:

>

On Monday, 8 November 2021 at 19:59:35 UTC, Enjoys Math wrote:

>

In particular what I need are the fast implementations of:

  1. The Nth prime number.
  2. Prime Omega and/or Mobius function.
  3. Works with some type of BigInt.
  4. Primorial.
  5. Divisors of N.
  6. Extended GCD algorithm.

They don't have to be the state-of-the art, but it would be nice if they didn't simply do the bruteforce algorithm everywhere.

Check out Mir:
https://github.com/libmir

And std.numeric:
https://dlang.org/library/std/numeric.html

Primes:
https://code.dlang.org/packages/math-primes

Möbius:
https://rosettacode.org/wiki/M%C3%B6bius_function#D

GMP:
https://code.dlang.org/packages/gmp-d

Linear algebra:
https://github.com/kaleidicassociates/lubeck

SciD:
https://github.com/DlangScience/scid

https://johanengelen.github.io/ldc/2016/10/11/Math-performance-LDC.html