AoPS Wiki talk:Problem of the Day/September 6, 2011
Revision as of 17:14, 6 September 2011 by Negativebplusorminus (talk | contribs) (Created page with "Since <math>a>b>c>d</math>, <math>a+b>c+d</math>, so <math>a+b>512</math> and since <math>a>b</math>, <math>a>512</math>. If we were to have <math>a-b\geq2</math>, then <math>a^...")
Since , , so and since , .
If we were to have , then , which defies the first equation. Thus, . Since we must also have .
From there, we can simply test values. We know , so we test . It fails, since the maximum possible base, , has a sum of only 2046.
Testing , we see that works, so the minimum is .