Question about fast-growing functions
The sequence that produces Graham’s number is a well-known fast-growing sequence. I want to know how it contrasts with the following: Let F(x) be the function that produces the sequence and have it be defined for natural numbers n≥2. F(2)=2↑2=4 F(3)=3↑↑↑↑3=k F(4)=4↑(k)4=j F(5)=5↑(j)5... where ↑(x) denotes the number of arrows in an expression. Clearly this is similar to the G sequence. In fact, G(1)=F(3). Given that, is G(x)>F(x) for all positive integers? If not, around what size is the input that outputs a larger number in F's sequence given the same input to G's sequence?
Join Matchmaticians Affiliate Marketing
Program to earn up to a 50% commission on every question that your affiliated users ask or answer.
- closed
- 1328 views
- $10.00
Related Questions
- Compounding interest of principal P, where a compounding withdrawal amount W get withdrawn from P before each compounding of P.
- Same exponents in two nonlinear function deriving the same result?
- Is it true almost all Lebesgue measurable functions are non-integrable?
- Evaluate if possible the following limits, Check if L'Hopital's rule is appropriate to use, if so use it.
- Optimization of a multi-objective function
- Find the composition function $fog(x)$
- I need help on this problem! it's trigonometric functions I believe. If you could show your work that would be even better! Thank you guys
- Can someone translate $s_j : \Omega \hspace{3pt} x \hspace{3pt} [0,T_{Final}] \rightarrow S_j \subset R$ into simple English for me?
Offered bounty sounds low for the time it may require someone to answer the question.