Group with order $30$ is not a simple group.












0












$begingroup$


Could someone prove the sentence given above in the title?



I know that Sylow theorems should be used here.



Let $N_{p}$ stands for number of $p$-Sylow subgroups in group $G$.



I tried to use following sentences:




  • $lvert G rvert = 30 =2 cdot 3 cdot 5$

  • $N_{p} equiv 1 pmod p$

  • $N_{p} mid 30$


But i can't figure out.



Regards.






group-theory sylow-theory







share|cite|improve this question











$endgroup$












  • $begingroup$
    While it doesn't really impact your result in this case. One important thing to note is Sylow's theorem actually guarantees us that $N_p|30/p$. This reduces the number of cases you have to check, for example, 6 has 4 divisors, while 30 has 8.
    $endgroup$
    – Melody
    Jan 14 at 10:33










  • $begingroup$
    You could also assume that there is more than one Sylow $p$-subgroup for each prime and count elements of order $p$ for each of the primes. This leads to a contradiction.
    $endgroup$
    – Tobias Kildetoft
    Jan 14 at 13:36
















0












$begingroup$


Could someone prove the sentence given above in the title?



I know that Sylow theorems should be used here.



Let $N_{p}$ stands for number of $p$-Sylow subgroups in group $G$.



I tried to use following sentences:




  • $lvert G rvert = 30 =2 cdot 3 cdot 5$

  • $N_{p} equiv 1 pmod p$

  • $N_{p} mid 30$


But i can't figure out.



Regards.






group-theory sylow-theory







share|cite|improve this question











$endgroup$












  • $begingroup$
    While it doesn't really impact your result in this case. One important thing to note is Sylow's theorem actually guarantees us that $N_p|30/p$. This reduces the number of cases you have to check, for example, 6 has 4 divisors, while 30 has 8.
    $endgroup$
    – Melody
    Jan 14 at 10:33










  • $begingroup$
    You could also assume that there is more than one Sylow $p$-subgroup for each prime and count elements of order $p$ for each of the primes. This leads to a contradiction.
    $endgroup$
    – Tobias Kildetoft
    Jan 14 at 13:36














0












0








0





$begingroup$


Could someone prove the sentence given above in the title?



I know that Sylow theorems should be used here.



Let $N_{p}$ stands for number of $p$-Sylow subgroups in group $G$.



I tried to use following sentences:




  • $lvert G rvert = 30 =2 cdot 3 cdot 5$

  • $N_{p} equiv 1 pmod p$

  • $N_{p} mid 30$


But i can't figure out.



Regards.






group-theory sylow-theory







share|cite|improve this question











$endgroup$




Could someone prove the sentence given above in the title?



I know that Sylow theorems should be used here.



Let $N_{p}$ stands for number of $p$-Sylow subgroups in group $G$.



I tried to use following sentences:




  • $lvert G rvert = 30 =2 cdot 3 cdot 5$

  • $N_{p} equiv 1 pmod p$

  • $N_{p} mid 30$


But i can't figure out.



Regards.






group-theory sylow-theory




group-theory sylow-theory






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Jan 14 at 10:21









Andreas Caranti

57.4k34498




57.4k34498










asked Jan 14 at 10:11









mkultramkultra

1048




1048












  • $begingroup$
    While it doesn't really impact your result in this case. One important thing to note is Sylow's theorem actually guarantees us that $N_p|30/p$. This reduces the number of cases you have to check, for example, 6 has 4 divisors, while 30 has 8.
    $endgroup$
    – Melody
    Jan 14 at 10:33










  • $begingroup$
    You could also assume that there is more than one Sylow $p$-subgroup for each prime and count elements of order $p$ for each of the primes. This leads to a contradiction.
    $endgroup$
    – Tobias Kildetoft
    Jan 14 at 13:36


















  • $begingroup$
    While it doesn't really impact your result in this case. One important thing to note is Sylow's theorem actually guarantees us that $N_p|30/p$. This reduces the number of cases you have to check, for example, 6 has 4 divisors, while 30 has 8.
    $endgroup$
    – Melody
    Jan 14 at 10:33










  • $begingroup$
    You could also assume that there is more than one Sylow $p$-subgroup for each prime and count elements of order $p$ for each of the primes. This leads to a contradiction.
    $endgroup$
    – Tobias Kildetoft
    Jan 14 at 13:36
















$begingroup$
While it doesn't really impact your result in this case. One important thing to note is Sylow's theorem actually guarantees us that $N_p|30/p$. This reduces the number of cases you have to check, for example, 6 has 4 divisors, while 30 has 8.
$endgroup$
– Melody
Jan 14 at 10:33




$begingroup$
While it doesn't really impact your result in this case. One important thing to note is Sylow's theorem actually guarantees us that $N_p|30/p$. This reduces the number of cases you have to check, for example, 6 has 4 divisors, while 30 has 8.
$endgroup$
– Melody
Jan 14 at 10:33












$begingroup$
You could also assume that there is more than one Sylow $p$-subgroup for each prime and count elements of order $p$ for each of the primes. This leads to a contradiction.
$endgroup$
– Tobias Kildetoft
Jan 14 at 13:36




$begingroup$
You could also assume that there is more than one Sylow $p$-subgroup for each prime and count elements of order $p$ for each of the primes. This leads to a contradiction.
$endgroup$
– Tobias Kildetoft
Jan 14 at 13:36










1 Answer
1






active

oldest

votes


















4












$begingroup$

$newcommand{Size}[1]{leftlvert #1 rightrvert}$If you know the result




if the finite group $G$ has order $Size{G} = 2 d$, with $d$ odd, then $G$ has a subgroup of order $d$,




then you are immediately in business.



Otherwise, check the possibilities for the number of Sylow $5$-subgroups, and consequently for the number of elements of order $5$. If $N_{5} > 1$, you will find that there won't be too many elements left.






share|cite|improve this answer









$endgroup$













  • $begingroup$
    As regards to the given result- I am not sure whether this going to help. A group is not simple when there exists non-trivial normal subgroup not just ordinary subgroup.
    $endgroup$
    – mkultra
    Jan 14 at 11:14










  • $begingroup$
    @mkultra Yes, but the result tells you that in a group $G$ of order $2d, d$ odd, you have a subgroup of order $d$, so $[G:H] = (2d)/d = 2$ and every subgroup of index $2$ is normal, you can see a proof here math.stackexchange.com/questions/84632/…
    $endgroup$
    – Cosmin
    Jan 14 at 11:23












  • $begingroup$
    I want to only ask for proof of the result mentioned by @Andreas Caranti.
    $endgroup$
    – mkultra
    Jan 14 at 13:33












  • $begingroup$
    @mkultra there is a proof here.
    $endgroup$
    – Andreas Caranti
    Jan 14 at 14:28












Your Answer








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


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3073058%2fgroup-with-order-30-is-not-a-simple-group%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









4












$begingroup$

$newcommand{Size}[1]{leftlvert #1 rightrvert}$If you know the result




if the finite group $G$ has order $Size{G} = 2 d$, with $d$ odd, then $G$ has a subgroup of order $d$,




then you are immediately in business.



Otherwise, check the possibilities for the number of Sylow $5$-subgroups, and consequently for the number of elements of order $5$. If $N_{5} > 1$, you will find that there won't be too many elements left.






share|cite|improve this answer









$endgroup$













  • $begingroup$
    As regards to the given result- I am not sure whether this going to help. A group is not simple when there exists non-trivial normal subgroup not just ordinary subgroup.
    $endgroup$
    – mkultra
    Jan 14 at 11:14










  • $begingroup$
    @mkultra Yes, but the result tells you that in a group $G$ of order $2d, d$ odd, you have a subgroup of order $d$, so $[G:H] = (2d)/d = 2$ and every subgroup of index $2$ is normal, you can see a proof here math.stackexchange.com/questions/84632/…
    $endgroup$
    – Cosmin
    Jan 14 at 11:23












  • $begingroup$
    I want to only ask for proof of the result mentioned by @Andreas Caranti.
    $endgroup$
    – mkultra
    Jan 14 at 13:33












  • $begingroup$
    @mkultra there is a proof here.
    $endgroup$
    – Andreas Caranti
    Jan 14 at 14:28
















4












$begingroup$

$newcommand{Size}[1]{leftlvert #1 rightrvert}$If you know the result




if the finite group $G$ has order $Size{G} = 2 d$, with $d$ odd, then $G$ has a subgroup of order $d$,




then you are immediately in business.



Otherwise, check the possibilities for the number of Sylow $5$-subgroups, and consequently for the number of elements of order $5$. If $N_{5} > 1$, you will find that there won't be too many elements left.






share|cite|improve this answer









$endgroup$













  • $begingroup$
    As regards to the given result- I am not sure whether this going to help. A group is not simple when there exists non-trivial normal subgroup not just ordinary subgroup.
    $endgroup$
    – mkultra
    Jan 14 at 11:14










  • $begingroup$
    @mkultra Yes, but the result tells you that in a group $G$ of order $2d, d$ odd, you have a subgroup of order $d$, so $[G:H] = (2d)/d = 2$ and every subgroup of index $2$ is normal, you can see a proof here math.stackexchange.com/questions/84632/…
    $endgroup$
    – Cosmin
    Jan 14 at 11:23












  • $begingroup$
    I want to only ask for proof of the result mentioned by @Andreas Caranti.
    $endgroup$
    – mkultra
    Jan 14 at 13:33












  • $begingroup$
    @mkultra there is a proof here.
    $endgroup$
    – Andreas Caranti
    Jan 14 at 14:28














4












4








4





$begingroup$

$newcommand{Size}[1]{leftlvert #1 rightrvert}$If you know the result




if the finite group $G$ has order $Size{G} = 2 d$, with $d$ odd, then $G$ has a subgroup of order $d$,




then you are immediately in business.



Otherwise, check the possibilities for the number of Sylow $5$-subgroups, and consequently for the number of elements of order $5$. If $N_{5} > 1$, you will find that there won't be too many elements left.






share|cite|improve this answer









$endgroup$



$newcommand{Size}[1]{leftlvert #1 rightrvert}$If you know the result




if the finite group $G$ has order $Size{G} = 2 d$, with $d$ odd, then $G$ has a subgroup of order $d$,




then you are immediately in business.



Otherwise, check the possibilities for the number of Sylow $5$-subgroups, and consequently for the number of elements of order $5$. If $N_{5} > 1$, you will find that there won't be too many elements left.







share|cite|improve this answer












share|cite|improve this answer



share|cite|improve this answer










answered Jan 14 at 10:19









Andreas CarantiAndreas Caranti

57.4k34498




57.4k34498












  • $begingroup$
    As regards to the given result- I am not sure whether this going to help. A group is not simple when there exists non-trivial normal subgroup not just ordinary subgroup.
    $endgroup$
    – mkultra
    Jan 14 at 11:14










  • $begingroup$
    @mkultra Yes, but the result tells you that in a group $G$ of order $2d, d$ odd, you have a subgroup of order $d$, so $[G:H] = (2d)/d = 2$ and every subgroup of index $2$ is normal, you can see a proof here math.stackexchange.com/questions/84632/…
    $endgroup$
    – Cosmin
    Jan 14 at 11:23












  • $begingroup$
    I want to only ask for proof of the result mentioned by @Andreas Caranti.
    $endgroup$
    – mkultra
    Jan 14 at 13:33












  • $begingroup$
    @mkultra there is a proof here.
    $endgroup$
    – Andreas Caranti
    Jan 14 at 14:28


















  • $begingroup$
    As regards to the given result- I am not sure whether this going to help. A group is not simple when there exists non-trivial normal subgroup not just ordinary subgroup.
    $endgroup$
    – mkultra
    Jan 14 at 11:14










  • $begingroup$
    @mkultra Yes, but the result tells you that in a group $G$ of order $2d, d$ odd, you have a subgroup of order $d$, so $[G:H] = (2d)/d = 2$ and every subgroup of index $2$ is normal, you can see a proof here math.stackexchange.com/questions/84632/…
    $endgroup$
    – Cosmin
    Jan 14 at 11:23












  • $begingroup$
    I want to only ask for proof of the result mentioned by @Andreas Caranti.
    $endgroup$
    – mkultra
    Jan 14 at 13:33












  • $begingroup$
    @mkultra there is a proof here.
    $endgroup$
    – Andreas Caranti
    Jan 14 at 14:28
















$begingroup$
As regards to the given result- I am not sure whether this going to help. A group is not simple when there exists non-trivial normal subgroup not just ordinary subgroup.
$endgroup$
– mkultra
Jan 14 at 11:14




$begingroup$
As regards to the given result- I am not sure whether this going to help. A group is not simple when there exists non-trivial normal subgroup not just ordinary subgroup.
$endgroup$
– mkultra
Jan 14 at 11:14












$begingroup$
@mkultra Yes, but the result tells you that in a group $G$ of order $2d, d$ odd, you have a subgroup of order $d$, so $[G:H] = (2d)/d = 2$ and every subgroup of index $2$ is normal, you can see a proof here math.stackexchange.com/questions/84632/…
$endgroup$
– Cosmin
Jan 14 at 11:23






$begingroup$
@mkultra Yes, but the result tells you that in a group $G$ of order $2d, d$ odd, you have a subgroup of order $d$, so $[G:H] = (2d)/d = 2$ and every subgroup of index $2$ is normal, you can see a proof here math.stackexchange.com/questions/84632/…
$endgroup$
– Cosmin
Jan 14 at 11:23














$begingroup$
I want to only ask for proof of the result mentioned by @Andreas Caranti.
$endgroup$
– mkultra
Jan 14 at 13:33






$begingroup$
I want to only ask for proof of the result mentioned by @Andreas Caranti.
$endgroup$
– mkultra
Jan 14 at 13:33














$begingroup$
@mkultra there is a proof here.
$endgroup$
– Andreas Caranti
Jan 14 at 14:28




$begingroup$
@mkultra there is a proof here.
$endgroup$
– Andreas Caranti
Jan 14 at 14:28


















draft saved

draft discarded




















































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%2f3073058%2fgroup-with-order-30-is-not-a-simple-group%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

Bressuire

Image
.mw-parser-output .infobox{border:1px solid #aaa;background-color:#f9f9f9;color:black;margin:.5em 0 .5em 1em;padding:.2em;float:right;clear:right;width:22em;text-align:left;font-size:88%;line-height:1.6em}.mw-parser-output .infobox td,.mw-parser-output .infobox th{vertical-align:top;padding:0 .2em}.mw-parser-output .infobox caption{font-size:larger}.mw-parser-output .infobox.bordered{border-collapse:collapse}.mw-parser-output .infobox.bordered td,.mw-parser-output .infobox.bordered th{border:1px solid #aaa}.mw-parser-output .infobox.bordered .borderless td,.mw-parser-output .infobox.bordered .borderless th{border:0}.mw-parser-output .infobox-showbutton .mw-collapsible-text{color:inherit}.mw-parser-output .infobox.bordered .mergedtoprow td,.mw-parser-output .infobox.bordered .mergedtoprow th{border:0;border-top:1px solid #aaa;border-right:1px solid #aaa}.mw-parser-output .infobox.bordered .mergedrow td,.mw-parser-output .infobox.bordered .mergedrow th{border:0;border-right:1px solid
Read more

Cabo Verde

Image
  Nota: Cabo-verdiano redireciona para este artigo. Para a língua falada em Cabo Verde, veja crioulo cabo-verdiano. Para outros significados, veja Cabo Verde (desambiguação). Coordenadas: 14° 55' N 23° 31' O Cabo Verde República de Cabo Verde Bandeira Brasão de Armas Lema: Unidade, Trabalho, Progresso Hino nacional: Cântico da Liberdade Gentílico: cabo-verdiano [ 1 ] Capital Praia 14° 55' N 23° 31' O Cidade mais populosa Praia Língua oficial Português Governo República unitária semipresidencialista [ 2 ]  - Presidente Jorge Carlos Fonseca  - Primeiro-ministro Ulisses Correia e Silva História    - Descoberta 1460   - Independência 00 • de Portugal 5 de Julho de 1975   - Multipartidarismo 13 de Janeiro de 1990  Área    - Total 4 033 km² (146.º)  - Água (%) 0,08 População    - Estimativa para 2017 560 899 [ 3 ] hab. (173.º)
Read more

Gyllenstierna

Image
.mw-parser-output .infobox{border:1px solid #aaa;background-color:#f9f9f9;color:black;margin:.5em 0 .5em 1em;padding:.2em;float:right;clear:right;width:22em;text-align:left;font-size:88%;line-height:1.6em}.mw-parser-output .infobox td,.mw-parser-output .infobox th{vertical-align:top;padding:0 .2em}.mw-parser-output .infobox caption{font-size:larger}.mw-parser-output .infobox.bordered{border-collapse:collapse}.mw-parser-output .infobox.bordered td,.mw-parser-output .infobox.bordered th{border:1px solid #aaa}.mw-parser-output .infobox.bordered .borderless td,.mw-parser-output .infobox.bordered .borderless th{border:0}.mw-parser-output .infobox-showbutton .mw-collapsible-text{color:inherit}.mw-parser-output .infobox.bordered .mergedtoprow td,.mw-parser-output .infobox.bordered .mergedtoprow th{border:0;border-top:1px solid #aaa;border-right:1px solid #aaa}.mw-parser-output .infobox.bordered .mergedrow td,.mw-parser-output .infobox.bordered .mergedrow th{border:0;border-right:1px solid
Read more