Everything Unique I I II

Logic Level 4

A B C D × E F G H I \begin{array}{ccccccc} & & & A & B & C & D\\ & \times && & & & E\\ \hline & & & F & G & H & I \end{array}

If all digits above consist of distinct positive single-digit integers, what is the value of E E ?

Inspiration: (1) , (2)

2 3 4 6 7 8 9 No or more than one possible value exist.

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

Chris Lewis
Jan 26, 2021

Obviously coding is the simplest way to go here, but it's just about possible manually.

Some initial observations:

1) A B C D \overline{ABCD} is at least 1234 1234

2) F G H I \overline{FGHI} is at most 9876 9876

3) E E can't be 1 1 (because then A B C D \overline{ABCD} would equal F G H I \overline{FGHI} ) and E E can't be 9 9 (because 9 × 1234 9 \times 1234 is too big)

4) D D can't be 5 5 , because that would force I I to be 0 0 or 5 5 , neither of which is allowed

Now consider the problem modulo 9 9 . If A + B + C + D k A+B+C+D \equiv k , then F + G + H + I k E F+G+H+I \equiv kE . But the total of all the digits in the sum is 45 45 ; ie A + B + C + D + E + F + G + H + I 0 ( m o d 9 ) A+B+C+D+E+F+G+H+I \equiv 0 \pmod9 so k + E + k E 0 ( m o d 9 ) ( k + 1 ) ( E + 1 ) 1 ( m o d 9 ) \begin{aligned} k+E+kE &\equiv 0\pmod9 \\ (k+1)(E+1) &\equiv 1 \pmod9 \end{aligned}

Remembering 1 < E < 9 1<E<9 , this has solutions

E E k k
3 3 6 6
4 4 1 1
6 6 3 3
7 7 7 7

Case E = 7 E=7 : A + B + C + D 7 ( m o d 9 ) A+B+C+D \equiv 7 \pmod9 . Since A , B , C , D A,B,C,D are distinct, the total can't be 7 7 . Since E = 7 E=7 , A B C D \overline{ABCD} is at most 1428 1428 ; so A = 1 A=1 and B 4 B \le 4 . Hence the total A + B + C + D A+B+C+D is less than 25 25 ; so A + B + C + D = 16 A+B+C+D=16 .

Remembering D 5 D \neq 5 , the only possible A B C D \overline{ABCD} values this leaves are { 1249 , 1258 , 1294 , 1348 , 1384 \{1249,1258,1294,1348,1384 and it's easy to check that none of these work.


Case E = 6 E=6 : In this case, D D cannot be even, as if it were then we would have I = D I=D . A + B + C + D 3 ( m o d 9 ) A+B+C+D \equiv 3 \pmod9 , and by its size, A B C D 1659 \overline{ABCD} \le 1659 . But B B can't be 6 6 , so again we have A = 1 A=1 and this time B 5 B\le 5 .

The possible totals of A + B + C + D A+B+C+D are then 12 12 and 21 21 . The possible values of A B C D \overline{ABCD} this time are 1389 , 1479 , 1497 , 1587 1389,1479,1497,1587 ; again it's easy enough to check that these don't work.


Case E = 3 E=3 : Now by its size, A B C D 3298 \overline{ABCD} \le 3298 , but of course we can't have A = 3 A=3 . However, even with these restrictions, there are 16 16 possibilities to check, which is a bit onerous. It turns out none of them work but it would be better to reduce these more - any ideas?


Case E = 4 E=4 : Finally, applying the same ideas, we find two solutions: namely 1738 × 4 = 6952 1738 \times 4=6952 and 1963 × 4 = 7852 1963 \times 4=7852

so E = 4 E=\boxed4 .

Is there a better way? How else can we reduce the number of possibilities to check?

Chris Lewis - 4 months, 2 weeks ago

Log in to reply

It's not by much, but you could try the checking from FGHI instead of ABCD (just for E = 3?) to cut on some of the trials & errors.

Saya Suka - 4 months, 2 weeks ago

Log in to reply

I think that removes three options from the E = 3 E=3 case (the way I was listing them, anyway) because we can't have F = 3 F=3 . I wonder if there's a fundamentally different idea, though; perhaps looking at a different divisor for the mod \text{mod} ?

Chris Lewis - 4 months, 2 weeks ago

I just used code to solve this; see my explanation.

Anonymous1 Assassin - 4 months, 1 week ago
1
2
3
4
5
from itertools import permutations

for a,b,c,d,e,f,g,h,i in permutations('123456789',9):
  if int(a+b+c+d)*int(e)==int(f+g+h+i):
    print(e)

1
2
3
Solutions:
4
4

We can also see from this that we have two solutions to this problem.

Anonymous1 Assassin - 4 months, 1 week ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...