Skip to main content
OlympiadHQ

Browse · MATH

Print

jmc

number theory senior

Problem

Compute the smallest base-10 positive integer greater than 5 that is a palindrome when written in both base 2 and 4.
Solution
We start by testing palindromic sequences in base 4. Since the positive integer must be greater than 5, we start by analyzing , which is . We then test , which is . Converting to base 10, we have .
Final answer
15