Using extended euclidean algorithm to find number of intersections of a line segment with points on ...

Digit wise modulo for calculating power function for very very large positive integers...

Resize image to contain exactly 120 pixels maintaining aspect ratio as closely as possible...

Lehmann algorithm doesn't make sense...

Prime factorization in prolog...

Generate very very large random numbers...

How does this code find the number of trailing zeros from any base number factorial?...

Multiplicative orders Vs order of a multiplicative group...

Infinite lazy lists of digits...

Algorithms to compute Frobenius Numbers of a set of positive integers...

Does it gets faster than this?...

Finding the number of integer partitions given a total, a number of parts, and a maximum summand...

number of solution to nonlinear congruence equation...

How to find total number of divisors upto N?...

count distinct prime factors...

Number Theory - Factors, HCF and LCM...

Find a random number generator using a given random number generating function...

Euclidean program for finding gcd in c...

finding ((a +b)/c)mod m...

Number Theory Optimization Required...

Bitshifts to obtain remainder...

What's the linear equivalent of this exponential distortion of random distribution?...

How to generate all multiplicative partitions of a number if I have a list of primes/exponents?...

Find pairs in an array such that a%b = k , where k is a given integer...

Why does fmod(55.8,9.3) return 9.3 when 55.8/9.3 =6?...

algorithm to find ten integers>0 that sum to 2011 but their reciprocals sum to 1...

Efficient algorithm for finding a common divisor closest to some value?...

A fast algorithm to minimize a pseudo Diophantine equation...

Understanding of the given Hash function...

Binary GCD Algorithm vs. Euclid's Algorithm on modern computers...