How many real values of x in the interval [ 1 , 1 0 ] satisfy
x 2 − ⌊ x 2 ⌋ = ( x − ⌊ x ⌋ ) 2 ?
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.
Almost exactly like how I did it. Great Job!
Write x = n + y , n an integer, 0 ≤ y < 1 . Then the left side is ( n + y ) 2 − ⌊ ( n + y ) 2 ⌋ and the right side is y 2 . Equating and canceling gives n 2 + 2 n y − ⌊ n 2 + 2 n y + y 2 ⌋ = 0 , but we can take the n 2 out of the floor since it's an integer. Hence 2 n y − ⌊ 2 n y + y 2 ⌋ = 0 , which happens if and only if 2 n y is an integer (since 0 ≤ y 2 < 1 ).
For each n between 1 and 9 , there are 2 n such y , namely 2 n 0 , 2 n 1 , … , 2 n 2 n − 1 . And we can't forget n = 1 0 , y = 0 . So the answer is ( 2 + 4 + ⋯ + 1 6 + 1 8 ) + 1 = 9 1 .
Main idea : Manipulate the equation to obtain x as a rational of a certain form, then break the remaining equation with this new expression of x .
Complete proof :
We manipulate the equation as follows:
x 2 − ⌊ x 2 ⌋ = ( x − ⌊ x ⌋ ) 2
x 2 − ⌊ x 2 ⌋ = x 2 − 2 x ⌊ x ⌋ + ⌊ x ⌋ 2
⌊ x 2 ⌋ + ⌊ x ⌋ 2 = 2 x ⌊ x ⌋
Note that the left hand side is an integer, so x = 2 ⌊ x ⌋ k for some integer k to make the right hand side to be an integer too. Let x = a + y where a is an integer and y ∈ [ 0 , 1 ) , so x = 2 a k for some integer k , so x = a + 2 a b for some integers a ≥ 1 , b ∈ [ 0 , 2 a ) . Note that ⌊ x ⌋ = a .
Plugging in, we have:
⌊ ( a + 2 a b ) 2 ⌋ + a 2 = 2 a ( a + 2 a b )
⌊ ( a + 2 a b ) 2 ⌋ + a 2 = 2 a 2 + b
⌊ a 2 + b + ( 2 a b ) 2 ⌋ = a 2 + b
Since 0 ≤ 2 a b < 1 , it follows that 0 ≤ ( 2 a b ) 2 < 1 , and so the last equation is always true for any positive integer a and integer b ∈ [ 0 , 2 a ) .
Now, note that a ranges from 1 to 9 ; the last value x = 1 0 is handled later. For each of these a , we have 2 a values of b and hence 2 a values of x satisfying the equation, so in total, for a = 1 , 2 , … , 9 , we have 2 + 4 + … + 1 8 = 9 0 values of x in [ 1 , 1 0 ) . The last value x = 1 0 also satisfies the equation, bringing the total to 9 1 .
Motivation : To be honest I didn't expect those fractional values. At first I was thinking about x = n or so, trying to mess things up with that, before finally struck by the idea of opening up the right part. The remaining of my train of thoughts follows the above.
The question has the equivalent form of solving for all x ∈ [ 1 , 1 0 ] such that { x 2 } = { x } 2 where { ⋅ } denotes the fractional part of x . Now, { x 2 } = { { x } 2 + 2 { x } ⌊ x ⌋ + ⌊ x ⌋ 2 } . This implies that 2 { x } ⌊ x ⌋ must be a positive integer which in turn implies that { x } must be rational. So, for a given ⌊ x ⌋ = k this can happen in 2 k ways if 1 ≤ k ≤ 9 . If k = 1 0 this can happen in only one way. So, total number of such numbers is 2 k = 1 ∑ 9 k + 1 = 9 1
Note that for a ≤ x < a + 1 , there are 2 a values of x such that the equation holds ( x = 2 ⌊ x ⌋ ⌊ x ⌋ 2 + ⌊ x 2 ⌋ - the result follows from the definition of the floor function). Hence, on [ 1 , 1 0 ) , there are 2 ⋅ 2 9 ⋅ 1 0 = 9 0 solutions, and of course all integers solve the equation, so there are a total of 9 1 solutions.
the equation can be written as : {
x
2
} = {x}^2 {a} denotes fractional part of a.
let q={x}. and a = floor of x.
{
x
2
} = {
q
2
+ 2aq}}.
q
2
= {
q
2
+2aq}.
now let a=1.
q
2
= {
q
2
+2q}.
floor of
q
2
+2q can be 1 or 2.
for each floor their exists one possible value of q.
similarly for a=2 floor of
q
2
+4q can be 1 , 2 , 3 or 4.
for each floor their exists one possible value of q.
similarly for a=1,2,3,4,5,6,7,8,9 there are 2,4,6,8,10,12,14,16,18 solutions respectively.
their exists one more solution for x=10.
thus there are a total of 2+4+6+8+10+12+14+16+18+1=91 values of x
After using x = [ x ] + θ
We have θ 2 + 2 [ x ] θ ] = 2 [ x ] θ .
Now since LHS is an integer RHS is also an integer.
Thus all x satisfying are 10 integers in range given.
But when [ x ] = ξ
We have 2 ξ − 1 values of θ .
Hence total such values are 81.
Thus answer= 9 1 .
Problem Loading...
Note Loading...
Set Loading...
Expand, simplify and rearrange, we get x = 2 ⌊ x ⌋ ⌊ x ⌋ 2 + ⌊ x 2 ⌋
For ⌊ x ⌋ = 1 , then 1 ≤ x < 2 , and 1 ≤ x 2 < 4 , values of ⌊ x 2 ⌋ are 1 , 2 , 3 , then x = 2 2 , 2 3 , a total of 2 values
Similarly, For ⌊ x ⌋ = 2 , then 2 ≤ x < 3 , and 4 ≤ x 2 < 9 , values of ⌊ x 2 ⌋ are 4 , 5 , 6 , 7 , 8 , then x = 4 8 , 4 9 , 4 1 0 , 4 1 1 , a total of 4 values
Repeat: for ⌊ x ⌋ = 3 , then 9 ≤ x 2 < 1 6 , values of ⌊ x 2 ⌋ are 9 , 1 0 , 1 1 , 1 2 , 1 3 , 1 4 , 1 5 , then x = 6 1 8 , 6 1 9 , 6 2 0 , 6 2 1 , 6 2 2 , 6 2 3 , a total of 6 values
Apply the same argument, for ⌊ x ⌋ = 4 , 5 , 6 , 7 , 8 , 9 , total of values are 8 , 1 0 , 1 2 , 1 4 , 1 6 , 1 8 respectively
And lastly, x = 1 0 is the largest solution.
Add them all up yields: 2 + 4 + 6 + 8 + 1 0 + 1 2 + 1 4 + 1 6 + 1 8 + 1 = 9 1