
Camp materials:

Discussed topics (with further reading resources):
 How to approach a programming problem?
 Euler totient or phi function and it’s proof
 Useful properties of Euler totient function
 Multiplicative function
 Euler phi and divisor sum theorem
 Sum of coprime numbers of a number N
 Euler’s theorem and Fermat’s Little theorem
 Extended Euclidean algorithm
 Linear diophantine equation and its solution
 InclusionExclusion principles
 Mobius Function

Topics for selfstudy with resources

Discussed problems
 Count the number of integer X such that L<= X <= R and gcd(X,N) = 1.
 Light OJ 1007 – Mathematically Hard
 Toph – Life of Phi
 ICPC 2019 Preli G – Pairs Forming GCD (Accepted Code with explanation)
 How many numbers from 1 to N are divisible by 2 or 3.
 How many numbers in range {1,…, N} is not divisible by 2, 3, or 5.
 Light OJ 1117 – Helping Cicada
 Light OJ 1144 – Ray Gun
 SPOJ – SQFREE – Squarefree integers
 Light OJ 1161 – Extreme GCD

Practice problems:
Thanks a lot for everything…
Desperately waiting for the next session.
hope we will get it very soon (: