a huge integer power 3 power n

[Thomas Brouard]

Hi,

Thanks for this answer. Yeah, that’s what I want, I want to know how should I write the program if I may.

I would love to know how to use libm. I don’t know what it is.

I would love that it could be possible for me up to n=19. I don’t know. I would appreciate your help up to 18.

May I know your configuration?

What should I buy to make it possible until 20? 

How to store a 1 000 000 000 digits integer and how to store a 100 000 000 digits integer? Who can I ask for this?

Thanks again.

Tom

> On 28 Aug 2016, at 21:46, Torbjörn Granlund <tg at gmplib.org> wrote:
> 
> James Cloos <cloos at jhcloos.com> writes:
> 
>  He seems to want pow(huge_int,pow(3,n)) (but using gmp instead of libm).
> 
> Well, that should be straightforward to do from a manual read, at least
> if huge_int is not terribly hard to compute.
> 
> But of course such an expression grows pretty quickly with n.  It will
> have around 3^n*1000 bits, and most of us cannot afford the RAM or disk
> for very large n.  I can afford up to n=18.  :-)
> 
> -- 
> Torbjörn
> Please encrypt, key id 0xC8601622