Converting from a string to a number in base-64...

How to generate distinct combinations from a given array such that every digit in sequence is also d...

For a given value of n and m, find fib(n) mod m where n is very huge. (Pisano Period)...

Project Euler #23 Optimization...

Euler Project problem #12 Python code gives weird results...

How do I calculate a number if its number of factors (N) and number of prime factors (K) are given?...

How to find the product of all the possible subarrays in an array in linear time?...

Find four factors of a number such that their product is maximum and their sum is the original numbe...

Efficiently finding the number of divisors in Haskell...

Time and Space Complexity for PCP and Halting Problem...

Trying to find cause of possible overflow in my approach when trying to solve...

Asking ideas of a codeforces problem (Problem-483A Counterexample)...

Finding Bezout coefficients via Extended Euclidean Algorithm on Array of Arbitrary Length...

minimum greater number with different adjacent digits...

Printing Carmichael numbers in a given limit...

miller-rabin test don't work for 252097800623...

How to determine if a number is polygonal for a polygon with s sides...

Picking A, C and M for Linear congruential generator...

Error in C program to find integer triplets (x,y,z) such that n^x + n^y = n^z for given range of n...

What is the fastest way to determine n^m = m^n if m != n?...

why 1 is subtracted from mod where mod =1000000007 in calculation...

Why is this failing for just a corner case? Question link-https://www.hackerearth.com/problem/algori...

Counting distinct digits...

Finding all even factorizations of a given number n - javascript python...

Different implementations for Extended Euclidean algorithm yield different results?...

Number of partition of `n` into sum of three squares (fast algorithm)...

Create faster Fibonacci function for n > 100 in MATLAB / octave...

Find count of all such distinct tuples, (i, j, k) where (i*j)%k == 0...

Calculating 1^X + 2^X + ... + N^X mod 1000000007...

Question about modulus of large numbers in Python...