## Chip Abacus

With this Java manipulative, you can represent place value and exchanges in base 2, base 5, or base 10.
http://nlvm.usu.edu/en/nav/frames_asid_209_g_1_t_1.html?open=activities&...

## Base Blocks

A Java applet that illustrates addition and subtraction in a variety of bases.
http://nlvm.usu.edu/en/nav/frames_asid_152_g_1_t_1.html?from=category_g_...

## Sieve of Eratosthenes

This virtual manipulative displays a number grid containing numbers from 2 to 200. You can use it to explore patterns and relationships involving multiples.
http://nlvm.usu.edu/en/nav/frames_asid_158_g_1_t_1.html?open=instruction...

## Tower of Hanoi

The Tower of Hanoi puzzle is an engaging and challenging problem for middle school students and an application of exponential functions. It also is the setting for an elegant proof by mathematical induction that the minimum number of moves M to move n disks from one disk to another is given by M = 2^n - 1.

Here is a Java implementation of the same puzzle.
http://nlvm.usu.edu/en/nav/frames_asid_118_g_3_t_2.html?open=instruction...