Is it possible to do prime factorization for (A + B) before doing the summation? I mean lets suppose that we want to prime factorize A^n + B^n and 1 <= A, B, N <= 1e12 .... how can i do so? or it's impossible and it's a stupid question?..
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3831 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | ksun48 | 3373 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
Is it possible to do prime factorization for (A + B) before doing the summation? I mean lets suppose that we want to prime factorize A^n + B^n and 1 <= A, B, N <= 1e12 .... how can i do so? or it's impossible and it's a stupid question?..
Name |
---|
The following is a related question: If $$$A$$$ and $$$B$$$ are two positive co-prime integers, i.e. $$$\gcd(A,B) = 1$$$, does their sum $$$(A+B)$$$ have any prime factor that appears in $$$A$$$ or $$$B$$$?
Another related question: Is it possible to express a prime number $$$p$$$ as $$$p = A+B$$$, where $$$A$$$ and $$$B$$$ are positive integers that are NOT co-prime?
The answer is negative for both questions:
$$$A+B$$$ can't have any prime factors in common with $$$A$$$ or $$$B$$$. Because by the Euclidian Algorithm, $$$gcd(A, A+B) = gcd(A, B) = 1 = gcd(A+B, B)$$$.
For the second one, if $$$g = gcd(A, B) > 1$$$, $$$A = gA'$$$and $$$B = gB'$$$. So $$$p = g(A'+B')$$$, where $$$g > 1$$$ and $$$A'+B' > 1$$$. This contradicts the assumption of $$$p$$$ being prime.