Its really easy to use. Due to the limitation in computational power of scratch, any number above and around about 6 digits long will take program ages or practically forever to finish. This little program finds the number of connections that exist in a group of objects (the number of which you decide) where each object is connected to all the other ones.
Try putting in the same number but increasing number of digits of it. For example: 9, 99, 999, 9999, 99999... You will find an interesting pattern! For a large number of connections, scratch will output a number in e notation (ne+x = n*(10^x)). You can also put e notation in as the number of objects, and with x above 100, this can give you a number of connections to great for scratch to handle, resulting in "infinity connections" which is not actually true, the number is just too large.
