Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer
 
PerlMonks  

Re^6: Algorithm for cancelling common factors between two lists of multiplicands

by BrowserUk (Patriarch)
on Aug 09, 2005 at 00:03 UTC ( #482072=note: print w/replies, xml ) Need Help??

Help for this page

Select Code to Download


  1. or download this
    #! perl -slw
    use strict;
    ...
    P:\test>MP-FET.pl
    8.070604647867604097576877668E-7030
      1 trial  of _default ( 25.852ms total), 25.852ms/trial
    
  2. or download this
    #! perl -slw
    use strict;
    ...
    $T->stop( '' );
    
    $T->report;
    
  3. or download this
    sub FishersExactTest2 {
        my @data = @_;
    ...
        my $divisor  = product( map{ ( $_ ) x $divisors { $_ } } keys %div
    +isors  );
        return $dividend / $divisor;
    }
    

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://482072]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others drinking their drinks and smoking their pipes about the Monastery: (4)
As of 2023-02-07 11:58 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    I prefer not to run the latest version of Perl because:







    Results (39 votes). Check out past polls.

    Notices?