Hello everybody ..
This is the first time i post on to daniweb for a favour.
Am just proceeding with a math contest.
in general say n , need the catalan series with formula 2n!/(n!*(n+1)!) . i am in need of the answer for n=1000.
I thought cud try this in java with the help of bigint. but in vain .. the answer might near 600 digits.. can someone help me ?
Thanx in advance
inilahs
0
Newbie Poster
Recommended Answers
Jump to PostAFAIK BigInteger will handle as many digits as you have memory for, certainly 600 is OK.
Jump to PostNo way.
BigInteger stores the number in normal binary form, using an array of ints big enough to hold all the bits for the number. At approx 10 decimal digits for each int, your 600 digit number only needs array approx int[60]. I don't think 240 bytes is going to …
All 5 Replies
JamesCherrill
4,733
Most Valuable Poster
Team Colleague
Featured Poster
inilahs
0
Newbie Poster
JamesCherrill
4,733
Most Valuable Poster
Team Colleague
Featured Poster
inilahs
0
Newbie Poster
JamesCherrill
4,733
Most Valuable Poster
Team Colleague
Featured Poster
Be a part of the DaniWeb community
We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.