Difference between revisions of "2023 AIME II Problems/Problem 15"
(→Solution) |
Jchaoisaac (talk | contribs) (add problem statement) |
||
Line 1: | Line 1: | ||
+ | For each positive integer <math>n</math> let <math>a_n</math> be the least positive integer multiple of <math>23</math> such that <math>a_n \equiv 1 \pmod{2^n}.</math> Find the number of positive integers <math>n</math> less than or equal to <math>1000</math> that satisfy <math>a_n = a_{n+1}.</math> | ||
+ | |||
==Solution== | ==Solution== | ||
Revision as of 17:30, 16 February 2023
For each positive integer let
be the least positive integer multiple of
such that
Find the number of positive integers
less than or equal to
that satisfy
Solution
Denote .
Thus, for each
, we need to find smallest positive integer
, such that
Thus, we need to find smallest , such that
Now, we find the smallest , such that
.
We must have
. That is,
.
We find
.
Therefore, for each , we need to find smallest
, such that
We have the following results:
\begin{enumerate}
\item If , then
and
.
\item If
, then
and
.
\item If
, then
and
.
\item If
, then
and
.
\item If
, then
and
.
\item If
, then
and
.
\item If
, then
and
.
\item If
, then
and
.
\item If
, then
and
.
\item If
, then
and
.
\item If
, then
and
.
\end{enumerate}
Therefore, in each cycle, , we have
,
,
,
, such that
. That is,
.
At the boundary of two consecutive cycles,
.
We have .
Therefore, the number of feasible
is
.
~Steven Chen (Professor Chen Education Palace, www.professorchenedu.com)