Find a + b from given factor tree.
42
7
49
53
Find the greatest number of four digits which is exactly divisible by 6, 8, 10 and 12.
5760
4239
9960
9036
Which of the following is the statement of Fundamental Theorem of Arithmetic?
Given positive integers a and b, there exist unique integers q and r satisfying a = bq + r, 0 ≤ r < b.
Every composite number can be expressed (factorized) as a product of primes, and this factorization is unique, apart from the order in which the prime factors occur.
For any two positive integers a and b, HCF (a,b) × LCM (a,b) = a × b.
HCF (p, q, r) × LCM (p, q, r) ≠ p × q × r, where p, q, r are positive integers.
The prime factors of 176 are
2 × 2 × 2 × 2 × 11
2 × 2 × 2 × 3 × 11
2 × 2 × 3 × 3 × 11
2 × 2 × 2 × 11 × 11
What is the HCF of the least prime number and the least composite number?
1
2
3
4
For any positive integer n, n3- n is always divisible by
6
5
What is the HCF of two consecutive natural numbers?
Euclid's division lemma can be used only for calculating
L.C.M
H.C.F
Prime number
Even prime number
The largest number which divides 70 and 125 leaving remainder 5 and 8 respectively is
11
13
17
20
According to Euclid's Division Lemma, given positive integers a and b, there exists unique integers q and r satisfying a = bq + r. Here, the inequalities satisfied by r are
0 ≤ r < b
0 < r < b
0 < r ≤ b
0 ≤ r ≤ b
