Smallest k With Base-k Bits | Dataford Interview Questions

Given a number n, find the smallest k such that all the bits of n in base k are 1.

Implement def smallest_good_base(n):. The input is an integer n, with 3 <= n <= 10^18, and the output is the smallest integer base k >= 2 for which every digit in the base-k representation of n equals 1.

Constraints

3 <= n <= 10^18
The base k must be an integer with k >= 2
Every digit in the base-k representation must equal 1

Function Signature

def smallest_good_base(n):

Your question is Smallest k With Base-k Bits. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Given a number n, find the smallest k such that all the bits of n in base k are 1.

Constraints

3 <= n <= 10^18
The base k must be an integer with k >= 2
Every digit in the base-k representation must equal 1

Function Signature

def smallest_good_base(n):

Your question is Smallest k With Base-k Bits. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.