2025 AMC 12A Problems/Problem 1: Difference between revisions

Revision as of 10:56, 3 August 2025

The following problem is from both the 2025 AMC 10A #1 and 2025 AMC 12A #1, so both problems redirect to this page.

Please do not post false problems.

2025 AMC 10A (Problems • Answer Key • Resources)
Preceded by First Problem	Followed by Problem 2
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25
All AMC 10 Problems and Solutions

2025 AMC 12A (Problems • Answer Key • Resources)
Preceded by First Problem	Followed by Problem 2
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25
All AMC 12 Problems and Solutions

@@ Line 1: / Line 1: @@
 {{duplicate|[[2025 AMC 10A Problems/Problem 1|2025 AMC 10A #1]] and [[2025 AMC 12A Problems/Problem 1|2025 AMC 12A #1]]}}
-==Problem==
+Please do not post false problems.
-Find the smallest positive integer <math>k</math> such that <math>2^{91}+k</math> is divisible by <math>127</math>.
-<math>\textbf{(A)}~122\qquad\textbf{(B)}~123\qquad\textbf{(C)}~124\qquad\textbf{(D)}~125\qquad\textbf{(E)}~126</math>
 ==Solution==