nepaluf.blogg.se - Basic number theory problems

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).Compute nCr % p | Set 1 (Introduction and Dynamic Programming Solution).Find remainder without using modulo operator.Modular Exponentiation (Power in Modular Arithmetic).

Euler’s Totient function for all numbers smaller than or equal to n.

Integer sequences: Fibonacci, Padovan, OESIS.

Basic and Extended Euclidean algorithms.

ISRO CS Syllabus for Scientist/Engineer Exam.

ISRO CS Original Papers and Official Keys.

GATE CS Original Papers and Official Keys.