Python implementation of Quadratic Sieve Algorithm.

A C++ rational (fraction) template class

JNI bindings for primesieve

Math, algorithm, and data structure problems and solutions (http://codeforces.com/)

A compilation of mathematical functions and algorithms

Website for solving problems on number-theoretic methods of cryptography

Number Theory based algorithms explained in detail using Python/Java.

CRT Based Deterministic Factoring Algorithm and Implementation up to 130 bit Numbers

All interview question.

Google Extensions Compilation (Crypto, Recon, Encryption, Discovery)

The conjecture can be summarized as follows. Take any positive integer n. If n is even, divide it by 2 to get n / 2. If n is odd, multiply it by 3 and add 1 to obtain 3n + 1. Repeat the process (which has been called "Half Or Triple Plus One", or HOTPO) indefinitely. The conjecture is that no matter what number you start with, you will always ev…

This program uses Java in order to check if a number is a Mersenne Prime. A Mersenne Prime is defined as a number that can be written as M(n) = 2n − 1 for an integer n.

Lista - Matemática Discreta

My Codeforces handle is hobe_naki_hobe_na. Max Rating is 1647

A C++20 constexpr implementation of the sieve of Eratosthenes able to sieve above 2^64

Solutions for problems posted on the projecteuler.net website

A collection of number-theoretic algorithms in Haskell. It features an optimised sieve of Eratosthenes that relies on coprime embeddings.

Here i'm filling the programs from project euler.