This Java program converts a natural number into a set-theoretic encoding using iteration. Request h...

Logical error in finding the prime number between two numbers...

Number theory algorithms. Most divisors on the segment...

Kaprekar numbers: I Get ValueError: invalid literal for int() with base 10 ''...

C++ Number theory: Fastest way to compute max(y = a_i * x+ b_i) <= k...

How to make the Sieve of Eratosthenes faster?...

Different ways of generating the partitions of a number in order...

What is the reason behind calculating GCD in Pollard rho integer factorisation?...

Getting the GHC to accept type signature with KnownNat arithmetic...

RSA key generation...

How should I generate random numbers for a genetic algorithm?...

How to find m in c = m^e (mod n) if c, e, n are known...

Finding 2 pentagonal numbers whose sum and difference produce pentagonal number...

how to represent a number as a sum of 4 primes?...

MASH-2 hash function...

Modular arithmetic and semi elgamal encryption...

How to compute the remainder of a very large number (string with 1 mi digits) in the division by 150...

Needs a proof in a part of prime factorisation...

How to define matching axis notches from existing "step list"...

Speed up calculation of partitions in Haskell...

Find sum of factors...

Miller-Rabin Primality test in Java...

Acm problem on Euler's Totient function (Homework)...

Java BigInteger , number theory , modular arithmetic...

Maximum "divide" operations on an array...

Find smallest integer in array which is a divisor of all previous integers...

Algorithm Optimization (Prime Factorization)...

Can a given number be written as a sum of two or more consecutive positive integers?...

Explanation of the following algorithm to find nCr modulo P...

Represent natural number as sum of distinct squares...