Divisors

This program is designed for bringing joy to Math Study. Kids effectively learn mathematics due to quiz-oriented learning accompanied by friendly natural animals and/or worms. As a whole inclusive hardle, the comprehensive game of Space Tour, touring and finding various planets and the...


Platforms: Windows

Amicable numbers are two different numbers so related that the sum of the proper divisors of the one is equal to the other, one being considered as a proper divisor but not the number itself. Such a pair is (220, 284); for the proper divisors of 220 are 1, 2, 4, 5, 10, 11, 20, 22, 44, 55 and 110,...


Platforms: Matlab

divisor(n) : row vector of all distinct divisors of a positive integer N, including 1 and N.Remark: This function uses the default factor() routine in Matlab and hence is limited to input values up to 2^32. However if factor() routine does get updated for larger integers, this function will still...


Platforms: Matlab

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...


Platforms: *nix

SQLMath extends the T-SQL scripting environment so you can perform mathematical operations on your data from within the database itself. This tends to be much faster and more efficient than transporting the data across the network to a client application, and also allows simpler and cleaner...


Platforms: Windows

Children can effectively learn math with friendly natural animals and/or worms. The comprehensive game of Space Tour, touring among various planets and the experience to fly over the surface of the earth, is provided. The players on the way encounter the hazards such as space dragons to block the...


Platforms: Windows

Prime95 is a program designed to be used to find Mersenne Prime numbers. Mersenne numbers can be proved composite (not prime) by either finding a factor or by running a Lucas-Lehmer primality test. Prime numbers have long fascinated amateur and professional mathematicians. An integer greater...


Platforms: Windows

Euler_Phi.zip is a suite of the foll Programmes :1) Euler_Phi (n) returns the no of positive integers less than n which are prime to n.2) a_k_mod_m_LCM_Method (a, m, k) : Imagine computing mod(14^26, 45) or mod(56^3005, 1125).This programme computes a_k_mod_m = mod (a^k, m) when a and m are...


Platforms: Matlab

NFACTORK All integer factorings of integer N which have K elements.T = NFACTORK(N,K) returns an array which has K columns such that all(prod(T,2)==N) is true. Examples: T = nfactork(24,3) % produces T = 1 1 24 1 2 12 1 3 8 1 4 6 2 2 6 2 3 4 such that: all(prod(T,2)==24) % True T =...


Platforms: Matlab