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 | 3880 |
2 | jiangly | 3669 |
3 | ecnerwala | 3654 |
4 | Benq | 3627 |
5 | orzdevinwang | 3612 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | jqdai0815 | 3532 |
9 | Radewoosh | 3522 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | adamant | 156 |
4 | maroonrk | 153 |
5 | -is-this-fft- | 148 |
5 | atcoder_official | 148 |
5 | SecondThread | 148 |
8 | Petr | 147 |
9 | nor | 144 |
9 | TheScrasse | 144 |
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.