2021 CIME I Problems/Problem 3

Revision as of 15:26, 16 January 2021 by Sugar rush (talk | contribs) (Created page with "==Problem== For any positive integer <math>n</math>, let <math>r(n)</math> denote the result when the digits of <math>n</math> are reversed. It is given that there exists a un...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

For any positive integer $n$, let $r(n)$ denote the result when the digits of $n$ are reversed. It is given that there exists a unique set of $3$-digit positive integers $\{p, r(p)\}\neq\{273, 372\}$ for which $p\cdot r(p)=273\cdot 372.$ Find $p+r(p).$

Video Solution by Punxsutawney Phil

https://youtu.be/Du2A7HbNxoM

See also

2021 CIME I (ProblemsAnswer KeyResources)
Preceded by
Problem 2
Followed by
Problem 4
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
All CIME Problems and Solutions

The problems on this page are copyrighted by the MAC's Christmas Mathematics Competitions. AMC logo.png

Invalid username
Login to AoPS