for n- fixed integer prove that(adsbygoogle = window.adsbygoogle || []).push({});

phi(x)=n has a finite number of solutions

I looked at 2 cases when x is even and when x is odd

1) if x is even then phi(2x)>phi(x) and I showed why it has a finite number of solutions

2) i'm not sure how to show for the case when x is odd.. any ideas?

thanks :)

**Physics Forums - The Fusion of Science and Community**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Phi(x) math

Loading...

Similar Threads for math | Date |
---|---|

Question on group theory: simplest math construction | Feb 1, 2015 |

Matrices math | Dec 25, 2014 |

Linear and Abstract Algebra: What Is It? | Dec 6, 2014 |

Prime numbers : a math question for the pro | Jul 24, 2012 |

What field of math is this | May 17, 2012 |

**Physics Forums - The Fusion of Science and Community**