Find the sum of the prime factors of 3 1 6 − 6 5 , 5 3 6
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.
Sir, you need to check ONLY THE PRIME NUMBERS below 82.5 that divide 6817 to check whether or not is this prime.
Log in to reply
Come on,man I am not a Sir. Look my age. Ya I missed that actually.Thanks.
I did the same thing, and was lucky enough to see 6817=6800+17=17(400+1)=(17)(401). I was hoping for a more elegant solution haha
what is 2*2 a 100 times
First, we note that 6 5 5 3 6 = 2 1 6 .
Next, we use the identity a 2 − b 2 = ( a + b ) ( a − b ) to factorize the given expression repeatedly:
3 1 6 − 2 1 6 = ( 3 8 + 2 8 ) ( 3 8 − 2 8 ) = ( 3 8 + 2 8 ) ( 3 4 + 2 4 ) ( 3 4 − 2 4 ) = ( 3 8 + 2 8 ) ( 3 4 + 2 4 ) ( 3 2 + 2 2 ) ( 3 2 − 2 2 ) = ( 3 8 + 2 8 ) ( 3 4 + 2 4 ) ( 3 2 + 2 2 ) ( 3 + 2 ) ( 3 − 2 )
3 1 6 − 2 1 6 = 6 8 1 7 × 9 7 × 1 3 × 5 × 1 = 1 7 × 4 0 1 × 9 7 × 1 3 × 5
We note that these factors are all prime and so:
1 7 + 4 0 1 + 9 7 + 1 3 + 5 = 5 3 3
Notice that 6 5 5 3 6 = 2 1 6 . ∴ 3 1 6 − 2 1 6 3 1 6 − 2 1 6 = ( 3 8 ) 2 − ( 2 8 ) 2 3 1 6 − 2 1 6 = ( 3 8 + 2 8 ) ( 3 8 − 2 8 ) Notice that ( 3 8 − 2 8 ) can be further factorized by repeating the process where a 2 − b 2 = ( a + b ) ( a − b ) . Hence, we will eventually obtain:
( 3 1 6 − 2 1 6 ) ≡ ( 3 8 + 2 8 ) ( 3 4 + 2 4 ) ( 3 2 + 2 2 ) ( 3 2 − 2 2 ) 3 1 6 − 2 1 6 = ( 6 8 1 7 ) ( 9 7 ) ( 1 3 ) ( 5 )
Because 6817 is not a prime number, hence we have to prime factorize 6 8 1 7 into 6 8 1 7 = 1 7 × 4 0 1 .
∴ 3 1 6 − 2 1 6 = ( 1 7 ) ( 4 0 1 ) ( 9 7 ) ( 1 3 ) ( 5 )
Thus, the sum of prime factors are 1 7 + 4 0 1 + 9 7 + 1 3 + 5 = 5 3 3 .
(3^16) = 43046721
thus, (3^16) - 65536 = 42981185
leave the rest up to c++ ;-)
(write the include iostream statement here, I can't because the site treats it as a formatting character)
using namespace std;
bool isPrime (const int& number) {
bool property (true);
if (number % 2 == 0) { property = false; }
else {
for (int i = 3; i < number; i += 2) {
if (number % i == 0) {
property = false;
break;
}
}
}
return (property);
}
int main () {
unsigned int axa = 42981185;
for (int i = 2; i < axa; i++) {
if (axa % i == 0 && (isPrime (i)) == true) {
cout << i << ", ";
}
}
cout << endl;
return (0);
}
3^16 - 65,536 = 42981185. The prime factorization of that number is 5 x 13 x 17 x 97 x 401. The sum of these numbers is 533. Therefore, 533 is the sum of the prime factors of 3^16 - 65,536.
First of all, note that 6 5 5 3 6 = 2 1 6 . Therefore, considering that a 2 − b 2 = ( a − b ) ( a + b ) , we get that
3 1 6 − 6 5 5 3 6 = 3 1 6 − 2 1 6 = ( 3 8 + 2 8 ) ( 3 8 − 2 8 ) = ( 3 8 + 2 8 ) ( 3 4 + 2 4 ) ( 3 4 − 2 4 ) = = ( 3 8 + 2 8 ) ( 3 4 + 2 4 ) ( 3 2 + 2 2 ) ( 3 2 − 2 2 ) = ( 3 8 + 2 8 ) ( 3 4 + 2 4 ) ( 3 2 + 2 2 ) ( 3 1 + 2 1 ) ( 3 1 − 2 1 ) .
Let us look at the brackets.
3 8 + 2 8 = 6 8 1 7 = 1 7 ⋅ 4 0 1 , which are both prime. 3 4 + 2 4 = 9 7 , which is a prime. 3 2 + 2 2 =13, which is a prime. 3 + 2 = 5 , which is also a prime.
Thus, the sum we need is 1 7 + 4 0 1 + 9 7 + 1 3 + 5 = 5 3 3
Only use calculator and the web http://www.mathsisfun.com/prime-factorization-tool.php :P
6 5 5 3 6 = 2 5 6 2 ( 3 8 ) 2 − 2 5 6 2 = ( 3 8 − 2 5 6 ) ( 3 8 + 2 5 6 ) = ( ( 3 4 ) 2 − 1 6 2 ) ( 3 8 + 2 5 6 ) = ( 3 4 − 1 6 ) ( 3 4 + 1 6 ) ( 3 8 + 2 5 6 ) = 6 5 ⋅ 9 7 ⋅ 6 8 1 7 = 5 ⋅ 1 3 ⋅ 9 7 ⋅ 1 7 ⋅ 4 0 1 so the sum is equal to 533.
The problem above have solution 5 x 13 x 17 x 97 x 401 . So, 5 + 17 + 13 + 97 + 401 = 533 (ANSWERED)
65,536 = 2^16, therefore the number can be factorised: (a^8+b^8)(a^4+b^4)(a^2+b^2)(a+b)(a-b) = 6817 97 13 5 1 = 17 401 97 13 5 All of these factors are prime numbers, add them: 533
My * sign doesn't appear between numbers, please correct :-(
Log in to reply
Inside \ ( ...... \ ), you have to use "\times" for multiplication. "*" won't work inside the brackets.
Problem Loading...
Note Loading...
Set Loading...
The key thing here is noting that: 6 5 5 3 6 = 2 1 6 .
Hence, we need to find the sum of the prime factors of : 3 1 6 − 2 1 6 .
In fact, the expression is factorisable since,
3 1 6 − 2 1 6 = ( 3 8 + 2 8 ) ( 3 8 − 2 8 )
= ( 3 8 + 2 8 ) ( 3 4 + 2 4 ) ( 3 4 − 2 4 )
= ( 3 8 + 2 8 ) ( 3 4 + 2 4 ) ( 3 2 + 2 2 ) ( 3 2 − 2 2 )
= ( 3 8 + 2 8 ) ( 3 4 + 2 4 ) ( 3 2 + 2 2 ) ( 3 + 2 ) ( 3 − 2 )
= ( 6 8 1 7 ) ( 9 7 ) ( 1 3 ) ( 5 ) ( 1 )
Now, we need to check if 6 8 1 7 is prime or not as that's the only thing to be worried about because all the other are primes.
One can notice that 1 7 ∣ 6 8 1 7 by seeing 6 8 and 1 7 in 6 8 1 7 and hence 6 8 1 7 isn't a prime.
The following part is for those who didn't notice the above thing.
We note, 6 8 1 7 ≈ 8 2 . 5 .
So, we need to check for odd integers(Since 6 8 1 7 is odd) less than 8 2 which may divide 6 8 1 7 .
Our luck is quite good as we don't have to go much far as 1 7 divides 6 8 1 7 and hence 6 8 1 7 is not a prime.
Now, dividing 6 8 1 7 by 1 7 we get 4 0 1 .
We check 4 0 1 in a similar way if it's a prime or not.On checking, we get that it's a prime.
So,
3 1 6 − 6 5 5 3 6 = 3 1 6 − 2 1 6 = ( 6 8 1 7 ) ( 9 7 ) ( 1 3 ) ( 5 ) = ( 4 0 1 ) ( 1 7 ) ( 9 7 ) ( 1 3 ) ( 5 ) .
Hence,our required sum is: 4 0 1 + 1 7 + 9 7 + 1 3 + 5 = 5 3 3 .