Kytcs

📘 Math Number Properties

Prime Numbers

$$ \text{Prime Number: divisible only by } 1 \text{ and itself} $$

Steps:
1. Take each number in range
2. Check divisibility from 2 to √n
3. If no divisor → Prime

Co-Prime Numbers

$$ \text{If } \gcd(a,b)=1 \Rightarrow \text{Co-Prime} $$

Steps:
1. Find HCF using Euclid method
2. If HCF = 1 → Co-Prime

Perfect Squares

$$ \text{Perfect Square if } \sqrt{n} \text{ is an integer} $$

Steps:
1. Find square root of number
2. If integer → Perfect Square