1. ## Euler Phi funtion

Let $\displaystyle k$ be positive integer $\displaystyle , n=3^k+2$ composite, squarefree

Show that $\displaystyle \Phi(n) \not= 2(3^{k-1}+1)$

2. Originally Posted by wauwau
Let $\displaystyle k$ be positive integer $\displaystyle , n=3^k+2$ composite, squarefree

Show that $\displaystyle \Phi(n) \not= 2(3^{k-1}+1)$

For any natural integer $\displaystyle m=p_i^{a_i}\cdot\ldots\cdot p_k^{a_k}$ , with $\displaystyle p_i$ primes, $\displaystyle 0<a_i\in\mathbb{N}$, we have that $\displaystyle \phi(m)=m\prod\limits_{1\le i\le k}\left(1-\frac{1}{p_i}\right)$, so if $\displaystyle 2\mid \phi(n)$, then n has to be divisible by a power of 2 greater than 1, and since $\displaystyle n=3^k+2$ then n is odd...

Tonio
{"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": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "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.950722873210907, "perplexity": 383.97179668242023}, "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-2018-13/segments/1521257650730.61/warc/CC-MAIN-20180324151847-20180324171847-00533.warc.gz"}