Problem 483 · Hard

Smallest Good Base

Find the smallest base k where n = x^m (m >= 2) using binary search.

Open the interactive visualisation