The tag has no wiki summary.

learn more… | top users | synonyms

0
votes
0answers
50 views

2x3 = 5+1 AND 2+3 = 5x1. How many other examples of this type? [migrated]

I noticed the following: 2x3 = 5+1. If you switch the operators, it is still true: 2+3 = 5*1. There is another obvious/trivial example where you can swap the operators: 2x2 = 2+2. I think these ...
3
votes
0answers
143 views

Monte Carlo variant of Hilbert's Tenth Problem

Let $k \in \mathbb{N}$. Given an algorithm $\mathcal{A}$ which takes as argument a polynomial $P \in \mathbb{Z}[x_1,\dots,x_k]$ and either returns true or false, we say that $\mathcal{A}$ works for ...
9
votes
1answer
168 views

Schoenberg's Rational Polygon Problem

"A polygon is said to be rational if all its sides and diagonals are rational, and I. J. Schoenberg has posed the difficult question, ‘Can any given polygon be approximated as closely as we like by ...
3
votes
4answers
393 views

solutions to special diophantine equations [closed]

Let $0\le x,y,z,u,v,w\le n$ be integer numbers obeying \begin{align*} x^2+y^2+z^2=&u^2+v^2+w^2\\ x+y+v=&u+w+z\\ x\neq& w \end{align*} (Please note that the second equality is ...
3
votes
0answers
121 views

polynomials in many variables and Hasse principle

I was wondering whether there exists any result of the form "if $f \in \mathbb{Z}[x_1, ..., x_k]$ is a polynomial (not form! I don't require homogeneity) of total degree $n$, with $k \geq \delta ...
4
votes
1answer
311 views

A congruence conjecture regarding $(r-s)^4-1 \equiv 0\!\pmod{4r^2s}$

Is the following conjecture true? Conjecture. If $r > s \ge 1$ are relatively prime integers such that \begin{equation} (r-s)^4-1 \equiv 0\!\pmod{4r^2s}, \tag{1} \end{equation} then $r-s = 1$ ...
0
votes
3answers
176 views

Does the Diophantine equation $(x^2+ay^2)(u^2+bv^2) = p^2+cq^2$ admit a complete solution?

In this MSE question/thread, I have been discussing the equation $$ (x^2+ay^2)(u^2+bv^2) = p^2+cq^2, \tag{$\star$} $$ where $x,a,y,u,b,v,p,c,q$ are integers. I posed a conjecture which turned out to ...
11
votes
2answers
562 views

Failing of heuristics from circle method

The heuristic from circle method for integral points on diagonal cubic surfaces $x^3+y^3+z^3=a$ ($a$ is a cubic-free integer) seems to fit well with numerical computations by ANDREAS-STEPHAN ELSENHANS ...
12
votes
3answers
1k views

Finding integer points on elliptic curves via divisibility conditions like $(a+b)^2 \mid (2b^3+6ab^2-1)$

Is the following conjecture correct? Conjecture. The divisibility condition $(\alpha+\beta)^2 \mid (2\beta^3+6\alpha\beta^2-1)$ has no solutions in positive integers $1 \le \beta < \alpha < ...
0
votes
0answers
75 views

Superelliptic Curves [duplicate]

I'm trying to find information on superelliptic curves and how to solve them over the integers. The equation is $$y^k = f(x)$$ where $k=3$ and $f$ has degree $d=3$. Does anyone know any ...
7
votes
1answer
258 views

The Diophantine equation $x^p - 4y^p = z^2$

If $p \geq 5$ is a prime, are there any integers $x, y, z > p$ such that $(x, y) = 1$ and $$x^{p} - 4y^{p} = z^{2}$$
1
vote
0answers
292 views

When is a cubic polynomial a cube? [closed]

I've been researching cubes and I'm trying to solve this Diophantine equation over the integers. $$ax^3 + bx^2 + cx + d = y^3$$where a, b, c, d are parameters for a given $n$. For example, for $n = ...
-4
votes
2answers
188 views

If $~(c - b) ^ 2 + 3cb = a^3~$ has nonzero integer solutions, then $~(a,c) \gt 1~$ or $~(b,c) \gt 1$? [closed]

If $~(c - b) ^ 2 + 3cb = a^3~$ has nonzero integer solutions, then $~(a,c) \gt 1~$ or $~(b,c) \gt 1$? I think this is true, how to prove this?
15
votes
0answers
427 views

The lonely molecule

Suppose $n$ air molecules (infinitesimal points) are bouncing around in a unit $d$-dimensional cube, with perfectly elastic wall collisions. Let $k=n^{\frac{1}{d}}$. For example, in 3D, $d=3$, with ...
2
votes
1answer
243 views

Integer points on $y^2=x^2-x^3+x^4$

Does the Diophantine equation $y^2=x^2-x^3+x^4$ have solutions other than $x=1,y=1$? Interestingly, the Diophantine equation $y^2=x^2-x^3+x^5$ has such solutions: $x=3,y=15$, $x=5,y=55$, ...
14
votes
3answers
956 views

Not-lonely runners

The lonely runner conjecture has several formulations. They all involve a number $n$ runners running on a circular track, each with a different speeds, and the conjecture is that each runner is ...
15
votes
0answers
256 views

Are there any integers which can't be written as a sum of two fourth powers minus a cube?

To be precise, I am asking: Does there exist an integer $k$ such that there do not exist (possibly negative) integers $x,y,z$ satisfying $x^4+y^4=z^3+k$? Heuristically the answer must be yes, in ...
3
votes
1answer
450 views

Some types of diophantine equations and their decidability

The MDRP theorem – which answers Hilbert's tenth problem in the negative – says: There is no algorithm for determining whether an arbitrary diophantine equation has a solution. In ...
4
votes
1answer
462 views

Hyperrectangles with integer diagonals

What is the largest value of $n$ for which there exists $n$ (not necessarily distinct) complete squares of natural numbers such that the sum of every subset of it is also a complete square? ( For ...
1
vote
0answers
126 views

Equation in the Gaussian Integers

Let $a,b \in \mathbb{N}$. Is there a possibility to characterize the solutions of $a N(\alpha) - b N(\beta)=1$ where $\alpha,\beta \in \mathbb{Z}[i]$? In particular I am interested in the case $a=1$ ...
1
vote
1answer
143 views

Link between integral points on varieties and solutions to Diophantine equations

Let $k$ be a number field, $S$ a finite set of places of $k$ including the infinite ones and $F(X_1,\dots,X_n)$ a polynomial in $k[X_1,\dots,X_n]$. I am looking for notes, books or surveys detailing ...
12
votes
1answer
548 views

Can we extend the proof of Catalan's conjecture?

What is it, in Mihailescu's proof of Catalan conjecture, that uses explicitly the fact that there is a 1 on the right hand side of $x^p - y^q = 1$? In other words, why can't we extend his argument to ...
2
votes
2answers
179 views

Enumerating solutions to an underdetermined non-homogenous linear system of Diophantine equations

I have a large, under-determined system (60 equations and 116 unknowns) of linear Diophantine equations. I am aware of the algorithms typically used to solve these systems, which is not my question. ...
2
votes
0answers
124 views

n-ary quadratic forms with $S$-integer values

Let $Q(x_1,\ldots,x_n):=x_1^2+\cdots+x_n^2$ be an $n$-ary quadratic form. Given a finite set of (rational) primes $S$ is there an algorithm or theorem that describes all solutions to ...
1
vote
0answers
40 views

Question about link between non-terminals of grammars and variables of Diophantine equations

If we change the right arrow in the rewriting rules of grammar into equators , changes all terminals into x and keep the non-terminals unchanged,we get system of equations.In some cases,those ...
5
votes
1answer
264 views

$xyz = \frac{7}{16}\left(\frac{2x - y - z}{3}\right)^3$ in nonvanishing integers

From research completely unrelated to Number Theory I stumbled onto the following equation: $$ xyz = \frac{7}{16}\left(\frac{2x - y - z}{3}\right)^3 $$ for $x, y, z$ integers, $x,y,z \neq 0$. Are ...
2
votes
1answer
396 views

Diophantine equations with infinitely many large solutions

Let $F(x,y)$ be a squarefree binary form with integer coefficients, possibly reducible, $\deg(F) \ge 3$. I am interested in ways of getting infinitely many integer solutions $(x,y,m), m \ne 0$ to ...
1
vote
0answers
53 views

Cassels-Birch-Davenport theorem for multiple quadratic forms of certain type

A classical theorem of Cassels states that if a homogenous quadratic form $Q$ has an integer zero, then there is a zero of small height (bounded solely by the coefficients and number of variables). ...
1
vote
2answers
250 views

Computational complexity of solution of Pell equation and more

What is computational complexity for computing integral solution of Pell equation .It seems to be in P ,and could any one give an algorithm and reference for proof of it's complexity? And more,could ...
3
votes
0answers
138 views

A question on a paper by Ribet

I'm reading the article On the equation $a^p + 2^\alpha b^p + c^p = 0$ by Ribet (http://math.berkeley.edu/~ribet/Articles/acta.pdf), but I'm having trouble understanding his proof of Theorem 3. For ...
0
votes
0answers
96 views

Are there generating functions of rational or integral solutions of Diophantine equation that

As we know,there are generating functions for c.e.languages which are some retricted rational or algebraic or transcendental functions dependent on the class of languages like regular ...
0
votes
0answers
78 views

Using the circle method to prove that there are no solutions to diophantine equaltions

Would it be possible to use the circle method to prove that there are no solutions to certain diophantine equations. For example, could one use the circle method to prove the fact that there are no ...
2
votes
0answers
175 views

Integer solutions of $ z^3 y^2 = x(x-1)(x+1)$

According to a conjecture there are no three consecutive powerful numbers. Necessary condition for this is integer solution of $$ z^3 y^2 = x(x-1)(x+1) \qquad (1) $$ What are integer solutions ...
1
vote
1answer
184 views

Non-coprime solutions to x^n+y^n = z^2

Let $n$ be an odd prime. I know that the equation $x^n+y^n = z^2$ has no non-zero coprime solution in integers whenever $n \geq 5$, and that there are infinitely many solutions as soon as one drops ...
2
votes
3answers
224 views

Specific Diophantine Equation Appearing in Faa Di Bruno Formula

In a Faa Di Bruno Formula there is an equation: $m_1$+2*$m_2$+3*$m_3$+...n*$m_n$=n Is there any general solution for this equation. For example for $m_1$+$m_2$+$m_3$+...+$m_n$=n, there is a ...
1
vote
1answer
218 views

On $x^3-y^2=1728 \text{ unit}$ in number fields

Consider solution of $$x^3-y^2=1728 \text{ unit} \qquad (1)$$ in a number field. This is related to the discriminant of elliptic curve in terms of $c_4,c_6$. Via elliptic curves it might have ...
21
votes
3answers
665 views

Consecutive square values of cubic polynomials

Let $P(x)$ be a cubic polynomial with integer coefficients. Does there exist a constant $c$ such that at least one of the following values $P(0),P(1),...,P(c)$ is not a square? It is known that the ...
2
votes
0answers
119 views

What is the general feeling for Hilbert's 10th problem for Q?

We know that Hilbert's 10th problem for $\mathbb{Z}$ is undecidable. I was wondering whether there is a strong opinion in the mathematical community on the decidability of Hilbert's 10th for ...
9
votes
1answer
442 views

Integer Solutions of $x+y^n = y + x^m$ for $n < m$

I found 8 of them and believe there is no more: $$2+3^2=3+2^3$$ $$2+6^2=6+2^5$$ $$6+15^2=15+6^3$$ $$3+16^2=16+3^5$$ $$3+13^3=13+3^7$$ $$2+91^2=91+2^{13}$$ $$5+280^2=280+5^7$$ $$30+4930^2=4930+30^5$$ ...
4
votes
0answers
100 views

Integers in a given box that can be represented by a polynomial

Suppose that $F(x_1, \cdots, x_n) \in \mathbb{Z}[x_1, \cdots, x_n]$ is a polynomial of degree $d$, and examine the quantity $$\displaystyle N(F;X, B) = \# \{(x_1, \cdots, x_n) \in \mathbb{Z}^n | -X ...
6
votes
4answers
292 views

Number of solutions of linear homogenous Diophantine equation inside a box

Let $a_1, ..., a_d$ be positive reals and consider the linear Diophantine equation $$ \sum_i a_in_i = 0. $$ I am interested in estimating the number of integer solutions of this equation inside a ...
5
votes
1answer
406 views

Is the following consequence of the Lang conjecture known?

This came up in a discussion with a colleague of mine, who studies PDEs. He was asking for a function $f \colon \mathbb{N} \rightarrow \mathbb{N}$ such that, for all but finitely many $n$, the ...
0
votes
1answer
120 views

Solutions of the equation $X^4-DY^4=z^4$

In order to obtain infinite integer non trivial solutions of the equation $X^4-DY^4=Z^4$ (all numbers natural) we do the following. We set $X=(r_1●p+p)$, $Y=p$, $Z=(r_1●p)$, ...
-1
votes
1answer
129 views

How many integer points does my favorite ellipse goes through? [closed]

What value on P gives an ellipse with 768 lattice Points? x^2 + 3y^2 = P P= 4*7*13*19*31*37*43 gives 384 lattice points
3
votes
0answers
100 views

Curves on hypersurfaces generated by diagonal sums

This is related to an earlier question of mine ((Non-)Existence of curves of low degree on affine and projective varieties). It seems that the question is too difficult for specific surfaces, although ...
5
votes
1answer
287 views

Subsets of all Diophantine's sets

I have asked this question on math.stackexchange already: http://math.stackexchange.com/questions/627461/subsets-of-all-diophantines-sets Function $\mathbb{N}^k \to \mathbb{N}^m$ is computable ...
2
votes
0answers
101 views

Congruences of binary forms

Suppose $f(x,y) \in \mathbb{Z}[x,y]$ is a binary form (that is, homogeneous polynomial in two variables). Further suppose that $f$ is irreducible over $\mathbb{Z}$ and has no fixed prime divisor. Let ...
3
votes
1answer
186 views

Special Case of famous Equation

I'm interested in the following diophantine eqaution: $(5^n-1)/4=y^2$. It turns out that this is a special case of the Nagell-Ljunggren equation, where $x=5$ and $q=2$ It has been shown that for ...
11
votes
3answers
297 views

(Non-)Existence of curves of low degree on affine and projective varieties

I am interested in papers that investigates the existence or non-existence of curves of low degree (relative to the degree of the ambient variety). The starting example is that of surfaces and ...
0
votes
1answer
157 views

Reference request: on sums of the form $ax^m + by^n = h$

I know that equations of the form $$\displaystyle ax^d + by^d = h$$ with $a,b,h \in \mathbb{Z}$ have been thoroughly investigated as a special (and interesting) case of the Thue-Mahler equation, for ...