Consider the a n series of positive integers. Let b n = ( a 1 + a 2 + ⋯ + a n ) ( a 1 1 + a 2 1 + a 3 1 + ⋯ + a n 1 )
Is it true, that for each k the ⌊ b k ⌋ is different?
Notation: ⌊ ⋅ ⌋ denotes the floor function .
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.
It is enough to prove that for each k b n + 1 ≤ b n + 1
Let d = a 1 + a 2 + ⋯ + a n , c = a 1 1 + a 2 1 + ⋯ + a n 1 and x = a n + 1 .
Now we have to prove: ( d + x ) ( c + x 1 ) ≥ c d + 1 From that x d + c x ≥ 2 c d which is true because the relationship between arithmetic mean and geometric mean.
Problem Loading...
Note Loading...
Set Loading...
By the Cauchy-Schwarz Inequality,
b n = i = 1 ∑ n a n i = 1 ∑ n a n 1 = i = 1 ∑ n a n 2 i = 1 ∑ n ( a n 1 ) 2 ≥ ( i = 1 ∑ n a n a n 1 ) 2 = n 2 .
Thus, ⌊ b n ⌋ ≥ ⌊ n 2 ⌋ = n . From this, we can see that ⌊ b n ⌋ and ⌊ b n + 1 ⌋ differ by at least one, so we conclude that yes , all the ⌊ b k ⌋ are different.