Find the sum of all real values of x in the interval [ 1 , 1 0 1 ] such that 1 , { x } , and { x 2 } (in that order) form a geometric progression with a non-zero ratio. Here { x } denotes fractional part of x .
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.
To be in G.P. they must satisfy the equation { x 2 } = { x } 2 with x not being integer. Let x = a be one of the solutions between n and n + 1 where n is any natural number. Then n < a < n + 1 which implies n 2 < a 2 < ( n + 1 ) 2 or n 2 < a 2 < n 2 + 2 n + 1 or n 2 + 1 ≤ ⌊ a 2 ⌋ ≤ n 2 + 2 n
In general, ⌊ a 2 ⌋ = n 2 + r , 1 ≤ r ≤ 2 n , r ∈ N
Now,
{
a
2
}
=
{
a
}
2
⇒
a
2
−
⌊
a
2
⌋
=
(
a
−
⌊
a
⌋
)
2
⇒
a
2
−
⌊
a
2
⌋
=
a
2
+
⌊
a
⌋
2
−
2
a
⌊
a
⌋
⇒
2
a
⌊
a
⌋
=
⌊
a
⌋
2
+
⌊
a
2
⌋
We have ⌊ a 2 ⌋ = n 2 + r and ⌊ a ⌋ = n
So, 2 a n = n 2 + n 2 + r
⇒
a
=
2
n
2
n
2
+
r
or
a
=
n
+
2
n
r
a
is not an integer
⇒
r
=
2
n
Hence, between n and n + 1 , x = n + 2 n r ; 1 ≤ r ≤ 2 n − 1 , r ∈ N , n ∈ N are the solutions. Now sum of these solution,
S n = ∑ r = 1 2 n − 1 ( n + 2 n r ) ⇒ S n = n ( 2 n − 1 ) + 2 . 2 n ( 2 n − 1 ) ( 2 n ) = ( 2 n − 1 ) ( n + 2 1 ) = 2 4 n 2 − 1 Our final sum S = ∑ n = 1 1 0 0 S n ⇒ S = ∑ n = 1 1 0 0 ( 2 4 n 2 − 1 ) = 2 ∑ n = 1 1 0 0 n 2 − ∑ n = 1 1 0 0 2 1
⇒ S = 3 1 ⋅ 1 0 0 ⋅ 1 0 1 ⋅ 2 0 1 − 5 0 = 6 7 6 7 0 0 − 5 0 = 6 7 6 6 5 0
Problem Loading...
Note Loading...
Set Loading...
Let x = n + a with 1 ≤ n ≤ N an integer and 0 ≤ a < 1 . Then { x } = a and { x 2 } = { n 2 + 2 a n + a 2 } = { 2 a n + a 2 } . In order for { x 2 } = a 2 , it is therefore necessary that 2 a n is an integer. This is possible provided that a = 2 n k 1 ≤ k < 2 n an integer . There are ∑ n = 1 N ( 2 n − 1 ) = N 2 such combinations of n and k . To add them, consider that the average of the fractional parts { x } is 2 1 , so that we calculate n = 1 ∑ N ( 2 n − 1 ) ( n + 2 1 ) = n = 1 ∑ N 2 n 2 − 2 1 = 3 1 N ( N + 1 ) ( 2 N + 1 ) − 2 1 N . Substitute N = 1 0 0 to find 1 0 0 ⋅ 1 0 1 ⋅ 3 2 0 1 − 2 1 0 0 = 6 7 6 7 0 0 − 5 0 = 6 7 6 , 6 5 0 .