Free winning numbers software for linux

Linux Letters and Numbers project is an educational childrens game for linux.
Linux Letters and Number is a fun and educational learning game intended for children 2 and up.
It helps children learn or improve their letters, numbers, spelling, and vocabulary skills through the use of interesting pictures.
It also helps them develop important computer skills too.
It is written in C using the GTK and GDK_Imlib libraries.
Main features:
- Extensible - add new images yourself without having to make changes to the program. With support for gdk_imlib, you can now use common image formats, including common formats like gif, jpeg, xpm, png, and tiff.
- Dynamic - each letter or number can be represented by numerous pictures, each being displayed randomly.
- Flexible - you can even have more than one picture for a given word, by using a simple versioning scheme (ie Apple.1.xpm, Apple.2.xpm)
- Interesting - because you can change the game, its different every time!

isdnMonitor saves call information (number, name, connection, and duration) in a MySQL database.

The project does inverse searches for German phone numbers, enables notifying clients via the Windows/SMB messaging service, and displays caller names on an LCD display via LCDproc.

Convert::Number::Digits is a Perl module that convert Digits Between the Scripts of Unicode.

SYNOPSIS

use utf8;
require Convert::Number::Digits;

my $number = 12345;
my $d = new Convert::Number::Digits ( $number );
print "$number => ", $d->toArabic, "n";

my $gujarti = $d->toGujarti;
my $khmer = reverse ( $d->toKhmer );
$d->number ( $khmer ); # reset the number
print "$number => $gujarti => ", $d->number, " => ", $n->convert, "n";

The Convert::Number::Digits will convert a sequence of digits from one script supported in Unicode, into another. UTF-8 encoding is used for all scripts.

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.

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.

Lingua::ID::Nums2Words is a Perl module to convert number to Indonesian verbage.

SYNOPSIS

use Lingua::ID::Nums2Words ;

print nums2words(123) ; # "seratus dua puluh tiga"
print nums2words_simple(123) ; # "satu dua tiga"

nums2words currently can handle real numbers in normal and scientific form in the order of hundreds of trillions. It also preserves formatting in the number string (e.g, given "1.00" nums2words will pronounce the zeros).

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.

GetRSS is a shell script which displays and interacts with RSS feeds. It accepts urls, and supports bookmarks.
Enhancements:
- Added bookmark listing
- Aligned version numbers