All Questions
29 questions
4
votes
1
answer
316
views
Which integers can be expressed as $P(t)^2 + Q(t)^2 + R(t)^5$?
Inspired by this article and that one, I have two questions:
(1) Is the question of whether every integer can be expressed in the form $x^2 + y^2 + z^5$ ($x$, $y$, $z$ in $\mathbb{Z}$) an open problem?...
- 655
9
votes
1
answer
637
views
Representing $x^6-4$ as a sum of two squares
Prove that there exist infinitely many integers $x$ such that integer $P(x)=x^6-4$ is a sum of two squares of integers.
Equivalently, prove that $x^3-2$ and $x^3+2$ are simultaneously sums of two ...
- 7,182
2
votes
0
answers
96
views
Cryptography signature scheme based on hardness of finding points on varieties?
Related to this question Complexity of finding solutions of trapdoored polynomial.
I am trying to build signature scheme based on hardness
of finding points on varieties.
Let $K$ be field and $M=K[x_1,...
- 25.4k
0
votes
1
answer
161
views
Can $P(z)$ have a divisor in a given congruence class?
In the answer to this previous question , Noam D. Elkies proved that for any integer $x$, $x^3-x^2-2x+1$ can only have a divisors equal to $-1$, $0$, or $1$ modulo $7$. I would like to know what is ...
- 7,182
0
votes
0
answers
153
views
Polynomial parametrization for solutions of quadratic Diophantine equations
A previous Mathoverflow question asks if there is an algorithm that would determine all integer solutions to a given quadratic Diophantine equation.
To make this question more formal, we need to agree ...
- 7,182
6
votes
1
answer
1k
views
Find all integer solutions to the following easy-looking Diophantine equations
In general, it is not clear What does it mean to solve an equation? in integers. In this question, let us assume that an equation
$$
P(x_1,\dots,x_n)=0
$$
is solved if we have proved that its integer ...
- 7,182
2
votes
3
answers
568
views
Polynomial parametrization of the solutions to $yz=x^2+x\pm 1$
If a Diophantine equation has infinitely many integer solutions, how to describe them all? One standard approach is polynomial parametrization. For example, all integer solutions to the equation
$$
yz=...
- 7,182
16
votes
2
answers
1k
views
Representing $x^3-2$ as a sum of two squares
Prove that there exist infinitely many integers $x$ such that integer $P(x)=x^3-2$ is a sum of two squares of integers.
Ideally, I am looking for a proof method that also applies for other $P(x)$, ...
- 7,182
2
votes
1
answer
360
views
Positive divisors of $P(x,n)=1+x+x^2+ \cdots + x^n$ that are congruent to $1$ modulo $x$
This is a follow-up question to Positive integer solutions to the diophantine equation $(xz+1)(yz+1)=z^4+z^3 +z^2 +z+1$
Let \begin{equation}
P(x,n)= 1+x+x^2+ \cdots + x^n, \end{equation}
\begin{...
- 319
9
votes
0
answers
563
views
Iterating Diophantine equations over Q to quickly get a large interval with just integer solutions
Hilbert's Tenth Problem was whether there is an algorithm which will answer whether any Diophantine equation has solutions (where we want integer solutions). Hilbert's Tenth has a negative solution by ...
- 6,969
3
votes
0
answers
308
views
Is there an integer-valued quadratic polynomial $P(x,y)$ such that $\{P(x,y)+2^k:\ x,y\in\mathbb Z\ \text{and}\ k\in\mathbb N\}=\mathbb Z^+$?
I seek for very sparse representations of positive integers. Let
$$\mathbb N=\{0,1,2,\ldots\}\ \ \ \text{and}\ \ \ \mathbb Z^+=\{1,2,3,\ldots\}.$$
Recall that a polynomial $P(x,y)$ is integer-valued ...
- 15.6k
0
votes
0
answers
115
views
Maximum number of integer solutions with some size constraints to bivariate polynomials?
Take a bivariate polynomial of total degree $d$ satisfying $d=d_x=d_y>1$ in $\mathbb Z[x,y]$ with coefficients bound in absolute value by $b$ ($d_x$ is $x$-degree and $d_y$ is $y$-degree).
Given a ...
- 13.9k
1
vote
0
answers
88
views
Distribution of number of integer solutions in box to bivariate polynomials?
Take a bivariate polynomial of degree $d_x+d_y>\max(d_x,d_y)>1$ in $\mathbb Z[x,y]$ with coefficients bound in absolute value by $b$ ($d_x$ is $x$-degree and $d_y$ is $y$-degree).
What is the ...
- 13.9k
1
vote
1
answer
157
views
Diophantine equations that involve Gregory coefficients: a computational exercise
In this post that I've asked three weeks ago with same title in Mathematics Stack Exchange and identificator 3692235, for integers $k\geq 1$, we denote the Gregory coefficients as $G_k$. Wikipedia has ...
1
vote
1
answer
218
views
On a quadratic diophantine equation
Given a quadratic diophantine equation in $\mathbb Z[x,y,z]$ of form
$$ax^2+by^2+cx+dy+ez+f=0$$ are there standard methods to solve for it when $$\|(x^2,y^2,z)\|_\infty\leq e^{1/2}$$
$$\|(a,b,c,d,e,f)...
- 1,826
0
votes
0
answers
146
views
Chinese remaindering to solve solvable diophantine equations
Given a diophantine equation $$f(x_1,\dots,x_z)=0$$ where $f(x_1,\dots,x_z)\in\mathbb Z[x_1,\dots,x_z]$ is of total degree $d$ and each variable degree $d_i$ where $i\in\{1,\dots,z\}$ there is no ...
- 1,826
1
vote
0
answers
53
views
On a structural decomposition of polynomials based on integral roots
Given an irreducible polynomial of structure $$f(x,y)=\sum_{\substack{i,j\in\{0,1,2\}\\i+j\leq3}}a_{i, j}x^iy^j\in\mathbb Z[x,y]$$ with $a_{2,1}a_{1,2}a_{1,1}a_{1,0}a_{0,1}a_{0,0}\neq0$ if $f(m,n)=0$ ...
- 1,826
1
vote
0
answers
135
views
$n$-variable polynomials modulo $p$
The Hasse-Weil bound implies that for any 2-variable polynomial $P(x,y)$, there exists approximately $p$ solutions in $\mathbb{F}_p$ of $P(x,y) \equiv a \pmod p$ for sufficiently large $p$, and any ...
- 141
0
votes
1
answer
140
views
Diophantine equations that involve cubes and the volume of square frustums
This week I wondered about diophantine problems that involve the volume of certain cubes and frustums, see the Wikipedia Frustum. I wondered if each one of these problems have infinitely many ...
5
votes
0
answers
125
views
Is integer circuit membership undecidable?
According to wikipedia
integer circuit
in its simplest form is succinct representation of multivariate polynomial with
integer coefficients. Decidability if an integer is represented by the integer ...
- 25.4k
1
vote
1
answer
189
views
Explicit bivariate quadratic polynomials where Coppersmith is better than standard solver?
http://www.numbertheory.org/pdfs/general_quadratic_solution.pdf gives a general method to solve quadratic bivariate diophantine equation while Coppersmith introduced a method to solve bivariate ...
- 13.9k
5
votes
1
answer
430
views
How many roots of polynomial in $\mathbb Z[x]$ and $\mathbb Q[x]$ are integers on average?
Given $d,B>0$ the number of polynomials in $\mathbb Z[x]$ of degree $d$ and coefficient size at most $B$ have at least one integer roots should be $B^{O(d)}f(d)$ at some function $f$ (from Random ...
- 13.9k
1
vote
1
answer
119
views
Dimension of $S$-units over $\mathbb{C}[x]$
Let $S=\{s_1,\ldots,s_n\}$ be a finite set of complex numbers. Consider the set of polynomials $$U=\{\,(x+s_1)^{k_1}\cdots(x+s_n)^{k_n}:\, 0\leq k_1+\cdots+k_n\leq H\}.$$
I am curious as to what is ...
- 11
16
votes
4
answers
1k
views
Random Diophantine polynomials: Percent solvable?
Suppose one generates a random polynomial
of degree $d$ with integer coefficients
uniformly distributed within $[-c_\max,c_\max]$.
For example, for
$d=8$, $|c_\max|=100$, here is one random polynomial:...
- 151k
11
votes
2
answers
1k
views
Sum of consecutive cubes
I'm investigating when the sum of $n$ consecutive cubes equals a cube, i.e., for which $n$ does
$$\sum_{i=0}^{n-1} (k+i)^3 = k^3 + (k+1)^3 + \cdots + (k+n-1)^3 = Y^3 $$
have nontrivial solutions $(k,...
- 239
1
vote
0
answers
377
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 = 5$...
- 239
7
votes
0
answers
533
views
$a^5+b^5=c^5+d^5$ and polynomial identities
No nontrivial integer solutions to $$ a^5+b^5=c^5+d^5 \qquad (1)$$ are known.
(1) has infinitely many solutions in an extension of $\mathbb{Z}$
(root of $9-15x+37x^2 $ ) resulting
from a genus 0 ...
- 25.4k
11
votes
1
answer
565
views
When adding a constant makes a multivariate polynomial reducible?
Given a multivariate polynomial $f(x_1,\dots,x_n)$ with integer coefficients, how to find an integer $m$ (if it exists) such that $f(x_1,\dots,x_n) + m$ factors into polynomials of smaller degrees?
...
- 34.3k
27
votes
1
answer
4k
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 isn'...
- 13.5k