Show that the only divisors are $1$ and $2$ for $(z^(2^x)+1)$ and $(z^(2^y)+1)$ where $x,y,zinmathbbN$Fermat numbers are coprimeHow to deduce that $gcd(a, b) = gcd(a, a+b)$ given that the common divisors of $a$ and $b$ are the same as the common divisors of $a$ and $a+b$?How to show that if $24k+4$ and $24k+1$ are both perfect squares where $k$ is a natural number, then it is only when $k=0$?Show that the odd prime divisors of $n^2+1$ are of form $4k+1$Show that $1$ and $-1$ are the only divisors of $1$If $p$ is prime and $gcd(m,p) = 1$ show that $gcd(m,p^k) = 1$Show that $x^2 + y^2$ and $x^2 - y^2$ cannot both be perfect squares at the same time where $x, y in mathbbZ^+$.Find the common divisors of $a_1986$ and $a_6891$numbers that are the difference of two integers that have an odd number of divisorsIf $d_1 =1, d_2, cdots, d_k = n$ are positive divisors of natural $n$, show $(d_1d_2 cdots d_k)^2 = n^k$.Show that only finitely many positive integers $n$ have the property that for all $m$ for which $1<m<n$ and $textgcd(m,n) = 1$, $m$ is prime.
Origin of pigs as a species
Is there anyway, I can have two passwords for my wi-fi
Why is the principal energy of an electron lower for excited electrons in a higher energy state?
Grepping string, but include all non-blank lines following each grep match
Unable to disable Microsoft Store in domain environment
Giving feedback to someone without sounding prejudiced
What does "tick" mean in this sentence?
The Digit Triangles
Review your own paper in Mathematics
Deciphering cause of death?
Possible Eco thriller, man invents a device to remove rain from glass
What the heck is gets(stdin) on site coderbyte?
How to make money from a browser who sees 5 seconds into the future of any web page?
Would this string work as string?
Check if object is null and return null
What's the name of the logical fallacy where a debater extends a statement far beyond the original statement to make it true?
When and why was runway 07/25 at Kai Tak removed?
How much do grades matter for a future academia position?
In One Punch Man, is King actually weak?
How to leave product feedback on macOS?
How can I, as DM, avoid the Conga Line of Death occurring when implementing some form of flanking rule?
How to get directions in deep space?
Sigmoid with a slope but no asymptotes?
Language involving irrational number is not a CFL
Show that the only divisors are $1$ and $2$ for $(z^(2^x)+1)$ and $(z^(2^y)+1)$ where $x,y,zinmathbbN$
Fermat numbers are coprimeHow to deduce that $gcd(a, b) = gcd(a, a+b)$ given that the common divisors of $a$ and $b$ are the same as the common divisors of $a$ and $a+b$?How to show that if $24k+4$ and $24k+1$ are both perfect squares where $k$ is a natural number, then it is only when $k=0$?Show that the odd prime divisors of $n^2+1$ are of form $4k+1$Show that $1$ and $-1$ are the only divisors of $1$If $p$ is prime and $gcd(m,p) = 1$ show that $gcd(m,p^k) = 1$Show that $x^2 + y^2$ and $x^2 - y^2$ cannot both be perfect squares at the same time where $x, y in mathbbZ^+$.Find the common divisors of $a_1986$ and $a_6891$numbers that are the difference of two integers that have an odd number of divisorsIf $d_1 =1, d_2, cdots, d_k = n$ are positive divisors of natural $n$, show $(d_1d_2 cdots d_k)^2 = n^k$.Show that only finitely many positive integers $n$ have the property that for all $m$ for which $1<m<n$ and $textgcd(m,n) = 1$, $m$ is prime.
$begingroup$
I am trying to show that the only divisors are $1$ and $2$ for both $(z^(2^x)+1)$ and $(z^(2^y)+1)$ where $x,y,zinmathbbN$. To start the problem, the logical choice is to use difference of squares. We see that $z^2^x+1-(z^2^y+1)=z^2^x-z^2^y$. I am not sure where to go from here except to show that the gcd is 2, which proves the result.
number-theory elementary-number-theory
$endgroup$
add a comment |
$begingroup$
I am trying to show that the only divisors are $1$ and $2$ for both $(z^(2^x)+1)$ and $(z^(2^y)+1)$ where $x,y,zinmathbbN$. To start the problem, the logical choice is to use difference of squares. We see that $z^2^x+1-(z^2^y+1)=z^2^x-z^2^y$. I am not sure where to go from here except to show that the gcd is 2, which proves the result.
number-theory elementary-number-theory
$endgroup$
3
$begingroup$
math.stackexchange.com/questions/123524/…
$endgroup$
– lab bhattacharjee
Mar 14 at 4:35
1
$begingroup$
I assume that you also want that $x neq y$, else the gcd of the $2$ values will be the values them.
$endgroup$
– John Omielan
Mar 14 at 4:37
add a comment |
$begingroup$
I am trying to show that the only divisors are $1$ and $2$ for both $(z^(2^x)+1)$ and $(z^(2^y)+1)$ where $x,y,zinmathbbN$. To start the problem, the logical choice is to use difference of squares. We see that $z^2^x+1-(z^2^y+1)=z^2^x-z^2^y$. I am not sure where to go from here except to show that the gcd is 2, which proves the result.
number-theory elementary-number-theory
$endgroup$
I am trying to show that the only divisors are $1$ and $2$ for both $(z^(2^x)+1)$ and $(z^(2^y)+1)$ where $x,y,zinmathbbN$. To start the problem, the logical choice is to use difference of squares. We see that $z^2^x+1-(z^2^y+1)=z^2^x-z^2^y$. I am not sure where to go from here except to show that the gcd is 2, which proves the result.
number-theory elementary-number-theory
number-theory elementary-number-theory
edited Mar 14 at 5:14
Robert Howard
2,2293935
2,2293935
asked Mar 14 at 4:26
user593295user593295
678
678
3
$begingroup$
math.stackexchange.com/questions/123524/…
$endgroup$
– lab bhattacharjee
Mar 14 at 4:35
1
$begingroup$
I assume that you also want that $x neq y$, else the gcd of the $2$ values will be the values them.
$endgroup$
– John Omielan
Mar 14 at 4:37
add a comment |
3
$begingroup$
math.stackexchange.com/questions/123524/…
$endgroup$
– lab bhattacharjee
Mar 14 at 4:35
1
$begingroup$
I assume that you also want that $x neq y$, else the gcd of the $2$ values will be the values them.
$endgroup$
– John Omielan
Mar 14 at 4:37
3
3
$begingroup$
math.stackexchange.com/questions/123524/…
$endgroup$
– lab bhattacharjee
Mar 14 at 4:35
$begingroup$
math.stackexchange.com/questions/123524/…
$endgroup$
– lab bhattacharjee
Mar 14 at 4:35
1
1
$begingroup$
I assume that you also want that $x neq y$, else the gcd of the $2$ values will be the values them.
$endgroup$
– John Omielan
Mar 14 at 4:37
$begingroup$
I assume that you also want that $x neq y$, else the gcd of the $2$ values will be the values them.
$endgroup$
– John Omielan
Mar 14 at 4:37
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Let $x<y.$ Let $n=gcd(1+z^2^x,1+2^2^y).$ Then $z^2^xequiv -1 equiv z^2^y pmod n.$ Now $y-x-1$ is a non-negative integer, so modulo $n$ we have $$-1equiv z^2^yequiv (,(z^2^x)^2^y-x-1,)^2equiv$$ $$equiv (,(-1)^2^y-x-1,)^2equiv$$ $$equiv (,pm 1,)^2 equiv 1.$$
So $-1equiv 1 pmod n.$ And since $dequiv e pmod n iff n|(e-d)$ (for any $d,e$), we have $n|(1-(-1))=2,$ so $nle 2.$
We have used the fact that for any $a,b, nin Bbb Z$ with $nne 0,$ and any $cin Bbb N,$ if $aequiv b pmod n$ then $a^cequiv b^c pmod n.$
$endgroup$
$begingroup$
This is also valid, verbatim, if $ 0=x<y.$
$endgroup$
– DanielWainfleet
Mar 14 at 6:48
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%2f3147555%2fshow-that-the-only-divisors-are-1-and-2-for-z2x1-and-z2y%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Let $x<y.$ Let $n=gcd(1+z^2^x,1+2^2^y).$ Then $z^2^xequiv -1 equiv z^2^y pmod n.$ Now $y-x-1$ is a non-negative integer, so modulo $n$ we have $$-1equiv z^2^yequiv (,(z^2^x)^2^y-x-1,)^2equiv$$ $$equiv (,(-1)^2^y-x-1,)^2equiv$$ $$equiv (,pm 1,)^2 equiv 1.$$
So $-1equiv 1 pmod n.$ And since $dequiv e pmod n iff n|(e-d)$ (for any $d,e$), we have $n|(1-(-1))=2,$ so $nle 2.$
We have used the fact that for any $a,b, nin Bbb Z$ with $nne 0,$ and any $cin Bbb N,$ if $aequiv b pmod n$ then $a^cequiv b^c pmod n.$
$endgroup$
$begingroup$
This is also valid, verbatim, if $ 0=x<y.$
$endgroup$
– DanielWainfleet
Mar 14 at 6:48
add a comment |
$begingroup$
Let $x<y.$ Let $n=gcd(1+z^2^x,1+2^2^y).$ Then $z^2^xequiv -1 equiv z^2^y pmod n.$ Now $y-x-1$ is a non-negative integer, so modulo $n$ we have $$-1equiv z^2^yequiv (,(z^2^x)^2^y-x-1,)^2equiv$$ $$equiv (,(-1)^2^y-x-1,)^2equiv$$ $$equiv (,pm 1,)^2 equiv 1.$$
So $-1equiv 1 pmod n.$ And since $dequiv e pmod n iff n|(e-d)$ (for any $d,e$), we have $n|(1-(-1))=2,$ so $nle 2.$
We have used the fact that for any $a,b, nin Bbb Z$ with $nne 0,$ and any $cin Bbb N,$ if $aequiv b pmod n$ then $a^cequiv b^c pmod n.$
$endgroup$
$begingroup$
This is also valid, verbatim, if $ 0=x<y.$
$endgroup$
– DanielWainfleet
Mar 14 at 6:48
add a comment |
$begingroup$
Let $x<y.$ Let $n=gcd(1+z^2^x,1+2^2^y).$ Then $z^2^xequiv -1 equiv z^2^y pmod n.$ Now $y-x-1$ is a non-negative integer, so modulo $n$ we have $$-1equiv z^2^yequiv (,(z^2^x)^2^y-x-1,)^2equiv$$ $$equiv (,(-1)^2^y-x-1,)^2equiv$$ $$equiv (,pm 1,)^2 equiv 1.$$
So $-1equiv 1 pmod n.$ And since $dequiv e pmod n iff n|(e-d)$ (for any $d,e$), we have $n|(1-(-1))=2,$ so $nle 2.$
We have used the fact that for any $a,b, nin Bbb Z$ with $nne 0,$ and any $cin Bbb N,$ if $aequiv b pmod n$ then $a^cequiv b^c pmod n.$
$endgroup$
Let $x<y.$ Let $n=gcd(1+z^2^x,1+2^2^y).$ Then $z^2^xequiv -1 equiv z^2^y pmod n.$ Now $y-x-1$ is a non-negative integer, so modulo $n$ we have $$-1equiv z^2^yequiv (,(z^2^x)^2^y-x-1,)^2equiv$$ $$equiv (,(-1)^2^y-x-1,)^2equiv$$ $$equiv (,pm 1,)^2 equiv 1.$$
So $-1equiv 1 pmod n.$ And since $dequiv e pmod n iff n|(e-d)$ (for any $d,e$), we have $n|(1-(-1))=2,$ so $nle 2.$
We have used the fact that for any $a,b, nin Bbb Z$ with $nne 0,$ and any $cin Bbb N,$ if $aequiv b pmod n$ then $a^cequiv b^c pmod n.$
edited Mar 14 at 6:54
answered Mar 14 at 6:46
DanielWainfleetDanielWainfleet
35.6k31648
35.6k31648
$begingroup$
This is also valid, verbatim, if $ 0=x<y.$
$endgroup$
– DanielWainfleet
Mar 14 at 6:48
add a comment |
$begingroup$
This is also valid, verbatim, if $ 0=x<y.$
$endgroup$
– DanielWainfleet
Mar 14 at 6:48
$begingroup$
This is also valid, verbatim, if $ 0=x<y.$
$endgroup$
– DanielWainfleet
Mar 14 at 6:48
$begingroup$
This is also valid, verbatim, if $ 0=x<y.$
$endgroup$
– DanielWainfleet
Mar 14 at 6:48
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%2f3147555%2fshow-that-the-only-divisors-are-1-and-2-for-z2x1-and-z2y%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
3
$begingroup$
math.stackexchange.com/questions/123524/…
$endgroup$
– lab bhattacharjee
Mar 14 at 4:35
1
$begingroup$
I assume that you also want that $x neq y$, else the gcd of the $2$ values will be the values them.
$endgroup$
– John Omielan
Mar 14 at 4:37