Day 2- Number Theory

  1. Birthday Paradox, Birthday Attacks
  2. Linear Recurrence
  3. Generating n_th Fibonacci number
  4. N Modulo properties
  5. HCF, LCM, GCD calculations
  6. Divisibility checks
  7. Euclid’s Theorem
  8. Prime Count till N
  9. Prime Sieve
  10. Segmented Prime Sieve
  11. Euclid GCD generation Algorithm
  12. Linear Diophantine Equations
  13. a congruent to b(mod N)
  14. Prime Factorisation of N using Sieve
  15. No of Divisors, Sum of Divisors, Product of Divisors
  16. Chinese Remainder Theorem(valid for CO-PRIMES)
  17. Euler Totient Function
  18. Fermat’s Little Theorem
  19. Wilson’s Theorem
  20. Mathematical Expectation- ICPC

 

Codechef Tutorialhttps://www.codechef.com/wiki/tutorial-number-theory

Useful Site- https://comeoncodeon.wordpress.com/tag/fermat/

Bitwise Operatorshttp://www.cprogramming.com/tutorial/bitwise_operators.html

Advertisements