ِYou. can watch all the topic streams in this playlist:

   • Fridays Topic Streams  

We start from the basics and move on to challenging topics in number theory!

0:00 Intro
2:25 Definition of GCD
6:46 Prove that gcd(a, b) = gcd(a - b, b)
17:08 Simple Algorithm to Calculate GCD
20:50 Extend the Fact to gcd(a, b) = gcd(a % b, b)
27:30 Prove that a % b is Less than a / 2
34:26 O(lg a) Algorithm to Calculate GCD
46:48 Solving 1458A from Codeforces
1:04:50 How to Find Prime Numbers in O(N)
1:08:42 Improving the Algorithm to O(N sqrt(N))
1:17:45 Sieve of Eratosthenes
1:29:13 Harmonic Series
1:50:55 Solving 230B from Codeforces
2:00:54 Find the Smallest Prime Factor with Sieve

Link of the problems solved from Codeforces:

https://codeforces.com/problemset/pro...
https://codeforces.com/problemset/pro...


For further discussion, you can join our community in Telegram:
https://t.me/Competitive_Programming_...

#coding #codeforces #programming #competitive_programming #learn_programming #learn_coding #code_tutorial #computer_science #computer_tutorial #number_theory #learn_programming_online