Results 1 to 2 of 2

Thread: Number Theory

  1. November 3rd 2008, 08:42 PM #1
    tret
    tret is offline
    Newbie
    Joined
    Nov 2008
    Posts
    3

    Number Theory

    Hi. I am a little confused. Please Help!

    Given an integer n, prove that there exits at least one k for which n|φ(k)
    Follow Math Help Forum on Facebook and Google+
  2. November 3rd 2008, 08:51 PM #2
    ThePerfectHacker
    ThePerfectHacker is offline
    Global Moderator ThePerfectHacker's Avatar
    Joined
    Nov 2005
    From
    New York City
    Posts
    10,603
    Quote Originally Posted by tret View Post
    Hi. I am a little confused. Please Help!

    Given an integer n, prove that there exits at least one k for which n|φ(k)
    Dirichlet's theorem says there is a prime so that p\equiv 1(\bmod n).
    Therefore let k=p then \phi (p) = p-1 is divisible by n.
    Follow Math Help Forum on Facebook and Google+
« Gauss Lemma (Number Theory) | Linear Diophantine equation »

Similar Math Help Forum Discussions

  1. Textbooks on Galois Theory and Algebraic Number Theory
    Posted in the Advanced Algebra Forum
    Replies: 3
    Last Post: July 8th 2011, 06:09 PM
  2. Number Theory
    Posted in the Number Theory Forum
    Replies: 3
    Last Post: May 19th 2010, 07:51 PM
  3. Number Theory
    Posted in the Advanced Algebra Forum
    Replies: 4
    Last Post: February 16th 2010, 05:05 PM
  4. Number Theory type of problem--need help understanding number relationships. yikes.
    Posted in the Algebra Forum
    Replies: 2
    Last Post: December 18th 2008, 05:28 PM
  5. Number theory, prime number
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: September 17th 2006, 08:11 PM

Search Tags


/mathhelpforum @mathhelpforum