What is the largest 3 digit divisor of N = 1 0 2 4 3 − 6 3 9 3 − 3 8 5 3 ?
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.
u cud use A^3+B^3+C^3=3ABC because A+B+C=0
Log in to reply
That's what he did.
Log in to reply
he did it indirectly
Log in to reply
@Akash Singh – It's okay. It's up to a person what approach he used ⌣ ¨
Same way...
Log in to reply
Me too same!
Same way !!!
I quite liked this question, because although it can be solved by spamming the large number to get its prime factorisation, which comes out as: 2 1 0 × 3 3 × 5 × 7 × 1 1 × 7 1 , it is not a nice approach. Now, to get prime divisors etc. of an extremely large number, more often than not, we can factorise . Let us recall some useful factorisation regarding cubes , Now, recall that
a 3 + b 3 + c 3 = 3 a 2 b + 3 a 2 c + 3 a b 2 + 3 a c 2 + 3 b 2 c + 3 b c 2 + 6 a b c
= 3 a b c + 3 ( a 2 b + a 2 c + a b 2 + a c 2 + b 2 c + b c 2 )
= 3 a b c + ( a + b + c ) ( a 2 + b 2 + c 2 − a b − a c − b c ) .
Although this factorisation seems pretty convoluted, the main idea is to factorise out 3 a b c then subbing in a , b , c = 1 we can get that ( a + b + c ) is a factor of the really symmetric expression. Next it's just comparing coefficients by trying out ( a + b + c ) ( a b + b c + c a ) and trying to match up the terms.
Now, 1 0 2 4 , 6 3 9 , 2 8 5 must be chosen for some reason. It is quite motivated to consider 6 3 9 + 3 8 5 (hoping that since math is beautiful everything should work out) which voila gives 1 0 2 4 . By the above factorisation, if a + b + c = 0 then a 3 + b 3 + c 3 = 3 a b c . In this case, we get:
N = 1 0 2 4 3 − 6 3 9 3 − 3 8 5 3 = 3 ( 1 0 2 4 ) ( − 6 3 9 ) ( − 3 8 5 ) = 3 × 1 0 2 4 × 6 3 9 × 3 8 5
The beauty of factorisations is that it leaves us with smaller expressions/numbers to work with. By general methods (such as sum of digits, etc.) we can determine the factorisations of 6 3 9 and 3 8 5 as 3 2 × 7 1 respectively 5 × 7 × 1 1 . Obviously, 1 0 2 4 = 2 1 0 . So we are back with the clean factorisation noted at the beginning of the solution.
Now, to find the largest (3 -digit) divisor, consider taking out the largest prime divisor of N and multiplying smaller prime divisors. This guarantees a larger factor than, say, 2 9 = 5 1 2 , because exponents increase faster, in other words, make the number bigger (to an extent > 1 0 0 0 which should be avoided). By simple trial and error, we can get the answer is 7 1 × 7 × 2 = 9 9 4 .
I guess everyone went through trial and error.
And just because math is beautiful doesn't mean that everything will work out. But I love your optimism!
Log in to reply
Haha thanks :) I was quoting Absolutely Lazy Mistake so it was supposed to be a joke :P
Great. Just one thing that you'll be kicking yourself for, in the second to last paragraph you said that the factorizations of 6 3 9 and 3 8 5 were 3 × 7 1 and 3 × 5 × 1 9 , but they are 3 2 × 7 1 and 5 × 7 × 1 1 .
Log in to reply
Oh yeah, facepalm. Haha thanks for pointing this out (:
Log in to reply
Updated. Remember to check that your mathematical statements display correctly.
DANG!!! I tried 990 because of 2 × 3 2 × 5 × 1 1 . So close yet so far. :(
I don't understand the first two expressions, when you write a 3 + b 3 + c 3 = . . . . They're equal to eachother, but not equal to the sum of cubes. Or maybe it's not displayed correctly (I'm guessing that was the problem)...
Log in to reply
Maybe you would like to verify your workings? Because I am positive that it is indeed ( a + b + c ) 3 but with the terms a 3 , b 3 , c 3 isolated.
How clever you subtitute the algebra until you make it simple
Hmmm it's the same approach as mine. A good one
First notice that 1 0 2 4 = 6 3 9 + 3 8 5 . This suggests that we may want to factor the expression using differences and sums of cubes to get a representation of N which is much easier to factor into primes.
For easier manipulation, let a = 1 0 2 4 , b = 6 3 9 , c = 3 8 5 . a = b + c and a − c = b . Then N = a 3 − b 3 − c 3 = a 3 − ( b 3 + c 3 ) = a 3 − ( b + c ) ( b 2 − b c + c 2 ) = a 3 − a ( b 2 − b c + c 2 ) = a ( a 2 − ( b 2 − b c + c 2 ) ) = a ( a 2 − c 2 + b c − b 2 ) = a ( ( a + c ) ( a − c ) + b c − b 2 ) = a b ( a + c + c − b ) = a b ( 3 c ) = 3 ( 1 0 2 4 ) ( 6 3 9 ) ( 3 8 5 ) = 3 ( 2 1 0 ) ( 3 2 ⋅ 7 1 ) ( 5 ⋅ 7 ⋅ 1 1 ) = 2 1 0 ⋅ 3 3 ⋅ 5 ⋅ 7 ⋅ 1 1 ⋅ 7 1 .
Beginning with 9 9 9 and working backwards, we have:
9 9 9 = 3 3 ⋅ 3 7
9 9 8 = 2 ⋅ 4 4 9
9 9 7 = 9 9 7
9 9 6 = 2 2 ⋅ 3 ⋅ 8 3
9 9 5 = 5 ⋅ 1 9 9
9 9 4 = 2 ⋅ 7 ⋅ 7 1 ∣ N
Therefore, 9 9 4 is the largest 3-digit integer that divides N .
While one can calculate and factorized using a computer, the point was to factorize by hand. Several different identities can be used for that purpose, including the simple difference/sum of cubes and cube of the sum formulas. Once the prime factorization of N is established, it is easiest to work backwards, as in this solution.
Log in to reply
I wanted to ask if in any other such question will the largest divisor having certain digits will always be a multiple of the largest prime divisor of that number ? And if so how can we prove that thing ?
a 3 + b 3 + c 3 = ( a + b + c ) ( a 2 + b 2 + c 2 − a b − b c − c a ) + 3 a b c
Now we just substitute a = 1 0 2 4 , b = − 6 3 9 , c = − 3 8 5 , and find that a + b + c quite conveniently reduces to 0, leaving us with 3 × 1 0 2 4 × − 6 3 9 × − 3 8 5
We prime factorize this to get
2 1 0 × 3 3 × 5 × 7 × 1 1 × 7 1
Now we start backwards from 999, which is the largest 3 digit number
9 9 9 = 9 × 3 7 × 3 9 9 8 = 2 × 4 9 9 9 9 7 = ? 9 9 6 = 4 × 3 × 8 3 9 9 5 = 5 × 1 9 9 9 9 4 = 2 × 7 × 7 1
Now since we do have the number to make up 994, our answer is 994
Use the identity: a 3 + b 3 + c 3 − 3 a b c = ( a + b + c ) ( a 2 + b 2 + c 2 − a b − b c − c a ) .
And re-write the given expression for N as: N = ( 1 0 2 4 ) 3 + ( − 6 3 9 ) 3 + ( − 3 8 5 ) 3 .
By considering a = 1 0 2 4 , b = − 6 9 3 , and c = − 3 8 5 , it can easily be seen that a + b + c = 0 , so that N = 3 ⋅ 1 0 2 4 ⋅ ( − 6 3 9 ) ⋅ ( − 3 8 5 ) .
Factorizing the above expression for N gives: N = 2 1 0 × 3 3 × 5 × 7 × 1 1 × 7 1 .
Now, the best way to find the largest 3-digit divisor of N (theoretically) is to find the prime factorization of every number starting from 999 (998, 997, 996, and so on) and compare it with the prime factorization of N . But, it is practically better to do some hit and trial first.
Dividing 9 9 9 by the largest prime factor of N , 7 1 , gives about 1 4 . 0 7 . Which means the largest three digit number which is divisible by 7 1 (and is a divisor of N ) is 7 1 × 1 4 = 9 9 4 .
To make sure there isn't any greater number than 9 9 4 which is a divisor of N , it is a good idea to check with the help of the prime factorization of the last five 3 - digit numbers:
9 9 5 = 5 × 1 9 9
9 9 6 = 2 2 × 3 × 8 3
9 9 7 = 9 9 7 ( 9 9 7 is a prime number)
9 9 8 = 2 × 4 9 9
9 9 9 = 3 3 × 3 7
Comparing these with the prime factorization of N reveals that none of the them are divisors of N , as they have one or the other prime factor uncommon with N .
Which means we can safely say that the largest 3 - digit divisor of N is 9 9 4 .
N = 1 0 2 4 3 − ( 6 3 9 + 3 8 5 ) ( 6 3 9 2 + 3 8 5 2 − 3 8 5 ∗ 6 3 9 )
= 1 0 2 4 ∗ ( 1 0 2 4 2 − 6 3 9 2 + 3 8 5 ∗ 6 3 9 − 3 8 5 2 )
= 1 0 2 4 ∗ ( 3 8 5 ∗ 1 6 6 3 + 3 8 5 ∗ 2 5 4 )
= 1 0 2 4 ∗ 3 8 5 ∗ 1 9 1 7
= 1 0 2 4 ∗ 2 7 ∗ 5 ∗ 7 ∗ 1 1 ∗ 7 1
9 9 4 = 2 ∗ 7 ∗ 7 1 is a divisor of N. Other 3 digit numbers larger than 994 can't be factorized into prime factors of N. Hence, the answer is 994.
We take the given equation and rearrange it to make N = 1 0 2 4 3 − ( 6 3 9 3 + 3 8 5 3 ) Recall that the sum of cubes equation is a 3 + b 3 = ( a + b ) ( a 2 − a b + b 2 ) . We simplify our expression
1 0 2 4 3 − ( 6 3 9 + 3 8 5 ) ( 6 3 9 2 − ( 6 3 9 ∗ 3 8 5 ) + 3 8 5 2 )
1 0 2 4 3 − ( 1 0 2 4 ) ( 3 1 0 5 3 1 )
1 0 2 4 ∗ ( 1 0 2 4 2 − 3 1 0 5 3 1 )
1 0 2 4 ∗ ( 7 3 8 0 4 5 )
The problem asks for a specific divisor, so prime factorization would be useful. Brute force subtraction is not the best path because if would be hard to factorize such a big number. However, with the above method, we have already factored out 2 1 0 . Factoring even more, we get
2 1 0 × 3 3 × 5 × 1 1 × 7 1 . With a few educated guesses, we see that 7 1 × 1 4 = 9 9 4
Using a^3 + b^3 + c^3 = 3abc + (a +b +c)(a^2 + b^2 + c^2 - ab - bc - ca)
as a +b +c = 0 here
a^3 + b^3 + c^3 = 3abc
and 1024^3−639^3−385^3 = 3 x 1024 x 639 x 385
= 3^3 x 2^10 x 71 x 11 x 7 x 5
which can be rearranged to get 71 x 2 x 7 as the largest 3 digit number. Hence ans = 994
First, we try to factor this strange expression. There isn't a neat factorization for a 3 − b 3 − c 3 , so we try something else.
Notice that since 6 3 9 + 3 8 5 = 1 0 2 4 , 6 3 9 3 + 3 8 5 3 = ( 6 3 9 + 3 8 5 ) ( 6 3 9 3 − 6 3 9 ( 3 8 5 ) + 3 8 5 2 ) = 1 0 2 4 ( 6 3 9 2 − 6 3 9 ( 3 8 5 ) + 3 8 5 2 ) Then, N = 1 0 2 4 3 − 6 3 9 3 − 3 8 5 3 = 1 0 2 4 ( 1 0 2 4 2 − ( 6 3 9 2 − 6 3 9 ( 3 8 5 ) + 3 8 5 2 ) ) Also using 6 3 9 + 3 8 5 = 1 0 2 4 , 6 3 9 2 − 6 3 9 ( 3 8 5 ) + 3 8 5 2 = ( 6 3 9 + 3 8 5 ) 2 − 3 ( 6 3 9 ) ( 3 8 5 ) = 1 0 2 4 2 − 3 ( 6 3 9 ) ( 3 8 5 ) and so N = 1 0 2 4 ( 1 0 2 4 2 − ( 1 0 2 4 2 − 3 ( 6 3 9 ) ( 3 8 5 ) ) ) = 1 0 2 4 ( 3 ( 6 3 9 ) ( 3 8 5 ) ) This expression is easy to factor, since we can find 6 3 9 = 3 2 ⋅ 7 1 and 3 8 5 = 5 ⋅ 7 ⋅ 1 1 . Now, N = 2 1 0 ⋅ 3 3 ⋅ 5 ⋅ 7 ⋅ 1 1 By trial and error, we find that 2 ⋅ 7 ⋅ 7 1 = 9 9 4 is the largest 3 digit divisor of N .
Motivation: When I noticed that 6 3 9 + 3 8 5 = 1 0 2 4 , I realized that I could factor sum of cubes, and then simplify the second factor. The rest was trial and error, trying all possible combinations of factors. In hindsight, it makes some sense to try to see that 7 ⋅ 7 1 = 4 9 7 is very close to 500, and multiplying by 2 gives 994.
I was going to post this as a solution but had to go do something, and when I came back, I saw two solutions, so I thought someone had done it the way I did it. Obviously, that assumption was wrong, so here is my solution. This is what I wrote down as notes for a solution, but LaTeX-ed.
A very clean way to approach this is to use the information that 6 3 9 + 3 8 5 = 1 0 2 4 and set 3 8 5 , 6 3 9 , and 1 0 2 4 as a , b , and a + b respectively. The expression becomes the following.
( a + b ) 3 − a 3 − b 3 = a 3 + 3 a 2 b + 3 a b 2 + b 3 − a 3 − b 3 = 3 a 2 b + 3 a b 2 = 3 a b ( a + b ) = 3 × 3 8 5 × 6 3 9 × 1 0 2 4 = 3 × 5 × 7 × 1 1 × 3 2 × 7 1 × 2 1 0 = 2 1 0 × 3 3 × 5 × 7 × 1 1 × 7 1
Noticeably, 7 × 7 1 is very close to 5 0 0 , and multiplying by 2 gives a minimum possible answer of 9 9 4 . Simple checking of 9 9 5 through 9 9 9 shows that none of these are factors, so the answer is 9 9 4
Log in to reply
I'm glad you mentioned "Simple checking of 995 through 999". That is the best way to determine that 994 is indeed the largest 3-digit factor, rather than attempting to find all possible 3-digit factors.
First, I used difference of cubes to factor 1 0 2 4 3 − 6 3 9 3 into ( 1 0 2 4 − 6 3 9 ) ( 1 0 2 4 2 + 1 0 2 4 × 6 3 9 + 6 3 9 2 ) . Now, since 1 0 2 4 − 6 3 9 = 3 8 5 , I can pull out a 385 so I am left with 1 0 2 4 2 + 1 0 2 4 × 6 3 9 + 6 3 9 2 − 3 8 5 2 . To simplify this inner expression, I factor 1 0 2 4 2 − 3 8 5 2 using difference of squares to get 6 3 9 ∗ 1 4 0 9 . Now I can pull out a 639 so the total expression at this point is 3 8 5 × 6 3 9 ( 1 4 0 9 + 1 0 2 4 + 6 3 9 ) . 3 8 5 × 6 3 9 factors into 3 × 3 × 5 × 7 × 1 1 × 7 1 and the inner expression add up to 3 0 7 2 which factors into ( 2 1 0 ) × 3 . To achieve the greatest 3 digit divisor, take 2 × 7 × 7 1 = 9 9 4 .
[Latex Edits - Calvin]
a^3+b^3+c^3=3abc+(a+b+c)(something) as a+b+c is zero a^3+b^3+c^3=3abc if we write the prime factors of these three numbers we shall find that the highest possible 3 digit number is 2 7 71=994
it is 2.7.71 (multiplication)
But Anup, How can we prove that it is the highest?
write all the three digit divisors of N, and you see that it is true! It's the highest because, 995 has 199 which is not in N 996 has 83 997 is a prime 998 has 499 999 has 37 (It's a lame proof I know!)
Factoring the number we get that it is equal to:
(2^10)(3^3)(5)(7)(11)(71)
The largest possible 3-digit number made by these factors is 7x71x2 = 994
CONSIDER a = 639; b =385; a+b= 1024; (a+b)^3-a^3-b^3= 3ab(a+b) = 3 639 385 1024;= (2^10) (3^3) 5 7 11 71 by taking all possible divisors nearer to 1000 we get 71 7 2 =994.
N = 2 1 0 × 3 3 × 5 × 7 × 1 1 × 7 1
So the largest 3 digit divisor is less than 1000.
7 1 × 7 × 2 = 9 9 4
We note that 1 0 2 4 − 6 3 9 = 3 8 5 . Therefore, we have
1 0 2 4 3 − 6 3 9 3 − 3 8 5 3 = 3 8 5 ( 1 0 2 4 2 + 6 3 9 2 + 1 0 2 4 . 6 3 9 ) − 3 8 5 3
= 3 8 5 ( 1 0 2 4 2 − 3 8 5 2 + 6 3 9 2 + 1 0 2 4 . 6 3 9 )
= 3 8 5 . 6 3 9 [ ( 1 0 2 4 + 3 8 5 ) + 6 3 9 + 1 0 2 4 ] = 3 8 5 . 6 3 9 . 3 0 7 2
We use prime factorization to get 3 8 5 . 6 3 9 . 3 0 7 2 = 2 1 0 . 3 3 . 5 . 7 . 1 1 . 7 1 . . Notice that 2 . 7 . 7 1 = 9 9 4 and a quick check shows that no 3-digit number bigger than 994 has divisors as subset of divisors of N. Hence 994 is the answer.
since 1 0 2 4 − 6 3 9 − 3 8 5 = 0 , 1 0 2 4 3 − 6 3 9 3 − 3 8 5 3 = 3 ( 1 0 2 4 ) ( − 6 3 9 ) ( − 3 8 5 ) = 2 1 0 . 3 3 . 5 . 7 . 1 1 . 7 1 . 9 9 4 = 7 1 ( 1 4 ) , and checking the numbers 9 9 5 − 9 9 9 shows that 9 9 4 is the max
( a + b ) 3 − a 3 − b 3 = a 3 + 3 a 2 b + 3 a b 2 + b 3 − a 3 − b 3 = 3 a 2 b + 3 a b 2 = 3 a b ( a + b )
N=1024³-(639³+385³)=1024³-(639+385)×(639²-639×385+385²)= 1024×(1024²-639²+385(639-385))= 1024×(385×1663+385×254)= 1024×385×1917= 2^10×3³×5×7×11×71 So we try 999=3³×37 not 998=2×499,997,996=2²×3×83 ,995=5×199 So 994=71×7×2 is solution
Note that 6 3 9 + 3 8 5 = 1 0 2 4 .
Let 6 3 9 be a and 3 8 5 be b . Then we have: N = ( a + b ) 3 − a 3 − b 3
Expanding ( a + b ) 3 using Binomial Theorem : N = a 3 + 3 a 2 b + 3 a b 2 + b 3 − a 3 − b 3
Cancelling: N = 3 a 2 b + 3 a b 2
Take out common factor: N = 3 a b ( a + b )
Substituting them back: N = 3 × 3 8 5 × 6 3 9 × 1 0 2 4
Note that:
Therefore: N = 3 × 5 × 7 × 1 1 × 3 2 × 7 1 × 2 1 0
Rearranging: N = 2 1 0 × 3 3 × 5 × 7 × 1 1 × 7 1
Let us prime factorize every number from 9 9 9 to see if the prime factors is included in the prime factorization of N .
Therefore, the answer is 9 9 4 .
using computer to solve (javascript):
1 2 3 4 |
|
Let A = 6 3 9 and B = 3 8 5 , now notice that A + B = 1 0 2 4 , thus N = ( a + b ) 3 − a 3 − b 3 N = a 3 + 3 a 2 b + 3 a b 2 + b 3 − a 3 − b 3 N = 3 a b ( a + b ) N = 3 × 6 3 9 × 3 8 5 × 1 0 2 4
By factorising, we have N = 2 1 0 × 3 3 × 5 × 7 × 1 1 × 7 1 Since we have to find the largest 3 digit divisor, let the largest divisor P . We have to find, make sure we have P ∣ N . Since we have prime 2 , 3 , 5 , 7 , 1 1 , 7 1 , by a little trial and error, choose any primes that makes easier to continue. For me, I choose 7 1 as the first prime, we have 7 1 0 0 0 ≤ 1 4 . Now, find another factor greater or less than 14.
Tips: do backwards For another factor 1 4 , we have 1 4 ∣ N
Since G C F ( 1 4 , 7 1 ) = 1 , we conclude that
( 2 × 7 × 7 1 ) ∣ N
9 9 4 ∣ N
Which satisfis the problem
The interesting thing is that 994 and 9940 are both factors of this number.
Getting to N=3 * 1024 * 639 * 385 is easy i guess (lot of solutions explaining it) But getting to 994 must be kind of trial and error as far as i saw in the solutions i reached the solution this way (i found an interval where to do the trial and error) N= 2^10 * 3^3 * 5 * 7 *11 * 71 [ Factorized format]
Largest possible 3 digit no. = 999 [ which is not a divisor; 9 * 3 * 37 ]
9 * 111 = 999 so closest we can get is 9*110 (which is a divisor of N because 9 * 10 * 11)
So the interval is [990,999) is our place where we can find our solution
To check if any number > 990 is a factor
If it is a divisor D then it should be divisible by some of primes in the factored format set S={ 2,3,5,7,11,71 } Other way: all the divisor's prime factors should be present in N
5 cannot be a common factor of N,D because only 995 is possible and also it is not divisible by any other prime factors
995=5 * 199 (199 is a prime)
11 can also not be a common factor of N,D because 990 is a multiple of 11 and the next one will be 1001
3^2 can't be a factor because of the similar reason 990,999 are the factors no other number will have two 3s
Numbers with 3 as factor 993=3*331(a prime),
996 - 2 * 2 * 3 * 83 - X [can see without factorizing it also. only 2s and 3s can be there in the divisors from set S]
So 3 cannot be a factor Only prime factors left are N`=2^8 * 7 * 71 [ 2^10 can't be and 2^9 can't be (for obvious reasons 1024 is too be and 512 cant be multiplied be anything smaller than 2) ] => only 2 possiblities 2^7 * 7=896 and 2 * 7 * 71=994 (Y)
999 - 9 * 3 * 37 -X
998 - 2 * 499(prime) -X
997 - prime - X
996 - 2 * 2 * 3* 83 - X [can see without factorizing it also. only 2s and 3s can be there in the divisors from set S]
995 - (it's not divisible by any prime factor other than 5 from set S)
994 - divisible by 71,2,7
994=2 *7 * 71 [Y Solution]
L e t a = 6 3 9 , b = 3 8 5 , a + b = 1 0 2 4 . 6 3 9 = 3 ∗ 3 ∗ 7 1 = 3 2 ∗ 7 1 , 3 8 5 = 5 ∗ 7 ∗ 1 1 , 1 0 2 4 = 2 1 0 . . . ( w e l l k n o w n . ) ( a + b ) 3 − a 3 − b 3 = 3 a b ( a + b ) = 3 ∗ 3 2 ∗ 7 1 ∗ 5 ∗ 7 ∗ 1 1 ∗ 2 1 0 The two out standing options are 9 9 ∗ 1 0 = 9 9 0 0 r s i n c e 7 ∗ 7 = 4 9 : − 7 1 ∗ 7 ∗ 2 = 9 9 4 . The factors of the devisor must be factors of N 9 9 5 = 5 ∗ 1 9 9 X , 9 9 6 = 4 ∗ 3 ∗ 8 3 X , 9 9 7 : − − 3 / 5 / 7 / 1 1 ∤ 9 9 7 , 7 1 , 9 9 7 = 1 4 . 0 4 , b u t 1 3 ∤ 9 9 7 , X , 9 9 8 = 2 ∗ 4 9 9 : − 3 / 5 / 7 / 1 1 ∤ 4 9 9 , 7 1 4 9 9 = 7 , X , 9 9 9 = 2 7 ∗ 3 7 X ,
Simplified, N = 755,758,080, which has prime factorization of 2 1 0 ⋅ 3 3 ⋅ 5 ⋅ 7 ⋅ 1 1 ⋅ 7 1 . Starting at 999 and working backwards, I looked for the first number which could be made by multiplying a combination of these prime factors. 994 is the first number which meets these conditions as it equals 2 ⋅ 7 ⋅ 7 1
1024×1024×1024-639×639×639-385×385×385=755758080
755758080÷999=756514.59 755758080÷998=757272.63 755758080÷997=758032.18 755758080÷996=758792.25 755758080÷995=759555.86 755758080÷994=760320
So 994 is the answer
calculator-based
Log in to reply
I had posted my solution. It is not there now though it was in the solution box.!!!There is no solution box now. It must have been closed. That is OK. But when I wrote, there was the solution box.
Problem Loading...
Note Loading...
Set Loading...
At first, we notice that 6 3 9 + 3 8 5 = 1 0 2 4 , so
N = 1 0 2 4 3 − 6 3 9 3 − 3 8 5 3 = ( 6 3 9 + 3 8 5 ) 3 − 6 3 9 3 − 3 8 5 3 = 3 . 6 3 9 . 3 8 5 ( 6 3 9 + 3 8 5 ) = 3 . 6 3 9 . 3 8 5 . 1 0 2 4
Now, 1 0 2 4 = 2 1 0 , 6 3 9 = 3 2 . 7 1 , 3 8 5 = 5 . 7 . 1 1 , so N = 2 1 0 . 3 3 . 5 . 7 . 1 1 . 7 1
Now the largest multiple of 7 1 below 1 0 0 0 is 9 9 4 = 2 . 7 . 7 1 , and thus 9 9 4 is a divisor of N . Now if we check the 3 digit numbers greater than 9 9 4 , i.e. 9 9 5 − 9 9 9 , then we are done.
9 9 5 = 5 . 1 9 9
9 9 6 = 2 2 . 3 . 8 3
9 9 7 is a prime.
9 9 8 = 2 . 4 9 9
9 9 9 = 3 3 . 3 7
and thus none of them is a divisor of N , and thus the answer is 9 9 4 .