Minimal elements for the base b representations of the prime numbers > b for the subsequence ordering, for 2 ≤ b ≤ 36
-
Updated
May 25, 2024 - C++
Minimal elements for the base b representations of the prime numbers > b for the subsequence ordering, for 2 ≤ b ≤ 36
Play with a lot of number theory things!
2️⃣ 3️⃣ 5️⃣ 7️⃣ Prime numbers for JavaScript
Hints & Solutions of Competitive Programming Problems of several Online Judges like Codeforces, AtCoder, UVA, LightOJ, SPOJ, InterviewBit, HackerEarth, CodeChef, HackerRank etc.
Floretions and Triangle Representations
FLINT (Fast Library for Number Theory)
Computational algebraic number theory
All problems solutions From Codeforces.com Website
(WIP) Esoteric Mathematic Library for Rust
A COLLECTION OF ALGORITHMS RELATED TO NUMBER THEORY
The agda-unimath library
Finding Sets of Positive Integers from which you can not Construct an Arithmetic Expression that Evaluates to Zero
Stack-based arbitrary-precision integers - Fast and portable with natural syntax for resource-restricted devices.
A formalised proof of Fermat's Last Theorem for exponent 3 in the Lean proof assistant.
Competitive programming related stuffs (Olympiads, Codeforces, USACO)
A Go library for checking whether an integer is prime or not, using either the AKS or Miller-Rabin algorithms.
A collection of packages related to math, algorithms and science, in Haskell.
Gaussian Integers and Gaussian Rational Numbers
Add a description, image, and links to the number-theory topic page so that developers can more easily learn about it.
To associate your repository with the number-theory topic, visit your repo's landing page and select "manage topics."