← Complete problem index

PROJECT EULER · #0507

Shortest Lattice Vector

Statement only · UnsolvedOriginal problem ↗

Let tn be the tribonacci numbers defined as:
t0=t1=0;
t2=1;
tn=tn−1+tn−2+tn−3 for n≥3
and let rn=tn mod 107.

For each pair of Vectors Vn=(v1,v2,v3) and Wn=(w1,w2,w3) with v1=r12n−11−r12n−10,v2=r12n−9+r12n−8,v3=r12n−7⋅r12n−6 and
w1=r12n−5−r12n−4,w2=r12n−3+r12n−2,w3=r12n−1⋅r12n
we define S(n) as the minimal value of the manhattan length of the vector D=k⋅Vn+l⋅Wn measured as |k⋅v1+l⋅w1|+|k⋅v2+l⋅w2|+|k⋅v3+l⋅w3| for any integers k and l with (k,l)≠(0,0).

The first vector pair is (−1,3,28), (−11,125,40826).
You are given that S(1)=32 and ∑n=110S(n)=130762273722.

Find ∑n=120000000S(n).

Write-up coming later

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