2014 USAJMO Problems/Problem 4
Revision as of 16:42, 30 April 2014 by TheMaskedMagician (talk | contribs) (Created page with "==Problem== Let <math>b\geq 2</math> be an integer, and let <math>s_b(n)</math> denote the sum of the digits of <math>n</math> when it is written in base <math>b</math>. Show th...")
Problem
Let 
be an integer, and let 
denote the sum of the digits of 
when it is written in base 
. Show that there are infinitely many positive integers that cannot be represented in the form 
, where is a positive integer.
