← Complete problem index

PROJECT EULER · #0647

Linear Transformations of Polygonal Numbers

Statement only · UnsolvedOriginal problem ↗

It is possible to find positive integers A and B such that given any triangular number, Tn, then ATn+B is always a triangular number. We define F3(N) to be the sum of (A+B) over all such possible pairs (A,B) with max(A,B)≤N. For example F3(100)=184.

Polygonal numbers are generalisations of triangular numbers. Polygonal numbers with parameter k we call k-gonal numbers. The formula for the nth k-gonal number is 12n(n(k−2)+4−k) where n≥1. For example when k=3 we get 12n(n+1) the formula for triangular numbers.

The statement above is true for pentagonal, heptagonal and in fact any k-gonal number with k odd. For example when k=5 we get the pentagonal numbers and we can find positive integers A and B such that given any pentagonal number, Pn, then APn+B is always a pentagonal number. We define F5(N) to be the sum of (A+B) over all such possible pairs (A,B) with max(A,B)≤N.

Similarly we define Fk(N) for odd k. You are given ∑kFk(103)=14993 where the sum is over all odd k=3,5,7,….

Find ∑kFk(1012) where the sum is over all odd k=3,5,7,…

Write-up coming later

The complete problem is available here. An approach, code, and answer will be added later.