Home Research Java Applets Problems Links Books Guest Book Contact Topics: Polyominoes Egyptian Fractions Graceful Graphs 16 Puzzle Chess Tours Non-Euclidian Geometry Monty Hall Problem Block Swapping Problem Tic Tac Toe Poker Bad Beats How To Become A Millionaire
search by FreeFind
Polyominoes Home Kevin's Math Blog Kevin's Home Page
This is a Java applet which computes prime numbers in a very brain-dead way. It simply goes one number at a time, then sees if it's divisible by 2, 3, 5, 7, 9, 11, 13, etc. Maybe I'll put a faster Java applet up here later.
