← RoseCode

ROSECODE 383

Squarefree Factorisations

Philippe_57721 · Programming ·

Let's n an integer with the following factorisation : n=a1e1×a2e2×⋯×apep where ai are squarefree and ∀i∈{1,…,p−1}ai divides ai+1

For instance :
56=22×141
5040=22×61×2101
526773121875=32×153×11551×150151

It can be proved that this factorisation is unique.

For such a factorisation, let's consider all the divisors of n : a1f1×a2f2×…apfp where 0≤fi≤ei

Define σ′(n)=∑d(d) where d runs over the divisors of n as defined above
σ′(5040)=1+2+4+6+12+24+210+420+840+1260+2520+5040=10339

We say that n is a champion if the ratio σ′(n)n is greater than any ratio σ′(m)m with m<n

Here are the first 10 champions:
1⋅1⇒2
2⋅24⇒2,04166666666667
3⋅48⇒2,1875
4⋅96⇒2,26041666666667
5⋅192⇒2,296875
6⋅384⇒2,31510416666667
7⋅768⇒2,32421875
8⋅1152⇒2,3515625
9⋅2304⇒2,37022569444444
10⋅4608⇒2,37955729166667

What is the 66th champion?

[My timing: 5 sec]