## New answers tagged computational-number-theory

4
votes

### What are the solutions in numbers of $xyz \mid x^n + y^n + z^n$, $x,y,z$ globally coprime

Some solutions for $n=7$:
...

- 23.6k

1
vote

Accepted

### If the coefficient of the polynomial positive

When $m=1$ and $k$ is odd, I compute that $\bar{S}(k) = (3k^5-20k^3+17k)/120$, which has a negative coefficient.

- 45.6k

12
votes

### About the complexity of some operation involving integers

There is a simple algorithm because the minimal path from $A$ to $B$ using these operations must have a very constrained form.
First, an optimal sequence of $x+1$ and $x-1$ operations from $a$ to $b$ ...

- 40.3k

Top 50 recent answers are included

#### Related Tags

computational-number-theory × 384nt.number-theory × 276

prime-numbers × 60

computational-complexity × 54

algorithms × 52

analytic-number-theory × 51

algebraic-number-theory × 47

reference-request × 24

co.combinatorics × 24

polynomials × 21

modular-forms × 19

diophantine-equations × 18

computer-algebra × 16

ag.algebraic-geometry × 14

elliptic-curves × 14

factorization × 13

ac.commutative-algebra × 9

linear-algebra × 8

arithmetic-geometry × 8

na.numerical-analysis × 8

computer-science × 8

cryptography × 8

additive-combinatorics × 7

gr.group-theory × 6

ds.dynamical-systems × 6