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!

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...

Funny thing is... I made a program JUST like it. It is very impressive. (Made it in my first few days of coding) [7XEQ33KJ]

(Proof that it works) The factors go by page. Also, my program might be including 360360 itself or 1, thats why it says one more than yours.

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.

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)

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.

Thanks for the advice, like I said I made it just for fun near my begining days.

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!

Hmm, do RND(98)+2 because the program automatically changes it if the number is < 2 or > than like 9999999.

Responding to your previous post, a composite number is a positive integer that can be formed by multiplying 2 smaller positive integer. It also has one divisor OTHER than 1 and itself. Basically, you should include 1 and the number because they are factors.

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)

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! ;)

You should use that to solve the google billboard challenge I've already solved q1 using a java program i made that does pretty much the same thing as that

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 wrote a simple program to get the numbers that match those criteria! (Ends in 0, 2 didgits before 0 make a number divisible by 4, and sum of didgits is 9)

Whoops, there was an error in the program. Fixed it now.

Again, there was an error in the previous code.

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!

I wouldn't have enough patience to do that on paper. You are extremely patient. Also I don't know if the second one has been taken down yet, I am still in the process of solving it

What's the question?

The first question is {the firsrt ten digit number found in consecutive digits of e}.com. And the second question is: f(1)=7182818284 f(2)=8182845904 f(3)=8747135266 f(4)=7427466391 f(5)=______________

Strange...

Just a btw, botn of those questions are solved.

Looks like this number divisible by everything to 100 will have at least 40 digits, then I'll make a program with C to verify its the smallest one possible once I multiply the numbers together. I have to multiply a 26 digit number by a 15 digit one!

Hmmmm... I think my TI-83 may be messing up the results because of the size of the number, but according to the factor finder program I made, 950511799137600 has all the numbers under 100 as it's factors? I'll have to verify that though.

Its not it's!

According to my phone's calculator, that number is not wholly divisible by 11 already. So it looks like I still have to multiply those numbers!