How many ordered triples of integers ( a , b , c ) are there such that a + b + c = 2 0 0 0 ?
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.
Small correction - in the proof, N is a positive integer, and N is the number that factors into a b ± c d .
The solution shows how to deal with sum or difference of square roots of two numbers, but the situation with three or more numbers is not completely analogical.For example, in our particular case we have that 5 a b c is an integer, which doesn't mean that a = b = c (this comes after squaring twice the original equation)
Cool..........
great!!! (y)
Claim: a = 5 k 1 2 for some non-negative integer k 1 .
Proof: We have 2 0 5 − a = b + c . Squaring both sides gives 2 0 0 0 + a − 4 0 5 a = b + c − b c .
Let z = b + c − a − 2 0 0 0 , which is an integer, so b c = 4 0 5 a + z
Squaring both sides again, we get b c = 8 0 0 0 a + 8 0 z 5 a + z 2 , which can be rewritten as 5 a = 8 0 b c − 8 0 0 0 a − z 2 . Since the RHS is rational, this implies that 5 a = K 2 for some integer K . Hence, a = 5 k 1 2 for some non-negative integer k 1 . □
Back to the original problem. We have a = 5 k 1 2 , b = 5 k 2 2 , c = 5 k 3 2 by symmetry, hence we want to find the number of non-negative solutions to k 2 + k 2 + k 3 = 2 0 . By generating functions, this is the coefficient of x 2 0 in the binomial expansion of ( 1 − x ) − 3 , hence is equal to 2 2 1 × 2 2 = 2 3 1 .
Claim 1. If √n is rational, then n is a perfect square, where n is a non-negative integer. Proof. Let √n=p/q, where p is a non-negative integer, q is a positive integer and (p,q)=1. n=p²/q², q²n-p²=0. Let P(x)=q²x-p². Observe that P(n)=P(p²/q²)=(q²)(p²/q²)-p²=0. This implies that n is a root of P(x). Since n is a positive integer, by Rational Roots Theorem, q² divides 1. q²=1. Therefore, n=p²/q²=p²/1=p², a perfect square. Claim 2. If √m+√n is rational for non-negative integers m,n, then both m and n are perfect squares. Proof. Let √m+√n=p/q, where p is a non-negative integer, q is a positive integer and (p,q)=1. √m=p/q-√n. Squaring both sides, m=p²/q²+n-2(p/q)(√n), √n is rational, by Claim 1, n is a perfect square. Similarly, m is also a perfect square. Now, we return to the problem. √b+√c=√2000-√a. Squaring both sides, b+c+2√(bc)=2000+a-2√(2000a). Rearranging, √(bc)+√(2000a)=(2000+a-b-c)/2. √(bc)+√(2000a) is rational, by Claim 2, 2000a is a perfect square. 2000a=20²×5a is a perfect square. Therefore, a is divisible by 5. Let a=5x² for some non-negative integer x. Similarly, b=5y² and c=5z² for some non-negative integer y and z. √(5x²)+√(5y²)+√(5z²)=√2000. x+y+z=20. Since a non-negative integer solution of (x,y,z) determines a unique solution for (a,b,c), there is a bijection from (x,y,z) to (a,b,c). So, we only need to determine the number of non-negative solutions for (x,y,z). When z=0, x+y=20, there are 21 solutions. When z=1, x+y=19, there are 20 solutions. … When z=20, x+y=0, there are 1 solution. Therefore, there are a total of 21+20+…+1=231 solutions.
Well, this question's difficulty was pretty out of place I feel.
First, begin by noting that the equation r x + s y = t z where x , y , z , r , s , t ∈ Z and x , y , z is not divisible by the square of any prime has no solutions for distinct x , y , z . In addition, 2 0 0 0 = 2 0 5 , so a, b, c all have an odd power of 5 's. The equation can be henceforth written as a + b + c = 2 0 , and using stars and stripes, stars and bars, sticks and stones, whatever you want to call it, the answer is clearly ( 2 0 2 2 ) = 2 3 1 .
The first statement can be easily proven with contradiction. I could type it out, but I think it's simple enough that you should be able to do it on your own (but feel free to ask questions if otherwise)
I suppose you assume implicitly that x , y and z are square-free, right? Still, how does the fact that the equation r x + s y = t z has no solutions for distinct x , y , z imply that in the original problem all square-free parts of the numbers under the radicals equal 5 ? This is a linear combination of four radicals, not three.
Log in to reply
If you were to instead add m x + n y + r z = t w , I think the proof still works. Square both sides, you get some integer parts and some surds (namely m n x y , n r y z , m r x z ), and this equals an integer, and since x , y , z are square free then necessarily x = y = z .
Log in to reply
Why? Just because 3 terms add up to an integer doesn't mean that they must all be integers. What if m , n , r are allowed to be negative?
Log in to reply
@Calvin Lin – given the question at hand, doesn't that imply that m, n, r are positive?
Note that 2 0 5 = 2 0 0 0
So the problem is equivalent to find the solutions of x+y+z=20 where x,y,z are nonnegative integers.
Which can be verified to have 1+2+3+...+21=231 solutions.
Theorem: If x , y , and z are nonnegative integers such that x + y + z = N for some nonnegative integer N , then there are ( 2 N + 2 ) ordered triples ( a , b , c ) that satisfy the equality.
Proof: The number of triples we are looking for is the same as the number of arrangements in a row of N ∗ 's and 2 + 's. There are ( 2 N + 2 ) such arrangements.
Since 2 0 0 0 = 2 0 5 , we are looking for a , b , c that can be written as x x ′ , y y ′ , z z ′ , respectively, such that x , y , z are nonnegative integers, x + y + z = 2 0 , and x ′ = y ′ = z ′ = 5 . The theorem above tells us that there are ( 2 2 2 ) = 2 3 1 such triples.
Since 2 0 0 0 = 2 0 5 then a , b and c must be multiples of 5, then let a = 5 x 2 , b = 5 y 2 and c = 5 z 2 . Taking note that a , b , c ≥ 0 . Therefore x + y + z = 2 0 , if x = 0 , then there are 2 1 combiations of y and z , if x = 1 , then thre are 2 0 combinations, if x = 2 , 1 9 combinations, ... if x = 2 0 , then only 1 combination, so the total number: 1 + 2 + 3 + . . . + 2 1 = 2 1 ( 2 1 + 1 ) / 2 = 2 3 1 .
We know that 2 0 0 0 = 2 0 5 . Also, a , b , c ≥ 0 .
Square roots can only be added and simplified into one term if the number inside the square root of the simplified radical is the same. Hence, since we are adding non-negative terms, the number inside the square root of a , b , and c should be 5.
Let a = x 5 , b = y 5 , and c = z 5 , where x , y , and z are non-negative integers. Thus,
5 ( x + y + z ) = 2 0 5
x + y + z = 2 0
Since x , y and z are non-negative, the number of integer solutions to this equation is ( 2 2 0 + 2 ) = 2 3 1 .
We are given that a + b + c = 2 0 0 0 . Simplifying, we get a + b + c = 2 0 5 . Since a,b,c are all nonegative integers, we know that a , b , c can be written in the form A 5 , B 5 , C 5 . We know that A+B+C=20, and that they are nonegative integers. There is a bijection between the triples (a,b,c) and the triples (A,B,C) where A+B+C=20. There are (20+2)C2=231 ordered triples (A,B,C) using the stars and bars method, thus our answer is 231.
First off, we note that 2 0 0 0 = 2 0 5 . Hence we have that a + b + c = 2 0 5 , or 5 a + 5 b + 5 c = 2 0 .
The only way for a sum of three square roots to be an integer is if all three square roots are integers themselves, that is, all of 5 a , 5 b , 5 c have to be perfect squares.
Hence, the number of ordered triples of integers ( a , b , c ) is equal to the number of solutions to x + y + z = 2 0 , where ( x , y , z ) are nonnegative integers. This is easily solved by the standard choose function, with 20 '1's and 2 'dividers', hence the answer is ( 2 2 2 ) = 2 3 1 .
first we can see 2 0 0 0 = 2 0 5 .
then a is a integer,so a must be a integer or format like x y , and x , y is integer.
as a + b + c = 2 0 0 0 = 2 0 5 , we can know a + b + c = ( x + y + z ) 5 = 2 0 5 , x , y , z are integers and ≥ 0 .
from combination theory, there are b i n o m i a l ( 2 0 + 2 , 2 ) = 2 2 ∗ 2 1 / 2 = 2 3 1 kinds of solution to x + y + z = 2 0 , x , y , z are integers and ≥ 0 .
2000=20^2.5 so (2000)^1/2=20(5)^1/2 it meams that all non zero terms on the LHS must have (5)^1/2 in them. so the problem just boils down to the no of ways to choose 3 numbers such that their sum is 20 which is 22 choose 2
First, we notice that 2 0 0 0 = 2 0 5 . Thus, we have, a + b + c + 2 0 5 Therefore, we can see that a = 5 k 2 , b = 5 l 2 , c = 5 m 2 where k , l , m ∈ Z . Now we have, k 5 + l 5 + m 5 = 2 0 5 ⇒ k + l + m = 2 0 Thus, we need the number of ways for 3 non-negative integers to sum to 2 0 . For this we will use a technique called stars and bars. Consider the follwowing, ★ ★ ★ ★ ★ ★ |★★ ★ ★ |★ ★ ★ ★★ ★ ★ ★ ★ ★ We have 2 0 stars and 2 bars which split the stars into 3 groups. The number of ways to place the first bar and second bar is 2 1 and 2 2 respectively. Therefore, there are, 2 1 ⋅ 2 2 = 4 6 2 ways to place both bars. However, since it doesn't matter which bar is which, we divide by 2 to get the final answer of, 2 4 6 2 = 2 3 1
a + b + c = 2 0 0 0
and we know that 2 0 0 0 = 20 5 .
Notice that 2 0 0 0 when simplified ends with a 5 .
So now we can rewrite the equation into :
x 1 5 + x 2 5 + x 3 5 = 20 5 . where x 1 , x 2 and x 3 are positive integers.
Now we start adding combinations of 5 triple that sum-up to 20 5 .
0 + 0 + 20 5 = 20 5
19 5 + 5 + 0 = 20 5
From the above triples, it is clear that for every distinct triple it gives 6 combinations and for every 2 same variable and 1 distinct it gives 3 combinations.
Counting all the possible combinations starting from 20 5 + 0 + 0 = 20 5 up to 7 5 + 7 5 + 6 5 = 20 5 .
Thus, 3 3 × 6 + 1 1 × 3 = 2 3 1
Can you explain your thinking step by step? Why must each of the terms only be of the form x i 5 ?
Log in to reply
Okay.
Every term must be in the form of x i 5 since we can't add terms with different bases. Thus, I came up into conclusion that the values of "a" , "b" , and "c" are perfect squares multiplied to 5. So that when it is substituted inside the radical it will leave a 5 , (eg. 5 2 × 5 )
I also assume they are only positive integers and the largest term is 20 5 . Having a negative integer would not change the sign between radicals. In fact, it will only be in form of x i i 5 . i 2 = -1
We can write the solution as follows;
sqrt(2000) = 20(sqrt(5)).
Let sqrt(a),sqrt(b), sqrt(c) be x(sqrt(5)), y(sqrt(5)) and z(sqrt(5)).
By putting these assumptions in the question we get,
x + y +z = 20
Then, for finding no. of triplets we will be using = C((n + r - 1),(r - 1))
Here, n = 3 , r = 20.
Therefore, Total triplets = C((22),(19))
= C((22),(2))
= (22 * 21)/2
= 231 (Ans.)
Can you explain your thinking step by step? Why did you make the assumption that the terms can only be of the form x 5 ?
Log in to reply
Yes!, as you can see that sqrt(2000) = 20sqrt(5), then the sum sqrt(a),sqrt(b),sqrt(c) can only be of type xsqrt(5) etc. because sum of other irrationals can never be related with sqrt(5). As xsqrt(3) + ysqrt(7) is not equal to zsqrt(5)???
I made a typo instead of C((n + r -1),(n-1)), I have written it by mistake as C((n + r -1),(r - 1)).
And C((22),(19)) should be deleted. Sorry, for the mistake!!!
Firstly, prime factorize 2 0 0 0 = 2 4 x 5 3 .
Hence, 2 0 0 0 = 2 0 5 .
Let a , b , c = 5 A 2 , 5 B 2 , 5 C 2 respectively, where A , B , C are integers satisfying the condition mentioned.
Thus, a + b + c = 2 0 5 ,
= 5 A 2 + 5 B 2 + 5 C 2 = 2 0 5
= A 5 + B 5 + C 5 = 2 0 5
= ( A + B + C ) 5 = 2 0 5
Hence, A + B + C = 2 0
Thus, when A = 0 , B + C = 2 0 , where B = 2 0 , C = 0 ; B = 1 9 , C = 1 ; . . . B = 0 , C = 2 0
A = 0 yield 21 possible solutions of B and C
Similarly, when A = 1 , there are 20 solutions of B and C from B = 1 9 , C = 0 to B = 0 , C = 1 9 for B + C = 1 9
The number of triplets for ( A , B , C ) = 2 1 + 2 0 + 1 9 . . . + 1 = 2 3 1
As each integer of A , B , C corresponds to a unique value of a , b , c respectively, thus, the number of triplets for ( a , b , c ) = 2 3 1
a + b + c = 2 0 0 0 = 2 0 5 . Thus, a , b , and c must all be of the form n 5 , where n is an integer.
Let a = x 5 , b = y 5 , and c = z 5 . Then, x + y + z = 2 0 and we want to count the number of ordered pairs of non-negative integers ( x , y , z ) that satisfy this. By Stars and Bars, the answer is ( 2 0 2 2 ) = 2 3 1 .
2 0 0 0 = 2 0 5
Let
a = x 5
b = y 5
c = z 5
Substitute into the equation we have
x 5 + y 5 + z 5 = 2 0 5
( x + y + z ) 5 = 2 0 5
x + y + z = 2 0
By Stars and Bars , the ordered triples of ( x , y , z ) is
( 2 2 2 )
= 2 3 1
Hence, the ordered triples of integers ( a , b , c ) is also 2 3 1 .
Simplifying the RHS of the equation, we'll get a + b + c = 2 0 5 , which implies, the LHS can be expressed in such way, so let a = d 2 q , b = e 2 q , c = f 2 q , where q is not a perfect square number, thus, we get, by substitution:
d q + e q + f q = 2 0 5
( d + e + f ) q = 2 0 5 which implies, d + e + f = 2 0 and q = 5
Now, since a = d 2 q , b = e 2 q and c = f 2 q and ( a , b , c ) are all non - negative numbers, otherwise it will yield unreal numbers, the number of ordered triples of integer ( a , b , c ) that will satisfy the condition is equal to the number of the natural number solutions, ( d , e , f ) .
Thus, ( 2 0 2 2 ) = 2 3 1 solutions
Simply the problem with:
a + b + c =20.\sqrt{5})
suppose that
a = x 2 , x ≥ 0 ,
b = y 2 , y ≥ 0 ,
c = z 2 , z ≥ 0 ,
So,
x + y + z = 2 0 , where x , y , z ≥ 0
Solution for non-negatif integer number are:
C ( 2 0 + 3 − 1 , 3 − 1 ) = C ( 2 2 , 2 ) = 2 3 1
So, the answer are 2 3 1
Problem Loading...
Note Loading...
Set Loading...
The first thing that should be noticed is that 2 0 0 0 = 2 0 5 . A possible way to approach this is to take a , b , and c as being equal to k 1 5 , k 2 5 , and k 3 5 and finding the number of ways three nonnegative numbers can add up to 2 0 . However, a problem with this is that it ignores the possibility that a the square root of two numbers might simplify to h 1 r and h 2 5 − h 1 r , which sum to h 2 5 . The third number could be ( 2 0 − h 2 ) 5 , which would be an acceptable 3 -tuple.
Therefore, something that needs to be done is to prove that a number's square root cannot factor to r 1 ± r 2 . This is a relatively straightforward proof by contradiction.
Assume a positive integer N can factor into a b ± c d where a and c are positive integers and b and d are distinct positive integers not divisible by any square of any prime. Squaring both sides gives N = a 2 b + c 2 d ± 2 a c b d . Because N is an integer, b × d must be 0 or a square. b and d are both positive, so they cannot have a product of 0 . We now know that b × d must be a square. In order for two positive integers b and d not divisible by any prime's square to have a product that is a square, the numbers must be equal. Otherwise, when simplified, b d will still have a number under the radical. Therefore, b = d . However, this contradicts our condition that b and d are distinct. Therefore, N = a b + c d . N can only be equal to a b for a and b being positive integers.
This proves that 2 0 5 = k 1 5 + k 2 5 + k 3 5 when k 1 , k 2 , and k 3 are nonnegative integers. This problem can be simplified to a balls-in-urns problem. We are finding the number of ways to put 2 0 balls into 3 urns.
The number of ways to put n balls into k urns is equal to ( n n + k − 1 )
In this problem, n = 2 0 and k = 3 .
( 2 0 2 2 ) = 2 0 ! × 2 ! 2 2 ! = 2 2 2 × 2 1 = 2 3 1
This problem can be generalized using similar logic. a 1 + a 2 + … + a k = n m , then every a b is of the form c m for c being a nonnegative integer and m not being divisible by the square of any prime. The number of ways this can be achieved is equivalent to the balls in urns problem, so the number of ways to achieve this is ( n n + k − 1 )