# Sylow p-subgroups

Printable View

• April 1st 2008, 09:49 PM
math_science_dude
Sylow p-subgroups
Hello,

I'm trying to show that if H is a subgroup of a finite group G, and p is a prime that the number of sylow p-subgroups of H $n_H$ is less thanor equal to the number of sylow p-subgroups of $n_G$.

This is all I have:
Clearly if p does not divide |G| then p does not divide |H| and so $n_H = n_G = 0$. Let $p^j$ and $p^k$ be the greatest powers of p that divides |H| and |G| respectively.

Case 1: j = k. In this case any sylow p-subgroup of H is a sylow p-subgroup of G and so clearly $n_H \le n_G$.

Case 2: j < k.

This is where i got stuck. I am at a point where I need to show that each sylow p-subgroup of G can contain only one sylow p-subgroup of H. I do not know if this is right path, maybe I overlooked a simple theorem.

Any assistance is greatly appreciated. Thank you.

m_s_d
All times are GMT -8. The time now is 06:34 AM.
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 6, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9213710427284241, "perplexity_flag": "head"}