discrete structures

From: Nichole <xnicole13x@xxxxxxx>
Date: Sun, 24 Feb 2008 16:45:23 EST

(a) Let n and a be positive integers with gcd(a, n)=1. Prove that the equation a x≡1(mod n) has a solution.
(b) Solve 271 x ≡ 1 (mod 1003)
(c) Solve 7008x ≡ 1(mod 7919)

any ideas or thoughts??
.

Follow-Ups:
- Re: discrete structures
  - From: Nichole
- Re: discrete structures
  - From: N. Silver
- Re: discrete structures
  - From: Nichole
- Re: discrete structures
  - From: quasi
- Re: discrete structures
  - From: Arturo Magidin
- Re: discrete structures
  - From: Mariano Suárez-Alvarez

Prev by Date: Re: order of an element
Next by Date: Re: New symbolic/numeric/dynamic/intuitive programming language
Previous by thread: What is the geometrical meanning of exact sequence?
Next by thread: Re: discrete structures
Index(es):
- Date
- Thread