Ask your own question, for FREE!
Mathematics 10 Online
OpenStudy (across):

This one should be fun: http://dl.dropbox.com/u/12189012/fact.html

OpenStudy (anonymous):

2 137 577 22689565741

OpenStudy (savvy):

it's prime.... ;)

OpenStudy (across):

Where did you get those numbers from? And it's not a prime number.

OpenStudy (savvy):

are you actually serious about solving that....????

OpenStudy (anonymous):

I use some algorithms online

OpenStudy (across):

I guess you're right: this website is not a serious place. :)

OpenStudy (across):

Your algorithms are wrong because the number ends in 7, yet you say that it's divisible by 2. :P

OpenStudy (savvy):

actually this is a nyc place but that no. is a bit too large to solve...

OpenStudy (anonymous):

oh yea......so it should be only itself...

OpenStudy (across):

This number has only two factors.

OpenStudy (anonymous):

yes.....got it

OpenStudy (savvy):

then they have to be 1 and itself and hence its prime...

OpenStudy (across):

I already said that the number is not prime!

OpenStudy (savvy):

then how can it have ONLY 2 factors.....1 and itself have to be compulsory factors....

OpenStudy (across):

With two factors, I obviously meant to state proper ones (and excluding 1).

OpenStudy (across):

Otherwise, the problem would've been trivial, no? ;P

OpenStudy (savvy):

with such a LARGE no. the problem can never be a trivial one.....

OpenStudy (zarkon):

2158122193002952449690243008233157266924190689, 24058327474941875553768074062128402939746847713

OpenStudy (across):

I said that the problem would have been trivial if it had been a prime.

OpenStudy (across):

Zarkon, how did you do that? ;P

OpenStudy (across):

I wonder if you wrote a program.

OpenStudy (zarkon):

I'm part machine.

OpenStudy (apoorvk):

so, how do we 'solve' this? o.O

OpenStudy (sasogeek):

i'm going to write a program to solve this :) and yes, should be fun :D

OpenStudy (anonymous):

Not just any program, we need a very fast prime factorization algorithm is required. If you are very confident about your algorithm , you may consider testing it here:www.spoj.pl/problems/FACT2/

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!