## Welcome to BrainDen.com - Brain Teasers Forum

 Welcome to BrainDen.com - Brain Teasers Forum. Like most online communities you must register to post in our community, but don't worry this is a simple free process. To be a part of BrainDen Forums you may create a new account or sign in if you already have an account. As a member you could start new topics, reply to others, subscribe to topics/forums to get automatic updates, get your own profile and make new friends. Of course, you can also enjoy our collection of amazing optical illusions and cool math games. If you like our site, you may support us by simply clicking Google "+1" or Facebook "Like" buttons at the top. If you have a website, we would appreciate a little link to BrainDen. Thanks and enjoy the Den :-)
Guest Message by DevFuse

# Inequalities for large integers

14 replies to this topic

### #1 Rainman

Rainman

• Members
• 143 posts

Posted 29 January 2014 - 12:49 PM

These problems use Knuth's up-arrow notation (http://en.wikipedia....-arrow_notation), with ^ being the up-arrow.

1. Find the smallest value for n, such that 1000^^n > 12^^(n+1).

2. We define the sequence g, by assigning g(1) = 3^^^^3, and g(n+1) = 3^^^...^3, where the number of up-arrows is g(n). A famously large number is Graham's number = g(64). Which is larger, Graham's number or 2^^^...^2, where the number of up-arrows is Graham's number?

• -1

### #2 bonanova

bonanova

bonanova

• Moderator
• 5918 posts
• Gender:Male
• Location:New York

Posted 02 February 2014 - 11:17 AM

Aaaargh. Up arrows are famously non intuitive to think about. I'm thinking nonetheless.

• 0
The greatest challenge to any thinker is stating the problem in a way that will allow a solution.
- Bertrand Russell

### #3 Rainman

Rainman

• Members
• 143 posts

Posted 07 February 2014 - 09:36 PM

Spoiler for general hint

Spoiler for hint for puzzle 1

Spoiler for hint for puzzle 2

• 0

### #4 phil1882

phil1882

Senior Member

• Members
• 550 posts

Posted 08 February 2014 - 09:06 PM

Spoiler for

• 0

### #5 phil1882

phil1882

Senior Member

• Members
• 550 posts

Posted 08 February 2014 - 09:26 PM

• 0

### #6 phil1882

phil1882

Senior Member

• Members
• 550 posts

Posted 08 February 2014 - 09:51 PM

whoops....

Spoiler for big correction

• 0

### #7 Rainman

Rainman

• Members
• 143 posts

Posted 08 February 2014 - 11:52 PM

Actually, just one up-arrow is the same as exponentiation.

3^3 = 33 = 27

3^^3 = 3^(3^3) = 3^27 = 7625597484987

3^^^3 = 3^^(3^^3) = 3^^(7625597484987) = 3^3^3^3^3...^3, where the number of threes is 7,625,597,484,987.

So 12^^2 = 12^12 = 8916100448256, which is much larger than 1000^^1 = 1000. The inequality doesn't hold for n=1.

Generally, 1000^^n is 1000^1000^1000^...^1000, where the number of 1000s is n.

You solved puzzle 2 2^^^....^2 always equals 4, no matter how many up-arrows you have.

• 0

### #8 Rainman

Rainman

• Members
• 143 posts

Posted 23 February 2014 - 07:50 PM

Spoiler for image for puzzle 1

Spoiler for further hint

Edited by Rainman, 23 February 2014 - 07:55 PM.

• 0

### #9 phil1882

phil1882

Senior Member

• Members
• 550 posts

Posted 23 February 2014 - 10:58 PM

hmmm.

Spoiler for

• 0

### #10 Rainman

Rainman

• Members
• 143 posts

Posted 24 February 2014 - 12:27 AM

12^12^12 should be interpreted as 12^(12^12) rather than (12^12)^12. So log(12^12^12) = log(12^(12^12)) = (12^12)*log(12) ~ 9 600 000 000 000.

• 0

#### 0 user(s) are reading this topic

0 members, 0 guests, 0 anonymous users