Double the Last Number

[Gavin]

2^159 = 730750818665451459101842416358141509827966271488

[Gavin]

1,461,501,637,330,902,918,203,684,832,716,283,019,655,932,542,976

[Gavin]

On 4/5/2012 at 11:26 PM, Flareon350 said:

2 (I remember this game and your fact about insanely huge numbers will come VERY soon is true! But it'll be in about 15 posts or so)

1,461,501,637,330,902,918,203,684,832,716,283,019,655,932,542,976 times what he said

[H2O]

2707685248164858261307045101702230179137145581421695874189921465443966120903931272499975005961073806735733604454495675614232576

--------------------------------------------------------------------------------------------------------------------------------------------------------------------

463168356949264781694283940034751631413079938662562256157830336031652518559744

[Gavin]

What do you use to calculate numbers this large out of interest? I'm using Python

[H2O]

Most of the time, Haskell, but pretty much everything will do


GHCi:

> 2^163

11692013098647223345629478661730264157247460343808

tclsh:

% expr {2**163}

11692013098647223345629478661730264157247460343808

bc:

2^163

11692013098647223345629478661730264157247460343808

C:

Code:

#include <stdio.h>
#include <stdlib.h>
#include <gmp.h>

int main(int argc, char **argv){
  if(argc!=2){
    fprintf(stderr, "%s int\n", argv[0]);
    return EXIT_FAILURE;}
  unsigned long int e = strtoul(argv[1], NULL, 10);

  mpz_t r;
  mpz_init(r);
  mpz_ui_pow_ui(r,2ul,e);
  gmp_printf("%Zd\n",r);

  return EXIT_SUCCESS;}

./prog 163

11692013098647223345629478661730264157247460343808

[budugoo]

10000 00000 00000 00000 00000 00000 00000 00000 00000 00000 00000 00000 00000 00000 00000 00000 00000 00000 00000 00000 00000 00000 00000 00000 00000 00000 00000 00000 00000 00000 00000 00000 00000

There are 10 kinds of people in the world: those who know binary, and those who don't.