## New answers tagged diophantine-equations

1
vote

### Only trivial solution to a pair of constrained linear diophantine equations

The answer to the first question is negative.
Let $A$ denote the set of weights $\{a_i\}$. Strengthen the first constraint to $0 \le x_i \le 2$.
If we have two different subsets $S_1, S_2 \subset A$ ...

3
votes

### $x^3+x^2y^2+y^3=7$, and solvable families of Diophantine equations

Let me post an elementary answer to this question, which I have found recently.
(a) Assume that $(x,y)$ is an integer solution. From symmetry, we may assume that $|y|\geq |x|$. If fact, cases $|y|=|x|$...

2
votes

### Rational solutions to $P(x,y)=0$ for $P$ reducible over ${\mathbb C}$

This also follows from Prop. 2.3.26(i) in Bjorn Poonen's Rational Points on Varieties, where it is stated that if for a finite type $k$-scheme $X$ the set of rational points $X(k)$ is Zariski dense, ...

4
votes

Accepted

### Rational solutions to $P(x,y)=0$ for $P$ reducible over ${\mathbb C}$

The main idea of the proof already appears in what you've written, but here are some more details.
Factor $P(x,y) = Q_1(x,y) \cdots Q_n(x,y)$ into irreducibles, where the factorization takes place ...

Top 50 recent answers are included

#### Related Tags

diophantine-equations × 780nt.number-theory × 651

ag.algebraic-geometry × 64

elliptic-curves × 64

reference-request × 52

analytic-number-theory × 37

algebraic-number-theory × 37

prime-numbers × 37

arithmetic-geometry × 37

polynomials × 31

co.combinatorics × 27

quadratic-forms × 24

rational-points × 20

diophantine-approximation × 19

computational-number-theory × 18

diophantine-geometry × 16

computability-theory × 14

integer-programming × 14

decidability × 14

lattices × 13

divisors-multiples × 12

linear-algebra × 11

lo.logic × 11

algorithms × 11

elementary-proofs × 11