2026/088) How will we show that $2^{23} -1$ is divisible by 47

 I shall prove the same using modular arithmetic keeping arithmetic simple

We have $2^5 = 32 \equiv -15 \pmod {47}$

$=> 2^{10} \equiv  (-15) ^2  \pmod {47}$

$=> 2^{10} \equiv  225  \pmod {47}$

$=> 2^{10} \equiv  -10  \pmod {47}$ (as 225 = 5 * 47 -10)

$=> 2^{20} \equiv  (-10)^2  \pmod {47}$

$=> 2^{20} \equiv  100  \pmod {47}$

$=> 2^{20} \equiv  6  \pmod {47}$    as 100 =2 * 47 + 6

 $=> 2^{23} \equiv  6 * 2^3  \pmod {47}$

 $=> 2^{23} \equiv  48  \pmod {47}$

 $=> 2^{23} \equiv  1  \pmod {47}$

 $=> 2^{23} -1 \equiv 0   \pmod {47}$

Hence  $2^{23} -1$ is divisible by 47

 

2026/087) The LCM of two even numbers is 90. Which are the numbers

The 2 numbers are even so let the 2 numbers be 2x and 2y where x and y are co-primes

So lcm = 2xy

As product of numbers is same of product of LCM and HCF so we have

2xy = 90

Or xy = 45

x and y are co-primes

Factor $45 = 3^2 * 5$

As x and y are co-primes so no prime shall divide both and highest power will be present of a prime is a factor

So $(x,y)$ are $(1,45)$ or $(9,5)$ so the 2 even numbers are $(2,90)$ or $(18,10)$

2026/086) Prove that for every positive integer n, the number $A_n=7^{2n}−48n−1$ is a multiple of 9.

Let us take the mod 9 of the expression

$A_n=7^{2n} - 48n -1 \mod 9$

 $=(7^2)^n - 48n -1 \mod 9$

$=49^n - 48n -1 \mod 9$ 

$=4^n -3n -1 \mod 9$ reducing to mod 9

This can be proved by principle of mathematical induction  also binomial expansion

Method 1 Principle of Mathematical Induction 

To prove by   principle of mathematical induction we first need to check for initial condition then induction step  

We have 

$A_1= 4^1 - 3 *1 -1 = 0$  is divisible by 9

We have checked the basic step

So we proceed to check the induction step

 Let us assume that it is true for some n say k 

So  $A_k= 4^k - 3k -1 \equiv 0 \mod 9$

We need to prove

  $A_{k+1}= 4^{k+1} - 3 *(k+1) -1 \equiv 0 \mod 9\cdots(2)$

We have

$A_k= 4^k - 3k -1$

$A_{k+1}= 4^{k+1} - 3(k+1) -1$ 

Now $A_{k+1}- 4 * A_k = 4^{k+1} - 3(k+1) -1- 4 (4^k - 3k -1)$

$= -3k -4 + 12k + 4 = 9k$

Hence Or $A_{k+1} - 4 * A_k+9k$

or  $A_{k+1} = 4 * A_k+9k$

 So if $A_k$ is divisible by 9 the $A_{k+1}$ is divisible by 9

We proved the induction step

Hence Proved

Method 2 :Binomial expansion

We shall prove the same by Binomial expansion

Let us use for 1 and 2 for simple cases and the binomial theorem for $n>2$

$A_k = 4^k - 3k -1$

So we have

$A_1 = 4 - 3 - 1 =0$ or $A_1$ is divisible by 9

and $A_2 = 4^2 - 3 * 2 -1 = 9$ or $A_2$ is divisible by 9

 for $n>2$ we have (it is rue for all n but we shall use for n>2)

$4^n= (3+1)^n =  \sum_{k=0}^n \binom {n}{k} 3^{n-k}1^k$

 $=\sum_{k=0}^{n-2} \binom {n}{k} 3^{n-k}1^k+3n + 1$ by grouping 1st n-2 terms and separating last 2 terms

As the sum under the summation each term is divisible by n we get

$4^n = 9p + 3n +1 $ for sum mutilple of 9 with some p

Or $4^n -3n -1 = 9p$

Or   $4^n -3n -1$ s divisible by 9

Hence proved

 

 

 

 

 

2026/085) Prove that sum of cubes of legs of a right angled triangle is less than the cube of its hypotenuse.

Let a b c be sides of right angled triangle where c is the hypotenuse

So $a^2 + b^2 = c^2$

$=>a^2c + b^2c = c^3\cdots(1)$

As $a<c$ we have $a^3<a^2c\cdots(2)$

Also  as $b<c$ we have $b^3<b^2c\cdots(3)$

From (2) and (3) we have

$a^3+b^3 < c(a^2+b^2)$

Using above and (1) we have

$a^3+b^3 < c^3$

Proved

2026/084) What is the next number in the sequence 9, 12, 17, 24, 33?

Let us look at the 1st order differences they are $3,5,7,9$

Method 1:(Short form)

next difference is 11 and next number is 33 + 11 = 44

Method 2(Finding Polynomial form of the number) 

Now 2nd order difference are $2$ 

So the terms are defined by a quadratic polynomial and

$T_n= an^2 + bn+c$ for some a,b ,c 

Putting n =1 ,2, 3 respectively we get

$a+b+c = 9\cdots(1)$

$4a+ 2b + c = 12\cdots(2)$

$9a + 3b+c = 17\cdots(3)$ 

 Subtract (1) from(2) to get

$3a + b = 3\cdots(4)$

Subtract (2) from(3) to get

$5a + b = 5\cdots(5)$

Subtracting (4) frpm (5) we get $2a = 2$ or $a=1$

Putting value of a in (4) we get $b=0$

Putting value of a and b in (1) we get c = 8 

So $n^{th}$ term is $n^2+8$

 Next  number is $6^2+8=44$  

 

2026/083) For a triangle ABC with the sides of a,b,c such that a + c = 2b prove that $\cot(\frac{A}{2}) + \cot(\frac{C}{2}) = 2 \cot(\frac{B}{2})$

 We have using law of cot for a triangle using standard notation s ,and area of triangle $\triangle$

$\cot(\frac{A}{2}) = \dfrac{s(s-a)}{\triangle}\cdots(1)$

$\cot(\frac{B}{2}) = \dfrac{s(s-b)}{\triangle}\cdots(2)$

$\cot(\frac{C}{2}) = \dfrac{s(s-c)}{\triangle}\cdots(3)$

Add (1) and (3) to get

 $\cot(\frac{A}{2}) + \cot(\frac{C}{2}) = \dfrac{s(s-a)}{\triangle} + \dfrac{s(s-c)}{\triangle}$
$= \dfrac{s(s-a)+s(s-c)}{\triangle}$
$= \dfrac{s(s-a+s-c)}{\triangle}$
$= \dfrac{s(2s-(a+c))}{\triangle}$
$= \dfrac{s(2s-2b)}{\triangle}$ (from given conditon)
$= 2\dfrac{s(s-b)}{\triangle}$
$=2\cot(\frac{B}{2})$ (using (2))

Proved 

2026/082) How can we find out the two factors of 12243 such that they differ by 82 from each other

If they differ by 82 let them be (x-41) and (x+41) for some x. Basically we take the middle term

So we have $(x-41)(x+41) = 12243$

Or $x^2- 1681 = 12243$

Or $x^2 = 12243 + 1681 = 13924 = 118^2$

Or $x= \pm 118$

 Or $x = 118$ or $-118$

Taking $x = 118$ we get  $118–41$ and $118+ 41$ that is $77,159$

also taking $x = -118$ we get $-77,-159$

 

 

2026/081) Given that $\frac{\sin (A-B)} {\sin(A+B)} =\frac{5}{13}$ How do you show that $4 \tan A = 9 \tan B$

We shall use the formula for sum of  sin and and difference of sin

$\sin \, C + \sin \, D = 2 \sin \frac{C+D}{2} \cos \frac{C-D}{2}\cdots(1)$

and  $\sin \, C - \sin \, D = 2 \cos \frac{C+D}{2} \sin \frac{C-D}{2}\cdots(2)$

We are given

$\frac{\sin (A-B)} {\sin(A+B)} =\frac{5}{13}$ 

Or   $\frac{\sin (A+B)} {\sin(A-B)} =\frac{13}{5}$

By compnendo and dividendo we get'

$\frac{\sin (A+B)+\sin(A-B)} {\sin(A+B) -\sin(A-B)} =\frac{13+5}{13-5}$

OR

$\frac{\sin (A+B)+\sin(A-B)} {\sin(A+B) -\sin(A-B)} =\frac{9}{4}\cdots(3)$  

we have  

$\sin (A+B)+\sin(A-B) = 2\sin\,A\cos\,B\cdots(4)$ using (1)

$\sin (A+B)-\sin(A-B) = 2\cos\,A\sin\,B\cdots(5)$ using (2)

Hence we have

$\frac{\sin (A+B)+\sin(A-B)} {\sin(A+B) -\sin(A-B)} =\frac{2\sin\,A\cos\,B}{2\cos\,A\sin\,B}$

Or  $\frac{\sin (A+B)+\sin(A-B)} {\sin(A+B) -\sin(A-B)} =\frac{\tan\,A}{\tan \,B}$ 

Form above and (3) 

$\frac{\tan\,A}{\tan\,B}=\frac{9}{4}$

Or  

$4 \tan A = 9 \tan B$

2026/080) How do you prove the identity $\tan(A+B) - \tan\, A = \frac{\sin\,B}{\cos\,A\cos(A+B)}$

 We have

LHS =  

 $\tan(A+B) - \tan\, A = \dfrac{\sin(A+B)}{\cos(A+B)} - \dfrac{\sin\,A}{\cos\,A}$

$=\dfrac{\sin (A+B)\cos \, A - \cos (A+B)\sin\, A}{\cos(A+B)\cos\,A}$

$=\dfrac{\sin (A+B-A}{\cos(A+B)\cos\,A}$ using $ \sin (A-B) = \sin\,A\cos\,B - \cos\,A \sin\,B$

 $=\dfrac{\sin\, A}{\cos(A+B)\cos\,A}$

=RHS

 

2026/079) Find a 7-digit integer divisible by 128, whose decimal representation contains only the digits 2 and 3.

 

We have $128= 2^7$

For n digit number to have $2^n$ a factor we must have $n-1$ digit number after removing the left most digit must have $2^{n-1}$ as a factor

To illustrate we have 2 divides 2 and 4 divides 32. if unit digit is not divisible by 2 then 2 digit number is not divisible by 2^2 or 4

So we start with a number and add a digit to the left and repeat the steps. If n digit number is divisible by $2^{n+1}$ then we should append 2 to the left. and if it not divisible by $2^{n+1}$ then we should append 3.

This is so because we need to make the n+1 digit number divisible by $2^{n+1}$

We know $2^n$ divides $10^n$

So $2^{n+1}$ divides $2 * 10^n$

So if (n-1) digit number is  divisible by $2^n$ then we add $2 * 10^n$ to it and it shall be divisible by $2^n$

If  (n-1) digit number is  not divisible by $2^n$ but divisible of $2^{n-1}$ then we add $1 * 10^{n-1}$ which is n digit number to it and it shall be divisible by $2^n$.  As 1 is not in digit so we can add $3 * 10^(n-1)$ to it.

So if n digit number is divisible by $2^(n+1)$ then append 3 to the left else add 2 to the left. 

One digit number $2$

As 2 is not divisible by $2^2=4$ so append 3 to get 2 digit number $32$

As 32 is divisible by $2^3=8$ so append 2 to get 3 digit number $232$

As 232 is not divisible by $2^4=16$ so append 3 to get 4 digit number $3232$ 

As 3232 is divisible by $2^5=32$ so append 2 to get 5 digit number $23232$

As 23232 is divisible by $2^6=64$ so append 2 to get 6 digit number $223232$

As 223232 is divisible by $2^7=128$ so append 2 to get 7 digit number $2223232$   

So ans is 7 digit number $2223232$

2026/078) Find the remainder when we divide $3^{33}-2$ by 18

We need to factor 18 into product of co-primes $18 = 9 *2 $

Now let us find  $3^{33}-2$ mod 9 and $3^{33}-2$ mod 2 then we shall combine both

Let us proceed one by one 

As $3^{33}$ is  divisible by $3^2=9$ we have 

  $3^{33} \equiv 0 \pmod 9$

So $3^{33} -2 \equiv -2 \pmod 9$ 

Adding 9 on RHS to make is positive

so $3^{33} -2 \equiv 7 \pmod 9$ 

$3^{33} -2$ is odd

So $3^{33} -2 \equiv 1 \pmod 2$ 

To find the remainder when divided by 18 we to find the number $x \lt 18$ such that 

$x \equiv 7 \pmod 9$ 

$x \equiv 1 \pmod 2$ 

This can be solved using Chinese Remainder Theorem but as 2 and 9 are small numbers we can solve

Simply by taking numbers which are 7 mod 9 and checking it is 1 mod 2 or odd.

The number should be less than 18. the 2 numbers are 7 and 16 and 7 is odd

So $3^{33} -2 \equiv 7 \pmod {18}$ 

 

2026/077)The set M consists of all 7-digit positive integer numbers that contain (in decimal notation) each of the digits 1,3,4,6,7,8 and 9 exactly once. (a) Find the smallest positive difference d of two numbers from M. (b) How many pairs (x,y) with x and y from M are there for which x−y=d?

 

It is 9 . this can be checked 1346798 - 1346789,

This should be divisible by 9 as 2 permutations of a number as they contain same digits so both have same remainder and hence the difference should be divisible by 9 and hence 9 is the answer.

What are the numbers that give a difference 9. The unit digit of larger number shall be 1 less than the tens digit.

The number must end with (2 digits) 43,76,87,98 end smaller number ends with 34,67,78,89

That is 4 sets of number

They must have 5 digits same that can be from rest 5 digits they can be in 120 ways(5 digits can be permuted in 120 ways

So number of pair of numbers 120 * 4 = 480

2026/076) Find multiple of 29 having last 2 digits 47

Because last 2 digits are 47 so the number is of the form 100n+47

Because it is multiple of 29 so it is of the form 29m

So 29m = 100n + 47

Or $29m - 100n = 47\cdots(1)$

Because GCD(29,100) =1 this has got  solution

Let us find 1 in form of 100a + 29b

We have $100 = 29*3 + 13\cdots(2)$

$29 = 2 * 13 + 3\cdots(3)$

$13 =  3 *4+1 \cdots(4)$

From (4)

$1 = 13 - 3 * 4$

$= 13 - 4(29 - 2 *13) = 9 * 13 - 4 * 29$  (from (3))

$= 9*(100-3*29) - 4* 29$ (from (2))

$= 9 *100 - 31 *29\cdots(5)$

 

From (1) and (5) we get

 

$47 = 29 + 18$

 

Or $47 = 29 +  18(9 * 100 - 31 *29)$

 

Or $47 = 29 + 100*(162)  - 29 *558$

 

$= 100 *162 - 29 * 557$

 

$-29 * 557 = 47 - 100 *162$

 

Here we need to make the multiple of 100 positive this shall make multiple of 29 positive

 

We need to add 29 * 100 * 6 (600 is least multiple of 100 above 557 ) to LHS and 29* 6 * 100 on RHS both 17400 to get  

 

$29 * (600 - 557) = 47 + 100 *( 29 * 6 - 162$

 

Or $29 * 43 = 100 * 12 + 47= 1247$

 

This is the smallest multiple of 29 having last 2 digits 47 and we have

 

$29 * (43 +100n) = (12 + 29n) *100 + 47 = 1247 + 2900n$ are all positive numbers when $n >=0$  

 

  

2026/075) The equation $x^3+px+q =0$ where $q\ne 0$ has one root raciprocal of another route , Show that $p+q^2=1$

Let the roots be $m,\frac{1}{m},n$

Using  Vieta's formula we have

$m +\frac{1}{m} + n=0\cdots(1)$

$ m * \frac{1}{m} + m * n + n *\frac{1}{m} =  p \cdots(2)$

We have product of roots $m* \frac{1}{m} *n = - q \cdots(3)$

From(3) $n = -q\cdots(4)$

From (1) $n = - (m + \frac{1}{m})\cdots(5)$ 

From (2)  $1 + n( m + \frac{1}{m}) = p$

Or $1+ n * (-n) = p$ using (5)$

Or $1 - n^2 = p$

Or $1 = p + n^2$ 

Or $1 = p +q^2$ using (4)

Proved   

2026/074) What is the largest What is the largest integer n with no repeated digits that is relatively prime to 6?

 Note : 2 numbers a and b are relatively prime (also called coprimes if GCD(a,b) =1

 Let us take the largest no 9876543210. This number is divisible by both 2 and 3. Any permutation shall be divisible by 3 so one digit has to be removed. The one digit number should not be divisible by 3.

The digit that came be removed are 1,2,4,5,7,8.

To keep the number as large as possible the lower digit need to be removed 

Let us remove 1 the smallest digit

So we get 987654320

This is not divisible by 3.But it is divisible by 2

For the number to be odd (that is not divisible by 2) we need an odd digit in unit place

So we get 987654203

We next try to find a larger number if it exists

1st six digits 987654 cannot be changed as if we change we shall have a smaller number

So only change possible is is in 3 digits must contain 0 3(removing them shall not affect as it shall remain divisible by 3) and either 1 or 2 (either can be removed to make non multiple of 3)

203. larger numbers are 230( discarded as it is even), 301, 302( discarded as even)

So the number is 301 and the original required number is 987654301

 

2026/073) How do you find the remainder when $x^10$ is divided by $x^4+x^3+x^2+x+1$

This we can do it by long division,

Here we realize that  

$(x^4+x^3+x^2+x+1)(x-1)= x^5-1$

And $x^{10}-1= (x^5+1)(x^5-1)$

Or   $x^{10}-1= (x^5+1)(x^5-1)= (x^5+1)(x-1)(x^4+x^3+x^2+x+1)$

Or  $x^{10}= (x^5+1)(x-1)(x^4+x^3+x^2+x+1) + 1$

Hence remainder is 1 

 

2026/072) What is the value of $\sin^3 10^\circ +\sin^3 50^\circ −\sin^3 70^\circ$ equal to?

We have Formula for $\sin 3t $

$\sin 3t = 3 \sin t-4 \sin^3 t$

Putting  $10^\circ$, $10^\circ$,$70^\circ$ we get

 $\sin 30^\circ = 3\sin 10^\circ -4 \sin^3 10^\circ$

or   $\frac{1}{2} = 3 \sin 10^\circ -4 \sin^3 10^\circ\cdots(1)$

  $\sin 150^\circ = 3 \sin 50^\circ -4 \sin^3 50^\circ$

or   $\frac{1}{2} = 3 \sin 50^\circ -4 \sin^3 50^\circ\cdots(2)$

$\sin 210^\circ = 3 \sin 70^\circ -4 \sin^3 70^\circ$ 

or   $\frac{-1}{2} = 3 \sin 70^\circ -4 \sin^3 70^\circ\cdots(3)$

Adding (1) , (2) and subtracting (3) we get

$\frac{3}{2} = 3(\sin 10^\circ + \sin 50^\circ - \sin ^70^\circ) + 4(\sin^3 10^\circ +\sin^3 50^\circ −\sin^3 70^\circ) $ 

Or

$\sin^3 10^\circ +\sin^3 50^\circ −\sin^3 70^\circ = \frac{1}{4}(\frac{3}{2} -   3(\sin 10^\circ + \sin 50^\circ - \sin 70^\circ)  \cdots(1)$

Now we need to evaluate  

$\sin 10^\circ + \sin 50^\circ - \sin 70^\circ$

 Using $\sin A + \sin B = 2 \sin\frac{A+B}{2}\cos \frac{A-B}{2}$ we get

 $\sin 50^\circ + \sin 10^\circ = 2 \sin 30^\circ \cos 20^\circ$

$2 * |frac{1}{2} \cos 20^\circ$

$ \cos 20^\circ = \sin 70^\circ $

Or = $\sin 10^\circ + \sin 50^\circ - \sin 70^\circ = 0$

putting in (1) we get

 $\sin^3 10^\circ +\sin^3 50^\circ −\sin^3 70^\circ = -\frac{3}{8} $

 

 

 

 

2026/071) if $k_1,k_2,\cdots k_{15}$ are the roots of the equation $x^{15} - 2x^{14} + 3 x^{13} + \cdots + 15x-16= 0$ evaluate $(1+k_1)(1+k_2)\cdots(1+k_{15})$

 Because $k_1,k_2,\cdots k_{15}$ are the root

Hence $(x-k_1)(x-k_2)\cdots(x-k_{15}) = x^{15} - 2x^{14} + 3 x^{13} + \cdots + 15x-16$ as RHS is a 

degree 15 polynomial and coefficient is 1

Putting $x= -1 $ we get
 

$(-1-k_1)(-1-k_2)\cdots(-1-k_{15}) = -1 - 2 -3 - \cdots - 15-16= -136$
 

hence
 

$(-1)^{15}(1+k_1)(1+k_2),\cdots(-1+k_{15}) = -136$
 

or $(1+k_1)(1+k_2)\cdots(1+k_{15}) = 136$

2026/070) Simplify $\sqrt{8+\sqrt{7}} - \sqrt{8-\sqrt{7}}$

Because $8 + 2 \sqrt(7)$ has $\sqrt(7)$ as one of the terms so the square root is of the form $a + b \sqrt(7)$ where a and b are rational numbers

Squaring we get

$a^2 + 7b^2 + 2ab \sqrt(7) = 8 + 2 \sqrt(7)$

So comparing rational and irrational parts we get

$a^2 + 7b^2 = 8\cdots(1)$

and $ab = 1\cdots(2)$

So a and b both are positive (-ve shall give -ve square root)

From (2) we get

$b = \frac{1}{a}$

Putting in (1) we get

$a^2 + 7 \frac{1}{a^2} = 8$

or $a^4 - 8a^2 +7=0$

or $(a^2-1)(a^2-7) = 0$

as a is rational so $a^2-7=0$ is ruled out and we have $a^2-1=0$

As a is positive a = 1 and so b = 1 from (2)

So $\sqrt{8+\sqrt{7}} = 1+ \sqrt{7}\cdots(3)$

Now Similarly $\sqrt{8 -\sqrt{7}} = \pm (1- \sqrt{7})$ we need to chooses the proper sign  

We need to take the principal root that is the value

 $\sqrt{8 -\sqrt{7}} = \sqrt{7}-1\cdots(4)$

from (3) and (4)

 $\sqrt{8+\sqrt{7}} - \sqrt{8-\sqrt{7}}= 2$

 

 

2026/069) Find the smallest positive three-digit integer n such that $3^n+4^n$ is divisible by 5.

We need to find $3^n+ 4^n \mod 5$

Let us take the $3^n \mod 5$ and see the behaviour As 5 is prime we have

$3^4 \equiv 1 \mod 5$

and also

$4^4 \equiv 1 \mod 5$

so $3^n + 4^n \mod 5 $ have period  4

Let us consider $f(n) = 3^n + 4^n \pmod 5$

We have

$f(0) = 2$

$f(1) = 2$

$f(2) = 0$

$f(3) = 1$

And $f(n) = f(4k+n)$

We see that $f(2)$ is zero so $f(4k+2)$ is zero

So we need to find the smallest k suck that $4k + 2 > 99$ and get $k = 25$ and smallest number $102$