Prepostorous Primes

Let n = a b c n=\overline{abc} be a 3-digit number such that all of the following 7 numbers are prime:

a b c \overline{abc} a b \overline{ab} a c \overline{ac} b c \overline{bc} b a \overline{ba} c a \overline{ca} c b \overline{cb}

Find the sum of all possible values of n n .

Details and Assumptions \text{Details and Assumptions}

x y z \overline{xyz} means the three-digit number with x x in the hundreds placem y y in the tens place, and z z in the ones place, where x , y , z x,y,z are digits.


The answer is 1182.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

2 solutions

Ivan Koswara
May 10, 2014

Note that two-digit primes can only end with 1 , 3 , 7 , 9 1,3,7,9 . Since all a , b , c a,b,c are last digits (with a b , b c , c a \overline{ab}, \overline{bc}, \overline{ca} for example), they must all be 1 , 3 , 7 , 9 1,3,7,9 .

The digits cannot be all among 1 1 and 7 7 , as then a b c = 100 a + 10 b + c a + b + c 1 + 1 + 1 0 ( m o d 3 ) \overline{abc} = 100a + 10b + c \equiv a+b+c \equiv 1+1+1 \equiv 0 \pmod{3} , and so a b c \overline{abc} is divisible by 3 3 , impossible. Also, we cannot have two digits divisible by 3 3 . Suppose otherwise, that a , b a,b are divisible by 3 3 , then a b \overline{ab} is divisible by 3 3 by a similar argument as above. So we need at least one digit divisible by 3 3 (otherwise all digits are among 1 , 7 1,7 , impossible), but no more than one digit (otherwise we have at least two digits divisible by 3 3 , impossible).

Now, ignore the condition that a b c \overline{abc} is prime; after we get all possible candidates for a b c \overline{abc} , only then we check whether each is prime.

Suppose that some of the digits is 9 9 ; WLOG a = 9 a = 9 . The only two-digit prime beginning with 9 9 is 97 97 . Since a b , a c \overline{ab}, \overline{ac} are both primes, we need b = c = 7 b = c = 7 . But then b c = 77 \overline{bc} = 77 is not prime. So none of the digits is 9 9 . Thus the digit divisible by 3 3 must be a 3 3 .

Among the two remaining digits, we cannot have both 7 7 s, as that means we have a 77 77 which is not prime. However, we can check that 113 113 and 173 173 , together with permutations, satisfy the conditions that all 6 two-digit primes among them are primes. Thus we only need to check whether nine numbers are prime. Of course, this is a job for computer, because I don't feel like doing this boring task.

113 prime
131 prime
311 prime
137 prime
173 prime
317 prime
371 not prime ( 7 × 53 7 \times 53 )
713 not prime ( 23 × 31 23 \times 31 )
731 not prime ( 17 × 43 17 \times 43 )

Thus the sum is 113 + 131 + 311 + 137 + 173 + 317 = 1182 113 + 131 + 311 + 137 + 173 + 317 = \boxed{1182} .

Solved the same way!!!!!! :D

Krishna Ar - 7 years ago
Figel Ilham
Jul 25, 2014

My solution is logic and table of prime number 2, 4, 5, 6 and 8 are exactly impossible!

so, only 1, 3, 7, 9

WE know that 9 is also impossible because, from all the other numbers that combine with 9, if we just take 2 of the digits abc, it must be not prime. Whether I take 9 and 7, both of them when bonds are prime, any numbers will make them not prime when we bond 2 of three numbers. so, the possible answer is digit 1, 3 and 7

The numbers fulfil (after I filter) are 113 131 137 173 311 317

Add them, got 1182

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...