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 "1982 AHSME Problems/Problem 26"

m (→‎A Solution)
(→‎A Solution)
Line 14: Line 14:
 
Notice that <math>r^2\equiv 1,4,9,0 \pmod{16}</math>.
 
Notice that <math>r^2\equiv 1,4,9,0 \pmod{16}</math>.
  
−
Now <math>ab3c</math> in base 8 is <math>a8^3+b8^2+3(8)+c\equiv 8+c\pmod{16}</math>. It being a perfect square means <math>8+c\equiv 1,4,9,0 \pmod{16}</math>. That means that c can only be 1, 4, or 9, so the answer is 3 = <math>\boxed{\textbf{(C)}.}</math>.
+
Now <math>ab3c</math> in base 8 is <math>a8^3+b8^2+3(8)+c\equiv 8+c\pmod{16}</math>. It being a perfect square means <math>8+c\equiv 1,4,9,0 \pmod{16}</math>. That means that c can only be 1 so the answer is 1 = <math>\boxed{\textbf{(C)}.}</math>.
  
 
== Partial and Wrong Solution ==
 
== Partial and Wrong Solution ==

Revision as of 13:10, 26 January 2019

Problem 26

If the base $8$ representation of a perfect square is $ab3c$, where $a\ne 0$, then $c$ equals

$\text{(A)} 0\qquad \text{(B)}1 \qquad \text{(C)} 3\qquad \text{(D)} 4\qquad \text{(E)} \text{not uniquely determined}$

A Solution

A perfect square will be $(8k+r)^2=64k^2+16kr+r^2\equiv r^2\pmod{16}$ where $r=0,1,...,7$.

Notice that $r^2\equiv 1,4,9,0 \pmod{16}$.

Now $ab3c$ in base 8 is $a8^3+b8^2+3(8)+c\equiv 8+c\pmod{16}$. It being a perfect square means $8+c\equiv 1,4,9,0 \pmod{16}$. That means that c can only be 1 so the answer is 1 = $\boxed{\textbf{(C)}.}$.

Partial and Wrong Solution

From the definition of bases we have $k^2=512a+64b+24+c$, and $k^2\equiv 24+c \pmod{64}$

If $k=8j$, then $(8j)^2\equiv64j^2\equiv0 \pmod{64}$, which makes $c\equiv -24\pmod{64}$

If $k=8j+1$, then $(8j+1)\equiv 64j^2+16j+1\equiv 16j+1\equiv 24+c \implies 16j\equiv 23+c$, which clearly can only have the solution $c\equiv 7 \pmod{64}$, for $j\equiv 1$. This makes $k=9$, which doesn't have 4 digits in base 8

If $k=8j+2$, then $(8j+1)\equiv 64j^2+32j+4\equiv 32j+4\equiv 24+c \implies 32j\equiv 20+c$, which clearly can only have the solution $c\equiv 12 \pmod{64}$, for $j\equiv 1$. $c$ is greater than $9$, and thus, this solution is invalid.

If $k=8j+3$, then $(8j+3)\equiv 64j^2+48j+9\equiv 48j+9\equiv 24+c \implies 48j\equiv 15+c$, which clearly has no solutions for $0\leq c<10$.

Similarly, $k=8j+4$ yields no solutions

If $k=8j+5$, then $(8j+5)\equiv 64j^2+80j-1\equiv 16j-1\equiv 24+c \implies 16j\equiv 25+c$, which clearly can only have the solution $c\equiv 9 \pmod{64}$, for $j\equiv 1$. This makes $k=13$, which doesn't have 4 digits in base 8.

If $k=8j+6$, then $(8j+6)\equiv 64j^2+96j+1\equiv 32j+36\equiv 24+c \implies 16j\equiv 23+c$, which clearly can only have the solution $c\equiv 7 \pmod{64}$, for $j\equiv 1$. This makes $k=9$, which doesn't have 4 digits in base 8

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=1982_AHSME_Problems/Problem_26&oldid=100864"