Tagged Questions

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

713 views

75 views

Large, small but a useful number. [closed]

Today we were discussing in our class about usefulness of a number no problem how large,small may be it's value. As per my knowledge (till grade 11) Avogadro number $N_A=6.022\times 10^{23}$ is a ...
57 views

How can I show, that $N\uparrow\uparrow N$ is not “much larger” than $N$ for very large $N\$?

Here : https://sites.google.com/site/largenumbers/home/3-2/knuth Saibian demonstrates that for very large numbers $N$, $N\uparrow\uparrow N$ is only "slightly larger" than $N$. I would like to ...
70 views

explicit upper bound of TREE(3)

TREE(3) is the famously absurdly large number that is the length of a longest list of rooted, 3-colored trees whose $i$th element has at most $i$ vertices, and for which no tree's vertices can be ...
79 views

156 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$, ...
3k views

Find modulo of multiplication of two number?

Given $m$, $a$ and $b$ are very big numbers, how do you calculate $(a*b)\pmod m$ ? As they are very big number I can not calculate $(a*b)$ directly. So I need another method.
109 views

The smallest number $m$, such that $m\uparrow \uparrow (n+1)>n\uparrow\uparrow n$

A natural number $n\ge 3$ is given. Denote $a\uparrow\uparrow b$ to be a power tower of $b$ $a's$. Let $m$ be the smallest natural number , such that $m\uparrow\uparrow(n+1) > n\uparrow\uparrow n$ ...
189 views

Proof of the inequality $2\uparrow^n 4 < 3\uparrow^n 3 < 2\uparrow^n 5$

I tried to prove the inequality $$2\uparrow^n 4 < 3\uparrow^n 3 < 2\uparrow^n 5$$ for all natural numbers $n\ge 1$ For $n = 1$, the claim is true because of $16 < 27 < 32.$ The left ...
56 views

What is the smallest number $n$ for which $bb(n)>f_{\epsilon_0}(5)$ is known?

It is known that $bb(23)$>Graham's number (I do not remember exactly, but $bb(21)$ could already be larger). But what is the smallest number $n$, such that $bb(n)>f_{\epsilon_0}(5)$ is known ? ...
855 views

Examples of Diophantine equations with a large finite number of solutions

I wonder, if there are examples of Diophantine equations (or systems of such equations) with integer coefficients fitting on a few lines that have been proven to have a finite, but really huge number ...
91 views

Does Graham's number have an odd or an even number of digits?

I think it is hopeless to decide whether the number of digits of Graham's number is even or odd because the only way that I can think of is determining the logarithm with accuracy $0.1$ or even better,...
49 views

Extending fast growing functions to the reals “naturally”

There are a lot of incredibly fast growing functions defined on the natural numbers. Typical examples start with tetration, further hyper operators, Ackermann, and then there is monsters like the ...
2k views

What's the last whole number before a googolplex?

"What's the last whole number before a googolplex?" My six yr old asked me this tonight. How does a math challenged dad answer this?! A googolplex is hard enough as it is to imagine or visualize. ...
139 views

2k views

If I call the Ackermann Function with Graham's number as both of its arguments will it be less than $g_{65}$

In xkcd comic 207 it states that [xkcd] means calling the Ackermann function with Graham's number as the arguments just to horrify mathematicians. $A(g_{64},g_{64})$ In this explanation it ...
78 views

What is the smallest prime factor of the number $14^{14^{14}}+13\$?

What is the smallest prime factor of the number $$N\ :=\ 14^{14^{14}}+13\ ?$$ The number of digits of $N$ is $12,735,782,555,419,983$ (The number of digits of $N$ has itself $17$ digits). The first ...
30 views

57 views

Can I restrict the possible factors of $2\uparrow \uparrow 4+3\uparrow \uparrow 4$?

I would like to accelerate the search of prime factors of $$2\uparrow \uparrow 4+3\uparrow \uparrow 4$$ In a question, I asked for a prime factor and another user also asked, whether this number is ...
53 views

How to shuffle a number so that it can be maximum multiple of the number 30 ?

If i have a large number (<=10^5 Digits) how can i tell that if i can shuffle the number so that it become a multiple of 30 . if it is possible then i have to find the maximum multiple . Suppose if ...
835 views

Which number is larger?

If $n$ is large enough, which is greater: $(n+1) ^{n+1}$ or $(kn)^{n}$ where $k$ is a natural number? I've plotted a graph which suggests that the second is larger, but surely the larger power ...
2k views

Which is bigger: $9^{9^{9^{9^{9^{9^{9^{9^{9^{9}}}}}}}}}$ or $9!!!!!!!!!$?

In my classes I sometimes have a contest concerning who can write the largest number in ten symbols. It almost never comes up, but I'm torn between two "best" answers: a stack of ten 9's (exponents) ...
206 views

With $f(n) = n!$, what is the least $k$ such that $f^k(\text{googolplex}) > \text{Graham's number}$?

$\text{googolplex} = 10^{(10^{100})}$ Is $\text{googolplex}!$ greater than $\text{Graham's number}$? How would this be proven? If $\text{googolplex}! \le \text{Graham's number}$, (which I expect) ...