20-CS-472 Design and Analysis of Algorithms 2 Winter 2011

Complexity classes, Divide-and-Conquer, Dynamic Programming, Greedy, Matroids, more

Try to find a generator for a group. Select a number n from the drop box on the left. Select a number from the horizontal list of numbers, all of which are prime relative to n. Click the Multiply button and watch boxes turn yellow. Each is nk for some k (given by the count textfield). A generator has been found if many clicks on Multiply turn all gray boxes to yellow. Use the reset button to try another generator.