Bigint problems

[Cho]

Can someone show me some problems which need to be solved with bigint * or / or % bigint? or even bigint power mod?

[stubbscroll]

This is a list I made by searching through my hard disk for calls to bigint *, /, % and pow operations. Some problems might be possible to solve using only +, - or long long (or maybe I missed the correct way to solve it, without big numbers).

239 Tempus et mobilius, time and motion
254 Towers of Hanoi
288 Arithmetic operations with large integers
324 Factorial frequencies
338 Long multiplication
367 Halting factor replacement systems
504 Random number
560 Magic
619 Numerically speaking
623 500!
748 Exponentiation
787 Maximum sub-sequence product
10007 Count the trees
10023 Square root
10070 Leap year or not leap year and...
10106 Product
10176 Ocean deep! - make it shallow!!
10213 How many pieces of land?
10220 I love big numbers!
10303 How many trees?
10359 Tiling
10494 If we were a child again
10519 !! Really strange !!
10521 Continuously growing fractions
10523 Very easy!!!
10527 Persistent numbers
10606 Opening doors
10658 ReArrange
10814 Simplifying fractions
10836 The maximum term
10862 Connect the cable wires

I'm sure that someone who's solved more of volume 100-107 than me can add a lot of problems to this list.

[Cho]

woh.. a long list, thank you.

[roticv]

Hi,

Can someone tell me how to code a bigint verison of square root for 10023. Seems like not much people knows how to do that.

[little joey]

Take a look at http://en.wikipedia.org/wiki/Square_root; there's plenty of information.
I used Pell's equation for this problem for a reasonable time.

[roticv]

Thanks alot!

[meaga]

10183 is also a bigint problem with ranges to 10^100.
10198 a counting a problem.
have fun

[Helaluddin_brur]

Removed after accepted