Math::NumberCruncher - Collection of useful math-related functions.

It should be noted that as of v4.0, there is now an OO interface to Math::NumberCruncher. For backwards compatibility, however, the previous, functional style will always be supported.

# OO Style

use Math::NumberCruncher;

$ref = Math::NumberCruncher->new();

# From this point on, all of the subroutines shown below will be available # through CW$ref (i.e., ( CW$high,$low ) = CW$ref->Range( \@array )). For the sake # of brevity, consult the functional documentation (below) for the use # of specific functions.

# Functional Style

use Math::NumberCruncher;

($high, CW$low) = Math::NumberCruncher::Range(\@array);

$mean = Math::NumberCruncher::Mean(\@array);

$median = Math::NumberCruncher::Median(\@array [, CW$decimal_places]);

$odd_median = Math::NumberCruncher::OddMedian(\@array);

$mode = Math::NumberCruncher::Mode(\@array);

$covariance = Math::NumberCruncher::Covariance(\@array1, \@array2);

$correlation = Math::NumberCruncher::Correlation(\@array1, \@array2);

($slope, CW$y_intercept) = Math::NumberCruncher::BestFit(\@array1, \@array2 [, CW$decimal_places]);

$distance = Math::NumberCruncher::Distance($x1,$y1,$z1,$x2,$y2,$z2 [, CW$decimal_places]);

$distance = Math::NumberCruncher::Distance($x1,$y1,$x1,$x2 [, CW$decimal_places]);

$distance = Math::NumberCruncher::ManhattanDistance($x1,$y1,$x2,$y2);

$probAll = Math::NumberCruncher::AllOf('0.3','0.25','0.91','0.002');

$probNone = Math::NumberCruncher::NoneOf('0.4','0.5772','0.212');

$probSome = Math::NumberCruncher::SomeOf('0.11','0.56','0.3275');

$factorial = Math::NumberCruncher::Factorial($some_number);

$permutations = Math::NumberCruncher::Permutation($n);

$permutations = Math::NumberCruncher::Permutation($n,$k);

$roll = Math::NumberCruncher::Dice(3,12,4);

$randInt = Math::NumberCruncher::RandInt(10,50);

$randomElement = Math::NumberCruncher::RandomElement(\@array);

Math::NumberCruncher::ShuffleArray(\@array);

@unique = Math::NumberCruncher::Unique(\@array);

@a_only = Math::NumberCruncher::Compare(\@a,\@b);

@union = Math::NumberCruncher::Union(\@a,\@b);

@intersection = Math::NumberCruncher::Intersection(\@a,\@b);

@difference = Math::NumberCruncher::Difference(\@a,\@b);

$gaussianRand = Math::NumberCruncher::GaussianRand();

$ways = Math::NumberCruncher::Choose($n,$k);

$binomial = Math::NumberCruncher::Binomial($attempts,$successes,$probability);

$gaussianDist = Math::NumberCruncher::GaussianDist($x,$mean,$variance);

$StdDev = Math::NumberCruncher::StandardDeviation(\@array [, CW$decimal_places]);

$variance = Math::NumberCruncher::Variance(\@array [, CW$decimal_places]);

@scores = Math::NumberCruncher::StandardScores(\@array [, CW$decimal_places]);

$confidence = Math::NumberCruncher::SignSignificance($trials,$hits,$probability);

$e = Math::Numbercruncher::EMC2( m512, miles [, CW$decimal_places] );

$m = Math::NumberCruncher::EMC2( e987432 km [, CW$decimal_places] );

$force = Math::NumberCruncher::FMA( m12, a73.5 [, CW$decimal_places] );

$mass = Math::NumberCruncher::FMA( a43, f1324 [, CW$decimal_places] );

$acceleration = Math::NumberCruncher::FMA( f53512, m356 [, CW$decimal_places] );

$predicted_value = Math::NubmerCruncher::Predict( CW$slope, CW$y_intercept, CW$proposed_x [, CW$decimal_places] );

$area = Math::NumberCruncher::TriangleHeron( CW$a, CW$b, CW$c [, CW$decimal_places] );

$area = Math::NumberCruncher::TriangleHeron( 1,3, 5,7, 8,2 [, CW$decimal_places] );

$perimeter = Math::NumberCruncher::PolygonPerimeter( CW$x0,$y0, CW$x1,$y1, CW$x2,$y2, ... [, p$decimal_places]);

$direction = Math::NumberCruncher::Clockwise( CW$x0,$y0, CW$x1,$y1, CW$x2,$y2 );

$collision = Math::NumberCruncher::InPolygon( CW$x, CW$y, CW@xy );

@points = Math::NumberCruncher::BoundingBox_Points( CW$d, CW@p );

$in_triangle = Math::NumberCruncher::InTriangle( CW$x,$y, CW$x0,$y0, CW$x1,$y1, CW$x2,$y2 );

$area = Math::NumberCruncher::PolygonArea( 0, 1, 1, 0, 2, 0, 3, 2, 2, 3 [, p$decimal_places] );

$area = Math::NumberCruncher::CircleArea( CW$diameter [, CW$decimal_places] );

$circumference = Math::NumberCruncher::Circumference( CW$diameter [, CW$decimal_places] );

$volume = Math::NumberCruncher::SphereVolume( CW$radius [, CW$decimal_places] );

$surface_area = Math::NumberCruncher::SphereSurface( CW$radius [, CW$decimal_places] );

$years = Math::NumberCruncher::RuleOf72( CW$interest_rate [, CW$decimal_places] );

$volume = Math::NumberCruncher::CylinderVolume( CW$radius, CW$height [, CW$decimal_places] );

$volume = Math::NumberCruncher::ConeVolume( CW$lowerBaseArea, CW$height [, CW$decimal_places] );

$radians = Math::NumberCruncher::deg2rad( CW$degrees [, CW$decimal_places] );

$degrees = Math::NumberCruncher::rad2deg( CW$radians [, CW$decimal_places] );

$Fahrenheit = Math::NumberCruncher::C2F( CW$Celsius [, CW$decimal_places] );

$Celsius = Math::NumberCruncher::F2C( CW$Fahrenheit [, CW$decimal_places] );

$cm = Math::NumberCruncher::in2cm( CW$inches [, CW$decimal_places] );

$inches = Math::NumberCruncher::cm2in( CW$cm [, CW$decimal_places] );

$ft = Math::NumberCruncher::m2ft( CW$m [, CW$decimal_places] );

$m = Math::NumberCruncher::ft2m( CW$ft [, CW$decimal_places] );

$miles = Math::NumberCruncher::km2miles( CW$km [, CW$decimal_places] );

$km = Math::NumberCruncher::miles2km( CW$miles [, CW$decimal_places] );

$lb = Math::NumberCruncher::kg2lb( CW$kg [, CW$decimal_places] );

$kg = Math::NumberCruncher::lb2kg( CW$lb [, CW$decimal_places] );

$RelativeStride = Math::NumberCruncher::RelativeStride( CW$stride_length, CW$leg_length [, CW$decimal_places] );

$RelativeStride = Math::NumberCruncher::RelativeStride_2( CW$DimensionlessSpeed [, CW$decimal_places] );

$DimensionlessSpeed = Math::NumberCruncher::DimensionlessSpeed( CW$RelativeStride [, CW$decimal_places] );

$DimensionlessSpeed = Math::NumberCruncher::DimensionlessSpeed_2( CW$ActualSpeed, CW$leg_length [, CW$decimal_places]);

$ActualSpeed = Math::NumberCruncher::ActualSpeed( CW$leg_length, CW$DimensionlessSpeed [, CW$decimal_places] );

$eccentricity = Math::NumberCruncher::Eccentricity( CW$half_major_axis, CW$half_minor_axis [, CW$decimal_places] );

$LatusRectum = Math::NumberCruncher::LatusRectum( CW$half_major_axis, CW$half_minor_axis [, CW$decimal_places] );

$EllipseArea = Math::NumberCruncher::EllipseArea( CW$half_major_axis, CW$half_minor_axis [, CW$decimal_places] );

$OrbitalVelocity = Math::NumberCruncher::OrbitalVelocity( CW$r, CW$a, CW$M [, CW$decimal_places] );

$sine = Math::NumberCruncher::sin( CW$x [, CW$decimal_places] );

$cosine = Math::NumberCruncher::cos( CW$x [, CW$decimal_places] );

$tangent = Math::NumberCruncher::tan( CW$x [, CW$decimal_places] );

$arcsin = Math::NumberCruncher::asin( CW$x [, CW$decimal_places] );

$arccos = Math::NumberCruncher::acos( CW$x [, CW$decimal_places] );

$arctan = Math::NumberCruncher::atan( CW$x [, CW$decimal_places] );

$cotangent = Math::NumberCruncher::cot( CW$x [, CW$decimal_places] );

$arccot = Math::NumberCruncher::acot( CW$x [, CW$decimal_places] );

$secant = Math::NumberCruncher::sec( CW$x [, CW$decimal_places] );

$arcsec = Math::NumberCruncher::asec( CW$x [, CW$decimal_places] );

$cosecant = Math::NumberCruncher::csc( CW$x [, CW$decimal_places] );

$arccosecant = Math::NumberCruncher::acsc( CW$x [, CW$decimal_places] );

$exsecant = Math::NumberCruncher::exsec( CW$x [, CW$decimal_places] );

$versine = Math::NumberCruncher::vers( CW$x [, CW$decimal_places] );

$coversine = Math::NumberCruncher::covers( CW$x [, CW$decimal_places] );

$haversine = Math::NumberCruncher::hav( CW$x [, CW$decimal_places] );

$grouped = Math::NumberCruncher::Commas( CW$number );

$SqrRoot = Math::NumberCruncher::SqrRoot( CW$number [, CW$decimal_places] );

$square_root = Math::NumberCruncher::sqrt( CW$x [, CW$decimal_places] );

$root = Math::NumberCruncher::Root( 55, 3 [, CW$decimal_places] );

$root = Math::NumberCruncher::Root2( 55, 3 [, CW$decimal_places] );

$log = Math::NumberCruncher::Ln( 100 [, CW$decimal_places] );

$log = Math::NumberCruncher::log( CW$num [, CW$decimal_places] );

$num = Math::NumberCruncher::Exp( 0.111 [, CW$decimal_places] );

$num = Math::NumberCruncher::exp( CW$log [, CW$decimal_places] );

$Pi = Math::NumberCruncher::PICONST( CW$decimal_places );

$E = Math::NumberCruncher::ECONST( CW$decimal_places );

( CW$A, CW$B, CW$C ) = Math::NumberCruncher::PythagTriples( CW$x, CW$y [, CW$decimal_places] );

$z = Math::NumberCruncher::PythagTriplesSeq( CW$x, CW$y [, CW$decimal_places] );

@nums = Math::NumberCruncher::SIS( [$start, CW$numbers, CW$increment] );

$inverse = Math::NumberCruncher::Inverse( CW$number [, CW$decimal_places] );

@constants = Math::NumberCruncher::CONSTANTS( 'all' [, CW$decimal_places] );

$bernoulli = Math::NumberCruncher::Bernoulli( CW$num [, CW$decimal_places] );

@bernoulli = Math::NumberCruncher::Bernoulli( CW$num );

This module is a collection of commonly needed number-related functions, including numerous standard statistical, geometric, and probability functions. Some of these functions are taken directly from _Mastering Algorithms with Perl_, by Jon Orwant, Jarkko Hietaniemi, and John Macdonald, and others are adapted heavily from same. The remainder are either original functions written by the author, or original adaptations of standard algorithms. Some of the functions are fairly obvious, others are explained in greater detail below. For all calculations involving pi, the value of pi is taken out to 2000 places. Overkill? Probably, but it is better, in my opinion, to have too much accuracy as opposed to not enough. I've also included the value of Euler's e, g (Newton's gravitational constant), and the natural log of 2 out to 2000 places. These are available for export as CW$PI, CW$_e_, CW$_g_, and CW$_ln2_, respectively. In addition, via the CONSTANT() routine, the Golden Mean, Catalan constant, Apery constant, Landau-Ramanujan constant, Khintchine constant, Sierpinski constant, Wilbraham-Gibbs constant, Euler's gamma, square root of 2, square root of 3, and square root of 5 are pre-calculated to 2000 decimal places and are constructed only as requested by the user. See below for further details. Additionally, sqrt, sin, cos, log, and exp are suitable as drop-in replacements for the built-in functions of the same name. Usage is exactly the same, the only difference being the number of default decimal places is 20, and can be changed on the fly with each call. Further details below.

The default number of decimal places throughout is 20. This can be modified either by changing the value of CW$DECIMALS at the top of the NumberCruncher.pm file itself, or it can be changed for the duration of a given script by modifying CW$Math::NumberCruncher::DECIMALS. Or, where noted, you can specify a number of decimal places on a given call. For example, if you want the square root of two taken out to the default 20 decimal places, you can simply use: $root = Math::NumberCruncher::SqrRoot( 2 ). However, if you want to take the square root of two out to, say, 100 decimal places, you can use: $root = Math::NumberCruncher::SqrRoot( 2, 100 ).

The following functions are available for export: sqrt, sin, asin, cos, acos, tan, atan, cot, acot, sec, asec, csc, acsc, vers, covers, hav, log, exp. Where there is a function of the same name as a built-in function, the Math::NumberCruncher version is suitable as a drop-in replacement, allowing for a greater degree of accuracy. It should be noted, however, that the functions are potentially a good deal slower than the built-in functions, depending upon the complexity of the call. For a simple call, like the square root of 1111 taken out to 50 decimal places, the result is reasonably fast. For something like the 20th root of 123456789.9876543210000001, expect it to take substantially longer.

Returns the largest and smallest elements in an array.

Returns the mean, or average, of an array. Returns the median, or the middle, of an array. The median may or may not be an element of the array itself.

Returns the odd median, which, unlike the median, *is* an element of the array. In all other respects it is similar to the median.

Returns the mode, or most frequently occurring item, of CW@array.

Returns the covariance, which is a measurement of the correlation of two variables.

Returns the correlation of two variables. Correlation ranges from 1 to -1, with a correlation of zero meaning no correlation exists between the two variables. Returns the slope and y-intercept of the line of best fit for the data in question. Returns the Euclidian distance between two points. The above example demonstrates the use in two dimensions. For three dimensions, usage would be CW$distance = Math::NumberCruncher::Distance($x1,$y1,$z1,$x2,$y2,$z2);>

Modified two-dimensional distance between two points. As stated in _Mastering Algorithms with Perl_, Helicopter pilots tend to think in Euclidian distance, good New York cabbies tend to think in Manhattan distance. Rather than distance as the crow flies, this is distance based on a rigid grid, or network of streets, like those found in Manhattan.

The probability that all of the probabilities in question will be satisfied. (i.e., the probability that the Steelers will win the SuperBowl and that David Tua will win the World Heavyweight Title in boxing.)

The probability that none of the probabilities in question will be satisfied. (i.e., the probability that the Steelers will not win the SuperBowl and that David Tua will not win the World Heavyweight Title in boxing.)

The probability that at least one of the probabilities in question will be satisfied. (i.e., the probability that either the Steelers will win the SuperBowl or David Tua will win the World Heavyweight Title in boxing.)

The number of possible orderings of CW$factorial items. The factorial n! gives the number of ways in which n objects can be permuted.

The number of permutations of CW$n elements.

The number of permutations of CW$k elements drawn from a set of CW$n elements.

The obligatory dice rolling routine. Returns the result after passing the number of rolls of the die, the number of sides of the die, and any additional points to be added to the roll. As commonly seen in role playing games, 4d12+5 would be expressed as Dice(4,12,5). The function defaults to a single 6-sided die rolled once without any points added.

Returns a random integer between the two number passed to the function, inclusive. With no parameters passed, the function returns either 0 or 1.

Returns a random element from CW@array.

Shuffles the elements of CW@array and returns them.

Returns an array of the unique items in an array.

Returns an array of elements that appear only in the first array passed. Any elements that appear in both arrays, or appear only in the second array, are discarded.

Returns an array of the unique elements produced from the joining of the two arrays.

Returns an array of the elements that appear in both arrays.

Returns an array of the symmetric difference of the two arrays. For example, in the words of _Mastering Algorithms in Perl_, "show me the web documents that talk about Perl or about sets but not those that talk about both.

Returns one or two floating point numbers based on the Gaussian Distribution, based upon whether the call wants an array or a scalar value.

The number of ways to choose CW$k elements from a set of CW$n elements, when the order of selection is irrelevant.

Returns the probability of CW$k successes in CW$n tries, given a probability of CW$p. (i.e., if the probability of being struck by lightning is 1 in 75,000, in 100 days, the probability of being struck by lightning exactly twice would be expressed as Binomial('100','2','0.0000133'))

Returns the probability, based on Gaussian Distribution, of our random variable, CW$x, given the CW$mean and CW$variance. Returns the Standard Deviation of CW@array, which is a measurement of how diverse your data is. Returns the variance for CW@array, which is the square of the standard deviation. Or think of standard deviation as the square root of the variance. Variance is another indicator of the diversity of your data. Returns an array of the number of standard deviations above the mean for CW@array.

Returns the probability of how likely it is that your data is due to chance. The lower the confidence, the less likely your data is due to chance. Implementation of Einstein's E=MC**2. Given either energy or mass, the function returns the other. When passing mass, the value must be preceeded by a m, which may be either upper or lower case. When passing energy, the value must be preceeded by a e, which may be either upper or lower case. The second argument is whether you wish to use kilometers per second or miles per second for the speed of light. Case is irrelevant. EMC2() keys off of the first letter of the second argument, so all that is necessary to pass is either k or m. Implementation of the stadard force = mass * acceleration formula. Given two of the three variables (i.e., mass and force, mass and acceleration, or acceleration and force), the function returns the third. When passing the values, mass must be preceeded by a m, force must be preceeded by a f, and acceleration must be preceeded by an a. Case is irrelevant. Useful for predicting values based on data trends, as calculated by BestFit(). Given the slope and y-intercept, and a proposed value of x, returns corresponding y. Calculates the area of a triangle, using Heron's formula. TriangleHeron() can be passed either the lengths of the three sides of the triangle, or the (x,y) coordinates of the three verticies. Calculates the length of the perimeter of a given polygon. The final argument specifies the number of decimal places you want. To specify a number other than the default (see above), the number must be preceeded by the letter p. For example: Math::NumberCruncher::PolygonPerimeter( 1, 1, 2, 3, 4, 5, p75 ); Given three pairs of points, returns a positive number if you must turn clockwise when moving from p1 to p2 to p3, returns a negative number if you must turn counter-clockwise when moving from p1 to p2 to p3, and a zero if the three points lie on the same line. Given a set of xy pairs (@xy) that define the perimeter of a polygon, returns a 1 if point ($x,$y) is inside the polygon and returns 0 if the point ($x,$y) is outside the polygon. Given a set of CW@p points and CW$d dimensions, returns two points that define the upper left and lower right corners of the bounding box for set of points CW@p. Returns true if point CW$x,$y is inside the triangle defined by points ($x0,$y0), ($x1,$y1), and ($x2,$y2)

Calculates the area of a polygon using determinants. As with PolygonPerimeter(), the final argument specified the number of decimal places you want. See PolygonPerimeter(), above, for details. Calculates the area of a circle, given the diameter. Calculates the circumference of a circle, given the diameter. Calculates the volume of a sphere, given the radius. Calculates the surface area of a sphere, given the radius. A very simple financial formula. It calculates how many years, at a given interest rate, it will take to double your money, provided that the money and all interest is left in the account. Calculates the volume of a cylinder given the radius and the height. Calculates the volume of a cone given the lower base area and the height. Converts degrees to radians. Converts radians to degrees. Converts Celsius to Fahrenheit. Converts Fahrenheit to Celsius. Converts inches to centimeters. Converts centimeters to inches. Converts meters to feet. Converts feet to meters. Converts kilometers to miles. Converst miles to kilometers. Converts kilograms to pounds. Converts pounds to kilograms. Welcome to the world of ichnology. This was originally for a dinosaur simulation I have been working on. This and the following four routines are all part of determining the speed of a dinosaur (or any other animal, including people), based on leg measurements and stride measurements. Ichnology is study of trace fossils (i.e., nests, eggs, fossilized dung...seriously, that's not a joke), and in this case, fossilized footprints, or trackways. RelativeStride() is for determining the relative stride of the animal given stride length and leg length. This differs from the previous routine in that it calculates relative stride based on dimensionless speed, rather than stride and leg length. Dimensionless speed is a calculated value that relates the speed of an animal to leg length and stride length. This differs from the previous routine in that it calculates dimensionless speed based on actual speed and leg length. This is the really interesting one. Given leg length and dimensionless speed, it returns the actual speed (or absolute speed) of the animal in question in distance per second. There is no unit of measure conversion performed, so if you pass it measurements in meters, the answer is in meters per second. If you pass it measurements in inches, it returns inches per second, and so on. Calculates the eccentricity of an ellipse, given the semi-major axis and the semi-minor axis. Calculates the latus rectum of an ellipse, given the semi-major axis and the semi-minor axis. Calculates the area of an ellipse, given the semi-major axis and the semi-minor axis. Calculates orbital velocity of an object given the radial distance at a given point on an elliptical orbit, the mean distance of the central object, and the mass of the central object. Calculates the square root of a number out to an arbitrary number of decimal places. It should be noted that this method is potentially substantially slower than the built-in sqrt() function. However, especially with large numbers, this method is far more accurate. An alias for SqrRoot. This is exportable and is suitable as a drop-in replacement for the built-in sqrt() function. Calculates the N-th root of a given number using Newton's Method. In the above example, CW$root is the cube root of 55. Root() tends to be faster than Root2() when dealing with integers, or numbers with few decimal places. Calculates the N=th root of a given number using logarithms. In the above example, CW$root is the cube root of 55. Root2() tends to be faster than Root() when dealing with numbers containing multiple decimal places. Calculates the sine. This is available for export and is suitable as a drop-in replacement for the built-in sin() function. Calculates the cosine. This is available for export and is suitable as a drop-in replacement for the built-in cos() function. Calculates the tangent. Calculates the inverse sine. Calculates the inverse cosine. Calculates the inverse tangent. Calculates the secant. Calculates the inverse secant. Calculates the cosecant. Calculates the inverse of the cosecant. Calculates the exsecant. Calculates the cotangent. Calculates the inverse cotangent. Calculates the versine. Calculates the coversine. Calculates the haversine. Performs digit grouping, making large number more visually pleasing. Calculates the natural log of a given number to a given number of decimal places. An alias for Log(). This is exportable and is suitable as a drop-in replacement for the built-in log() function. Performs the inverse of Ln(). An alias for Exp(). This is exportable and is suitable as a drop-in replacement for the built-in exp() function. Calculates Pi out to an arbitrary number of decimal places. Math::NumberCruncher has Pi pre-calculated out to 2000 decimal places. If you want more decimal places than 2000, be advised that this can take a non-trivial length of time. Calculaes Euler's number e out to an arbitrary number of decimal places. Math::NumberCruncher has e pre-calculated out to 2000 decimal places. If you want more decimal places than 2000, be advised that this can take a non-trivial length of time. Calculates Pythagorian Triples based on the two numbers passed. Remember Pythagorian Triples are three numbers where the sum of the squares of the first two numbers is equal to the square of the third. Completes the Pythagorian Triple sequence based on the two numbers passed. Returns an array of numbers in a super-increasing sequence. All parameters are optional. You can pass the number with which you want the sequence to start, the quantity numbers you want returned, and by how much you want to increase the next number over the sum of all of the previous numbers. By default, start is 1, numbers returned is 50, and increment is 1. Returns the inverse of a given number. A variety of relatively common constants pre-calculated out to 2000 decimal places. For backwards compatibility, CW$PI, CW$_e_, and CW$_g_ will always be available without invoking CONSTANTS(), but all future pre-calculated constants will be available through here. The constants can be called individually by name, or you can specify 'all' and have all available constants returned as an array. The available constant names are '_gm_' (Golden Mean); '_catalan_' (Catalan constant); '_apery_' (Apery constant); '_landau_' or '_ramanujan_' (Landau-Ramanujan constant); '_khintchine_' (Kintchine constant); '_sierpinski_' (Sierpinski constant); '_wilbraham_' or '_gibbs_' (Wilbraham-Gibbs constant); '_gamma_' (Euler's constant, gamma); '_sqrt2_' (square root of 2); '_sqrt3_'(square root of 3); '_sqrt5_' (square root of 5). For example: CW$gamma = Math::NumberCruncher::CONSTANT( '_gamma_', 75 ) will return Euler's constant, gamma, out to 75 decimal places. Bernoulli numbers according to the modern definition, sometimes called the even-index Bernoulli numbers. The first 498 Bernoulli numbers are cached. Only even numbers can be passed to Bernoulli(). Odd numbers, negative numbers, or numbers less than 2 return undef. Bernoulli() can be called in either scalar or list context. In scalar context, it returns the value. In list context, it returns the two numbers which, when the first is divided by the second, yields the same value as that given in scalar context.

Kurt Kincaid, sifukurt@yahoo.com

Copyright (c) 2002, Kurt Kincaid. All rights reserved. This code is free software; you can redistribute it and/or modify it under the same terms as Perl itself. Several of the algorithms contained herein are adapted from _Mastering Algorithms with Perl_, by Jon Orwant, Jarkko Hietaniemi, and John Macdonald. Copyright (c) 1999 O-Reilly & Associates, Inc.

Thanks to Douglas Wilson for allowing me to borrow his code for Ln(), Exp(), Root2(), and the various other supporting functions. Mr. Wilson's code is based on an algorithm described at <http://www.geocities.com/zabrodskyvlada/aat/>

I would also like to thank the folks at <http://www.perlmonks.org> for their input on optimizing BIRoot().

perl(1).