2025 USAMO Problems/Problem 1
Revision as of 01:29, 22 March 2025 by Eevee9406 (talk | contribs) (Created page with "{{duplicate|2025 USAMO/1 and 2025 USAJMO/2}} __TOC__ == Problem == Let <math>k</math> and <math>d</math>...")
- The following problem is from both the 2025 USAMO/1 and 2025 USAJMO/2, so both problems redirect to this page.
Contents
[hide]Problem
Let 
and 
be positive integers. Prove that there exists a positive integer 
such that for every odd integer 
, the digits in the base-
representation of 
are all greater than .
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
See Also
| 2025 USAMO (Problems • Resources) | ||
| Preceded by First Question |
Followed by Problem 2 | |
| 1 • 2 • 3 • 4 • 5 • 6 | ||
| All USAMO Problems and Solutions | ||
| 2025 USAJMO (Problems • Resources) | ||
| Preceded by Problem 1 |
Followed by Problem 3 | |
| 1 • 2 • 3 • 4 • 5 • 6 | ||
| All USAJMO Problems and Solutions | ||
These problems are copyrighted © by the Mathematical Association of America, as part of the American Mathematics Competitions. 
