hihi, all - a few days ago, rich wrote: Chris Landauer worked on the 2...6 problem long long ago; I think his program got up to a million or so. i sort of remembered it, so i went back to look - in july of 1984, i ran a program to count how many representations there were for non-negative integers of the form n = a^2 + b^3 + c^4 + d^5 + e^6 with a, b, c, d, e non-negative i only ran it up to a few thousand, but i did run it for scattered values near a million i ran it last night and it is up to about 300000 so far - i am using the "strict" formulation, in which a, b, c, d, e all have to be at least 2, and still getting many representations for each rechable number (obviously, low values are not representable that way all the time), and i'll run it again with strict bound 1 when this one finishes (which should be about aweek or so) more soon, cal