Can you prove in general that , where n is a natural number greater than 1 and x,y and z are whole numbers? (this is the Erdos-Straus conjecture of 1948 - to date no one has proven it nor furnished a counterexample).
The last puzzle for CB was too easy. I think this one should keep CB busy for awhile if he wants to try his hand at it.
Good luck to everybody.
"1 : to offer or represent to (as a person) a problem difficult to solve or a situation difficult to resolve : challenge mentally; also : to exert (as oneself) over such a problem or situation <they puzzled their wits to find a solution>
2 archaic : complicate, entangle
3 : to solve with difficulty or ingenuity <puzzle out an answer to a riddle>"
I couldn't post this one under the math challenge section as it explicitly requires the poster to know the solution beforehand. The foreword to this section
(If you have a brain teaser, a word problem or an interesting math problem that doesn't require formal math training, put it in here!) doesn't say anything about the poster having to need to know what the solution is to the problem.
A puzzle doesn't require a poster to know the solution beforehand (the best kind of puzzle since it would be the most challenging). Such puzzles can be very stimulating (e.g. Fermat's conjecture which is now Fermat's last theorem or the Konisberg bridges problem which led to the new branch of topology by Euler).
The conjecture I posted should prove to be very stimulating (I don't think it's a Godel type of problem that's impossible to solve). I'll be working at it myself and I hope others will find it stimulating.