‘Practice Problems’ on Modular Arithmetic.How to avoid overflow in modular multiplication?.Number of substrings divisible by 6 in a string of integers.Rearrange an array in maximum minimum form | Set 2 (O(1) extra space).Find power of power under mod of a prime.Partition a number into two divisble parts.Count all sub-arrays having sum divisible by k.Find sum of modulo K of first N natural number.Find Last Digit Of a^b for Large Numbers.GCD of two numbers when one of them can be very large.Program to find last digit of n’th Fibonnaci Number.
Measure one litre using two vessels and infinite water supply.Searching for Patterns | Set 3 (Rabin-Karp Algorithm).Pollard’s Rho Algorithm for Prime Factorization.Sum of divisors of factorial of a number.number-theoryGenerators of finite cyclic group under addition.Legendre’s formula (Given p and n, find the largest x such that p^x divides n!).Primality Test | Set 4 (Solovay-Strassen).Primality Test | Set 1 (Introduction and School Method).Multiply large integers under large modulo.Using Chinese Remainder Theorem to Combine Modular equations.Euler’s criterion (Check if square root under modulo p exists).Primitive root of a prime number n modulo n.Cyclic Redundancy Check and Modulo-2 Division.Find Square Root under Modulo p | Set 2 (Shanks Tonelli algorithm).Find Square Root under Modulo p | Set 1 (When p is in form of 4*i + 3).Chinese Remainder Theorem – Set 1 (Introduction), Set 2 (Inverse Modulo based Implementation).Compute nCr % p | Set 3 (Using Fermat Little Theorem).Compute nCr % p | Set 2 (Lucas Theorem).
ISRO CS Original Papers and Official Keys.GATE CS Original Papers and Official Keys.
0 kommentar(er)
