Numbers (C10)

Fundamental Theorem of Arithmetic; Proofs of irrationality

Write the smallest number which is divisible by both 306 and 657

Write the smallest number which is divisible by both 306 and 657.

Prove that 2 + 5√3 is an irrational number

Prove that 2 + 5√3 is an irrational number, given that √3 is an irrational number.

Using Euclid’s Algorithm, find the HCF of 2048 and 960

Using Euclid’s Algorithm, find the HCF of 2048 and 960.

Given that √3 is an irrational number, prove that (2 + √3) is an irrational number

Given that √3 is an irrational number, prove that (2 + √3) is an irrational number.

Seven times a two digit number is equal to four times the number

Seven times a two digit number is equal to four times the number obtained by reversing the order of its digits. If the difference of the digits is 3, determine the number.

Show that exactly one of the numbers n, n + 2 or n + 4 is divisible by 3

Show that exactly one of the numbers n, n + 2 or n + 4 is divisible by 3.

If two positive integers p and q are written as p = a^2b^3 and q = a^3b

If two positive integers p and q are written as p = a²b³ and q = a³b; a, b are prime numbers, then verify:
LCM (p, q) × HCF (p, q) = pq

Use Euclid’s algorithm to find the HCF of 4052 and 12576

Use Euclid’s algorithm to find the HCF of 4052 and 12576.

Using Euclid’s division algorithm find the HCF of the numbers 867 and 255

Using Euclid’s division algorithm find the HCF of the numbers 867 and 255.

Find the HCF and LCM of 6, 72 and 120

Find the HCF and LCM of 6, 72 and 120, using the prime factorisation method.

Find the HCF of 96 and 404 by the prime factorisation method

Find the HCF of 96 and 404 by the prime factorisation method. Hence, find their LCM.

A sweet seller has 420 kaju barfis and 130 badam barfis

A sweet seller has 420 kaju barfis and 130 badam barfis. She wants to stack them in such a way that each stack has the same number, and they take up the least area of the tray. What is the number of that can be placed in each stack for this purpose?