Loading repovive.com/roadmaps/math-fundamentals
Roadmaps
Math Fundamentals
GCD & LCM
Problemset
Discussion
AI Helper
Arithmetic & Modulo
0/41
Exponents & Roots
0/49
Logarithms
0/49
Basic Algebra
0/46
Sequences & Summations
0/41
Number Bases
0/41
Bit Manipulation
0/41
Boolean Logic
0/40
Sets
0/41
Counting Principles
0/43
Factorials & Permutations
0/45
Combinations
0/44
Probability Basics
0/62
Divisibility & Primes
0/44
GCD & LCM
0/47
1
Intro
2
What GCD Means
3
What LCM Means
4
Naive GCD Method
5
The Euclidean Algorithm
6
Euclidean Algorithm - Pseudocode
7
Why Euclidean Algorithm Works
8
Recursive Version
9
Computing LCM from GCD
10
Why the LCM Formula Works
11
GCD of Multiple Numbers
12
Quiz: GCD Basics
13
Problem - Greatest Common Divisor of Strings
14
GCD of Strings - The Idea
15
GCD of Strings - Algorithm
16
GCD of Strings - Pseudocode
17
Simplifying Fractions
18
Clock Synchronization Problem
19
Problem - Nth Magical Number
20
Nth Magical Number - Counting Formula
21
Nth Magical Number - Binary Search
22
Nth Magical Number - Pseudocode
23
Quiz: LCM and Applications
24
Extended Euclidean Algorithm
25
Extended Euclidean - How It Works
26
Coprime Numbers
27
GCD Properties
28
Problem - Ugly Number III
29
Ugly Number III - Inclusion-Exclusion
30
Ugly Number III - Binary Search
31
Ugly Number III - Pseudocode
32
Quiz: Inclusion-Exclusion
33
When to Use GCD
34
When to Use LCM
35
GCD and Prime Factorization
36
GCD with Negative Numbers
37
GCD of Arrays
38
LCM of Arrays
39
Binary GCD Algorithm
40
Practice - Find GCD Sum
41
Practice - Greatest Common Divisor Traversal
42
Quiz: Advanced GCD
43
Problem - Fraction Addition
44
Fraction Addition - Insight
45
Fraction Addition - Algorithm
46
Fraction Addition - Implementation
47
Section Recap
Modular Arithmetic
0/46
Big O Notation
0/49
Geometry Basics
0/45
15.1
Intro
2 minutes
100%
Tasks
Read Unit