Re: C(n, k): binomial coefficient calculation

From: Timothy Little (tim-via-n.i.net_at_little-possums.net)
Date: 01/25/05 

Date: 25 Jan 2005 05:42:19 GMT

Gerry Myerson wrote:
> Do the products, one at a time, mod x.

And then do the divisions, one at a time, mod x? Remembering of
course that x is composite.

- Tim

Relevant Pages

  • Re: Dem Eye-o-wah kitties!
    ... The sadness I remembered in the book was when Tim had to move his dad to the ... am sorry for your loss and know the remembering can be painful. ... watching Tom Brokaw honor Tim Russert in NBC's Special ... image in my head at the moment of Ron showing Tim Russert around The ...
    (rec.pets.cats.community)
  • Re: Another relationship for Phytagorean triplets
    ... 2008 6:56 PM Gerry Myerson wrote: ... My reason is to start with some specific Pythagorean ... Therefore for every composite number X and odd ... Never to late for to correct the treatment with not so comfortable position or proposition. ...
    (sci.math)
  • Re: Doubt - Proof of Four Color Theorem
    ... Gerry Myerson writes: ... It lies, in that it claims there is a 4-coloring but ... > 100% isn't good enough, either, as 100% of an infinite set ... then only 50% of the integers appear as composite in that order. ...
    (sci.math)
  • Re: OT: Happy Birthday, Janet
    ... Tim Barr wrote: ... David "The Hamster" Malone ... I appreciate your remembering. ... Happy Birthday Janet. ...
    (rec.outdoors.rv-travel)
  • Re: Largest prime ever just discovered
    ... Jim Spriggs wrote: ... > integers which are not prime and not composite? ... there are heaps of large positive integers which are not prime ... Gerry Myerson ...
    (sci.math)