1998-08-11 - Re: novice needing help

Header Data

From: Xcott Craver <caj@math.niu.edu>
To: Olivier Langlois <olanglois@sympatico.ca>
Message Hash: 83896bb8944da3b8f621d5caa19729d432fe9f5db0fff3e358818e5657c0e880
Message ID: <Pine.SUN.3.91.980811173637.14510A-100000@baker>
Reply To: <199808112124.RAA27282@smtp13.bellglobal.com>
UTC Datetime: 1998-08-11 22:46:11 UTC
Raw Date: Tue, 11 Aug 1998 15:46:11 -0700 (PDT)

Raw message

From: Xcott Craver <caj@math.niu.edu>
Date: Tue, 11 Aug 1998 15:46:11 -0700 (PDT)
To: Olivier Langlois <olanglois@sympatico.ca>
Subject: Re: novice needing help
In-Reply-To: <199808112124.RAA27282@smtp13.bellglobal.com>
Message-ID: <Pine.SUN.3.91.980811173637.14510A-100000@baker>
MIME-Version: 1.0
Content-Type: text/plain


On Tue, 11 Aug 1998, Olivier Langlois wrote:

> a = b/c and
> d = b/(b mod c)

	I'm not sure what you're trying to say with this notation.

	Well, if by '/' you mean integer division with truncation
	(a la most programming languages,) then consider that
	
		 9 = 49/5 and
		12 = 49/(49%5=4) 

	And so gcd(a,d) != 1.  

	This is my best guess as to what you're trying to say, since
	in number-theoretic notation these two statements don't make
	much sense:  division is not closed on the integers, and 
	(b mod c) is not a single integer, but an equivalence class.

							-Caj





Thread