Revision 3882456b-cb9f-4d17-a687-32efd8fbf219 - Code Golf Stack Exchange
# [Python 2, histocrat, ≤16](https://codegolf.stackexchange.com/a/60786/32353)
[[[51002**3/6]]]
----
The biggest hint is the promise that it won't work in Python 3. [What's changed in Python 3](https://docs.python.org/3.0/whatsnew/3.0.html#integers)? The biggest suspect is that the division operator returns a `float` in Python 3.
So I assume the solution is of the form ⌊α<sup>β</sup>/n⌋ = c = 22111101102001, as exponentiation is the only short way to create huge numbers.
If {α, β, n} indeed forms a solution, then (cn)<sup>1/β</sup> ≈ α should be very close to an integer. Therefore I use the following to try to brute-force the {α, β} for each n:
(* Mathematica *)
n=2; Sort[Table[{N[Abs[k - Round@k] /. k -> (22111101102001*n)^(1/b), 12], b}, {b, 2, 50}]]
(* Output: {{0.00262542213622, 7}, ...}
The first number is the "quality" of the solution, lower is better.
the second number is β.
Thus α ≈ (nc)^(1/β) = 89
But (89^7)/2 =わ 22115667447764, which is still far away from the answer.
*)
The actual result quickly comes out when n = 6.