Oh my God! :Large Prime number
4 posters
Oh my God! :Large Prime number
How will you compute large numbers like this :-
Constraint: Language to be used (C/C++) with normal usages(I mean every syntax should be basic.)
28433 × 2^7830457 + 1 (Actually this is a 2 million digit prime number discovered in 2004)
Constraint: Language to be used (C/C++) with normal usages(I mean every syntax should be basic.)
28433 × 2^7830457 + 1 (Actually this is a 2 million digit prime number discovered in 2004)
Beagle- Posts : 40
Join date : 2009-01-30
Re: Oh my God! :Large Prime number
i think its better to store it,just like u have written.
saves a lot of space .
saves a lot of space .
ramthegreatcv- Posts : 55
Join date : 2009-01-30
Age : 36
Re: Oh my God! :Large Prime number
are you telling the same thing that we did for LR... frequency array.[:?]
Beagle- Posts : 40
Join date : 2009-01-30
Re: Oh my God! :Large Prime number
yes, similar kind of thing.in terms of other prime numbers smaller than that.
--ramprasad
--ramprasad
Re: Oh my God! :Large Prime number
i am just saying that store it as an expression: 28433 × 2^7830457 + 1
Permissions in this forum:
You cannot reply to topics in this forum