The diophantine-equations tag has no wiki summary.

**5**

votes

**2**answers

839 views

### Are there consecutive integers of the form $a^2b^3$ where $a$, $b$ > 1?

Let $S$ = { $a^2b^3$ : $a, b \in \mathbb{Z}_{>1}$ }.
Does there exist $n$ such that $n$, $n+1 \in S$?
Motivation: I was thinking about Question on consecutive integers with similar prime ...

**2**

votes

**3**answers

439 views

### Hexagonal Triangular Squares

Is there a hexagonal, triangular, square (apart from 0 and 1)?
In other words, is there a positive integer that is simultaneously
(1) a perfect square, $n^2$, $n \ge 2$,
(2) a triangular number, ...

**3**

votes

**3**answers

611 views

### Integer polynomials taking square values

Is there a way to determine a formula giving all integer values of $x$ for which the value of a polynomial $P(x)$ with integer coefficients is a square?
That is, is there a closed formula for:
$X = ...

**1**

vote

**0**answers

167 views

### Checking local solubility of varieties at “bad” primes

Let $X$ be smooth variety defined over $\mathbb{Q}$. If we want to check that $X$ is locally soluble at a prime $p$, then it suffices to find a non-singular $\mathbb{F}_p$ point, which can be lifted ...

**7**

votes

**1**answer

924 views

### Integer values of a rational function

Suppose we are given a rational function with numerator and denominator being polynomials with integer coefficients. Is there an efficient algorithm for finding all integers arguments at which the ...

**20**

votes

**3**answers

1k views

### Proving non-existence of solutions to $3^n-2^m=t$ without using congruences

I made a passing comment under Max Alekseyev's cute answer to this question and Pete Clark suggested I raise it explicitly as a different question. I cannot give any motivation for it however---it was ...

**6**

votes

**2**answers

982 views

### $3^n - 2^m = \pm 41$ is not possible. How to prove it?

$3^n - 2^m = \pm 41$ is not possible for integers $n$ and $m$. How to prove it?

**6**

votes

**3**answers

752 views

### Is there a solution for the equation x^m-y^n=k in which k > 1?

The Catalan conjecture state that $x^m-y^n=1$ has only the solution $x=3, m=2, y=2, n=3$. This conjecture was proved by Preda Mihailescu in 2004, but I want to know about the equation mentioned above. ...

**4**

votes

**1**answer

960 views

### Solving a Diophantine equation related to Algebraic Geometry, Steiner systems and $q$-binomials?

The short version of my question is:
1)For which positive integers $k, n$ is there a solution to the equation $$k(6k+1)=1+q+q^2+\cdots+q^n$$ with $q$ a prime power?
2) For which positive ...

**9**

votes

**3**answers

5k views

### Status of Beal, Granville, Tijdeman-Zagier Conjecture [closed]

The Beal, Granville, Tijdeman-Zagier Conjecture, i.e.
If $A^x+B^y=C^z$ , where $A, B, C, x, y,z$ are positive integers and $x,
y$ and $z$ are all greater than $2$, then $A, B$ and $C$ must have a ...

**10**

votes

**3**answers

995 views

### Diophantine equation: Egyptian fraction representations of 1

According to the OEIS (A002966) there are 294314 solutions in positive integers to the equation
$$\sum_{i=1}^7\frac{1}{x_i}=1$$ assuming $x_1\leq x_2\leq\cdots\leq x_7$.
Similarly for 8 summands there ...

**4**

votes

**3**answers

2k views

### Non-negative integer solutions of a single Linear Diophantine Equation

Consider the following linear Diophantine Equation::
ax + by + cz = d ------------ (1)
for all, a,b,c and d positive integers, and relatively prime, and ...

**4**

votes

**2**answers

2k views

### Quadratic Diophantine equations solver

Is there software that helps list small solutions of the Diophantine equation
$$
x_0^2=1+x_1^2+x_2^2+\cdots+ x_n^2
$$
where "small" is negotiable, but e.g. we could fix $x_0$ and and ask for the list ...

**28**

votes

**3**answers

1k views

### A binomial generalization of the FLT: Bombieri's Napkin Problem

This is an extract from ApĂ©ry's biography
(which some of the people have already enjoyed in
this answer).
During a mathematician's dinner in
Kingston, Canada, in 1979, the
conversation turned ...

**20**

votes

**1**answer

2k views

### Polynomials with rational coefficients

Long time ago there was a question
on whether a polynomial bijection $\mathbb Q^2\to\mathbb Q$ exists. Only one attempt
of answering it has been given, highly downvoted by the way. But this answer ...

**12**

votes

**2**answers

1k views

### Transforming a Diophantine equation to an elliptic curve

I heard that the following problem lead to determine the rational points of an elliptic curve:
For which integers $n$ there are integers $x,y,z$ such that $x/y+y/z+z/x=n$. Could anyone show me why ...

**7**

votes

**3**answers

719 views

### Is there a solution to the a+b^m=b+c^n=c+a^l for l,m,n >1 and a, b, c distinct odd primes?

Is there a solution to:
$a+b^m=b+c^n=c+a^l$ for l,m,n >1 and a, b, c distinct odd primes?
I've had a play around with specific possible solutions and there are lots of possibilities that may be ...

**3**

votes

**2**answers

1k views

### 4900, a particularly square number

I read in "Letters to a young mathematician" that 4900 is the only square integer that is the sum of consecutive squares (I believe he meant by that "starting from 1", but maybe that's not even ...

**1**

vote

**2**answers

511 views

### Diophantine equation problem

How many positive integer solutions does the equation x^2+y^2+z^2-xz-yz = 1 have? My guess is (1,0,1), (0,1,1) and (1,1,1). What is proof of that fact that there are none other?

**1**

vote

**3**answers

2k views

### Integer points of an elliptic curve

I would like to find those integers $x,y$ that satisfies $y^2=x^3+1$. Is there some elementary way to find those?

**3**

votes

**0**answers

350 views

### Asymptotics related to the Erdos--Moser diophantine equation

I share the authorship of this question with Pieter Moree.
In our recent joint work with Y. Gallot (arXiv:0907.1356 [math.NT]) we attack
the Erdős--Moser diophantine equation
$$
...

**0**

votes

**0**answers

270 views

### When is $Pn^2-2an+\frac{a^2-k}{P}$ , with $P$ Prime, $k=a^2 mod P$, a square?

It is easy to show that the following problems are equivalent.
a. When is $Pn^2-2an+\frac{a^2-k}{P}$ , with $P$ Prime, $k=a^2 mod P$, and $n$ any integer, a square?
and
b. When is $X^2-PY^2=k$ ...