2026/054) What is the next number of the sequence 256, 1156, 4356..

The sequence is the squares of numbers which leaves a remainder 56 when divided by 100 that is

$n \equiv 56 \pmod {100}$ 

We can look at the numbers mod 100 and then find the numbers from table lookup. However this is not interesting

To keep the things simple let us find the numbers mod 10 and then make it to numbers mod 100.

Let us look at the number mod 10 and find the square mod 10 we get (1st is number mod 10, 2nd is number square mod 10 $(0,0),(1,1),(2,4),(3,9),(4,6),(5,5),(6,6),(7,9),(8, 4),(9,1)$

So then umber is 4 mod 10 or 6 mod 10

That is number is of the form 10n+ 4 or 10n+ 6

Now we need to find n in both the forms.  

We can take the x as 2 digit number . adding 100 to x shall not change the 2 digits mod 100

This is because

 $(100n + k)^2 = 10000n^2 + 200nk + k^2$

so  $(100n + k)^2 = k^2\pmod {100}$

Consider first form $x = 10n + 4$

Now $(10n+4)^2  = 100n^2 + 80n + 16$

so $80n + 16 = 56\pmod {100}$

or $80n = 40 \mod 100$

dividing by 20 on both sides

$2n = 1\pmod 5$

or $n = 3 \mod 5$ or $n \in \{3,8\}$ as we are looking for single digit number

So the number is $34 \pmod {100}$ or $84 \pmod {100}$

we can combine both to get $x \equiv 34\pmod {50}$  

Considerfnext form $x = 10n + 6$

Now $(10n+6)^2  = 100n^2 + 120n + 36$

As remainder is 56 

so $20n + 16 = 56\pmod {100}$

or $20n = 20 \mod 100$

dividing by 20 on moth sided

$n = 1\pmod 5$

or $n = 1 \mod 5$ or $n \in \{1,6\}$ as we are looking for single digit number

So the number is $16 \pmod {100}$ or $66 \pmod {100}$

So we have  $x \equiv 16 \pmod {50}$ or $x \equiv 34 \pmod {50}$

  

 

 

 

 

 

 

 

2026/053) If both x and y are integers, how many pairs of solutions are there of the equation $(x−8)(x−10)=2^y$

As RHS is power of 2 so both $x-8$ and $ x-10$ should be power of 2 or they should be -ve of power or 2 because there are two terms on the left hand side so product shall be positive.

As $(x-8) - (x-10) = 2$ so the 2 values should be 4 and 2 or -2 and 4( because 2 and 4 the power of 2 which differ by 2)

Naturally x-8 shall be lower value

So taking $x -8 = 4$  or $x = 12$ we get $2^y= 4* 2 = 8$ or $y = 3$ giving $((x,y) = (12,3)$

Taking $x-8 = -2$ we get $x = 6$ and $y = 3$ or $((x,y) = (6,3)$

 So we have 2 set of solutions $(x,y) \in \{(12,3),(6,3)\}$

2026/052 ) Let $a, b, c, d$ be four integers. Prove that $(b−a)(c−a)(d−a)(d−c)(d−b)(c−b) $ is divisible by 12.

If is is divisible by 12 then it is divisible by 3 and also by 4. this is so because 3 and 4 are co-primes

First Let us prove that is divisible by 3

Let us take $(b-a) , (c-a), (d-a)$ mod 3

As taking mod 3 there are 3 different remainders there are 2 possibilities

1. One of them is zero so it is divisible by 3
2. Non of them is zero so at least 2 remainder are same say $b-a$ and $c-a$. then the difference $(c-a) - (b-a) or (c-b) gives remainder 0 so divisible by 3

Having proved divisible by 3 Now let us prove that is is divisible by 4

Let  us take $(b-a) , (c-a), (d-a)$

If at least two of them are even then it is divisible by 4

        1. If one is even say $d-a$ then $b-a$ and $c-a$ are odd and $(c-a) - (b-a)$ that is c-a is even . As                there are 2 even numbers so product is divisible by 4

        2. If none is even the $b-a$ and$ c-a$ being odd $c-b$ is even and $b-a$ and $d-a $being odd $d-b$             is even . As $c-b$  and  $d-b$ are even so product is divisible by 4

In all cases it is divisible by 4

Hence it is divisible by 12

2026/051) Show that square of sum of 3 squares can be expressed as sum of 3 squares

 We need to show that $(a^2+b^2+ c^2)^2$ can be expressed as sum of 3 squares.

Let for simplicity 

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

and 

$y=c^2\cdots(2)$

So we have

$(a^2+b^2 + c^2)^2 = (x+y)^2$ from (1) and (2)

$=(x-y)^2 + 4xy$ as $(x+y)^2 - (x-y)^2 = 4xy$ 

$=  (a^2+b^2-c^2)^2 + 4(a^2+b^2)c^2$ putting back values

$=  (a^2+b^2-c^2)^2 + 4a^2c^+4b^2c^2$

$=  (a^2+b^2-c^2)^2 + (2ac)^2 + (2bc)^2$

Hence proved  

 

2026/050) Show that if a,b,c are sides of a right angled triangle and c is the hypotenuse then $a^n+b^n \lt c^n$ for $c \gt 2$

We shall prove it by Principle of  Mathematical Induction

The base step is n = 3 and n = 4

Because  it is right angled triangle and c is the hypotenuse we have

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

Further as  

$a < c$

Multiplying both sides by  a^2 we have

$a^3 < ca^2\cdots(2)$

Similarly 

$b^3 < cb^2\cdots(3)$

Adding (2) and (3) we get

$a^3 + b^3 < ca^2 + cb^2$

or 

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

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

Additionally

Squaring (1) we get 

$a^4 + b^4 + 2ab = c^4$

And hence dropping 2ab(which is positive) from the left 

$a^4 + b^4 < c^4$    

So we have proved the base step

For induction step we shall not move from n to n+1 but ftom n to n+ 2

We have Let t be true upto k = n

from k = n- 1  (not k) we shall prove for n+ 1

we have

$a^{k-1} < c^{k-1}$

Multiplying by a^2 on both sides we get

$a^{k +1} < c^{k-1}a^2\cdots(4)$

Similarly

 $b^{k +1} < c^{k-1}b^2\cdots(5)$

from (4) and (5) we get 

 $a^{k +1}  + b^{k+1} < c^{k-1}a^2 + c^{k-1}b^2$

Or  

 $a^{k +1}  + b^{k+1} < c^{k-1}(a^2 + b^2)$

or   $a^{k +1}  + b^{k+1} < c^{k-1}c^2)$

or  $a^{k +1}  + b^{k+1} < c^{k+1}$

So the induction step is complete

We have proved for 3 and 4 ad from n-1 to n+ 1 and hence for all above 2

As we have proved base step and induction step proof is complete

 

 

 

 

$  

 

 

 

 

2026/049) Does there exist integer solutions to $x^2+y^2=2022$

Before we look for solutions let us quickly check based on modular arithmetic.

 Looking at mod 3 we have 2022 is 2 mod 4. 

Solution may exist.

Let us check based on mod 3.

We have 

$2022 \equiv 0 \pmod 3$

But $2022 \equiv 6 \pmod 9$

So 2022 is not sum of 2 perfects squares

Let us prove the basis of the same

x is of the form $3a$ or $3a+1 or $3a+2$

If $x \equiv 0 \pmod 3$ then $x^2 \equiv 0 \pmod 3$

If $x \equiv 1 \pmod 3$ then $x^2 \equiv 1 \pmod 3$

If $x \equiv 2 \pmod 3$ then $x^2 \equiv 1 \pmod 3$

Similarly for y

Now looking at above we have $x^2+y^2 \equiv 0 \pmod 3 $ iff $x \equiv 0 \pmod 3$ and  $y \equiv 0 \pmod 3$.

So x = 3a and y = 3b for some a and b

or $x^2+y^2 = 9(a^2+b^2)$ or divisible by 9

But 2022 is not divisible by 9

Hence no solution

  

2026/048) For $1\le n \le2016$, how many integers n satisfying the condition: the remainder divided by 20 is smaller than the one divided by 16

Because LCM of 20 and 16 is 80. we need to look upto 80 an then the pattern repeats

Now remainder shall keep increasing till we get next multiple . then the remainder resets

Because we need to compare the remainder the number is of the form 20a + b and 16c + d ( 0 <=b <=19) , (o <=d <=16)

The remainder divided by 20 is lower than remainder divided by 16 if multiple of 16 is lower than multiple of 20. that is $16c < 20a < n < 16(c+1) $, That is the number lies between multiple of 20 and multiple of 16. The numbers that fit the condition are from 20a to 16(c+1)

Let us write multiples of 16 : $16,32,48,64,80$

multiple of 20 : -$20,40,60,80$

So the ranges are $0, 16(16*1),20(20*1),32(16*2),40(20*2),48(16*3),60(20*3),64(16*4),80$

the ranges where the remainder divided by 20 is lower in the rage $[20*1,16*2), [20*2,16 * 3]$ and $[20*3,16 * 4)$ in each range lower number is inclusive and higher is not giving $16*2 - 20 *1 + 16*3 - 20*2 + 16*4 - 20 *3$ or $24$ numbers.

In each lock of 80 numbers there are 24 numbers

upto 2000 there are 25 blocks so 25 * 24 600 numbers

From 2001 to 16 there are 16 number having same remainder as divided by 16 as divided 20

So no extra

So Ans 600 

 

 

 

2026/047) Factorize: $2x^2−y^2−3z^2−xy+4yz+5zx$

To factor this we shall take it as this as a polynomial of  Let us write in decreasing power of x

$2x^2−y^2−3z^2−xy+4yz+5zx$

$=2x^2+x(-y+5z) -(y^2–4yz+3z^2)$

 $= 2x^2+x(-y+5z) -(y-z)(y-3z)$ by factoring the the term independent of z.

We let $a = y-z$ and $b= y-3z$ which are factors of the independent term and they are co prime to each other

 Now a and b are co-primes so 2 the coefficient of $x^2$ $must go with one of them and we have to chose the same so that the sum (or difference) is co-efficient of x.

We have $a - 2b = -y + 5z$

So we get 

$2x^2 +(a-2b) x - ab$

$= 2x^2 + ax - 2bx -ab$+

$= x(2x+a)-b(2x+ a)$

$= (x-b)(2x+a) = (x-y+3z)(2x+y-z)$

2026/046) Find the sum of the real roots of the polynomial $\prod_{k=1}^{100} (x^2-11x +k)$

 It is product of 100 terms. 

From each term we shall have 2 solutions. 

Either both the solutions are real or complex

Let check which and how many terms shall have real roots

$x^2 - 11x +k$ has real root if discriminant is positive or zero 

That is $11^2 - 4 * k \ge 0$ or $ k \le 30$

There are 30 terms for which it has got real roots and sum of real roots in each term is 30 giving sum of real roots 330  

2026/045) Prove that $(4\cos^2 9^{\circ}–3)(4\cos^2 27^{\circ}–3)=\tan 9^{\circ}$

We shall use formula for $\cos 3x$  

$\cos 3x = 4 \cos^3 x - 3 \cos x$

so we have $4 \cos ^2 x - 3 = \frac{\cos 3x}{ \cos x}$

Hence 

$4 \cos ^2 9^{\circ} - 3 = \frac{\cos 27^{\circ}}{\cos 9^{\circ}}$

And 

$4 \cos ^2 27^{\circ} - 3 = \frac{\cos 81^{\circ}}{\cos 27^{\circ}}$

so   $(4\cos^2 9^{\circ}–3)(4\cos^2 27^{\circ}–3)$ = $\frac{\cos 27^{\circ}}{\cos 9^{\circ}}$ *  $\frac{\cos 81^{\circ}}{\cos 27^{\circ}}$ 

= $\frac{\cos 81^{\circ}}{\cos 9^{\circ}}$

 = $\frac{\sin 9^{\circ}}{\cos 9^{\circ}}$ using $\cos \theta = \sin (90^{\circ}-\theta)$

 = $\tan 9^{\circ}$

Hence Proved  

 

2026/044) Each digit in the n-digit number N is 1. What is the smallest value of n for which N is divisible by 333,333?

We know 333333 = 3 * 111111

Now the number which is 111111 or $\frac{10^6-1}{9}$ 

Any number which is having  1's is $\frac{10^n-1}{9}$ 

 $\frac{10^6-1}{9}$ shall divide  $\frac{10^n-1}{9}$ only when n is multiple of 6

Or n = 6k for some integer k

Number is divisible by 111111 and 9 as GCD(111111, 9) = 333333 

This is so because 111111 is divisible by 3 and 9 = 3* 3

So 6k should be divisible by 9 and smallest k = 3 or 6k = 18. 

N = 6k = 18  

2026/043) Show that there exists an n digit number each digit being odd and the number is divisible by $5^n$

We shall prove the same  by construction. But before that set us try to understand the pattern

One digit number divisible by 5there is only one number 5 and the digit is odd 

2 digit number divisible by $5^2=25$ the numbers are  25,50,75 and 75 has both digits odd 

3 digit number divisible by $5^3=125$ the numbers are  125,250,375 and so on 375 has all there digits odd

4 digit number divisible by $5^4= 625$ I am not enumerating  and a number 9375

We shall use this as a basis for construction of number by induction we shall expand the number from n digits to n+1 digits by adding a a digit to the left.

Let there be an n digit number with all n digits odd and divisible by  $5^n$ and let it be $k*5^n$. Note that k has to be odd else digit in unit place shall be zero which i even.

Now we know   that $10^n$ is divisible by $5^n$

So adding $p *10^n$ we can convert the n digit number to n+1 digit number and this is divisible by $5^n$.

We have n+1 digit number $p * 10^n  + k * 5^n= (p *2 ^n + k) 5^n$

Now we require and do we have $p *2^n + k$ divisible by 5

That is $p * 2^n \equiv -k \pmod 5$

As 3 is multiplicative inverse of 2 we get

$p  \equiv -k * 3^n \pmod 5$

p cannot be zero as $gcd(3,5) = 1$

So p is 1 or 2 or 3 or 5

If p is 1 or 3 then we are done

If p is 2 or 4 add 5 to p to get p single digit and odd

 

 

2026/042) 65 distinct natural numbers not exceeding 2016 are given. Prove that among these numbers we can find four a,b,c,d such that a+b-c-d is divisible by 2016.

Out of 65 numbers one can choose 2 numbers in ${65}\choose {2}$ 2080 ways.

We have 2080 pairs and when we divide by 2016 there can be 2016 remainders So there exists a, b and c,d such that dividing a + b by 2016 leaves the same remainder as c + d dividing by 2016.  

Or a + b -c - d is divisible by 2016 . This is based on pigeon hole principle

2026/041) For $x^2+x+5$ to be a factor of $x^4+px^2+q$ the values of p and q must be, respectively: (A) −2,5(B) 5,25(C) 10,20(D) 6,25(E) 14,25

 Because product is bi-quadratic and one factor is quadratic so other factor must be quadratic

Other factor is of the form $x^2+ax+b$

So we get 

 $(x^2+2x+5)(x^2+ax+b) = = x^4 + (2+a)x^3 + (b+2a+5)x^2 + (2b+5a)x + 5b$

Comparing with $x^4+px^2+ q$ we get a = - 2 (coefficient $x^3$) and $b = 5$ from coefficient of x

So q = 5b = 25

Comparing coefficient of x^2 we get p = 5 -4 + 5 = 6

So Ans is (D) 6,25

 

2026/040) The number $2^{29}$ has exactly 9 distinct digits. Find the missing digit.

Let us work mod 9.

We have $2^3 \equiv -1 \pmod 9$

Hence $2^{27} \equiv (-1)^9  \equiv -1 \pmod 9$ 

Hence $2^{29} \equiv (-1) * 4  \equiv -4 \pmod 9$

If we have all the digits(once) that is 10 digits  then sum of digit is 45 so it is divisible by 9 or 0 mod 9 

So removing 4 we shall have -4 mod 9. 

So  missing digit is 4

2026/039) The product (8)(888…8), where the second factor has k digits, is an integer whose digits have a sum of 1000. What is k? (A) 901(B) 911(C) 919(D) 991(E) 999

Solution 

The above value = 8 * (k 8s) = 8 * 8 * (k ones) ths we find by taking 8 out 

$= 64 * \frac{(10^k-1)}{9}$ as $(n) ones * 9 = \frac{10^n-1}{9}$

 $= (7 *9 +1) * \frac{(10^k-1)}{9}$  as denominator is 9 we put 64 as multiple of 9 and plus 1

 $ =7 * 9  * \frac{10^k-1}{9}+ \frac{10^k-1}{9}$ expanding

 $ =7 * (10^k-1)+ \frac{10^k-1}{9}$

  $ =7 * 10^k-7 + \frac{10^k-1}{9}$ 

  $ =7 * 10^k + \frac{10^k-1}{9}-7 $

 The 1st term gives 7 followed by k zeroes the 2nd term gives k ones and sum total shall be 7 followed by k ones. . when we subtract 4 we get   7 followed by k-2  zeroes followed by 04.

This gives sum of digits = 7 + k -2 + 4 = 1000

or  = 991 

 so Answer is (D)

2026/038) Find all $n \in N$ so that 7 divides $5^n+1$-.

 Basically we need to find n such that $5^n = -1 \pmod 7$

Now we have as 7 is a prime number as per Fermat's Little Theorem $5^6 \equiv 1 \pmod 7$

So $5^{6k} \equiv 1 \pmod 7$

Now as $5^6 \equiv 1 \pmod 7$ so we need to check for power of 5 to a factor of 6 that is 1 or 2 or 3

$5^1,5^2$ do not satisfy and $5^3 \equiv -1 \pmod 7$ satisfies.

so $n \in 6k+3 $ for all $k \in \mathbb{N}$ 

 

 

 

 

2026/037) GCD of 2472,1284 and a third number n is 12.If their LCM is $2^3* 3^2*5*103 * 107$.

 Because this is problem of CGD and LCM it makes sense to find prime factors of all numbers. 

Because GCD is 12 my approach is to mention it as product of 12 and other prime factors. let n = 12k

2472 = 12 * 206 = 12 * 2 * 103

1284 = 12 * 107

n =  = 12 *k

LCM = 12 * 2 * 3 * 5 * 103 * 107

Let us see that is  

After the 12 there is additional 2 and that comes from 2472 ( so there can be 0 or 1 2 in k)

There is an additional 3 and it has to come from k as it does not come from other numbers

There is an additional 5 and it has to come from k as it does not come from other numbers

There is a 103 in 2472 not in 1284 putting 0 or 1 103 shall not change GCD or LCM

There is a 107 in 1284 not in 2742 putting 0 or 1 107 shall not change GCD or LCM

So $n = 12k = 12 * 3 *5 *2^a * 103^b * 107^c = 180 * 2^a *103^b * 107^c$ where each of a,b,c is 0 or 1

2026/036) Show that a positive integer m is a sum of two triangular numbers if and only if 4m+1 is a sum of two squares.

m is a sum of 2 triangular numbers 

Let the 2 triangular numbers be $t_n$ and $t_p$

We have 

$t_n = \frac{n(n+1)}{2}$

$t_p = \frac{p(p+1)}{2}$

So we have

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

Or $4m = 2n(n+1) + 2p(p+1)$

Or $4m + 1= 2n(n+1) + 2p(p+1) + 1$

 Or $4m+1 = 2n^2+2p^2 + 2n + 2p + 1$

using the fact that $2(a^2+b^2) = (a+b)^2 + (a-b)^2$ one can expand the RHS and check 

 we get $4m+1 = (p+n)^2 + (p-n)^2  + 2n + 2p + 1$

Now $4m + 1 = 2t(t+1) + 2k(k+1) + 1 = 2t^2 +2t + 2k^2 + 2k + 1$

$= (t-k)^2 + (t+k)^2 + 2(t+k) +1$

$= (t-k)^2 + (t+k+1)^2$

is sum of 2 squares.  As each step is reversible we can start from bottom and go backwards to prove the other part.

 

 

2026/035) Prove that circle l(0,2) with equation $x^2+y^2=4$ contains infinite points with rational coordinates.

 Solution

Solution to this is $x = 2 \sin 2t$ and $y = 2\cos 2t$ (deliberately chosen angle in form of 2t to avoid fraction angle)

We can represent $\sin 2t$ and $\cos 2t$ expressible in form $\tan t$ as

$\sin 2t = \frac{(2 \tan\, t)}{(1+ tan^2 t)}$

$\cos 2t = \frac{(1-tan ^2t)}{(1+ tan^2 t)}$

So we have 

$x = \frac{(4 \tan\, t)}{(1+ tan^2 t)}$

$y = \frac{2(1-tan ^2t)}{(1+ tan^2 t)}$

If $\tan\, t$ is rational then both x and y are rational and point is rational co-ordinate

We can any rational value of $\tan\, t$ to get rational co-ordinate of a point

Hence it has infinite points with rational co-ordinates

2026/034) Prove that the number of integral solutions of the equation $x^3+y^4=z^{31}$ is infinite

Note: This is one method of solution. Other method exist 

Because the left had side has 2 terms and right had side has one and  

$2 * 2^p = 2^{p+1}$

If we can make 

  $x^3= y^4\cdots(1)$ 

Same as some power of 2 we have a solution

Because   $x^3$ is a power of 2 so  x has to be some power of 2 say 

$x=2^m\cdots(2)$ 

And similarly y has to be some power of two say 

 $x=2^n\cdots(3)$

From (1),(2), and (3) we have

$(2^m)^3 = (2^n)^4$

So 3m = 4n

As m and n are integers we have m must be divisible by 4 and n by 3 so 3m and 4n which are same by 12

So we have

$3m = 4n = 12k$

So

$m = 4k\cdots(4)$

$n= 3k\cdots(5)$

And from (3) and (4)

$x = 2^{4k}\cdots(6)$

$y =  2^{3k}\cdots(7)$

Putting in the given equation we get

$(2^{4k})^3 + (2^{3k})^4 = z^{31}$ 

Or $2^{12k} + 2^{12k} = z^{31}$

Or $2^{12k+1} = z^{31}$

Because LHS is a power of 2 so RHS is also a power of 2 so z has to be a power of 2 say 

$z= 2^t\cdots(8)$

Thus we get  $2^{12k+1} = 2^{31t}$

Or  $12k+1 = 31t\cdots(9)$

We can solve it using Extended Euclidean Algorithm to solve the same.

However as 12 and 31 are small numbers we can use the following approach as well

As $12 | 31t-1$ so $12 | 7t-1$ as 31 is 7 mod 12

By putting values of t from 0 to 11 we get (we need not put all values but upto the solution) and kowing that t is odd as t even shall make the number odd and not divisible by 12 we get t = 7.

Putting $t=7$ in (3) to get $k=18$

So one soultion is k =18, t = 7

As $12k+1 = 31t$ adding 12 * 31 a on both sides shall not change the values

So 12(k+31a) + 31(t +12a)

As one set of solution is (18,7) so parametric solution is  t = 7+12a, k= 18 + 31a

From (6) and (7) and (8) 

We get $x=2^{4(18+31a)}$,  $y=2^{3(18+31a)}$,  $z=2^{7+12a}$ 

This is a parametric solution and by varying a any whole number we can get any number of solution

Hence infinite number of solutions 

 

 

 

2026/033) Find the number of ordered pairs (a,b) of positive integers that are solutions of the following equation: $a^2+b^2=ab(a+b)$.

We have 

$a^2(b-1) + b^2(a-1) =0$

As both terms are non negative and sum is zero both are zero or $a=b=1$ giving one ordered pair 

2026/032) The graph of $x^2−4y^2=0$ is: (A) a parabola (B) an ellipse (C) a pair of straight lines (D) A point

We have $x^2–4y^2=0$

Or $(x-2y) (x+2y) = 0$

Hence $x-2y = 0$ (this is a straight line)   or $x + 2y = 0$ (this is another straight line)

Hence ans is (C) A pair of straight lines

2026/031) What is the greatest integer less than or equal to $(2+√3)^2$

 

Using $(a + b) ^2 + ( a -b)^2 = 2(a^2 + b^2)$

We get $(2 + √3)^2 + (2 -√3)^2 = 2(4+3) = 14$

As $0 < 2 -√3 < 1$ so $0 < ( 2 - √3)^2 < 1$

hence

$13 < (2+√3)^2 < 14$

Hence integral part is 13 or greatest integer is 13

2026/030) How can we solve this equation $a^-ab+b^2=1 such that a and be are positive integers?

Multiply by 4 on both sides to get

$4a^2 -4ab + 4b^2 = 4$

Or $4a^2 - 4ab + b^2 + 3b^2 = 4$

Or $(2a -b)^2 + 3b^2 = 4$ 

Looking at integer solutions $2a - b = 1, b = 1$ as b above 1 becomes larger

Giving $a = 1, b = 1$

2026/029) What is the smallest perfect square larger than 1 with a perfect square number of positive integer factors?

 $2^2$ has 3 factors and $3^2$ has 3 factors product 36 has 9 factors . Let us check if smaller square has 16 has 5 and 25 has 3 . So 36 is the smallest perfect square number having perfect square number of  positive factors

2026/028) Let n be a positive integer such that $12n^2+12n+11$ is a 4-digit number with all 4 digits equal. Determine the value of n.

Let it be 1111x . Add 1 in both sides to get

$12n^2 + 12n + 12 = 1111x + 1$

Work mod 12 to get 

$7x + 1 = 0  \pmod {12}$

So x is odd

Trying x odd values that is $1,3,5,9,11$ we get x is 5 .

So $12n^2 + 12n + 12 = 5556$

Or $n^2 + n + 1 = 463$

Or $n = 21$

2026/027) Let n be a positive integer such that $12n^2+12n+11$ is a 4-digit number with all 4 digits equal. Determine the value of n.

All 4 digits are same

Let it be 1111x . Add 1 in both sides to get

$12n^2 + 12n + 12 = 1111x + 1$

Work mod 12 to get 

$7x \equiv = 0 \pmod {12}$

So x is odd and 

Trying x 1 3 5 9 11 we get x is 5 .

So $12n^2 + 12n + 12 = 5556$

Or $n^2 + n + 1 = 463$

Or $n = 21$

 

2026/026) The number of solution-pairs in the positive integers of the equation 3x+5y=501 is:(A) 33(B) 34(C) 35(D) 100(E) none

We have 501 = 495 (multiple of 15) + 6

6 = 3 * 2

So 501 = 2 * 3 + 99 * 5

As 3 * 5 = 5 * 3

We have 501 = 3 (2 + 5t) + 5 ( 99 - 3t)

If t is zero or positive coefficient of 3 is positive and t -ve coefficient of 3 is -ve . We need to ensure 99 - 3t positive so t is less than 33 so 33 values 0 to 32

Hence answer (A) 33

2026/025) Show that the sum of three consecutive perfect cubes can always be written as the difference between two perfect squares.

We have sum of 1st n cubes ($\frac{(n(n+1)}{2})^2$

Hence $\sum_{k=1}^{k=n} k^3$ =  $(\frac{(n(n+1)}{2})^2$

Also  sun of 1st n+p cubes is

 $\sum_{k=1}^{k=n+p} k^3 $ =  $(\frac{((n+p)(n+p+1)}{2})^2$

Hence sum of p cubes from $(n+1)^3$ to $(n+p)^3$ is

  $\sum_{k=n+1}^{k=n+p} k^3 $ =  $(\frac{((n+p)(n+p+1)}{2})^2$ - $(\frac{(n(n+1)}{2})^2$

p = 3 is a special case of the problem 

2026/024) Which of the following numbers is a perfect square? A) $\frac{14!15!}{2}$, B) $\frac{15!16!}{2}$,C) $\frac{16!17!}{2}$,D) $\frac{17!18!}{2}$

 

We are having numbers in the form $\frac{n!(n+1)!}{2}$ .

This is $\frac{(n!)^2 * (n+1)}{2}$

It  is a perfect square if $\frac{(n+1)}{2}$ is a perfect square $\frac{18}{2}$ is a perfect square so (D) is the answer

2026/023) Let P be the product of any three consecutive positive odd integers. The largest integer dividing all such P is: (A) 15(B) 6(C) 5(D) 3(E) 1

 Because this is 3 consecutive odd numbers one of them is divisible by 3. None may be divisible by 5 as in case of 17,19,21. If the form are 5n + 2, 5n+ 4, 5n+ 4 where n is odd.  None is divisible by 2 as numbers are odd . So answer is 3 that is (D) 

2026/022) Let n be certain positive integers divisible by 17 & n+1 divisible by 13. How to determine such integers n?

 Let n be divisible by 17 . So n is of the form 17k . 17k +1 is divisible by 13 so 4k +1 is divisible by 13 . So k is 3 is a solution or any multiple of 13 plus 3. Say $k=13 t +3$ or $n =221t +51$

2026/021) Let a,b,c be integers satisfying $ab+bc+ca=1$. Prove that $(1+a^2)(1+b^2)(1+c^2)$ is a perfect square.

We have putting $ab +bc +ca$ for 1 in $1+a^2$

$1+a^2 = ab + bc +ca + a^2 = (a+b)(a+c)$

Similarly $1+b^2 = (b+c)(b+a)$

And $1+ c^2 = (c+b)(c+a)$

So $(1+a^2)(1+b^2)(1+c^2) = ((a+b)(b+c)(c+a))^2$ a perfect square

2026/020) From the number $7^{2026}$ we delete its first digit, and then add the same digit to the remaining number. This process continues until the left number has ten digits. Show that the left number has two same digits.

We are deleting one digit and adding to the number. So value mod 9 shall not change . Given number mod 9 is not zero . So when we get a 10 digit number it shall not be divisible by 9. If all 10 digits are different then the number is divisible by 9. So all ten digits cannot be different. So upto 9 digits shall be different so at least one digit must repeat or two same digits will be there.

2026/019) Determine all positive integers that are equal to 300 times the sum of their digits.

 

The number must end with 2 zeroes . Excluding the 2 zeroes the sum of digits multiplied by 3 is the number. It is not one digit number as multiplied by 3 of the digit changed number

Maximum sum of digits of a 3 digits number is 27. Multiplied by 3 gives 81 which is a 2 digits number . So number of digits cannot be 3 or more. So it is a 2 digit number if it exists. 

Let it be $10a +b$. 

We have 

$10a +b =3(a+b)$ 

Or $7a =2b$ 

As a and b are single digit number so a is 2 and b is 7 and number is 27. We have removed 2 zeroes and so number is 2700 .