+0

# Let n be a positive integer. Prove that there exists a positive integer m > 1000...

0
130
2
+133

Let n be a positive integer. Prove that there exists a positive integer m > 1000 with the following two properties: m’s last 3 digits are 007, and m is relatively prime to n.

Aug 17, 2020

#1
0

4007 , 6007 , 9007 , 10007 , 12007 , 13007 , 16007 , 24007 , 36007 , 45007 , 61007 , 64007 , 78007 , 82007 , 88007 , 90007 , 94007 , 97007 , >>>Total= 18

All the above integers between 1000 and 100,000 end in 007 and are Prime Numbers. You may take any one of them and subtract 1.

Example: m = 9007 - 1 =9006. Any or ALL "n" between 1 and 9006 inclusive are relatively prime to m, or 9007 in this particular case. This comes from the definition of "Euler's Totient Function", or sometimes called "Euler's Phi Function"

I hope that this is what your Math Teacher had in mind when he/she posed this question.

Aug 17, 2020
#2
0

I neglected to add this fact: Because 9007 is a Prime Number, all integers between 1 and 9007 have a GCD = 1 with 9007 and hence are relatively prime to 9007, which is part of the definition of "Euler's Totient Function".

Guest Aug 17, 2020
{"found_math": false, "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": 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}