Can a number be a quadratic residue modulo all prime that do not divide it
$begingroup$
Is there a proof that for any number $a$, there must be at least one prime $p$ such that $(a/p)=-1$, where $(a/p)$ is the Legendre symbol?
In other words, for all $a$, is there at least one prime $p$ such that $a$ is a quadratic nonresidue modulo $p$?
EDIT: Due to the comments pointing out that there is no such $p$ for $a=x^2$, my question remains the same, except for only all $aneq x^2$.
number-theory elementary-number-theory legendre-symbol
$endgroup$
add a comment |
$begingroup$
Is there a proof that for any number $a$, there must be at least one prime $p$ such that $(a/p)=-1$, where $(a/p)$ is the Legendre symbol?
In other words, for all $a$, is there at least one prime $p$ such that $a$ is a quadratic nonresidue modulo $p$?
EDIT: Due to the comments pointing out that there is no such $p$ for $a=x^2$, my question remains the same, except for only all $aneq x^2$.
number-theory elementary-number-theory legendre-symbol
$endgroup$
5
$begingroup$
What about $a=1$?
$endgroup$
– Somos
Dec 30 '18 at 0:39
5
$begingroup$
Or any other square, for that matter.
$endgroup$
– Robert Israel
Dec 30 '18 at 0:42
$begingroup$
See here and its linked questions for related results.
$endgroup$
– Bill Dubuque
Dec 30 '18 at 23:00
add a comment |
$begingroup$
Is there a proof that for any number $a$, there must be at least one prime $p$ such that $(a/p)=-1$, where $(a/p)$ is the Legendre symbol?
In other words, for all $a$, is there at least one prime $p$ such that $a$ is a quadratic nonresidue modulo $p$?
EDIT: Due to the comments pointing out that there is no such $p$ for $a=x^2$, my question remains the same, except for only all $aneq x^2$.
number-theory elementary-number-theory legendre-symbol
$endgroup$
Is there a proof that for any number $a$, there must be at least one prime $p$ such that $(a/p)=-1$, where $(a/p)$ is the Legendre symbol?
In other words, for all $a$, is there at least one prime $p$ such that $a$ is a quadratic nonresidue modulo $p$?
EDIT: Due to the comments pointing out that there is no such $p$ for $a=x^2$, my question remains the same, except for only all $aneq x^2$.
number-theory elementary-number-theory legendre-symbol
number-theory elementary-number-theory legendre-symbol
edited Dec 30 '18 at 0:45
Tejas Rao
asked Dec 30 '18 at 0:35
Tejas RaoTejas Rao
33711
33711
5
$begingroup$
What about $a=1$?
$endgroup$
– Somos
Dec 30 '18 at 0:39
5
$begingroup$
Or any other square, for that matter.
$endgroup$
– Robert Israel
Dec 30 '18 at 0:42
$begingroup$
See here and its linked questions for related results.
$endgroup$
– Bill Dubuque
Dec 30 '18 at 23:00
add a comment |
5
$begingroup$
What about $a=1$?
$endgroup$
– Somos
Dec 30 '18 at 0:39
5
$begingroup$
Or any other square, for that matter.
$endgroup$
– Robert Israel
Dec 30 '18 at 0:42
$begingroup$
See here and its linked questions for related results.
$endgroup$
– Bill Dubuque
Dec 30 '18 at 23:00
5
5
$begingroup$
What about $a=1$?
$endgroup$
– Somos
Dec 30 '18 at 0:39
$begingroup$
What about $a=1$?
$endgroup$
– Somos
Dec 30 '18 at 0:39
5
5
$begingroup$
Or any other square, for that matter.
$endgroup$
– Robert Israel
Dec 30 '18 at 0:42
$begingroup$
Or any other square, for that matter.
$endgroup$
– Robert Israel
Dec 30 '18 at 0:42
$begingroup$
See here and its linked questions for related results.
$endgroup$
– Bill Dubuque
Dec 30 '18 at 23:00
$begingroup$
See here and its linked questions for related results.
$endgroup$
– Bill Dubuque
Dec 30 '18 at 23:00
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
Here is an interesting exercise that appears in A Classical Introduction to Modern Number Theory.
Let $a$ be a non square integer. Then there are infinitely many primes $p$ for which $a$ is a quadratic non residue.
As a hint, use the Chinese Remainder Theorem in a clever way.
$endgroup$
$begingroup$
Thank you for the reference. May you provide a proof of the exercise as the book is behind a pay barrier?
$endgroup$
– Tejas Rao
Dec 30 '18 at 2:08
$begingroup$
Try your best and after a few days I can give you another hint if needed.
$endgroup$
– Sandeep Silwal
Dec 30 '18 at 2:11
add a comment |
$begingroup$
Here is a solution to the above post.
Set $a=p_1^{alpha_1}cdots p_k^{alpha_k}$ be prime decomposition of $a$. Clearly, there is a $j$ such that, $alpha_j$ is odd. Without loss of generality, assume $j=1$. Also, suppose $p_1neq 2$, which is a case that can be handled separately.
We will construct a prime $p$, such that $p$ is a quadratic residue modulo $p_i$, for every $i geq 2$, and is not a quadratic residue in modulo $p_1$. Take $a_1$ to be a quadratic non-residue in modulo $p_1$. Take $q_2,dots,q_k$ to be quadratic residues in modulo $p_k$. Now, there is a prime $p$ such that $pequiv a_1pmod{p_1}$, and $pequiv q_ipmod{p_i}$, and $pequiv 1pmod{4}$, for $i geq 2$. Existence of this prime is due to Chinese remainder theorem + Dirichlet's theorem.
Finally, by quadratic reciprocity, it is not hard to check, $p$ is a quadratic residue in mod $p_j$ for $jgeq 2$, and a non-residue in mod $p_1$. Construction is complete.
$endgroup$
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3056403%2fcan-a-number-be-a-quadratic-residue-modulo-all-prime-that-do-not-divide-it%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Here is an interesting exercise that appears in A Classical Introduction to Modern Number Theory.
Let $a$ be a non square integer. Then there are infinitely many primes $p$ for which $a$ is a quadratic non residue.
As a hint, use the Chinese Remainder Theorem in a clever way.
$endgroup$
$begingroup$
Thank you for the reference. May you provide a proof of the exercise as the book is behind a pay barrier?
$endgroup$
– Tejas Rao
Dec 30 '18 at 2:08
$begingroup$
Try your best and after a few days I can give you another hint if needed.
$endgroup$
– Sandeep Silwal
Dec 30 '18 at 2:11
add a comment |
$begingroup$
Here is an interesting exercise that appears in A Classical Introduction to Modern Number Theory.
Let $a$ be a non square integer. Then there are infinitely many primes $p$ for which $a$ is a quadratic non residue.
As a hint, use the Chinese Remainder Theorem in a clever way.
$endgroup$
$begingroup$
Thank you for the reference. May you provide a proof of the exercise as the book is behind a pay barrier?
$endgroup$
– Tejas Rao
Dec 30 '18 at 2:08
$begingroup$
Try your best and after a few days I can give you another hint if needed.
$endgroup$
– Sandeep Silwal
Dec 30 '18 at 2:11
add a comment |
$begingroup$
Here is an interesting exercise that appears in A Classical Introduction to Modern Number Theory.
Let $a$ be a non square integer. Then there are infinitely many primes $p$ for which $a$ is a quadratic non residue.
As a hint, use the Chinese Remainder Theorem in a clever way.
$endgroup$
Here is an interesting exercise that appears in A Classical Introduction to Modern Number Theory.
Let $a$ be a non square integer. Then there are infinitely many primes $p$ for which $a$ is a quadratic non residue.
As a hint, use the Chinese Remainder Theorem in a clever way.
edited Dec 30 '18 at 3:26
dantopa
6,63342245
6,63342245
answered Dec 30 '18 at 1:30
Sandeep SilwalSandeep Silwal
5,88811237
5,88811237
$begingroup$
Thank you for the reference. May you provide a proof of the exercise as the book is behind a pay barrier?
$endgroup$
– Tejas Rao
Dec 30 '18 at 2:08
$begingroup$
Try your best and after a few days I can give you another hint if needed.
$endgroup$
– Sandeep Silwal
Dec 30 '18 at 2:11
add a comment |
$begingroup$
Thank you for the reference. May you provide a proof of the exercise as the book is behind a pay barrier?
$endgroup$
– Tejas Rao
Dec 30 '18 at 2:08
$begingroup$
Try your best and after a few days I can give you another hint if needed.
$endgroup$
– Sandeep Silwal
Dec 30 '18 at 2:11
$begingroup$
Thank you for the reference. May you provide a proof of the exercise as the book is behind a pay barrier?
$endgroup$
– Tejas Rao
Dec 30 '18 at 2:08
$begingroup$
Thank you for the reference. May you provide a proof of the exercise as the book is behind a pay barrier?
$endgroup$
– Tejas Rao
Dec 30 '18 at 2:08
$begingroup$
Try your best and after a few days I can give you another hint if needed.
$endgroup$
– Sandeep Silwal
Dec 30 '18 at 2:11
$begingroup$
Try your best and after a few days I can give you another hint if needed.
$endgroup$
– Sandeep Silwal
Dec 30 '18 at 2:11
add a comment |
$begingroup$
Here is a solution to the above post.
Set $a=p_1^{alpha_1}cdots p_k^{alpha_k}$ be prime decomposition of $a$. Clearly, there is a $j$ such that, $alpha_j$ is odd. Without loss of generality, assume $j=1$. Also, suppose $p_1neq 2$, which is a case that can be handled separately.
We will construct a prime $p$, such that $p$ is a quadratic residue modulo $p_i$, for every $i geq 2$, and is not a quadratic residue in modulo $p_1$. Take $a_1$ to be a quadratic non-residue in modulo $p_1$. Take $q_2,dots,q_k$ to be quadratic residues in modulo $p_k$. Now, there is a prime $p$ such that $pequiv a_1pmod{p_1}$, and $pequiv q_ipmod{p_i}$, and $pequiv 1pmod{4}$, for $i geq 2$. Existence of this prime is due to Chinese remainder theorem + Dirichlet's theorem.
Finally, by quadratic reciprocity, it is not hard to check, $p$ is a quadratic residue in mod $p_j$ for $jgeq 2$, and a non-residue in mod $p_1$. Construction is complete.
$endgroup$
add a comment |
$begingroup$
Here is a solution to the above post.
Set $a=p_1^{alpha_1}cdots p_k^{alpha_k}$ be prime decomposition of $a$. Clearly, there is a $j$ such that, $alpha_j$ is odd. Without loss of generality, assume $j=1$. Also, suppose $p_1neq 2$, which is a case that can be handled separately.
We will construct a prime $p$, such that $p$ is a quadratic residue modulo $p_i$, for every $i geq 2$, and is not a quadratic residue in modulo $p_1$. Take $a_1$ to be a quadratic non-residue in modulo $p_1$. Take $q_2,dots,q_k$ to be quadratic residues in modulo $p_k$. Now, there is a prime $p$ such that $pequiv a_1pmod{p_1}$, and $pequiv q_ipmod{p_i}$, and $pequiv 1pmod{4}$, for $i geq 2$. Existence of this prime is due to Chinese remainder theorem + Dirichlet's theorem.
Finally, by quadratic reciprocity, it is not hard to check, $p$ is a quadratic residue in mod $p_j$ for $jgeq 2$, and a non-residue in mod $p_1$. Construction is complete.
$endgroup$
add a comment |
$begingroup$
Here is a solution to the above post.
Set $a=p_1^{alpha_1}cdots p_k^{alpha_k}$ be prime decomposition of $a$. Clearly, there is a $j$ such that, $alpha_j$ is odd. Without loss of generality, assume $j=1$. Also, suppose $p_1neq 2$, which is a case that can be handled separately.
We will construct a prime $p$, such that $p$ is a quadratic residue modulo $p_i$, for every $i geq 2$, and is not a quadratic residue in modulo $p_1$. Take $a_1$ to be a quadratic non-residue in modulo $p_1$. Take $q_2,dots,q_k$ to be quadratic residues in modulo $p_k$. Now, there is a prime $p$ such that $pequiv a_1pmod{p_1}$, and $pequiv q_ipmod{p_i}$, and $pequiv 1pmod{4}$, for $i geq 2$. Existence of this prime is due to Chinese remainder theorem + Dirichlet's theorem.
Finally, by quadratic reciprocity, it is not hard to check, $p$ is a quadratic residue in mod $p_j$ for $jgeq 2$, and a non-residue in mod $p_1$. Construction is complete.
$endgroup$
Here is a solution to the above post.
Set $a=p_1^{alpha_1}cdots p_k^{alpha_k}$ be prime decomposition of $a$. Clearly, there is a $j$ such that, $alpha_j$ is odd. Without loss of generality, assume $j=1$. Also, suppose $p_1neq 2$, which is a case that can be handled separately.
We will construct a prime $p$, such that $p$ is a quadratic residue modulo $p_i$, for every $i geq 2$, and is not a quadratic residue in modulo $p_1$. Take $a_1$ to be a quadratic non-residue in modulo $p_1$. Take $q_2,dots,q_k$ to be quadratic residues in modulo $p_k$. Now, there is a prime $p$ such that $pequiv a_1pmod{p_1}$, and $pequiv q_ipmod{p_i}$, and $pequiv 1pmod{4}$, for $i geq 2$. Existence of this prime is due to Chinese remainder theorem + Dirichlet's theorem.
Finally, by quadratic reciprocity, it is not hard to check, $p$ is a quadratic residue in mod $p_j$ for $jgeq 2$, and a non-residue in mod $p_1$. Construction is complete.
answered Dec 30 '18 at 18:02
AaronAaron
1,922415
1,922415
add a comment |
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3056403%2fcan-a-number-be-a-quadratic-residue-modulo-all-prime-that-do-not-divide-it%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
5
$begingroup$
What about $a=1$?
$endgroup$
– Somos
Dec 30 '18 at 0:39
5
$begingroup$
Or any other square, for that matter.
$endgroup$
– Robert Israel
Dec 30 '18 at 0:42
$begingroup$
See here and its linked questions for related results.
$endgroup$
– Bill Dubuque
Dec 30 '18 at 23:00