All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Just Math
Expression Product Exercise (Posted on 2015-09-18) Difficulty: 3 of 5
Prove that when all expessions of the form:
+/- √1 +/- √2 +/- ....... +/- √100 are multiplied together, the result is an integer.
As an example, multiplying all expressions of the form: +/- √1 +/- √2 is equivalent to finding the result of this product:
(√1 +√2)( √1 - √2)( - √1 + √2)( - √1 - √2)

**** Extra Challenge: Solve this puzzle without the aid of a computer program.

No Solution Yet Submitted by K Sengupta    
No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)
possible solution | Comment 2 of 5 |

Establish the proposition for (a+b)(a-b)(-a+b)(-a-b) = (a^2-b^2)^2, with each element occurring to an even power, and a single difference of squares.

Let (a+b) = k, then -a-b=-k; let (a-b)=l; then (-a+b) = -l [1]

(k+c)(k-c)(l+c)(l-c)(-k+c)(-k-c)(-l+c)(-l-c) = (c^2-k^2)^2 (c^2-l^2)^2 with each element again occurring to an even power, and two differences of squares. Since all we have done with each of k and l is just the same as we did before with a and b, each of the latter on resubstitution must equally occur to an even power; in fact the expression is equivalent to:


In the same way as [1], we can pair off (k+c)(k-c)(-k+c)(-k-c) to m,-m,n,-n, and (l+c)(l-c)(-l+c)(-l-c) to o,-o,p,-p and repeat the whole thing for d, giving (d^2-m^2)^2 (d^2-n^2)^2(d^2-o^2)^2 (d^2-p^2)^2, and so on...

So the nth reiteration of the same exercise will be the product of 2n squared differences of squares, producing an integer result, as was to be shown.

Edited on September 19, 2015, 12:53 am
  Posted by broll on 2015-09-18 23:56:26

Please log in:
Remember me:
Sign up! | Forgot password

Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (0)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Copyright © 2002 - 2021 by Animus Pactum Consulting. All rights reserved. Privacy Information