What's the question?

Im calculating that number by paper now using the prime factors of all the numbers. The answer will already be over a trillion though. The smallest number divisible by all will be huge!

Nice, I'm in the process of finding factorials without computer assistance because... why not? I'll write a program though to find Euler's number just as a test of my skills... Is the second question still out there? Supposedly the resulting link was taken down...

I tried to program this in C just a minute ago, but it seems my compiler isn't working properly. It asked me over and over to compile the source again, thinking it wasn't already compiled. It only stopped when I clicked don't compile again... Oh well, I'll try again soon! ;)

Also, the number I'm going for has to follow these rules: -It ends in 0, making it divisible by 2, 5, and 10. -The two digits before the zero will form a number divisible by 4, resulting in it being divisible by 4, 8, 20, and 40. -The sum of the digits is 9, making it divisible by 3, 6, 9, and 18. (6 and 18 because it's even)

Yep. I tried making the program automatically test a bunch of numbers for divisibility by all under 100, but it made it to 75,000,000 and still got nothing!

Also, just a hint, some of those colors are very hard to see on that background! Might want to either make a slightly brighter background or use brighter colored text. You may miss some factors if it tells you the factors creating a new line each time, too.

I also was planning on making a way to see all the factors using a scroll-through list, also remember that there's no point in making it say a number is divisible by one number AND another, except to show what two must multiply. The number will occur later anyways. (360 is divisible by 2 and 180, but 180 would come up later anyways)

Nice, the visuals are a lot more impressive. I wasn't trying to go all out with this, and yes it doesn't include 1 or itself because those aren't exactly factors are they? That's what makes 1,2,3,5, and 7 all prime numbers for example.

Maybe I should just modify the code to try with every multiple of 990, which is divisible by 2,3,5,6,9,10,99, and a few others. 990 is the smallest number divisible by 99 and 10, so this should yield the smallest...

Using a simple program I quickly wrote, I'm trying to find the smallest possible number divisible by everything under 100! 360360 only works consecutively up to 16, but wow! 190 factors!

Oh, just saw your previous post. There's no way you put the time into finding the exact pixels and colors of each of those! Or did you write a program to generate the code?

Woah! All those individual GPSETs! What for?!

Been a while, haven't touched this in at least a month, but while bored in mathematics class, I made a small, simple program that finds any whole factors of a number and saves them, on a TI-83. It took two hours for it to get the same result shown here!

I'd be glad... Grammar failures, even I make them when typing.

If you'd like my help, I'd glad to give you some pointers, although I've already got another update for one of my games in progress, so I don't really think I'd like to do a collaborative project quite yet.

Also, so far I believe I've fixed Reflector-AI enemies (red circles and blue parallelograms) not spawning going to the center of the screen, enemies spawning very close to the actual screen on upper screen setting, and the bug shown on the post above.

Well, in the default controls setting you use the top screen with the stylus, problem is with the touch screen you can only go so far, so you can't reach the other 80 pixels of the top screen. Other than that, if you use circle pad controls you can go all the way across, and enemies always can.

If you don't already have the game, the key is B2KXCW3E.

Oh noes! Looks like I found a bug in 1.0.1 already. After retrying a game after failing with the gameplay screen set to the touch screen, the borders are drawn on the wrong page. I'll keep an eye out, and roll out a 1.0.2 patch soon. Report any bugs in POLYGON's latest update here, much appreciated!