Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "2020 AIME II Problems/Problem 5"

(→‎Video Solution 2)
(→‎Solution 1)
 
(5 intermediate revisions by 2 users not shown)
Line 2: Line 2:
 
For each positive integer <math>n</math>, let <math>f(n)</math> be the sum of the digits in the base-four representation of <math>n</math> and let <math>g(n)</math> be the sum of the digits in the base-eight representation of <math>f(n)</math>. For example, <math>f(2020) = f(133210_{\text{4}}) = 10 = 12_{\text{8}}</math>, and <math>g(2020) = \text{the digit sum of }12_{\text{8}} = 3</math>. Let <math>N</math> be the least value of <math>n</math> such that the base-sixteen representation of <math>g(n)</math> cannot be expressed using only the digits <math>0</math> through <math>9</math>. Find the remainder when <math>N</math> is divided by <math>1000</math>.
 
For each positive integer <math>n</math>, let <math>f(n)</math> be the sum of the digits in the base-four representation of <math>n</math> and let <math>g(n)</math> be the sum of the digits in the base-eight representation of <math>f(n)</math>. For example, <math>f(2020) = f(133210_{\text{4}}) = 10 = 12_{\text{8}}</math>, and <math>g(2020) = \text{the digit sum of }12_{\text{8}} = 3</math>. Let <math>N</math> be the least value of <math>n</math> such that the base-sixteen representation of <math>g(n)</math> cannot be expressed using only the digits <math>0</math> through <math>9</math>. Find the remainder when <math>N</math> is divided by <math>1000</math>.
  
−
==Solution==
+
==Solution 1==
−
Let's work backwards. The minimum base-sixteen representation of <math>g(n)</math> that cannot be expressed using only the digits <math>0</math> through <math>9</math> is <math>A_{16}</math>, which is equal to <math>10</math> in base 10.  Thus, the sum of the digits of the base-eight representation of the sum of the digits of <math>f(n)</math> is <math>10</math>.  The minimum value for which this is achieved is <math>37_8</math>.  We have that <math>37_8 = 31</math>.  Thus, the sum of the digits of the base-four representation of <math>n</math> is <math>31</math>.  The minimum value for which this is achieved is <math>13,333,333,333_4</math>.  We just need this value in base 10 modulo 1000.  We get <math>13,333,333,333_4 = 3(1 + 4 + 4^2 + \dots + 4^8 + 4^9) + 4^{10} = 3\left(\dfrac{4^{10} - 1}{3}\right) + 4^{10} = 2*4^{10} - 1</math>.  Taking this value modulo <math>1000</math>, we get the final answer of <math>\boxed{151}</math>.  (If you are having trouble with this step, note that <math>2^{10} = 1024 \equiv 24 \pmod{1000}</math>) ~ TopNotchMath
+
Let's work backwards. The minimum base-sixteen representation of <math>g(n)</math> that cannot be expressed using only the digits <math>0</math> through <math>9</math> is <math>A_{16}</math>, which is equal to <math>10</math> in base 10.  Thus, the sum of the digits of the base-eight representation of the sum of the digits of <math>f(n)</math> is <math>10</math>.  The minimum value for which this is achieved is <math>37_8</math>.  We have that <math>37_8 = 31</math>.  Thus, the sum of the digits of the base-four representation of <math>n</math> is <math>31</math>.  The minimum value for which this is achieved is <math>13,333,333,333_4</math>.  We just need this value in base 10 modulo 1000.  We get <math>13,333,333,333_4 = 3(1 + 4 + 4^2 + \dots + 4^8 + 4^9) + 4^{10} = 3\left(\dfrac{4^{10} - 1}{3}\right) + 4^{10} = 2*4^{10} - 1</math>.  Taking this value modulo <math>1000</math>, we get the final answer of <math>\boxed{151}</math>.  (If you are having trouble with this step, note that <math>2^{10} = 1024 \equiv 24 \pmod{1000}</math>) ~ TopNotchMath
  
 
==Solution 2 (Official MAA)==
 
==Solution 2 (Official MAA)==
Line 10: Line 10:
 
<cmath>\equiv 2\cdot24^2 - 1 \equiv 151 \pmod{1000}.</cmath>
 
<cmath>\equiv 2\cdot24^2 - 1 \equiv 151 \pmod{1000}.</cmath>
  
−
==Video Solution==
+
==Video Solutions==
−
https://youtu.be/lTyiRQTtIZI ~CNCM
+
https://youtu.be/lTyiRQTtIZI
  
−
==Video Solution 2==
 
 
https://youtu.be/ZWe_99091e4
 
https://youtu.be/ZWe_99091e4
  
−
~IceMatrix
+
== Video Solution by OmegaLearn ==
−
 
 
−
== Video Solution 3 ==
 
 
https://youtu.be/ZhAZ1oPe5Ds?t=5032
 
https://youtu.be/ZhAZ1oPe5Ds?t=5032
  

Latest revision as of 21:01, 23 March 2023

Problem

For each positive integer $n$, let $f(n)$ be the sum of the digits in the base-four representation of $n$ and let $g(n)$ be the sum of the digits in the base-eight representation of $f(n)$. For example, $f(2020) = f(133210_{\text{4}}) = 10 = 12_{\text{8}}$, and $g(2020) = \text{the digit sum of }12_{\text{8}} = 3$. Let $N$ be the least value of $n$ such that the base-sixteen representation of $g(n)$ cannot be expressed using only the digits $0$ through $9$. Find the remainder when $N$ is divided by $1000$.

Solution 1

Let's work backwards. The minimum base-sixteen representation of $g(n)$ that cannot be expressed using only the digits $0$ through $9$ is $A_{16}$, which is equal to $10$ in base 10. Thus, the sum of the digits of the base-eight representation of the sum of the digits of $f(n)$ is $10$. The minimum value for which this is achieved is $37_8$. We have that $37_8 = 31$. Thus, the sum of the digits of the base-four representation of $n$ is $31$. The minimum value for which this is achieved is $13,333,333,333_4$. We just need this value in base 10 modulo 1000. We get $13,333,333,333_4 = 3(1 + 4 + 4^2 + \dots + 4^8 + 4^9) + 4^{10} = 3\left(\dfrac{4^{10} - 1}{3}\right) + 4^{10} = 2*4^{10} - 1$. Taking this value modulo $1000$, we get the final answer of $\boxed{151}$. (If you are having trouble with this step, note that $2^{10} = 1024 \equiv 24 \pmod{1000}$) ~ TopNotchMath

Solution 2 (Official MAA)

First note that if $h_b(s)$ is the least positive integer whose digit sum, in some fixed base $b$, is $s$, then $h_b$ is a strictly increasing function. This together with the fact that $g(N) \ge 10$ shows that $f(N)$ is the least positive integer whose base-eight digit sum is 10. Thus $f(N) = 37_\text{eight} = 31$, and $N$ is the least positive integer whose base-four digit sum is $31.$ Therefore \[N = 13333333333_\text{four} = 2\cdot4^{10} - 1 = 2\cdot1024^2 - 1\] \[\equiv 2\cdot24^2 - 1 \equiv 151 \pmod{1000}.\]

Video Solutions

https://youtu.be/lTyiRQTtIZI

https://youtu.be/ZWe_99091e4

Video Solution by OmegaLearn

https://youtu.be/ZhAZ1oPe5Ds?t=5032

~ pi_is_3.14

See Also

2020 AIME II (Problems • Answer Key • Resources)
Preceded by
Problem 4 		Followed by
Problem 6
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15
All AIME Problems and Solutions

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. AMC logo.png

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2020_AIME_II_Problems/Problem_5&oldid=191234"