Thanks Dan for your email. I only add that, before my solution giving the exact value of n, it was proved in 1941 in the American Mathematical Monthly that n <= 8. On your P.S., I don't think that this problem was discussed here, in [math-fun]. As announced in The Monthly, a more detailed solution will be published in www.multimagie.com/indexengl.htm. Soon, probably tomorrow or Wednesday, with a lot of other news. Christian. -----Message d'origine----- De : math-fun-bounces@mailman.xmission.com [mailto:math-fun-bounces@mailman.xmission.com] De la part de Dan Asimov Envoyé : vendredi 2 novembre 2007 23:43 À : math-fun Objet : [math-fun] An honor for a math-funner
From the October, 2007 American Mathematical Monthly:
<< E 496 [1941, 699]. Proposed by R.V. Heath, New York, NY. What is the smallest value of n for which the n^2 triangular numbers 0,1,3,6,10,...,(n^2)(n^2-1)/2 can be arranged to form a magic square? Solution by Christian Boyer, Enghien les Bains, France. The answer is . . . . . . . . . [Editor's note: In 66 years, no other solutions were received.]
--Dan P.S. Solution is omitted in case anyone wants to work on this, though I suspect this problem has already been discussed here. (Has it?) P.P.S. Does anyone know of a longer interval between the publication of a Monthly problem and the first solution received? _______________________________________________ math-fun mailing list math-fun@mailman.xmission.com http://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun