You might recall in the last post the expansion of a general binomial : binexpand[z_] := Expand[(a + b)^z] TableForm[Array[binexpand,6]] You can also declare a loop in the way Mathematica does so that it gives a series of binomial expansions. Continue Reading
I have recently joined GIMPS, and have installed their prime search software on two of my computers. Their website is at: mersenne.org.
Since the last time I posted, I found a better way to do 100 dice rolls: This gives 100 dice rolls in a tabulated format in a much simpler syntax. You can also make a “die” out of complex numbers, Continue Reading
Yes, I’m still obsessed with prime numbers. I wrote a C program this time that can list or count prime numbers in a certain range, or do both. The C program is pretty fast, but in terms of large numbers, Continue Reading
INTRODUCTION The prime numbers are numbers which are divisible only by itself and 1. This means that all primes have two factors, so for that reason, “1” is not prime. OBSERVATIONS The first 100000 integers seems to have the greatest Continue Reading