Re: tell me if this is right.

From: LarryLard (larrylard_at_hotmail.com)
Date: 07/15/04 

Date: 15 Jul 2004 02:07:37 -0700

"slag" <rob@robfindlay.org> wrote in message news:<cd4hrf$8j7@odak26.prod.google.com>...
[snip]
> (V) Add and and reduce.
>
> = 13,142/15,048
>
>
> Now to reduce i've applied the Euclidean algorithm

Before explicitly finding the GCD, it's worth checking if you can see
any common factors 'by inspection' (ie, by looking :)). Here it's easy
to see that numerator and denominator share a common factor of 2
(since they are both even), so we can immediately say

13142/15048 = 6571/7524

which gives us a head start in the Euclidean GCD algorithm. Obviously,
common factors of 2 and 5 are the easiest to see by inspection; there
are 'quick' methods for spotting divisibility by 3, 9, and 11 as well
(and others maybe)

Has anyone suggested newsgroup alt.algebra.help to you? You will find
less 'noise' than sci.math there. 

-- 
Larry Lard
Replies to group please.

Relevant Pages

  • Re: GCD(0,0)
    ... >>>You're justifying an exception to the name GCD by pointing out that 0 ... >>>my point of view the G in GCD says it all. ... But the definition that works in a PID ... Euclidean algorithm, which means that it has a size function ...
    (sci.math)
  • Re: euclidean algorithm over Q[i]
    ... apart from the final value for the gcd. ... Are you using the Euclidean algorithm to compute ... GCD's of univariate polynomials over Q? ... advantage to using 'pseudo division' to avoid large ...
    (sci.math.symbolic)
  • Re: A gcd proposition
    ... A non-negative common ... and let d' be a non-negative common divisor divisible ... all common divisors divide the gcd ...
    (sci.math)
  • Re: how to rotate an array
    ... You can easily find the explanation of Euclidean algorithm on the Internet. ... gcd of original a,b values. ... > loops through the number of elements in the series, ...
    (comp.lang.cpp)
  • Re: Modular cube root question
    ... Paul Rubin wrote: ... > Yes, that's correct, e must have no common factors with phi. ... suppose it's just because when I read "this is a hard problem", ... using gcd in determining e. ...
    (sci.crypt)