1.1.7 · Maths › Arithmetic & Number Systems
Factor ek aisa number hota hai jo doosre number ko exactly divide kare (koi remainder na bache). Factors ko building blocks samjho jo multiply hokar ek number banate hain. Agar aap n objects ko a rows aur b columns ki perfect rectangle mein arrange kar sako, to a aur b dono n ke factors hain — woh pair ( a , b ) ek factor pair kehlata hai.
WHY it matters: Factors poore number theory ki neenv hain — primes, HCF/LCM, fractions, aur divisibility sab yaheen se shuru hote hain. Factor pairs master karo aur koi bhi factor miss nahi hoga.
n ka factor pair whole numbers ka ek ordered/unordered pair ( a , b ) hota hai jisme
a × b = n .
Har factor pair tumhe ek saath do factors deta hai.
WHAT har number ke factors ke baare mein sach hai:
1 har number ka factor hota hai (n = 1 × n ).
n khud apna factor hota hai (n = n × 1 ).
Har factor a , 1 ≤ a ≤ n satisfy karta hai.
HOW karte hain hum har factor find, bina koi miss kiye? Aao trick derive karein.
Maano a , n ka factor hai, to n = a × b . Tab b = n / a automatically bhi ek factor hai — yeh dono pairs mein aate hain. Ab poochho: ek pair ke chhote member ki maximum size kya ho sakti hai?
Agar dono a aur b , n se bade hote, to
a × b > n × n = n ,
jo a × b = n se contradict karta hai. Isliye har factor pair ka kam se kam ek member ≤ n hota hai.
Worked example Example 1 —
24 ke saare factors
d = 1 se ⌊ 24 ⌋ = 4 tak scan karo (kyunki 4 2 = 16 ≤ 24 < 25 = 5 2 ).
d
24 ÷ d
pair?
1
24
✅ ( 1 , 24 )
2
12
✅ ( 2 , 12 )
3
8
✅ ( 3 , 8 )
4
6
✅ ( 4 , 6 )
4 pe kyon rokein? Kyunki 5 factor nahi hai aur 24 se upar ka koi bhi factor pehle hi kisi chhote wale ke bade partner ke roop mein aa chuka hai.
Saare factors: 1 , 2 , 3 , 4 , 6 , 8 , 12 , 24 — aath factors.
Worked example Example 2 —
36 ke saare factors (ek perfect square)
⌊ 36 ⌋ = 6 . d = 1 … 6 scan karo:
d
36 ÷ d
pair
1
36
( 1 , 36 )
2
18
( 2 , 18 )
3
12
( 3 , 12 )
4
9
( 4 , 9 )
6
6
( 6 , 6 ) ← same number!
Yeh step kyon? Jab n ek perfect square hota hai, tab beech wala pair ( n , n ) hota hai — aap 6 ek baar likhte ho, do baar nahi.
Factors: 1 , 2 , 3 , 4 , 6 , 9 , 12 , 18 , 36 — nau (odd count!). Perfect squares mein hamesha odd number of factors hote hain kyunki ek factor apne aap se pair karta hai.
Worked example Example 3 — Ek prime,
17 ke factor pairs
⌊ 17 ⌋ = 4 . 1 , 2 , 3 , 4 test karo: sirf 1 hi 17 ko divide karta hai.
Sirf ek pair: ( 1 , 17 ) . Factors: 1 , 17 .
Kyon? Ek prime ke paas exactly do factors hote hain: 1 aur khud woh number.
n /2 tak check karunga."
Kyon sahi lagta hai: n se chhota sabse bada factor actually ≤ n /2 hota hai, isliye n /2 sab kuch cover karta hai.
Dikkat: yeh slow aur error-prone hai — zaroorat se zyada numbers check karne padte hain. Fix: n rule har pair ko bahut kam checks mein pakad leta hai, kyunki har chhota factor apne bade partner ko free mein le aata hai.
Common mistake Perfect square ke liye
n do baar likhna.
Kyon sahi lagta hai: har doosra factor do alag numbers ke pair mein aata hai, isliye do entries ki umeed hoti hai.
Fix: jab d = n / d (yaani d = n ), yeh wahi factor hai — ek baar list karo. Isliye perfect squares mein odd factor count hota hai.
1 ya n khud ko bhool jaana.
Kyon sahi lagta hai: 1 aur n "trivial" lagte hain, asli factors nahi.
Fix: yeh dono n = 1 × n exactly satisfy karte hain, isliye yeh hamesha count hote hain. ≥ 2 ka har number in donon ko kam se kam factor rakhta hai.
Common mistake Factors aur multiples mein confusion.
Kyon sahi lagta hai: dono mein multiplication involve hoti hai.
Fix: factors finite hote hain aur ≤ n ; multiples infinite hote hain aur ≥ n . 6 ke factors: { 1 , 2 , 3 , 6 } . 6 ke multiples: 6 , 12 , 18 , … hamesha ke liye.
Recall Quick self-test (answers chhupa lo!)
Ek prime ke kitne factors hote hain? → exactly 2 .
Hum sirf n tak kyon search karte hain? → har factor pair ka ek member ≤ n hota hai.
Perfect squares mein odd number of factors kyon hote hain? → pair ( n , n ) ek factor hai jo khud se pair karta hai.
30 ke factor pairs? → ( 1 , 30 ) , ( 2 , 15 ) , ( 3 , 10 ) , ( 5 , 6 ) .
Recall Feynman: ek 12-saal ke bachche ko samjhao
Socho tumhare paas 24 identical square tiles hain aur tum ek perfect rectangle floor banana chahte ho. Tum 1 × 24 , 2 × 12 , 3 × 8 , ya 4 × 6 bana sakte ho — har woh rectangle jo saare tiles ko neatly use kare. Un rectangles ki side lengths hi 24 ke factors hain! Inhe jaldi dhundhne ke liye, sirf chhoti sides ko us point tak try karo jahan rectangle square ban jaye — uske baad tum wohi rectangles flip kar rahe ho jo already mil chuke hain. Agar shape ek perfect square ban sakti hai (jaise 36 = 6 × 6 ), to woh square side sirf ek baar count hoti hai.
"Pair up, stop at the root."
Har factor ek buddy laata hai (d aur n / d ), aur tumhe sabse milne ke liye sirf n tak jaana hota hai.
n ka factor kya hota hai?Ek whole number a jo n ko exactly divide kare, yaani n = a × k remainder 0 ke saath.
a ka multiple kya hota hai?a × k form ka koi bhi number; agar a , n ka factor hai, to n , a ka multiple hai.
n ka factor pair kya hota hai?Ek pair ( a , b ) jisme a × b = n .
n ke saare factors dhundhne ke liye kitni value tak search karni chahiye?n search har factor kyon dhundh leta hai?Har factor pair ka kam se kam ek member
≤ n hota hai; dono ka
> n hona product
> n deta.
Perfect squares mein odd number of factors kyon hote hain? Factor
n khud se pair karta hai, isliye ek baar count hota hai.
Ek prime number ke kitne factors hote hain? Exactly 2 — yaani 1 aur khud woh number.
24 ke saare factors list karo. 1, 2, 3, 4, 6, 8, 12, 24.
36 ke saare factors list karo. 1, 2, 3, 4, 6, 9, 12, 18, 36 (nau factors).
Kya 1 har number ka factor hai? Haan, kyunki n = 1 × n hamesha hota hai.
30 ke factor pairs? (1,30), (2,15), (3,10), (5,6).
Prime numbers and composite numbers — factor counts inhe define karte hain.
Prime factorisation — sabse gehri factoring, blocks ke building blocks.
HCF and LCM — shared factors/multiples se directly compute hote hain.
Divisibility rules — test karne ke shortcuts ki d factor hai ya nahi.
Perfect squares — odd-factor-count property.
Fractions in lowest terms — common factors cancel karo.
Factor pair a times b = n
product > n contradiction
Scan d = 1 to floor sqrt n