Results 1 to 2 of 2

Math Help - Congruence/Prime Factorization Problem

  1. #1
    Newbie
    Joined
    Mar 2011
    Posts
    2

    Congruence/Prime Factorization Problem

    If the gcd(a,n)=1, show that there is an integer b congruent to a (mod n), where b has no prime factors less than any arbitrary integer k.

    ?????
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Senior Member abhishekkgp's Avatar
    Joined
    Jan 2011
    From
    India
    Posts
    495
    Thanks
    1
    i did not understand the question. can you make it clear by giving an example, that is, by taking say a= 6, n=13 so that gcd(a,n)=1.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Prime Factorization Help
    Posted in the Algebra Forum
    Replies: 11
    Last Post: March 23rd 2014, 12:02 PM
  2. Consecutive integers/prime factorization problem
    Posted in the Advanced Algebra Forum
    Replies: 1
    Last Post: May 11th 2010, 07:52 AM
  3. prime factorization 2
    Posted in the Algebra Forum
    Replies: 7
    Last Post: September 16th 2008, 01:37 PM
  4. prime factorization
    Posted in the Number Theory Forum
    Replies: 2
    Last Post: September 13th 2008, 01:36 PM
  5. prime factorization
    Posted in the Discrete Math Forum
    Replies: 2
    Last Post: February 18th 2008, 07:51 PM

Search Tags


/mathhelpforum @mathhelpforum