j
k
j a
j l
...a(n) = minimum value of k so that k copies each of cubes of sides 1 through n can be used to exactly fill some rectangular box. is it obvious that such k exists?
a(n) = minimum value of k so that k copies each of cubes of sides 1 through n can be used to exactly fill some rectangular box.
is it obvious that such k exists?
oh hell, sorry, S=n^2(n+1)^2 / 4, the sum of the first n cubes. erich
Back to the thread
Back to the list
