# Euler totient puzzle

1. Mar 16, 2012

### Gaussianheart

Let n=79
phi is Euler totient

Can you find a number k such as :

phi(k)=0 mod 79
phi(k+1)=0 mod 79
phi(k+2)=0 mod 79
phi(k+3)=0 mod 79
.....
phi(k+78)=0 mod 79
phi(k+79)=0 mod 79

Good luck!

2. Mar 17, 2012

### dodo

Since there are infinite primes in any[*] arithmetic sequence, I'd choose 80 primes, call them p0 to p79, of the form 79n+1.

Next, use the Chinese Remainder Theorem to find a solution 'k' of the system of 80 congruences $k \equiv -n \pmod {p_n}$ with n=0,1,2,...79.

It follows that p0 divides k, p1 divides k+1, ... and p79 divides k+79. Then each (pn-1) will divide each phi(k+n); and since all primes were a multiple of 79 plus 1, each phi(k+n) will be divisible by 79, as required.

--
Edit:
[*] Well, not any, but you get the idea.

Last edited: Mar 17, 2012
3. Mar 17, 2012

### Gaussianheart

You are right.
Anyway it does not mean that it ALWAYS exists k for every n odd prime.
Proof is needed.

Similar Discussions: Euler totient puzzle
{"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.9679391384124756, "perplexity": 7010.3888629648545}, "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-2017-43/segments/1508187823067.51/warc/CC-MAIN-20171018180631-20171018200631-00041.warc.gz"}