← Complete problem index

PROJECT EULER · #0484

Arithmetic Derivative

Statement only · UnsolvedOriginal problem ↗

The arithmetic derivative is defined by

  • p=1 for any prime p
  • (ab)=ab+ab for all integers a,b (Leibniz rule)

For example, 20=24.

Find gcd(k,k) for 1<k5×1015.

Note: gcd(x,y) denotes the greatest common divisor of x and y.

Write-up coming later

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