## New answers tagged computational-number-theory

0
votes

### Reliability of ILP approach to number-theoretic optimization

I would suggest using exact ILP solvers to rule out errors that are rooted in limited precision.
QSopt_ex for example works with exact rational numbers.
Another more recent exact solver is SCIP of the ...

1
vote

### Can every integer be written as a sum of squares of primes?

You need at least three large primes to write every large s as the sum of three squares of primes; there are only about $n / \ln n$ primes below n, therefore only about $n^2 / (2 \cdot \ln^2 n)$ pairs ...

Top 50 recent answers are included

#### Related Tags

computational-number-theory × 429nt.number-theory × 311

prime-numbers × 69

computational-complexity × 60

algorithms × 56

analytic-number-theory × 55

algebraic-number-theory × 50

co.combinatorics × 27

reference-request × 24

diophantine-equations × 23

polynomials × 22

modular-forms × 21

elliptic-curves × 19

ag.algebraic-geometry × 16

computer-algebra × 16

factorization × 15

cryptography × 11

na.numerical-analysis × 10

ac.commutative-algebra × 9

lattices × 9

linear-algebra × 8

arithmetic-geometry × 8

finite-fields × 8

computer-science × 8

gr.group-theory × 7