The Math Forum

Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Math Forum » Discussions » sci.math.* » sci.math

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

Topic: discrete structures
Replies: 9   Last Post: Apr 13, 2008 10:14 PM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]

Posts: 11,749
Registered: 12/4/04
Re: discrete structures
Posted: Feb 24, 2008 5:41 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

In article <>,
quasi <quasi@null.set> wrote:
>On Sun, 24 Feb 2008 16:45:23 EST, Nichole <> 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??

>For part (a), here's an outline ...
>(1) Define f: Z_n to Z_n by f(x) = a*x.

Geez, too much, and for all you know the poster does not even know
what Z_n means. How about using what you suggest for (b) and (c), and
then using (a) for (b) and (c)?

>For parts (b) and (c), read up on the Euclidean algorithm. Using the

"It's not denial. I'm just very selective about
what I accept as reality."
--- Calvin ("Calvin and Hobbes" by Bill Watterson)

Arturo Magidin

Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© The Math Forum at NCTM 1994-2018. All Rights Reserved.