B. Pym wrote:
It'd be interesting to see how the various functions perform with
respect to that polynomial for large n. They may well implement it.
Given the sequence 0, 1, 9, 36, 100, 225, 441... it is possible to
calculate the polynomial expression for the sum of the entries in a >multiplication table of n rows and n columns. 2025 is the 9th entry in
this sequence as it is the sum for the entries in a 9 x 9 multiplication >table.
Can you calculate that function?
sum(x=1..n) sum(y=1..n) [xy]
= sum(x=1..n) [x sum(y=1..n) y]
= [sum(x=1..n) x] [sum(y=1..n) y]
= [sum(x=1..n)]^2
sum(x=1..n) is well known and easily seen geometrically.
sum(x=1..n) sum(y=1..n) [xy]
= sum(x=1..n) [x sum(y=1..n) y]
= [sum(x=1..n) x] [sum(y=1..n) y]
= [sum(x=1..n)]^2
Sysop: | Keyop |
---|---|
Location: | Huddersfield, West Yorkshire, UK |
Users: | 546 |
Nodes: | 16 (0 / 16) |
Uptime: | 158:20:04 |
Calls: | 10,384 |
Calls today: | 1 |
Files: | 14,056 |
Messages: | 6,416,484 |