⌊ x ⌋ + ⌊ y ⌋ + ⌊ z ⌋ = 1 4 0
Find the number of non-negative integral solutions to the equation above.
Note:
⌊
k
⌋
represents the greatest integer less than or equal to
k
.
You can use calculators to calculate the final sum.
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.
Great approach with converting it into a generating function and manipulating it from there.
Great approach with converting it into a generating function and manipulating it from there.
That is not how I would have approached this question, thanks for sharing this!
This is so beautiful. Thank you
Instead of searching for non-negative integral solutions, I had tried positive integral solutions.
Good Solution, BTW.
I really did it using tons of paper. Very amazing and magic solutions. I really love it. I use the approach of using sums instead and using a computer to solve it. By then, I have the generalisation. I'm so thunderstruck!
Beautiful Solution! I really love this method. I hadn't seen this solution earlier.
My solution is more pedestrian than Surya's.
We start with the observation that there are 2 p + 1 integers x with ⌊ x ⌋ = p , namely, p 2 ≤ x ≤ p 2 + 2 p = ( p + 1 ) 2 − 1 .
The number of integer pairs ( x , y ) with ⌊ x ⌋ + ⌊ y ⌋ = q is ∑ p = 0 q ( 2 p + 1 ) ( 2 q − 2 p + 1 ) = 3 1 ( q + 1 ) ( 2 q 2 + 4 q + 3 ) .
Finally, the number of integer triples ( x , y , z ) with ⌊ x ⌋ + ⌊ y ⌋ + ⌊ z ⌋ = 1 4 0 is ∑ q = 0 1 4 0 3 1 ( q + 1 ) ( 2 q 2 + 4 q + 3 ) ( 2 8 1 − 2 q ) = 3 7 8 2 2 0 5 8 5 5
Nice solution. :) But my solution is big because of it's huge calculation.
Log in to reply
I was glad that you allowed us to use a calculator for the "final sum." ;)
We have that in order for ⌊ x ⌋ = n the following must be satisfied: n ≤ x < n + 1 Squaring both sides we have that: n 2 ≤ x < n 2 + 2 n + 1 There are 2 n + 1 values that x can take on to statisfy this condition. We can now take a sum to find the total combinations for x , y and z : X = 0 ∑ 1 4 0 Y = 0 ∑ 1 4 0 − X ( 2 X + 1 ) ( 2 Y + 1 ) ( 2 ( 1 4 0 − X − Y ) + 1 ) Here X denotes the value of ⌊ x ⌋ for X 2 ≤ x < X 2 + 2 X + 1 , and so does Y . Evaluating the sum we have that the number of combinations of x , y and z is: X = 0 ∑ 1 4 0 Y = 0 ∑ 1 4 0 − X ( 2 X + 1 ) ( 2 Y + 1 ) ( 2 ( 1 4 0 − X − Y ) + 1 ) = 3 7 8 2 2 0 5 8 5 5
Problem Loading...
Note Loading...
Set Loading...
The number of non-negative integer solutions to ⌊ x ⌋ + ⌊ y ⌋ + ⌊ z ⌋ = 1 4 0 is equivalent to finding the coefficient of the term t 1 4 0 in the expansion,
( 1 + t ⌊ 1 ⌋ + t ⌊ 2 ⌋ + … ) ( 1 + t ⌊ 1 ⌋ + t ⌊ 2 ⌋ + … ) ( 1 + t ⌊ 1 ⌋ + t ⌊ 2 ⌋ + … )
= ( 1 + t + t + t + t 2 + t 2 + t 2 + t 2 + t 2 + … ) 3 = ( 1 + 3 t + 5 t 2 + 7 t 3 + … ) 3 = ( ( 1 − t ) 2 1 + t ) 3 (Sum of terms in infinite A.G.P) = ( 1 + t ) 3 ( 1 − t ) − 6 = ( 1 + 3 t + 3 t 2 + t 3 ) ( 1 + ( 1 6 ) t + ( 2 7 ) t 2 + … + ( r 5 + r ) + … )
So, the coefficient of t 1 4 0 in the above expansion is
( 1 4 0 1 4 5 ) + 3 ( 1 3 9 1 4 4 ) + 3 ( 1 3 8 1 4 3 ) + ( 1 3 7 1 4 2 ) = 3 7 8 2 2 0 5 8 5 5 .