You may have wondered about the vast and endless nature of topics important(or I should say sufficient) for competitive programming point of view. Well to sum it all I have prepared a list(huge one!!!). It contains all the famous problems,algorithms and data structure…………………………

**(a)Number Theory**

- Prime Number Generation (Sieve, Segmented Sieve)
- Euler Totient Theorem
- Fermat’s Theorem
- HCF & LCM (Euclid)
- Linear Diophantine Equations (Extended Euclid)
- Modulus Arithmetic (addition,multiplication,subtraction,modular Inverse)
- Cycle Finding (Floyd Algo and Brent Algo)
- Integer Factorization (Trial Division , Pollard Rho method)
- Lucas Theorem (Simple & Advance)
- Chinese Remainder Theorem
- Wilson Theorem
- Miller – Rabin Primality Testing
- Perfect Numbers
- Goldbach Conjecture

**(b)Probability**

- Basic Probability and Conditional Probability
- Random Variables
- Probability Generating Functions
- Expectation
- Probability Distribution [Binomial, Poisson, Normal,Bernoulli]

**(c)Counting**

- Pigeonhole principle
- Inclusion Exclusion
- Special Numbers [Stirling,Fibonacci,Catalan, Eulerian, Harmonic, Bernoulli]
- Polya Counting
- Burnside lemma

**(d)Permutation Cycles**

**(e)Linear Algebra**

- Addition And Subtraction Of Matrices
- Multiplication ( Strassen’s algorithm ), Logarithmic…

View original post 433 more words

Advertisements