For questions relating to the computation, estimation and properties of extremely large quantities that are not usually used in mainstream mathematics.

learn more… | top users | synonyms

3
votes
1answer
20 views

Predicting how long the result of a permutation

We're calculating the result of a 'tweaked' Birthday Problem, but when we're calculating, we stumped by a very nasty permutation. $$10^{576}P_{10^{16}}$$ Which, make us stop working at the number, ...
2
votes
1answer
249 views

First digits of extremely large numbers (Generalization of “first digits of Graham's number”)

I found a question about the first digits of Graham's number and would like to generalize it : We want the first n digits of the number $a\uparrow^b c$. Which method is the most effective to do ...
1
vote
1answer
91 views

Divisibility of huge numbers

Please help me to solve my homework ;) Prove that for any positive integer $n$ a square of rather big number divides even more huge number: $${\LARGE \left.\underbrace{33\dots 3}_{1\underbrace{00\dots ...
0
votes
1answer
44 views

Find the biggest number from given data below

Maths problem : $$(9^{62773} + 2)^{83721}$$ Now here is the rest of the problem. After finding the huge number I have to find its digital sum. If you don't know what that means just give me the ...
4
votes
0answers
126 views

Transfinite Knuth-arrow hierarchy vs. fast-growing hierarchy

Suppose Knuth arrow notation (and hence the hyperoperation sequence) is extended to transfinite ordinal indices as follows: Let μ be a large countable ordinal such that a fundamental sequence is ...
3
votes
0answers
90 views

Comparing up-arrow's

Is it true that $$3\uparrow^{n+1} 3\ >\ n\uparrow^n n $$ holds for every $n\ge 1$ Since $3\uparrow^{n+1}3=3\uparrow ^n 3\uparrow ^n 3$ and $3\uparrow^n3$ is much bigger than $n$ for $n\ge 3$, ...
3
votes
0answers
414 views

First $n$ digits of Graham's Number

I know using Euler's Totient function, it's easy to find the last $n$ digits of Graham's number (or any large repeating power tower), but is there any known way to find the first $n$ digits of ...
2
votes
0answers
69 views

Improving Montgomery product

I am reading the paper "A Cryptographic Library for the Motorola DSP56000" (http://link.springer.com/content/pdf/10.1007%2F3-540-46877-3_21.pdf) which describes a trick to speed-up calculation of the ...
1
vote
0answers
28 views

Comparison of $4$-entry-conway-chains and $3$-entry-conway-chains

How big must $n$ approximately be, that $$n\rightarrow n \rightarrow n\ \approx \ 3 \rightarrow 3 \rightarrow 3 \rightarrow 3$$ holds ? $n\rightarrow n \rightarrow n$ (conway-chain) is ...
1
vote
0answers
46 views

Little graham's number, Graham's number and the Graham-conway-number

Sbiis Saibian desbribes on his site in section $3.2.9$ the "little-graham-number" He claims that Graham used this number (much smaller than "Graham's number") in his proof, and Gardner published ...
1
vote
0answers
95 views

Tim Chow's proof that the moser-number is much smaller than grahams number

The link here shows a proof from Tim Chow that the moser-number is much smaller than grahams number. I do not understand the inequality 3^^...^^3 (3^^^^^3×2-1 arrows) << G 2 What does G 2 ...
0
votes
0answers
23 views

Node potentials of minimum cost flow successive shortest path algorithm

I have a simple directed graph $G(V,E)$ that has a source $s$ and sink $t$. Each edge $e$ of $G$ has positive integer capacity $c(e)$ and positive integer cost $a(e)$. I am trying to find the minimum ...
0
votes
0answers
9 views

Check for greatest common multiple in a range

I am supposed to be writing a program that takes two numbers and checks to see if they have a common multiple in the range of 1 - 1100000000, 1.1 billion. If there are many common multiples, I have to ...
0
votes
0answers
62 views

What is the highest number that could be written down in principle using all computers in the world?

I read somewhere in the internet, that the capacity of all computers in the world would be about $10^{18}$ bytes. Does this mean, that in principle, a number with $10^{18}$ digits could be written ...
0
votes
0answers
46 views

monotony for conway chains

Let X and Y be chains, m and n be natural numbers with 0 < m < n. Is it always true that $$X \rightarrow m \rightarrow Y < X \rightarrow n \rightarrow Y$$ ? I need this to bound the ...