MathDB
Math Prize 2016 Problem 17

Source:

September 12, 2016
Math Prize for Girls

Problem Statement

We define the weight WW of a positive integer as follows: W(1)=0W(1) = 0, W(2)=1W(2) = 1, W(p)=1+W(p+1)W(p) = 1 + W(p + 1) for every odd prime pp, W(c)=1+W(d)W(c) = 1 + W(d) for every composite cc, where dd is the greatest proper factor of cc. Compute the greatest possible weight of a positive integer less than 100.