Later, I found on the same website that I originally found the problem a proof showing there was a single unique solution.
Can you post the proof? I got as far as Mathsy did, that two of the numbers should be odd and one even. Maybe, the proof has got something to do with 2 being the only even prime
]]>... but the hide tag has a problem with apostrophes.
I think I got the hide tag straightened out. Quotes should work now
]]>I know I am new here but I'm quite impressed with the speed that you found an answer.
]]>I said it was easy.
]]>This is one of my favorite integer problems. The wording is a little off. I think it should read, "their product is evenly divisible", no fractions. I think there is also a proof that shows there is exactly one solution to this problem. When posting solutions, please post your method as well.
(x × y 1) ÷ z = (int)
(y × z 1) ÷ x = (int)
(z × x 1) ÷ y = (int)