Skip to main content
added 14 characters in body
Source Link
asad
  • 841
  • 4
  • 7

A family of residue classes $a_i (\bmod n_i)$ with $2\leq n_1\lt\cdots\lt n_r$$2\leq n_1\leq\cdots\leq n_r$, ($r\geq2$) is called a covering system of congruences if every integer belongs to at least one of the residue classes, that is, every integer satisfies at least one of the congruences $a_i (\bmod n_i)$. The known examples are:

$0 (\bmod 2),\quad 0 (\bmod 3),\quad 1 (\bmod 4),\quad 5 (\bmod 6),\quad 7 (\bmod 12).$

$0 (\bmod 2),\quad 0 (\bmod 3),\quad 1 (\bmod 4),\quad 3 (\bmod 8),\quad 7 (\bmod 12),\quad 23 (\bmod 24).$

My question is whether it is possible to construct a (finite with at least two different moduli, or infinite) system of congruences that covers all odd non-square integers using moduli and residue classes satisfying

$$ \left(\frac{a_i}{n_i}\right)=-1,\qquad \text{for}\ \ 1\leq i\leq r $$

where the parenthesis is the Legendre (or Jacobi ) symbol.

P.S. What if we make the condition in the question weaker as follows: whether it is possible to construct a (finite with at least two different moduli, or infinite) system of congruences that covers all odd non-square integers using moduli and residue classes satisfying

$$ \left(\frac{a_i}{n_i}\right)=-1,\ \ \text{or}\ \ 0,\qquad \text{for}\ \ 1\leq i\leq r $$

A family of residue classes $a_i (\bmod n_i)$ with $2\leq n_1\lt\cdots\lt n_r$ is called a covering system of congruences if every integer belongs to at least one of the residue classes, that is, every integer satisfies at least one of the congruences $a_i (\bmod n_i)$. The known examples are:

$0 (\bmod 2),\quad 0 (\bmod 3),\quad 1 (\bmod 4),\quad 5 (\bmod 6),\quad 7 (\bmod 12).$

$0 (\bmod 2),\quad 0 (\bmod 3),\quad 1 (\bmod 4),\quad 3 (\bmod 8),\quad 7 (\bmod 12),\quad 23 (\bmod 24).$

My question is whether it is possible to construct a (finite with at least two different moduli, or infinite) system of congruences that covers all odd non-square integers using moduli and residue classes satisfying

$$ \left(\frac{a_i}{n_i}\right)=-1,\qquad \text{for}\ \ 1\leq i\leq r $$

where the parenthesis is the Legendre (or Jacobi ) symbol.

P.S. What if we make the condition in the question weaker as follows: whether it is possible to construct a (finite with at least two different moduli, or infinite) system of congruences that covers all odd non-square integers using moduli and residue classes satisfying

$$ \left(\frac{a_i}{n_i}\right)=-1,\ \ \text{or}\ \ 0,\qquad \text{for}\ \ 1\leq i\leq r $$

A family of residue classes $a_i (\bmod n_i)$ with $2\leq n_1\leq\cdots\leq n_r$, ($r\geq2$) is called a covering system of congruences if every integer belongs to at least one of the residue classes, that is, every integer satisfies at least one of the congruences $a_i (\bmod n_i)$. The known examples are:

$0 (\bmod 2),\quad 0 (\bmod 3),\quad 1 (\bmod 4),\quad 5 (\bmod 6),\quad 7 (\bmod 12).$

$0 (\bmod 2),\quad 0 (\bmod 3),\quad 1 (\bmod 4),\quad 3 (\bmod 8),\quad 7 (\bmod 12),\quad 23 (\bmod 24).$

My question is whether it is possible to construct a (finite with at least two different moduli, or infinite) system of congruences that covers all odd non-square integers using moduli and residue classes satisfying

$$ \left(\frac{a_i}{n_i}\right)=-1,\qquad \text{for}\ \ 1\leq i\leq r $$

where the parenthesis is the Legendre (or Jacobi ) symbol.

P.S. What if we make the condition in the question weaker as follows: whether it is possible to construct a (finite with at least two different moduli, or infinite) system of congruences that covers all odd non-square integers using moduli and residue classes satisfying

$$ \left(\frac{a_i}{n_i}\right)=-1,\ \ \text{or}\ \ 0,\qquad \text{for}\ \ 1\leq i\leq r $$

added 342 characters in body
Source Link
asad
  • 841
  • 4
  • 7

A family of residue classes $a_i (\bmod n_i)$ with $2\leq n_1\lt\cdots\lt n_r$ is called a covering system of congruences if every integer belongs to at least one of the residue classes, that is, every integer satisfies at least one of the congruences $a_i (\bmod n_i)$. The known examples are:

$0 (\bmod 2),\quad 0 (\bmod 3),\quad 1 (\bmod 4),\quad 5 (\bmod 6),\quad 7 (\bmod 12).$

$0 (\bmod 2),\quad 0 (\bmod 3),\quad 1 (\bmod 4),\quad 3 (\bmod 8),\quad 7 (\bmod 12),\quad 23 (\bmod 24).$

My question is whether it is possible to construct a (finite with at least two different moduli, or infinite) system of congruences that covers all odd non-square integers using moduli and residue classes satisfying

$$ \left(\frac{a_i}{n_i}\right)=-1,\qquad \text{for}\ \ 1\leq i\leq r $$

where the parenthesis is the Legendre (or Jacobi ) symbol.

P.S. What if we make the condition in the question weaker as follows: whether it is possible to construct a (finite with at least two different moduli, or infinite) system of congruences that covers all odd non-square integers using moduli and residue classes satisfying

$$ \left(\frac{a_i}{n_i}\right)=-1,\ \ \text{or}\ \ 0,\qquad \text{for}\ \ 1\leq i\leq r $$

A family of residue classes $a_i (\bmod n_i)$ with $2\leq n_1\lt\cdots\lt n_r$ is called a covering system of congruences if every integer belongs to at least one of the residue classes, that is, every integer satisfies at least one of the congruences $a_i (\bmod n_i)$. The known examples are:

$0 (\bmod 2),\quad 0 (\bmod 3),\quad 1 (\bmod 4),\quad 5 (\bmod 6),\quad 7 (\bmod 12).$

$0 (\bmod 2),\quad 0 (\bmod 3),\quad 1 (\bmod 4),\quad 3 (\bmod 8),\quad 7 (\bmod 12),\quad 23 (\bmod 24).$

My question is whether it is possible to construct a (finite with at least two different moduli, or infinite) system of congruences that covers all odd non-square integers using moduli and residue classes satisfying

$$ \left(\frac{a_i}{n_i}\right)=-1,\qquad \text{for}\ \ 1\leq i\leq r $$

where the parenthesis is the Legendre (or Jacobi ) symbol.

A family of residue classes $a_i (\bmod n_i)$ with $2\leq n_1\lt\cdots\lt n_r$ is called a covering system of congruences if every integer belongs to at least one of the residue classes, that is, every integer satisfies at least one of the congruences $a_i (\bmod n_i)$. The known examples are:

$0 (\bmod 2),\quad 0 (\bmod 3),\quad 1 (\bmod 4),\quad 5 (\bmod 6),\quad 7 (\bmod 12).$

$0 (\bmod 2),\quad 0 (\bmod 3),\quad 1 (\bmod 4),\quad 3 (\bmod 8),\quad 7 (\bmod 12),\quad 23 (\bmod 24).$

My question is whether it is possible to construct a (finite with at least two different moduli, or infinite) system of congruences that covers all odd non-square integers using moduli and residue classes satisfying

$$ \left(\frac{a_i}{n_i}\right)=-1,\qquad \text{for}\ \ 1\leq i\leq r $$

where the parenthesis is the Legendre (or Jacobi ) symbol.

P.S. What if we make the condition in the question weaker as follows: whether it is possible to construct a (finite with at least two different moduli, or infinite) system of congruences that covers all odd non-square integers using moduli and residue classes satisfying

$$ \left(\frac{a_i}{n_i}\right)=-1,\ \ \text{or}\ \ 0,\qquad \text{for}\ \ 1\leq i\leq r $$

added 10 characters in body
Source Link
asad
  • 841
  • 4
  • 7

A family of residue classes $a_i (\bmod n_i)$ with $2\leq n_1\lt\cdots\lt n_r$ is called a covering system of congruences if every integer belongs to at least one of the residue classes, that is, every integer satisfies at least one of the congruences $a_i (\bmod n_i)$. The known examples are:

$0 (\bmod 2),\quad 0 (\bmod 3),\quad 1 (\bmod 4),\quad 5 (\bmod 6),\quad 7 (\bmod 12).$

$0 (\bmod 2),\quad 0 (\bmod 3),\quad 1 (\bmod 4),\quad 3 (\bmod 8),\quad 7 (\bmod 12),\quad 23 (\bmod 24).$

My question is whether it is possible to construct a (finite with at least two different moduli, or infinite) system of congruences that covers all odd non-square integers using moduli and residue classes satisfying

$$ \left(\frac{a_i}{n_i}\right)=-1,\qquad \text{for}\ \ 1\leq i\leq r $$

where the parenthesis is the Legendre (or Jacobi ) symbol.

A family of residue classes $a_i (\bmod n_i)$ with $2\leq n_1\lt\cdots\lt n_r$ is called a covering system of congruences if every integer belongs to at least one of the residue classes, that is, every integer satisfies at least one of the congruences $a_i (\bmod n_i)$. The known examples are:

$0 (\bmod 2),\quad 0 (\bmod 3),\quad 1 (\bmod 4),\quad 5 (\bmod 6),\quad 7 (\bmod 12).$

$0 (\bmod 2),\quad 0 (\bmod 3),\quad 1 (\bmod 4),\quad 3 (\bmod 8),\quad 7 (\bmod 12),\quad 23 (\bmod 24).$

My question is whether it is possible to construct a (finite or infinite) system of congruences that covers all odd non-square integers using moduli and residue classes satisfying

$$ \left(\frac{a_i}{n_i}\right)=-1,\qquad \text{for}\ \ 1\leq i\leq r $$

where the parenthesis is the Legendre (or Jacobi ) symbol.

A family of residue classes $a_i (\bmod n_i)$ with $2\leq n_1\lt\cdots\lt n_r$ is called a covering system of congruences if every integer belongs to at least one of the residue classes, that is, every integer satisfies at least one of the congruences $a_i (\bmod n_i)$. The known examples are:

$0 (\bmod 2),\quad 0 (\bmod 3),\quad 1 (\bmod 4),\quad 5 (\bmod 6),\quad 7 (\bmod 12).$

$0 (\bmod 2),\quad 0 (\bmod 3),\quad 1 (\bmod 4),\quad 3 (\bmod 8),\quad 7 (\bmod 12),\quad 23 (\bmod 24).$

My question is whether it is possible to construct a (finite with at least two different moduli, or infinite) system of congruences that covers all odd non-square integers using moduli and residue classes satisfying

$$ \left(\frac{a_i}{n_i}\right)=-1,\qquad \text{for}\ \ 1\leq i\leq r $$

where the parenthesis is the Legendre (or Jacobi ) symbol.

added 21 characters in body
Source Link
asad
  • 841
  • 4
  • 7
Loading
added 77 characters in body
Source Link
Joe Silverman
  • 47.4k
  • 2
  • 149
  • 241
Loading
added 19 characters in body
Source Link
asad
  • 841
  • 4
  • 7
Loading
added 5 characters in body
Source Link
asad
  • 841
  • 4
  • 7
Loading
removed (covering) tag; related discussion on meta: https://meta.mathoverflow.net/questions/3545/how-should-questions-about-various-meanings-of-coverings-be-tagged
Link
Martin Sleziak
  • 4.7k
  • 4
  • 35
  • 40
Loading
Source Link
asad
  • 841
  • 4
  • 7
Loading