First, we will find the HCF of 65 and 117 by using Euclid's division algorithm, then put 65 m -117 =HCF and simplify.
= 2

Let three consecutive integers are n, (n + 1) and (n + 2).
Then, one of these three must be divisible by 2 and another one must be divisible by 3.
Hence, the product of numbers is divisible by 6.
e.g.lf n = 1, then the three consecutive numbers are 1,2,3.
∴ Product = 1 x  2 x 3 := 6;
So, it is divisible by 6.
Given statement is true.

No, because 6ⁿ = (2 x 3)ⁿ = 2ⁿ x 3ⁿ
If the number 6ⁿ ends with digit 5, then it will be divisible by 5, i.e. its one factor will be 5. But the only primes in the factorisation of 6ⁿ are 2 and 3, but not 5.
Hence, it cannot end with digit 5.

False, according to Euclid's division lemma, if a is divided by 3, then a = 3q + r
where, \(0\le r<3\) and r is an integer.
Therefore, the value of r can be 0, 1 or 2.
Hence, it is false statement.

Here, 5 and 8 are the remainders, which obtained on dividing 70 and 125 respectively. Thus, after subtracting these remainders from the given numbers, we have new numbers 65 (i.e. 70 - 5) and 117 (i.e. 125 - 8), which are divisible by the required number.
\(\therefore \)  Required number = HCF of 65 and 117
Now, by Euclid's division algorithm,
117 = ( 65 x 1) + 52
Here, divisor is 65 and remainder is 52.
Again, by using Euclid's division algorithm, we get
65 = (52 x 1) + 13
Here, divisor is 52 and remainder is 13.
Again, by using Euclid's division algorithm, we get
52 = (13 x 4) + 0
\(\therefore \)  HCF = 13
which is the largest number, which divides 70 and 125 leaving remainders 5 and 8.