Greedy/Sherlock and the Beast is a Diophantine equation which can be solved without loops.

[jeffreydwalter]

I have implemented this solution in Go in this PR: #239

You guys might want to update the java solution to match. :)

[jeffreydwalter]

I would also note that the mathematical solution is O(1), not O(n) like the currently listed solution.