Show that $n$ is a prime numberSquare free finite abelian group is cyclic$G$ is an abelian group of order a...

How do I locate a classical quotation?

How to create a hard link to an inode (ext4)?

Is having access to past exams cheating and, if yes, could it be proven just by a good grade?

How could our ancestors have domesticated a solitary predator?

Force user to remove USB token

What to do when during a meeting client people start to fight (even physically) with each others?

Why don't MCU characters ever seem to have language issues?

How strictly should I take "Candidates must be local"?

Why does Captain Marvel assume the planet where she lands would recognize her credentials?

Why would a jet engine that runs at temps excess of 2000°C burn when it crashes?

Do I really need to have a scientific explanation for my premise?

Is "history" a male-biased word ("his+story")?

Subset counting for even numbers

2×2×2 rubik's cube corner is twisted!

A three room house but a three headED dog

Should I take out a loan for a friend to invest on my behalf?

infinitive telling the purpose

They call me Inspector Morse

Solving "Resistance between two nodes on a grid" problem in Mathematica

Why is this plane circling around the Lucknow airport every day?

Virginia employer terminated employee and wants signing bonus returned

Am I not good enough for you?

The bar has been raised

Accountant/ lawyer will not return my call



Show that $n$ is a prime number


Square free finite abelian group is cyclic$G$ is an abelian group of order a product of distinct primes $implies G$ is cyclic?Finite abelian groups and subgroups.Show that $G$ is cyclicProof for prime avoidance lemma.Showing abelian group order that is the product of primes is cyclicProof that multiplication of two numbers plus $2$ is a prime numberProve that there is an infinite number of prime numbersIf $|G| = p_1^{r_1}…p_k^{r_k}$ it is the direct internal product of its Sylow subgroupsOrder of an arbitrary (finite) product of subgroups $|N_1cdots N_k|$













1












$begingroup$



Let $ninmathbb{N}$, $ngeq2$ and $(G,.)$ an abelian group of order $n$, with the property that for any $ain G$, the number of endomorphisms of $G$ with $f(a)=a$ is equal to $n+1-ord(a)$, where $ord(a)$ is the order of $a$. Show that $n$ is a prime number.




My approach is to suppose that $n$ is not prime, so there is a decomposition for $n=p_1p_2...p_k$, where $p_1,dots ,p_k$ are prime numbers and from Cauchy's theorem there is an $ain G$ such that $ord(a)=p_i$. Now $f(e)=f(a^{p_i})=(f(a))^{p_i}=e$, and so the number of endomorphisms $f$ is $n+1-1=n$.



However, from the hypothesis, the number of $f$ is $n+1-p_i$, and so $n+1-p_i=n$ $Rightarrow p_i=1$. As we chosen $p_i$ arbitrarily, we get that all the numbers $p_i,iin{0,1,...,k}$ are $1Rightarrow n=1$, false with $ngeq2$.




Is my proof correct?











share|cite|improve this question









New contributor




Jacob Denicula is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.







$endgroup$












  • $begingroup$
    The problem seems ill-formed- wouldn't $f(e)=e$ always hold for any endomorphism fixing an element (regardless of the primality of $|G|$)?
    $endgroup$
    – Cardioid_Ass_22
    Mar 9 at 19:34










  • $begingroup$
    @Cardioid_Ass_22 but that needs to hold for all elements.
    $endgroup$
    – enedil
    Mar 9 at 19:49
















1












$begingroup$



Let $ninmathbb{N}$, $ngeq2$ and $(G,.)$ an abelian group of order $n$, with the property that for any $ain G$, the number of endomorphisms of $G$ with $f(a)=a$ is equal to $n+1-ord(a)$, where $ord(a)$ is the order of $a$. Show that $n$ is a prime number.




My approach is to suppose that $n$ is not prime, so there is a decomposition for $n=p_1p_2...p_k$, where $p_1,dots ,p_k$ are prime numbers and from Cauchy's theorem there is an $ain G$ such that $ord(a)=p_i$. Now $f(e)=f(a^{p_i})=(f(a))^{p_i}=e$, and so the number of endomorphisms $f$ is $n+1-1=n$.



However, from the hypothesis, the number of $f$ is $n+1-p_i$, and so $n+1-p_i=n$ $Rightarrow p_i=1$. As we chosen $p_i$ arbitrarily, we get that all the numbers $p_i,iin{0,1,...,k}$ are $1Rightarrow n=1$, false with $ngeq2$.




Is my proof correct?











share|cite|improve this question









New contributor




Jacob Denicula is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.







$endgroup$












  • $begingroup$
    The problem seems ill-formed- wouldn't $f(e)=e$ always hold for any endomorphism fixing an element (regardless of the primality of $|G|$)?
    $endgroup$
    – Cardioid_Ass_22
    Mar 9 at 19:34










  • $begingroup$
    @Cardioid_Ass_22 but that needs to hold for all elements.
    $endgroup$
    – enedil
    Mar 9 at 19:49














1












1








1


1



$begingroup$



Let $ninmathbb{N}$, $ngeq2$ and $(G,.)$ an abelian group of order $n$, with the property that for any $ain G$, the number of endomorphisms of $G$ with $f(a)=a$ is equal to $n+1-ord(a)$, where $ord(a)$ is the order of $a$. Show that $n$ is a prime number.




My approach is to suppose that $n$ is not prime, so there is a decomposition for $n=p_1p_2...p_k$, where $p_1,dots ,p_k$ are prime numbers and from Cauchy's theorem there is an $ain G$ such that $ord(a)=p_i$. Now $f(e)=f(a^{p_i})=(f(a))^{p_i}=e$, and so the number of endomorphisms $f$ is $n+1-1=n$.



However, from the hypothesis, the number of $f$ is $n+1-p_i$, and so $n+1-p_i=n$ $Rightarrow p_i=1$. As we chosen $p_i$ arbitrarily, we get that all the numbers $p_i,iin{0,1,...,k}$ are $1Rightarrow n=1$, false with $ngeq2$.




Is my proof correct?











share|cite|improve this question









New contributor




Jacob Denicula is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.







$endgroup$





Let $ninmathbb{N}$, $ngeq2$ and $(G,.)$ an abelian group of order $n$, with the property that for any $ain G$, the number of endomorphisms of $G$ with $f(a)=a$ is equal to $n+1-ord(a)$, where $ord(a)$ is the order of $a$. Show that $n$ is a prime number.




My approach is to suppose that $n$ is not prime, so there is a decomposition for $n=p_1p_2...p_k$, where $p_1,dots ,p_k$ are prime numbers and from Cauchy's theorem there is an $ain G$ such that $ord(a)=p_i$. Now $f(e)=f(a^{p_i})=(f(a))^{p_i}=e$, and so the number of endomorphisms $f$ is $n+1-1=n$.



However, from the hypothesis, the number of $f$ is $n+1-p_i$, and so $n+1-p_i=n$ $Rightarrow p_i=1$. As we chosen $p_i$ arbitrarily, we get that all the numbers $p_i,iin{0,1,...,k}$ are $1Rightarrow n=1$, false with $ngeq2$.




Is my proof correct?








abstract-algebra group-theory proof-verification finite-groups






share|cite|improve this question









New contributor




Jacob Denicula is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.











share|cite|improve this question









New contributor




Jacob Denicula is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









share|cite|improve this question




share|cite|improve this question








edited Mar 9 at 18:46









Shaun

9,366113684




9,366113684






New contributor




Jacob Denicula is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









asked Mar 9 at 17:57









Jacob DeniculaJacob Denicula

554




554




New contributor




Jacob Denicula is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.





New contributor





Jacob Denicula is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.






Jacob Denicula is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.












  • $begingroup$
    The problem seems ill-formed- wouldn't $f(e)=e$ always hold for any endomorphism fixing an element (regardless of the primality of $|G|$)?
    $endgroup$
    – Cardioid_Ass_22
    Mar 9 at 19:34










  • $begingroup$
    @Cardioid_Ass_22 but that needs to hold for all elements.
    $endgroup$
    – enedil
    Mar 9 at 19:49


















  • $begingroup$
    The problem seems ill-formed- wouldn't $f(e)=e$ always hold for any endomorphism fixing an element (regardless of the primality of $|G|$)?
    $endgroup$
    – Cardioid_Ass_22
    Mar 9 at 19:34










  • $begingroup$
    @Cardioid_Ass_22 but that needs to hold for all elements.
    $endgroup$
    – enedil
    Mar 9 at 19:49
















$begingroup$
The problem seems ill-formed- wouldn't $f(e)=e$ always hold for any endomorphism fixing an element (regardless of the primality of $|G|$)?
$endgroup$
– Cardioid_Ass_22
Mar 9 at 19:34




$begingroup$
The problem seems ill-formed- wouldn't $f(e)=e$ always hold for any endomorphism fixing an element (regardless of the primality of $|G|$)?
$endgroup$
– Cardioid_Ass_22
Mar 9 at 19:34












$begingroup$
@Cardioid_Ass_22 but that needs to hold for all elements.
$endgroup$
– enedil
Mar 9 at 19:49




$begingroup$
@Cardioid_Ass_22 but that needs to hold for all elements.
$endgroup$
– enedil
Mar 9 at 19:49










1 Answer
1






active

oldest

votes


















-1












$begingroup$

You haven't used the hypothesis that the group is abelian.



I corrected some points of grammar & punctuation, though, too, like not starting a sentence with a mathematical symbol, adding a space after each comma, etc.






share|cite|improve this answer











$endgroup$









  • 1




    $begingroup$
    Thanks! How should I use the fact that the group is abelian?
    $endgroup$
    – Jacob Denicula
    Mar 9 at 19:24










  • $begingroup$
    Based on what I understand, you don't need that hypothesis. This is a bad sign though. I'm inclined to think I'm wrong. Where is the problem from, @JacobDenicula?
    $endgroup$
    – Shaun
    Mar 9 at 19:27








  • 1




    $begingroup$
    A mathematical magazine. It doesn`t matter as it has no proof.
    $endgroup$
    – Jacob Denicula
    Mar 9 at 19:49










  • $begingroup$
    You're right, it doesn't, epistemologically, @JacobDenicula. (Try to use ' instead of ` on this site for technical reasons.) If it has no proof, it has no proof. But to see whether it's likely to be correct, it helps to know from whence it came.
    $endgroup$
    – Shaun
    Mar 9 at 19:59






  • 5




    $begingroup$
    This does not provide an answer to the question. To critique or request clarification from an author, leave a comment below their post. - From Review
    $endgroup$
    – Alan Muniz
    Mar 9 at 21:57











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
});


}
});






Jacob Denicula is a new contributor. Be nice, and check out our Code of Conduct.










draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3141408%2fshow-that-n-is-a-prime-number%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









-1












$begingroup$

You haven't used the hypothesis that the group is abelian.



I corrected some points of grammar & punctuation, though, too, like not starting a sentence with a mathematical symbol, adding a space after each comma, etc.






share|cite|improve this answer











$endgroup$









  • 1




    $begingroup$
    Thanks! How should I use the fact that the group is abelian?
    $endgroup$
    – Jacob Denicula
    Mar 9 at 19:24










  • $begingroup$
    Based on what I understand, you don't need that hypothesis. This is a bad sign though. I'm inclined to think I'm wrong. Where is the problem from, @JacobDenicula?
    $endgroup$
    – Shaun
    Mar 9 at 19:27








  • 1




    $begingroup$
    A mathematical magazine. It doesn`t matter as it has no proof.
    $endgroup$
    – Jacob Denicula
    Mar 9 at 19:49










  • $begingroup$
    You're right, it doesn't, epistemologically, @JacobDenicula. (Try to use ' instead of ` on this site for technical reasons.) If it has no proof, it has no proof. But to see whether it's likely to be correct, it helps to know from whence it came.
    $endgroup$
    – Shaun
    Mar 9 at 19:59






  • 5




    $begingroup$
    This does not provide an answer to the question. To critique or request clarification from an author, leave a comment below their post. - From Review
    $endgroup$
    – Alan Muniz
    Mar 9 at 21:57
















-1












$begingroup$

You haven't used the hypothesis that the group is abelian.



I corrected some points of grammar & punctuation, though, too, like not starting a sentence with a mathematical symbol, adding a space after each comma, etc.






share|cite|improve this answer











$endgroup$









  • 1




    $begingroup$
    Thanks! How should I use the fact that the group is abelian?
    $endgroup$
    – Jacob Denicula
    Mar 9 at 19:24










  • $begingroup$
    Based on what I understand, you don't need that hypothesis. This is a bad sign though. I'm inclined to think I'm wrong. Where is the problem from, @JacobDenicula?
    $endgroup$
    – Shaun
    Mar 9 at 19:27








  • 1




    $begingroup$
    A mathematical magazine. It doesn`t matter as it has no proof.
    $endgroup$
    – Jacob Denicula
    Mar 9 at 19:49










  • $begingroup$
    You're right, it doesn't, epistemologically, @JacobDenicula. (Try to use ' instead of ` on this site for technical reasons.) If it has no proof, it has no proof. But to see whether it's likely to be correct, it helps to know from whence it came.
    $endgroup$
    – Shaun
    Mar 9 at 19:59






  • 5




    $begingroup$
    This does not provide an answer to the question. To critique or request clarification from an author, leave a comment below their post. - From Review
    $endgroup$
    – Alan Muniz
    Mar 9 at 21:57














-1












-1








-1





$begingroup$

You haven't used the hypothesis that the group is abelian.



I corrected some points of grammar & punctuation, though, too, like not starting a sentence with a mathematical symbol, adding a space after each comma, etc.






share|cite|improve this answer











$endgroup$



You haven't used the hypothesis that the group is abelian.



I corrected some points of grammar & punctuation, though, too, like not starting a sentence with a mathematical symbol, adding a space after each comma, etc.







share|cite|improve this answer














share|cite|improve this answer



share|cite|improve this answer








edited Mar 9 at 19:07

























answered Mar 9 at 18:54









ShaunShaun

9,366113684




9,366113684








  • 1




    $begingroup$
    Thanks! How should I use the fact that the group is abelian?
    $endgroup$
    – Jacob Denicula
    Mar 9 at 19:24










  • $begingroup$
    Based on what I understand, you don't need that hypothesis. This is a bad sign though. I'm inclined to think I'm wrong. Where is the problem from, @JacobDenicula?
    $endgroup$
    – Shaun
    Mar 9 at 19:27








  • 1




    $begingroup$
    A mathematical magazine. It doesn`t matter as it has no proof.
    $endgroup$
    – Jacob Denicula
    Mar 9 at 19:49










  • $begingroup$
    You're right, it doesn't, epistemologically, @JacobDenicula. (Try to use ' instead of ` on this site for technical reasons.) If it has no proof, it has no proof. But to see whether it's likely to be correct, it helps to know from whence it came.
    $endgroup$
    – Shaun
    Mar 9 at 19:59






  • 5




    $begingroup$
    This does not provide an answer to the question. To critique or request clarification from an author, leave a comment below their post. - From Review
    $endgroup$
    – Alan Muniz
    Mar 9 at 21:57














  • 1




    $begingroup$
    Thanks! How should I use the fact that the group is abelian?
    $endgroup$
    – Jacob Denicula
    Mar 9 at 19:24










  • $begingroup$
    Based on what I understand, you don't need that hypothesis. This is a bad sign though. I'm inclined to think I'm wrong. Where is the problem from, @JacobDenicula?
    $endgroup$
    – Shaun
    Mar 9 at 19:27








  • 1




    $begingroup$
    A mathematical magazine. It doesn`t matter as it has no proof.
    $endgroup$
    – Jacob Denicula
    Mar 9 at 19:49










  • $begingroup$
    You're right, it doesn't, epistemologically, @JacobDenicula. (Try to use ' instead of ` on this site for technical reasons.) If it has no proof, it has no proof. But to see whether it's likely to be correct, it helps to know from whence it came.
    $endgroup$
    – Shaun
    Mar 9 at 19:59






  • 5




    $begingroup$
    This does not provide an answer to the question. To critique or request clarification from an author, leave a comment below their post. - From Review
    $endgroup$
    – Alan Muniz
    Mar 9 at 21:57








1




1




$begingroup$
Thanks! How should I use the fact that the group is abelian?
$endgroup$
– Jacob Denicula
Mar 9 at 19:24




$begingroup$
Thanks! How should I use the fact that the group is abelian?
$endgroup$
– Jacob Denicula
Mar 9 at 19:24












$begingroup$
Based on what I understand, you don't need that hypothesis. This is a bad sign though. I'm inclined to think I'm wrong. Where is the problem from, @JacobDenicula?
$endgroup$
– Shaun
Mar 9 at 19:27






$begingroup$
Based on what I understand, you don't need that hypothesis. This is a bad sign though. I'm inclined to think I'm wrong. Where is the problem from, @JacobDenicula?
$endgroup$
– Shaun
Mar 9 at 19:27






1




1




$begingroup$
A mathematical magazine. It doesn`t matter as it has no proof.
$endgroup$
– Jacob Denicula
Mar 9 at 19:49




$begingroup$
A mathematical magazine. It doesn`t matter as it has no proof.
$endgroup$
– Jacob Denicula
Mar 9 at 19:49












$begingroup$
You're right, it doesn't, epistemologically, @JacobDenicula. (Try to use ' instead of ` on this site for technical reasons.) If it has no proof, it has no proof. But to see whether it's likely to be correct, it helps to know from whence it came.
$endgroup$
– Shaun
Mar 9 at 19:59




$begingroup$
You're right, it doesn't, epistemologically, @JacobDenicula. (Try to use ' instead of ` on this site for technical reasons.) If it has no proof, it has no proof. But to see whether it's likely to be correct, it helps to know from whence it came.
$endgroup$
– Shaun
Mar 9 at 19:59




5




5




$begingroup$
This does not provide an answer to the question. To critique or request clarification from an author, leave a comment below their post. - From Review
$endgroup$
– Alan Muniz
Mar 9 at 21:57




$begingroup$
This does not provide an answer to the question. To critique or request clarification from an author, leave a comment below their post. - From Review
$endgroup$
– Alan Muniz
Mar 9 at 21:57










Jacob Denicula is a new contributor. Be nice, and check out our Code of Conduct.










draft saved

draft discarded


















Jacob Denicula is a new contributor. Be nice, and check out our Code of Conduct.













Jacob Denicula is a new contributor. Be nice, and check out our Code of Conduct.












Jacob Denicula 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.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3141408%2fshow-that-n-is-a-prime-number%23new-answer', 'question_page');
}
);

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







Popular posts from this blog

Nidaros erkebispedøme

Birsay

Was Woodrow Wilson really a Liberal?Was World War I a war of liberals against authoritarians?Founding Fathers...