Difference between revisions of "2023 IOQM/Problem 1"
m (→Solution 1(Spacing of squares)) |
|||
Line 10: | Line 10: | ||
==Solution 1(Spacing of squares)== | ==Solution 1(Spacing of squares)== | ||
− | If for any integer n <math> | + | If for any [[integer]] <math>n</math>, if <math>\sqrt{n}</math> is an [[integer]] this means <math>n</math> is a [[perfect square]]. Now the problem reduces to finding the difference between maximum and minimum no. of [[perfect squares]] between <math>4n+1, 4n+2 .... 4n+1000.</math> There are 1000 numbers here. |
− | |||
− | The idea is for the same range of | + | The idea is that for the same range of numbers, the no. of [[perfect squares]] becomes less when the numbers become larger for example, there are 3 [[perfect squares]] between 1 and 10 but none between 50 and 60. |
− | So maximum value of <math>M_n</math> occurs when n is minimum and the minimum value of <math>M_n</math> occurs when n is maximum. Minimum n = 1 | + | So maximum value of <math>M_n</math> occurs when <math>n</math> is minimum and the minimum value of <math>M_n</math> occurs when <math>n</math> is maximum. |
− | + | ||
+ | Minimum value of <math>n</math> = 1 |
Revision as of 11:45, 26 September 2023
Problem
Let be a positive integer such that . Let be the number of integers in the set
. Let , and .
Find .
Solution 1(Spacing of squares)
If for any integer , if is an integer this means is a perfect square. Now the problem reduces to finding the difference between maximum and minimum no. of perfect squares between There are 1000 numbers here.
The idea is that for the same range of numbers, the no. of perfect squares becomes less when the numbers become larger for example, there are 3 perfect squares between 1 and 10 but none between 50 and 60.
So maximum value of occurs when is minimum and the minimum value of occurs when is maximum.
Minimum value of = 1