Computer Science Canada prime number detector |
Author: | Nick [ Tue Sep 25, 2007 4:40 pm ] | ||
Post subject: | prime number detector | ||
I was bored so i made this
it tells you if the inputted number is a prime number and if not then it outputs all the possiblities to get the number via multiplacation |
Author: | Tony [ Tue Sep 25, 2007 6:48 pm ] |
Post subject: | Re: prime number detector |
momop @ Tue Sep 25, 2007 4:40 pm wrote: all the possiblities to get the number via multiplacation
Those are called factors ![]() |
Author: | Nick [ Tue Sep 25, 2007 6:50 pm ] |
Post subject: | Re: prime number detector |
lmao whatever it works and i forgot the name ![]() pps i made this program in like 5 mins tops so if theres any errors... well it was bound to happen |
Author: | Cervantes [ Tue Sep 25, 2007 7:17 pm ] |
Post subject: | RE:prime number detector |
That's called self-handicapping, and that's a bad thing. |
Author: | HeavenAgain [ Tue Sep 25, 2007 7:18 pm ] |
Post subject: | RE:prime number detector |
theres no need to rush how about try making this code more efficient? whats the difference between 1x10 and 10x1? so why bother making your 2nd loop run from the beginning again? and another small thing, 1 or anything lower are not prime numbers ![]() |
Author: | Nick [ Tue Sep 25, 2007 7:21 pm ] |
Post subject: | RE:prime number detector |
oh yea... i forgot to run the loop from 2... whoops anyways Cervantes i usually don't make mistakes and when i do i can usually spot them and fix em easily i was just making a joke |