A four digit number A B C A fits into the following equations
A B C A + 1 0 ( A A − B C ) = 5 5 5 5
A B C A − A C B A = − 9 0
C = A − B
Let n = A 2 − B 2 + C 2 − A 2
If
f 1 ( x ) = x 3 + 3 x 2 + 3 x − 1 9
and
f 2 ( 3 x − 1 0 ) = 5 4 4 2 x
Find the largest prime divisor of A B C A − ( f 1 ( n ) + f 2 ( n ) )
Details and assumptions
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.
Problem Loading...
Note Loading...
Set Loading...
The first equation can be re-written to be
( 1 0 0 0 A + 1 0 0 B + 1 0 C + A ) + 1 0 ( ( 1 0 A + A ) − ( 1 0 B + C ) ) = 5 5 5 5
1 1 1 1 A = 5 5 5 5
So A = 5
The second equation can also be re-written to become
( 1 0 0 0 A + 1 0 0 B + 1 0 C + A ) − ( 1 0 0 0 A + 1 0 0 C + 1 0 B + A ) = − 9 0
9 0 B − 9 0 C = − 9 0
B − C = − 1
B = C − 1
We already know that C = A − B so we can substitute
B = ( A − B ) − 1
A = 5 so
B = ( 5 − B ) − 1
B = 4 − B
2 B = 4
B = 2
If we substitute the values into the equation for C we get
C = ( 5 ) − ( 2 ) = 3
Now
n = ( 5 ) 2 − ( 2 ) 2 + ( 3 ) 2 − ( 5 ) 2 = 5
Next is the functions
f 1 ( n ) = ( 5 ) 3 + 3 ( 5 ) 2 + 3 ( 5 ) − 1 9 = 1 4
For the second one we know that
n = 3 x − 1 0
So
5 + 1 0 = 3 x
1 5 3 = x = 3 3 7 5
That means that
f 2 ( n ) = 5 4 4 2 ( 3 3 7 5 ) = 2 6 2 5
Now the final part
A B C A − ( f 1 ( n ) + f 2 ( n ) ) = 5 2 3 5 − 2 6 3 9 = 2 5 9 6
The prime divisors of 2 5 9 6 are 2 , 1 1 and 5 9
The largest of those is 5 9 so the answer is 5 9