# Math Help - prove

1. ## prove

prove that if n and m are relatively prime, gcd(n,m)=1, then |U(n)|*|U(m)|=|U(nm)|

2. Originally Posted by mandy123
prove that if n and m are relatively prime, gcd(n,m)=1, then |U(n)|*|U(m)|=|U(nm)|
Define $\phi: \mathbb{Z}_{nm}^{\times}\to \mathbb{Z}_n^{\times} \times \mathbb{Z}_m^{\times}$ by $\phi( [x]_{nm}) = ( [x]_n, [x]_m)$.
Show this is well-defined.
Now prove this is a bijection by using Chinese remainder theorem.
{"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": 2, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.8475159406661987, "perplexity": 1179.0408261050834}, "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": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2014-49/segments/1416931009968.66/warc/CC-MAIN-20141125155649-00192-ip-10-235-23-156.ec2.internal.warc.gz"}