← Complete problem index

PROJECT EULER · #0876

Triplet Tricks

Statement only · UnsolvedOriginal problem ↗

Starting with three numbers a,b,c, at each step do one of the three operations:

  • change a to 2(b+c)−a;
  • change b to 2(c+a)−b;
  • change c to 2(a+b)−c;

Define f(a,b,c) to be the minimum number of steps required for one number to become zero. If this is not possible then f(a,b,c)=0.

For example, f(6,10,35)=3: (6,10,35)→(6,10,−3)→(8,10,−3)→(8,0,−3). However, f(6,10,36)=0 as no series of operations leads to a zero number.

Also define F(a,b)=∑c=1∞f(a,b,c). You are given F(6,10)=17 and F(36,100)=179.

Find ∑k=118F(6k,10k).

Write-up coming later

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