Difference between revisions of "2017 UNCO Math Contest II Problems/Problem 3"
(→Solution) |
|||
| Line 10: | Line 10: | ||
== Solution == | == Solution == | ||
985,674,321 | 985,674,321 | ||
| − | + | Since we want to maximize the integer, let's first start with <math>987,654,321</math>. Using a [[greedy algorithm]], we can do this series of changes (commas omitted): | |
| + | <cmath>987654321</cmath> <math>9+8</math> is a prime | ||
| + | <cmath>\LaTeX</cmath> | ||
== See also == | == See also == | ||
{{UNCO Math Contest box|year=2017|n=II|num-b=2|num-a=4}} | {{UNCO Math Contest box|year=2017|n=II|num-b=2|num-a=4}} | ||
[[Category:Introductory Number Theory Problems]] | [[Category:Introductory Number Theory Problems]] | ||
Revision as of 20:21, 16 January 2023
Problem
Prime Mates
Find the largest 9 digit integer in which no two digits are the same and the sum of each pair of adjacent digits is prime. That is, the sum of the first two digits is prime, the sum of the second and third digits is prime, the sum of the third and fourth digits is prime, and so on.
Solution
985,674,321
Since we want to maximize the integer, let's first start with 
. Using a greedy algorithm, we can do this series of changes (commas omitted):
![\[987654321\]](http://latex.artofproblemsolving.com/2/1/5/21598aecd6b974ede6d180b7eaaafb6b3a1d1505.png)
is a prime
\[\LaTeX\] (Error compiling LaTeX. Unknown error_msg)
See also
| 2017 UNCO Math Contest II (Problems • Answer Key • Resources) | ||
| Preceded by Problem 2 |
Followed by Problem 4 | |
| 1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 | ||
| All UNCO Math Contest Problems and Solutions | ||
