prime number (diophantine equation) The Next CEO of Stack Overflownumber theory Diophantine equationFind the smallest number with four factorizations in the $mathbbE$-zone.If $n$ is a positive integer, does $n^3-1$ always have a prime factor that's 1 more than a multiple of 3?Exponential diophantine equation involving a prime numberProperty of $n$th Lucas numberApplication of Lagrange's theorem for the number of roots of a polynonial modulo a primeIf p is an odd prime, then any prime that divides $2^p-1$ is congruent to $pm 1$ (mod 8).Proof that if $n$ is the sum of squares and $p^2k+1$ is in its prime factorization, then $pnotequiv 3mod4$Proof of an infinite number of primes of the form 8k+3.Congruences modulo non-Chen primes
Only print output after finding pattern
What's the point of interval inversion?
Why here is plural "We went to the movies last night."
Are there languages with no euphemisms?
What can we do to stop prior company from asking us questions?
If I blow insulation everywhere in my attic except the door trap, will heat escape through it?
Why does GHC infer a monomorphic type here, even with MonomorphismRestriction disabled?
Why do professional authors make "consistency" mistakes? And how to avoid them?
Increase performance creating Mandelbrot set in python
Was a professor correct to chastise me for writing "Prof. X" rather than "Professor X"?
Too much space between section and text in a twocolumn document
Example of a Mathematician/Physicist whose Other Publications during their PhD eclipsed their PhD Thesis
What is the difference between "behavior" and "behaviour"?
How to make a variable always equal to the result of some calculations?
Grabbing quick drinks
Anatomically Correct Mesopelagic Aves
Why didn't Khan get resurrected in the Genesis Explosion?
Is a stroke of luck acceptable after a series of unfavorable events?
When airplanes disconnect from a tanker during air to air refueling, why do they bank so sharply to the right?
If the heap is initialized for security, then why is the stack uninitialized?
How do scammers retract money, while you can’t?
What do "high sea" and "carry" mean in this sentence?
How can I quit an app using Terminal?
The King's new dress
prime number (diophantine equation)
The Next CEO of Stack Overflownumber theory Diophantine equationFind the smallest number with four factorizations in the $mathbbE$-zone.If $n$ is a positive integer, does $n^3-1$ always have a prime factor that's 1 more than a multiple of 3?Exponential diophantine equation involving a prime numberProperty of $n$th Lucas numberApplication of Lagrange's theorem for the number of roots of a polynonial modulo a primeIf p is an odd prime, then any prime that divides $2^p-1$ is congruent to $pm 1$ (mod 8).Proof that if $n$ is the sum of squares and $p^2k+1$ is in its prime factorization, then $pnotequiv 3mod4$Proof of an infinite number of primes of the form 8k+3.Congruences modulo non-Chen primes
$begingroup$
143 is semi prime number. 143 to power any odd is congruent to 3 mod 4 and 143 to power any even is congruent to 1 mod 4. Is it correct to write this way?
number-theory
asked yesterday
Shivangi AsthanaShivangi Asthana
1
New contributor
Shivangi Asthana is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
add a comment |
$begingroup$
143 is semi prime number. 143 to power any odd is congruent to 3 mod 4 and 143 to power any even is congruent to 1 mod 4. Is it correct to write this way?
number-theory
asked yesterday
Shivangi AsthanaShivangi Asthana
1
New contributor
Shivangi Asthana is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
$begingroup$
Sure....may be simpler to write $143equiv -1 pmod 4implies 143^nequiv (-1)^npmod 4$.
$endgroup$
– lulu
yesterday
1
$begingroup$
Why do you have "Diophantine equation" in the title? I only see modulo $4$ calculation.
$endgroup$
– Dietrich Burde
yesterday
add a comment |
$begingroup$
143 is semi prime number. 143 to power any odd is congruent to 3 mod 4 and 143 to power any even is congruent to 1 mod 4. Is it correct to write this way?
number-theory
asked yesterday
Shivangi AsthanaShivangi Asthana
1
New contributor
Shivangi Asthana is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
143 is semi prime number. 143 to power any odd is congruent to 3 mod 4 and 143 to power any even is congruent to 1 mod 4. Is it correct to write this way?
number-theory
number-theory
asked yesterday
Shivangi AsthanaShivangi Asthana
1
New contributor
Shivangi Asthana is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked yesterday
Shivangi AsthanaShivangi Asthana
1
New contributor
Shivangi Asthana is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked yesterday
Shivangi AsthanaShivangi Asthana
1
New contributor
Shivangi Asthana is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked yesterday
Shivangi AsthanaShivangi Asthana
1
asked yesterday
Shivangi AsthanaShivangi Asthana
1
1
New contributor
Shivangi Asthana is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
Shivangi Asthana is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
Shivangi Asthana is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$begingroup$
Sure....may be simpler to write $143equiv -1 pmod 4implies 143^nequiv (-1)^npmod 4$.
$endgroup$
– lulu
yesterday
1
$begingroup$
Why do you have "Diophantine equation" in the title? I only see modulo $4$ calculation.
$endgroup$
– Dietrich Burde
yesterday
add a comment |
$begingroup$
Sure....may be simpler to write $143equiv -1 pmod 4implies 143^nequiv (-1)^npmod 4$.
$endgroup$
– lulu
yesterday
1
$begingroup$
Why do you have "Diophantine equation" in the title? I only see modulo $4$ calculation.
$endgroup$
– Dietrich Burde
yesterday
$begingroup$
Sure....may be simpler to write $143equiv -1 pmod 4implies 143^nequiv (-1)^npmod 4$.
$endgroup$
– lulu
yesterday
$begingroup$
Sure....may be simpler to write $143equiv -1 pmod 4implies 143^nequiv (-1)^npmod 4$.
$endgroup$
– lulu
yesterday
1
1
$begingroup$
Why do you have "Diophantine equation" in the title? I only see modulo $4$ calculation.
$endgroup$
– Dietrich Burde
yesterday
$begingroup$
Why do you have "Diophantine equation" in the title? I only see modulo $4$ calculation.
$endgroup$
– Dietrich Burde
yesterday
add a comment |
0
active
oldest
votes
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
);
);
Shivangi Asthana is a new contributor. Be nice, and check out our Code of Conduct.
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%2f3164355%2fprime-number-diophantine-equation%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
Shivangi Asthana is a new contributor. Be nice, and check out our Code of Conduct.
Shivangi Asthana is a new contributor. Be nice, and check out our Code of Conduct.
Shivangi Asthana is a new contributor. Be nice, and check out our Code of Conduct.
Shivangi Asthana is a new contributor. Be nice, and check out our Code of Conduct.
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%2f3164355%2fprime-number-diophantine-equation%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
$begingroup$
Sure....may be simpler to write $143equiv -1 pmod 4implies 143^nequiv (-1)^npmod 4$.
$endgroup$
– lulu
yesterday
1
$begingroup$
Why do you have "Diophantine equation" in the title? I only see modulo $4$ calculation.
$endgroup$
– Dietrich Burde
yesterday