Free number 23 software for linux

Tree::Numbered is a thin N-ary tree structure with a unique number for each item.

SYNOPSYS

use Tree::Numbered;
my $tree = Tree::Numbered->new(John Doe);
$tree->append(John Doe Jr.);
$tree->append(Marry-Jane Doe);

while (my $branch = $tree->nextNode) {
$branch->delete if ($branch->getValue eq Stuff I dont want);
}

my $itemId = what_the_DB_says;
print join --- , $tree->follow($itemId); # a list of items up to itemId.

$tree->allProcess( sub {
my $self = shift;
$self->getValue =~ /^(S*)/;
$self->addField(FirstName, $1);
} );

etc.

Tree::Numbered is a special N-ary tree with a number for each node. This is useful on many occasions. The first use I found for that (and wrote this for) was to store information about the selected item as a number instead of storing the whole value which is space-expensive.

Every tree also has a lucky number of his own that distinguishes it from other trees created by the same module. This module is thin on purpose and is meant to be a base class for stuff that can make use of this behaveiour. For example, I wrote Tree::Numbered::DB which ties a tree to a table in a database, and Javascript::Menu which uses this tree to build menus for websites.

One more feature that the module implements for the ease of subclassing it is an API for adding and removing fields from trees and nodes.

Number::Latin is a Perl module that can convert to/from the number system "a,b,...z,aa,ab..."

SYNOPSIS

use Number::Latin;
print join( , map int2latin($_), 1 .. 30), "n";
#
# Prints:
# a b c d e f g h i j k l m n o p q r s t u v w x y z aa ab ac ad

Some applications, notably the numbering of points in outlines, use a scheme that starts with the letter "a", goes to "z", and then starts over with "aa" thru "az", then "ba", and so on. (The W3C refers to this numbering system as "lower-latin"/"upper-latin" or "lower alpha"/"upper alpha", in discussions of HTML/CSS options for rendering of list elements (OL/LI).)

This module provides functions that deal with that numbering system, converting between it and integer values.

FUNCTIONS

This module exports four functions, int2latin, int2Latin, int2LATIN, and latin2int:

$latin = int2latin( INTEGER )

This returns the INTEGERth item in the sequence (a .. z, aa, ab, etc). For example, int2latin(1) is "a", int2latin(2) is "b", int2latin(26) is "z", int2latin(30) is "ad", and so for any nonzero integer.

$latin = int2Latin( INTEGER )

This is just like int2latin, except that the return value is has an initial capital. E.g., int2Latin(30) is "Ad".

$latin = int2LATIN( INTEGER )

This is just like int2latin, except that the return value is in all uppercase. E.g., int2LATIN(30) is "AD".

$latin = latin2int( INTEGER )

This converts back from latin number notation (regardless of capitalization!) to an integer value. E.g., latin2int("ad") is 30.

Scalar::Number is a Perl module with numeric aspects of scalars.

SYNOPSIS

use Scalar::Number qw(scalar_num_part);

$num = scalar_num_part($scalar);

use Scalar::Number qw(sclnum_is_natint sclnum_is_float);

if(sclnum_is_natint($value)) { ...
if(sclnum_is_float($value)) { ...

use Scalar::Number qw(sclnum_val_cmp sclnum_id_cmp);

@sorted_nums = sort { sclnum_val_cmp($a, $b) } @floats;
@sorted_nums = sort { sclnum_id_cmp($a, $b) } @floats;

This module is about the numeric part of plain (string) Perl scalars. A scalar has a numeric value, which may be expressed in either the native integer type or the native floating point type. Many values are expressible both ways, in which case the exact representation is insignificant. To fully understand Perl arithmetic it is necessary to know about both of these representations, and the differing behaviours of numbers according to which way they are expressible.
This module provides functions to extract the numeric part of a scalar, classify a number by expressibility, and compare numbers across representations.

Number::Interval is a Perl module that can implement a representation of a numeric interval.

SYNOPSIS

use Number::Interval;

$i = new Number::Interval( Min => -4, Max => 20);
$i = new Number::Interval( Min => 0 );

$is = $i->contains( $value );
$status = $i->intersection( $i2 );

print "$i";

Simple class to implement a closed or open interval. Can be used to compare different intervals, determine set membership, calculate intersections and provide default stringification methods.

Intervals can be bound or unbound. If max is less than min the interval is inverted.

Number::WithError is a Perl module that contains numbers with error propagation and scientific rounding.

SYNOPSIS

use Number::WithError;

my $num = Number::WithError->new(5.647, 0.31);
print $num . "n";
# prints 5.65e+00 +/- 3.1e-01
# (I.e. it automatically does scientific rounding)

my $another = $num * 3;
print $another . "n";
# propagates the error assuming gaussian errors
# prints 1.69e+01 +/- 9.3e-01

# trigonometric functions also work:
print sin($another) . "n";
# prints -9.4e-01 +/- 3.1e-01

my $third = $another ** $num;
print $third. "n";
# propagates both errors into one.
# prints 8.7e+06 +/- 8.1e+06

# shortcut for the constructor:
use Number::WithError witherror;
$num = witherror(0.00032678, [2.5e-5, 3e-5], 5e-6);
# can deal with any number of errors, even with asymmetric errors
print $num . "n";
# prints 3.268e-04 + 2.5e-05 - 3.00e-05 +/- 5.0e-06
# Note: It may be annyoing that they dont all have the same
# exponent, but they *do* all have the sam significant digit!

This class is a container class for numbers with a number of associated symmetric and asymmetric errors. It overloads practically all common arithmetic operations and trigonometric functions to propagate the errors. It can do proper scientific rounding (as explained in more detail below in the documentation of the significant_digit() method).

You can use Math::BigFloat objects as the internal representation of numbers in order to support arbitrary precision calculations.

Errors are propagated using Gaussian error propagation.

With a notable exception, the test suite covers way over ninety percent of the code. The remaining holes are mostly difficult-to-test corner cases and sanity tests. The comparison routines are the exception for which there will be more extensive tests in a future release.

MaklerPlus is a Web based application for real estate business. It can be used to administrate real estates with an unlimited number of illustrations per object.

MaklerPlus includes a smart content management system.

Math::Numbers is a Perl module that contains methods for mathematical approaches of concepts of the number theory.

SYNOPSIS

use Math::Numbers;

my $a = 123;
my $b = 34;

my $numbers = Math::Numbers->new($a, $b [, ...]);

print "They are coprimes (relatively primes)!n" if $numbers->are_coprimes;
print "The greatest common divisor of these at least two numbers is ", $numbers->gcd;

my $number = Math::Numbers->new($a);

print "It is prime!n" if $number->is_prime;

my @divisors = $number->get_divisors;

print "$a is divisor of $b!n" if $number->is_divisor_of($b);

Math::Numbers is quite a simple module on matters of programming. What its interesting is the focus and approach it is intended to be made from the Number Theory basis for Perl beginners (like me) and also for young mathematicians (like me).

The normal topics of Number Theory include divisibility, prime numbers (which is separately intended to be covered by Math::Primes), congruences, quadratic residues, approximation for Real numbers, diophantine equations, etc. and all this is intended to be convered by the module on the concept on getting and setting values and also retriving the proof methods.

METHODS

new

# Some methods require more than only one argument.
my $numbers = Math::Numbers->new($p, $q, ...);

# Some methods require only one.
my $number = Math::Numbers->new($p);

Create a Math::Numbers object. Note that some of the methods will require objects created with only one or a defined numbers of arguments.

gcd
my $gcd = $numbers->gcd;

Calculation of the Greatest Common Divisor. This is made by two different methods which are described below: Blutos algorithm and Euclidean algorithm: The former is used when computing GCD for more than two integers; the latter is used when getting the GCD for two numbers to improve speed. See below for information on each.

Bluto_algorithm

You will mostly not require to call this method, but directly gcd(). Blutos algorithm uses a brute force calculation used by mathematicians to get divisors and then GCD also called Primality Test. Bluto takes some spinaches stolen from Popeye and starts dividing m all the way through 2 to m/2.

Euclidean_algorithm

Euclid rocks. I have a very nice Budgerigar (http://en.wikipedia.org/wiki/Budgerigar) called the same in honor of him (have to upload a pic of him).

As of now, this algorithm is only computed on two integers. From the Wikipedia entry: Given two natural numbers a and b: check if b is zero; if yes, a is the gcd. If not, repeat the process using (respectively) b, and the remainder after dividing a by b. This is exactly what our method does.
is_divisor_of

print "Yes, $p is divisor of $a...n" if $number->is_divisor_of($a);

Lets see if the number from the object is a divisor of $a, which means that the division $number/$a will return an integer (not necesarily a natural). If it does, itll return 1; 0, otherwise.

get_divisors
my @divisors = $number->get_divisors;

What are the divisors of the number brought by the object? This only includes the Natural numbers.

is_prime
print "$p is not prime!n" unless $number->is_prime

Returns 0 or 1 if the number from the object is prime or not, respectively. This method uses the, a bit slow, primality test.

are_coprimes
print "They are coprimes because their GCD is 1!n" if $numbers->are_coprimes;

Are the numbers from the object coprimes (relatively primes)? This means, the GCD is 1; (a, b, c, ...) = 1. Returns 1 or 0.