Re: discrete structures

From: "Mariano Suárez-Alvarez" <mariano.suarezalvarez@xxxxxxxxx>
Date: Sun, 24 Feb 2008 14:03:17 -0800 (PST)

On Feb 24, 7:45 pm, Nichole <xnicole...@xxxxxxx> wrote:

(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??

This look surprisingly similar to homework...

So: what have /you/ tried in order to solve those questions?

-- m
.

References:
- discrete structures
  - From: Nichole

Prev by Date: Re: order of an element
Next by Date: Re: New symbolic/numeric/dynamic/intuitive programming language
Previous by thread: discrete structures
Next by thread: Re: discrete structures
Index(es):
- Date
- Thread