Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with quadratic-forms
Search options questions only
not deleted
user 124654
Algebraic and geometric theory of quadratic forms and symmetric bilinear forms, e.g., values attained by quadratic forms, isotropic subspaces, the Witt ring, invariants of quadratic forms, the discriminant and Clifford algebra of a quadratic form, Pfister forms, automorphisms of quadratic forms.
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 …
- 15.6k
2
votes
1
answer
268
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 …
- 15.6k
3
votes
0
answers
306
views
Is there an integer-valued quadratic polynomial $P(x,y)$ such that $\{P(x,y)+2^k:\ x,y\in\ma...
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 i …
- 15.6k
-1
votes
1
answer
250
views
Questions on $x^2+y^2+z^2$, $x^2+y^2+2z^2$ and $x^2+2y^2+3z^2$
Question 1. My computation in 2018 suggests that a sum of two integer squares is a sum of three nonzero integer squares if and only if it is not of the form
$$4^km\ \ (k=0,1,2,\ldots;\ \ m=1,2,5,10,13 …
- 15.6k
-1
votes
1
answer
182
views
$7n=x^2+2y^2+4z^2$ with or without $x^2\equiv y^2\equiv z^2\pmod 7$
It is well known that any positive odd integer can be written as $x^2+2y^2+4z^2$ with $x,y,z\in\mathbb Z$.
Question 1. Whether for any odd integer $n>93$ there are $x,y,z\in\mathbb Z$ such that $7n=x^ …
- 15.6k
3
votes
0
answers
202
views
On sums of three squares
Let $\mathbb N=\{0,1,2,\ldots\}$. By the Gauss-Legendre theorem on sums of three squares, any $n\in\mathbb N$ with $n\equiv1,2\pmod4$ can be written as $x^2+y^2+z^2$ with $x,y,z\in\mathbb N$. Clearly, …
- 15.6k
1
vote
0
answers
87
views
On universal sums $x(ax+b)/2+y(cy+d)/2+z(ez+f)/2$ over $\mathbb N$
Let $a,b,c,d,e,f$ be integers with $a\ge c\ge e>0$, $b>-a$ and $a\equiv b\pmod2$, $d>-c$ and $c\equiv d\pmod 2$, $f>-e$ and $e\equiv f\pmod2$. If each $n\in\mathbb N=\{0,1,2,\ldots\}$ can be written a …
- 15.6k
5
votes
0
answers
229
views
Can we write each positive integer as $x^2+y^2+\varphi(z^2)$?
As odd squares are congruent to $1$ modulo $8$, any integer of the form $4^k(8m+7)$ with $k,m\in\mathbb N=\{0,1,2,\ldots\}$ cannot be written as the sum of three squares.
To avoid such congruence obs …
- 15.6k
16
votes
0
answers
582
views
The number 1680 and Lagrange's four-square theorem
The number $1680$ has the factorization $2^4\times3\times5\times7$. Rather to my surprise, I found that this number has certain mysterious connection with Lagrange's four-square theorem.
QUESTION: Ca …
- 15.6k
3
votes
0
answers
136
views
Can we write each positive integer as $w^2+x^2(1+2y^2+2z^2)$ with $w,x,y,z\in\mathbb Z$ and ...
Lagrange's four-square theorem states that each nonnegative integer is the sum of four squares. Here I ask the following question concerning a refinement of Lagrange's four-square theorem.
QUESTION: …
- 15.6k
5
votes
0
answers
195
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, wh …
- 15.6k