Hi,
Saw on the web comments about unsolved mathematical problems:
http://mathworld.wolfram.com/UnsolvedProblems.html
Chose problem No: 1 as good place to start.
"Goldbach's original conjecture (sometimes called the "ternary" Goldbach conjecture), written in a June 7, 1742 letter to Euler, states "at least it seems that every number that is greater than 2 is the sum of three primes" (Goldbach 1742; Dickson 2005, p. 421). Note that here Goldbach considered the number 1 to be a prime, a convention that is no longer followed."
Faber and Faber offered a 
prize to anyone who proved Goldbach's conjecture between March 20, 2000 and March 20, 2002, but the prize went unclaimed and the conjecture remains open."
Worth a punt at a MathCad solution?
Gotta at least be worth a copy of the latest software versions if I am right???? Hint :-).
Choosing a large value of "n" takes a long time::::::::::
Enjoy - not a mathetician so my idea of proof may not be what you expect but good enough for me as it is 2D graphical and obvious. That is the benefit of MathCad.
Regards
Terry Hendicott
