Skip to main content

All Questions

Filter by
Sorted by
Tagged with
11 votes
1 answer
598 views

How to prove this problem about ternary quadratic form?

Is this right? And how to prove it ? For $n \equiv 1,2 \bmod 4$ $$ \Bigg|\ \mathbb Z^3\cap\Big\{(a_1,a_2,a_3)\ \Big|\ a_1^2+a_2^2+a_3^2=n \Big\}\Bigg| \\ = \frac12\Bigg|\mathbb Z^3\cap\Big\{(a_1,...
8 votes
4 answers
870 views

A cubic equation, and integers of the form $a^2+32b^2$

I am trying to determine whether there are any integers $x,y,z$ such that $$ 1+2 x+x^2 y+4 y^2+2 z^2 = 0. \quad\quad\quad (1) $$ It is clear that $x$ is odd. We can consider this equation as quadratic ...
2 votes
1 answer
258 views

An arithmetic problem involving a system of equations

Fix a positive integer $r$. Describe the solutions to the system of equations given by: $$\begin{equation}\sum_{1\leq i\leq r}X_i^2\equiv0\pmod{X_k}(1\leq k\leq r)\end{equation}$$ Example: In the case ...
1 vote
0 answers
136 views

On the equation $q(\mathbf{x}) = 1$ for $q$ a quadratic form

Let $q(\mathbf{x}) = q(x_1, \cdots, x_n)$ be a quadratic form with integer coefficients. For $n \geq 3$, is there a reasonable theory for the set of integer solutions to the equation $$\displaystyle q(...
0 votes
1 answer
419 views

Integers representable as binary quadratic forms

It is known that odd prime $p$ can be represented as $p=x^2+y^2$ if and only if $p \equiv 1$ mod $4$, represented as $p=x^2+2y^2$ if and only if $p \equiv 1$ or $3$ mod $8$, represented as $p=x^2+3y^2$...
3 votes
1 answer
330 views

Strong Approximation for solutions to quadratic Diophantine equations

Can anyone either direct me to an relatively elementary proof in the literature--or show me why this (Conjecture 1 stated below) is true--or if I am mistaken and it is not true: For any 4-tuple $\xi =...
1 vote
0 answers
146 views

When does a system of homogeneous quadratic equations have integer solutions?

I learned that in general, solving systems of quadratic Diophantine equations is a difficult problem. But I wonder if there are special (and non-trivial) types of systems that are easier to handle. ...
2 votes
0 answers
192 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$ ...
10 votes
1 answer
908 views

How to describe all integer solutions to $x^2+y^2=3z^2+1$?

The question is in the title. Here is a short motivation. The general quadratic Diophantine equation is $$ x^TAx+bx+c=0, $$ where $x$ is a vector of $n$ variables, $A$ is $n \times n$ matrix with ...
1 vote
2 answers
401 views

Integral solutions of quadratic equation $5 X² − 14 X⁢Y + 5 ⁢Y² = n$

Solve for all integers $x$ and $y$ the quadratic form $5 X² − 14 X⁢Y + 5 ⁢Y² = n$ for some integer n. I know that for some cases there are recurrence solutions, but I'm not sure how to solve these ...
4 votes
2 answers
574 views

Existence of solution for a system of quadratic diophantine equations / symmetric quadratic froms

I am interested in solving, or even just deciding the existence of a solution, for a system of quadratic diophantine equations. Let $p$ be a prime congruent to 1 modulo 8, so $ p =17$ is the first ...
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 ...
1 vote
0 answers
143 views

Can $12n+5$ be written as $2x^2+5y^2+9z^2+xyz$ with $x,y,z$ nonnegative integers?

Let $\mathbb N=\{0,1,2,\ldots\}$. By the Gauss-Legendre theorem on sums of three squares, for any $n\in\mathbb N$ we can write $4n+1$ as $x^2+y^2+z^2$ with $x,y,z\in\mathbb N$. Motivated by this, here ...
2 votes
1 answer
269 views

Can each natural number be represented by $2w^2+x^2+y^2+z^2+xyz$ with $x,y,z\in\mathbb N$?

It is well known that each $n\in\mathbb N=\{0,1,2,\ldots\}$ can be written as $2w^2+x^2+y^2+z^2$ with $w,x,y,z\in\mathbb N$. Furthermore, $$\{2w^2+x^2+y^2:\ w,x,y\in\mathbb N\}=\mathbb N\setminus\{4^k(...
6 votes
1 answer
462 views

The number of integral solutions to $x^2+y^2-az^2=0$

I think this must be well-known (and probably not hard to prove either), but I cannot find a reference: for a (positive) rational number $a$, the number of integral solutions to the equation $$ x^2+y^...
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 ...
3 votes
1 answer
370 views

Close integer solutions to $ab-cd=1$?

I am looking for infinite set of Diophantine solutions. Suppose we require $$0<\min(a,d)<\max(a,d)<\min(b,c)<\max(b,c)\leq\sqrt 2\min(a,d)$$ $$a,b,c,d\in\mathbb Z$$ then can we still find ...
0 votes
0 answers
221 views

Number of integer solutions to quadratic polynomial with integer coefficients

It is known from for example Representations of Integers as Sums of Squares by Grosswald, E. that $$|\{(n_1,n_2,\ldots,n_k)\in\mathbb{Z}^k: \ n_1^2+n_2^2+\cdots+n_k^2=N\}|\leq C_\varepsilon N^{\frac{...
27 votes
3 answers
1k views

When does $axy+byz+czx$ represent all integers?

For which $a,b,c$ does $axy+byz+czx$ represent all integers? In a recent answer, I conjectured that this holds whenever $\gcd(a,b,c)=1$, and I hope someone will know. I also conjectured that $axy+byz+...
4 votes
2 answers
301 views

Quadratic diophantine equations and geometry of numbers

Let (for concreteness) $a = 2$, $b = \sqrt{5}$ and $\varphi = (\sqrt{5}+1)/2$. I am interested in solutions $(w,x,y,z) \in \mathbb{Z}[\varphi]^4$ of the system $$ w^2 - ax^2 -by^2 + abz^2 = 1 $$ $$ \...
5 votes
4 answers
797 views

Solutions to the Diophantine equation $x^2+3y^2+3z^2=n$

For a fixed positive integer $n$, the Diophantine equation $$x^2 + y^2 + z^2 = n$$ was studied by Gauss in Disquisitiones Arithmeticae. As is known, this equation is intimately connected to the ...
5 votes
0 answers
196 views

Is every integer $n>1$ the sum of two triangular numbers and two powers of $5$?

Recall that the triangular numbers are those integers $$T_n=n(n+1)/2\ \ \ (n=0,1,2,\ldots).$$ In 1796 Gauss proved that each $n\in\mathbb N=\{0,1,2,\ldots\}$ is the sum of three triangular numbers, ...
12 votes
1 answer
499 views

A diophantine equation in $\mathbb{N}$

While I was working on a paper on graph theory, I encountered a problem which I think is a number-theory-problem. I don't know if there are any tools to answer the question. Find all natural numbers $...
4 votes
1 answer
209 views

Numbers represented by inhomogeneous forms

I have a family of Diophantine equations that I am trying to solve, and I am trying to figure out what methods could be used to prove existence of solutions. Unfortunately, the equations are ...
8 votes
3 answers
1k views

Deciding a quadratic diophantine equation

Given $a,b\in\Bbb Q_+$, is there an easy way to decide if $$S_{a,b}=\{(x,y)\in\Bbb Z^2:ax^2 + by^2=1\}=\emptyset?$$ I am more interested in seeing if there is a quick way to test for case when ...
2 votes
5 answers
1k 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 ...
2 votes
0 answers
207 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 $Q(x_1,\ldots,...
1 vote
0 answers
190 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). ...
5 votes
0 answers
308 views

Algorithm for solutions to quadratic forms over number fields

Are there any know (preferably implemented) algorithms to find solutions to quadratic forms over number fields (or global fields)? I am especially interested in the quaternary case. There exist some ...
2 votes
0 answers
243 views

Hurwitz integers and $F_4$

The Hurwitz integers are $$ \mathcal H= \{a+bi+cj+dk:a,b,c,d\in\mathbb Z\;\text{ or } \;a,b,c,d\in \tfrac12+\mathbb Z\}. $$ I want to know if there is a formula, for $m\in\mathbb Z$, for the number ...