There exists an expression with infinite nested roots that evaluates to an integer:
3 = 6 + 6 + 6 + 6 + 6 + ⋯ .
How many integer values of x between 1 and 1000 (inclusive) are there such that x + x + x + x + x + ⋯ is also an integer?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Exactly how I did it!
1 2 3 4 5 6 7 8 9 10 11 12 |
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 |
|
Can we solve it this way? We know that for such expressions, when x is factorised in form of m(m+1), (m+1) is the integral value of the expression. So for this question we need to find the number of integers between 1 and 1000 which can be factorised into product of two conservative integers. So there are 31 pairs of consecutive integers whose product is between 1 and 1000. So our answer is 31.
Sir could u pls explain how did u solve the equation 1<k^2-k<1000??
Log in to reply
1 < k 2 − k < 1 0 0 0 ⟹ k 2 − k − 1 > 0 ⟹ k − k − 1 0 0 0 < 0 . For for k . You can also estimate. For example, when k = 1 , k 2 − k = 0 < 2 , when k = 2 , k 2 − k = 2 . For k 2 − k < 1 0 0 0 , ⟹ k ≈ 1 0 0 0 ≈ 3 1 . 6 , When k = 3 2 , k 2 − k = 9 9 2 < 1 0 0 0 , but when k = 3 3 , k 2 − k = 1 0 5 6 > 1 0 0 0 . Therefore, the answer is k ≤ 3 2 .
Log in to reply
Good one sir!!
Log in to reply
@Erica Phillips – But sir isn't it that x=k^2+K but in the inequation u have substituted x=k^2-K ??
Log in to reply
@Erica Phillips – Thanks, a typo.
This solution is wrong. There are 15 odd perfect squares less than 1000, not 31.
Log in to reply
Can you please show some mathematical proof to back it up?
The answer does not come from the number of odd perfect squares but from 1 < k 2 + k < 1 0 0 0 .
How did you get (2k+1)^2?
Log in to reply
( 2 k + 1 ) is a general expression for an odd integer, then odd number perfect square ( 2 k + 1 ) 2 .
Let y = x + x + x + ⋯ = x + y . Square both sides to find that y 2 = x + y ∴ x = y ( y − 1 ) . x is an integer whenever y is an integer, and the function x ( y ) is strictly increasing for y ≥ 2 . The condition 1 ≤ x ≤ 1 0 0 0 requires 2 ≤ y ≤ 3 2 . (Note that 3 2 × 3 1 = 9 9 2 but 3 3 × 3 2 = 1 0 5 6 .)
Therefore there are 3 2 − 2 + 1 = 3 1 values of y that result in an acceptable value for x .
Can we solve it this way? We know that for such expressions, when x is factorised in form of m(m+1), (m+1) is the integral value of the expression. So for this question we need to find the number of integers between 1 and 1000 which can be factorised into product of two conservative integers. So there are 31 pairs of consecutive integers whose product is between 1 and 1000. So our answer is 31.
Log in to reply
Yes, if you replace 100 by 1000. And make sure to use to positive integers only.
Sir why is it that y=(x+y)^1/2
Log in to reply
y = x + x + x + ⋯ y .
More formally, we define y 0 = x y n = x + y n − 1 , and we try to find the value of y = n → ∞ lim y n . If this limit exists, then n → ∞ lim y n = n → ∞ lim x + y n − 1 n → ∞ lim y n = x + n → ∞ lim y n y = x + y .
If y =1 this leads to x=0. This seems to imply that 1= sqrt(0+sqrt(0+......... Surely some mistake here.
Log in to reply
For one thing, we were asked integers between 1 and 1000.
Also, 0 + 0 + 0 + ⋯ = 0 . Not only is y = 0 a solution of 0 = y ( y − 1 ) ; it is also the limit of the sequence { y 0 = 0 y n = 0 + y n − 1 and this limit is really what is denoted informally by y = 0 + 0 + 0 + ⋯ .
But y starts from 2!!!
Let f ( x ) = x + x + x + x + x + … . Then, if f ( x ) exists (and it is easy to prove it exists by the monotone convergence theorem) then the relationship f ( x ) = x + f ( x ) must hold. Then f ( x ) 2 − f ( x ) = x ⟹ ( f ( x ) − 2 1 ) 2 = x + 4 1 ⟹ f ( x ) = x + 4 1 + 2 1 = 2 4 x + 1 + 1 .
One important thing to note is that I ignore the possibility of a negative radical because from the given definition we know that for positive x , f ( x ) has to be positive as well. After this, we have a new definition for our function which is much easier to manipulate. It is also much easier to see when f ( n ) will be an integer. We have a radical in our expression and it is necessary for that radical to evaluate to an integer so we have 4 n + 1 = m ⟹ 4 n + 1 = m 2 . This is now no more than a diophantine equation, and a very simple one too. Notice that what it says is that m 2 ≡ 1 m o d 4 ⟹ m ≡ − 1 , 1 m o d 4 . So m = 4 k − 1 or m = 4 k + 1 . In the first case we would have n = 4 ( 4 k − 1 ) 2 − 1 = 4 4 k ( 4 k − 2 ) = 4 k 2 − 2 k . We can easily solve the inequality 1 ≤ 4 k 2 − 2 k ≤ 1 0 0 0 ⟹ 1 ≤ k ≤ 1 6 so in this case there are 1 6 such numbers.
In the other case we would have n = 4 ( 4 k + 1 ) 2 − 1 = 4 k 2 + 2 k and solving the inequality 1 ≤ 4 k 2 + 2 k ≤ 1 0 0 0 ⟹ 1 ≤ k ≤ 1 5 so there are 15 such numbers. This adds up to 1 6 + 1 5 = 3 1 such numbers.
There is still an extra constraint though. It must be that 4 x + 1 + 1 is divisible by 2. This is always the case because 4 x + 1 ≡ 1 m o d 2 which implies its square root is also ≡ 1 m o d 2 and then if we add 1 to it we get an even number. So all of our 3 1 candidates work, making the solution exactly 3 1 .
There is a much more logical way. 1x1 works, 2x2 works....30x30 works, 31x31 works, 32x32 is too big, so there are 31 possibilities
Let y = x + x + x + x + ⋯
y = x + y
y 2 = x + y
x = y 2 − y
Now we have x as a function of y . At this point, we are looking for integer values of x between 1 and 1000. Any integer of y yields an integer for x , and since y 2 − y is strictly increasing, we simply need to find the lower and upper limits of y to determine the number of values of x between 1 and 1000.
y = 1 yields x = 0
y = 2 yields x = 2
So the lower limit of y is 2.
A good starting point to find the upper limit is ⌈ 1 0 0 0 ⌉ , since 1 0 0 0 − 1 0 0 0 < 1 0 0 0 , but close to the upper limit of y .
⌈ 1 0 0 0 ⌉ = 3 2
y = 3 2 yields x = 9 9 2
y = 3 3 yields x = 1 0 5 6
Therefore, 2 ≤ y ≤ 3 2 .
The number of integer values of x in the range 1 ≤ x ≤ 1 0 0 0 which satisfy the conditions of the problem are 3 1 . We do not need to calculate the possible values of x , other than those used to determine the limits.
Well I wrote my solution similar to Sir @Chew-Seong Cheong too however, I tried to reduce it a bit so that it can be done with in mind . So let's make some observations for x = 2 , 3 , 4 , ⋯ as below.
For x = 2 2 = 2 + 2 + + 2 + ⋯ 2 = 2 2 − 2 + 2 2 − 2 + 2 2 − 2 + ⋯ = 2 × 1 + 2 × 1 + 2 × 1 + ⋯ Similarly for x = 3 3 = 6 + 6 + 6 + ⋯ 3 = 3 2 − 3 + 3 2 − 3 + 3 2 − 3 + ⋯ = 3 × 2 + 3 × 2 + 3 × 2 + ⋯ So in general for x we can clearly note that x = x ( x − 1 ) + x ( x − 1 ) + x ( x − 1 ) + ⋯ Shows that x is an integer iff any integer nested is the product of consecutive integers where one of the integer is equal x .
So between 1 to 1000 we can have 1 < x ≤ 1 0 0 0 ⟹ 1 < x ( x − 1 ) ≤ 1 0 0 0 ⟹ 1 < 3 2 × ( 3 2 − 1 ) ≤ 1 0 0 0 ⟹ 1 < 3 2 × 3 1 ≤ 1 0 0 0 ⟹ 2 ≤ x ≤ 3 2 Hence there are exactly 3 1 integers for x between 1 too 1000
The integers that satisfy this equation are always right between consecutive squares.
So we can state that y will be an integer if y = ⌊ ( x 2 + ( x + 1 ) 2 ) / 2 ⌋ where x is an integer
In the example: 6 lies between 2 2 and 3 2 . Or in other words 6 = ⌊ ( 2 2 + 3 2 ) / 2 ⌋
The highest value of x 2 so that x 2 < 1000 is 31
n = x + x + … ⟹ n 2 − x = x + x + … ⟹ n 2 − x = n ⟹ n 2 − n − x = 0
Polynomial n 2 − n − x in Z [ n ] has integer root if and only if it can be factored over Z , i.e., if and only if there exist integers a and b such that n 2 − n − x = ( n − a ) ( n − b ) . Expanding the RHS and comparing coefficients gives us a + b = 1 and x = − a b which implies x = a ( a − 1 ) . It is not loss of generality to assume that a is positive (at least one of a , b is). Thus, the question is how many integers in [ 1 , 1 0 0 0 ] are product of two consecutive positive integers. Since 3 1 ⋅ 3 2 < 1 0 0 0 < 3 2 ⋅ 3 3 , we have that x ∈ { 1 ⋅ 2 , 2 ⋅ 3 , … , 3 1 ⋅ 3 2 } , so there are 3 1 integer values of x .
3 = 6 + 6 + 6 + 6 + …
Notice,
3 = 6 + 3 ⟹ 3 = 9
So, we have look for square roots which are integers from 1 → 1 0 0 0 . So, let's start.
1 0 0 0 = 1 0 1 0
1 0 1 0 is not an integer. By trying multiple times, I finally came to 9 6 1 .
9 6 1 = 3 1
Now we have our answer. I know that it's not a smart way of solving questions.
Let N be the set of positive integers.
Let ( x ∈ N ) ∧ ( 1 ≤ x ≤ 1 0 0 0 ) and let y = x + x + x + . . . ⟹ y 2 − x = x + x + x + . . . = y ⟹ y 2 − y − x = 0 ⟹ y = 2 1 ± 4 x + 1
( x ∈ N ) ∧ ( 1 ≤ x ≤ 1 0 0 0 ) ⟹ y = 2 1 − 4 x + 1 < 0 ∴ choose y = 2 1 + 4 x + 1 > 0 for ( 1 ≤ x ≤ 1 0 0 0 ) ⟹ 4 x + 1 = j 2 ⟹ x = 4 j 2 − 1 for positive j odd ⟹ ( 1 ≤ x = 4 ( 2 k + 1 ) 2 − 1 = k ( k + 1 ) ≤ 1 0 0 0 ) ⟹ k = ⌊ 2 − 1 + 4 0 0 1 ⌋ = 3 1
Y=√(X+Y)
Our condition is what both X & Y should be integers and the value of X should be in between 1 to 1000
1=√(0+1) but here our X value is 0 (i.e)<1. So neglect this expression
2=√(2+2)
3=√(6+3) which is given expression in question
4=√(12+4)
5=√(20+5)
6=√(30+6)
7=√(42+7)
8=√(56+8)
9=√(72+9)
10=√(90+10)
11=√(110+11)
12=√(122+12)
13=√(156+13)
14=√(182+14)
See in all the above expressions both the values of X & Y are integers
Think how long it will continue?
30x30=900
31x31=961 where we can get ----> 31=√(930+31)
32x32=1024 where we can get 32=√(992+32)
33x33=1089 where we can get 33=√(1056+33) but here our X value > 1000 so neglect this expression also
So from 1 to 33, neglect 1st & 33rd expressions
so we can get 31 such expression
right ans. is 30. I have counted that.Values of x between 1 & 1000 are 6,12,20,30,42,56,72,90,110,132,156,182,210,240,272,306,342,380,420,462,506,552,600,650,702,756,812,870,930,992. I have got these answers by C Programming.
Problem Loading...
Note Loading...
Set Loading...
Let y = x + x + x + ⋯ . Then we have:
y y 2 y 2 − y − x y = x + y = x + y = 0 = 2 1 + 1 + 4 x Squaring both sides Rearranging Solving the quadratic of y Note that y > 0
Note that y is integral when 1 + 4 x is a perfect square. Note that 1 + 4 x is odd therefore its root 1 + 4 x is also odd, then 2 1 + 1 + 4 x is integral whenever 1 + 4 x is a perfect square.
Next we note that all positive odd perfect squares can be expressed as 4 x + 1 . Proof: Let k be any non-negative integer, then any positive odd perfect square is ( 2 k + 1 ) 2 = 4 ( k 2 + k ) + 1 = 4 x + 1 , where x = k 2 + k .
Then the number of x between 1 and 1000 such that y is integral is given by:
1 < 1 < k 2 2 ≤ x < 1 0 0 0 + k < 1 0 0 0 k ≤ 3 2
Since one k gives one x , we have 3 1 integral x 's between 1 and 1000 such that y is also integral.