Here's what I'm saying
Moving 2 sticks, what is the largest number that you can create?
How about...
Take the top and bottom sticks of the first zero, and place them upright on the bottom left, making $11^{11000}$?
If that's unrealistic...
... because the base is usually in bigger font, then $11000^{11}$ could work as well.
Move the top and bottom stick of the first zero to create another 1, thus making 111000
Move the top and bottom matchsticks from the 3rd zero to make:
Where the first two characters are B's thus: BB110 And BB refers to the Busy Beaver Function The Busy Beaver function is non-computable and therefor grows faster than any computable function such as exponentiation or the series to create Grahams Number.
The first few entries:
BB2 = 6
BB3 = 21
BB4 = 107
BB5 ≥ 47,176,870
BB6 > 7.4 × 10^36534 which is already greater than greenturtle3141's answer
BB12 > g1
which is already close enough to catching up to Graham's Sequence to pretty safely say that BB110 > g900 considering BB continues to ramp up faster than any computable function.
How about
take the two bottom sticks from the leftmost zeros, break the end off of one and place it at the right hand side and place the other at the left hand side to make: $1171700!$ (or if the small 1 on the left is invalid make $771700!$
That's $factorial(1171700)$ (or $factorial(771700)$)
...and given that $100000!=2.824229408×10^{456573}$ both of the above examples are pretty big.
For a less lateral-thinking solution
- without breaking sticks, that is - one can make $7713170$ ($778170$ edit, credit @PaulGriffiths):
_ _ _ _ _ _ _ _ _
| || || || | --> | ||_|| || |
|_||_||_||_| --> | ||_|| ||_|
Or for a smidgen more (due to @PaulGrffiths' observation on my previous attempt)
$7717130$
_ _ _ _ _ _ _ _ _
| || || || | --> | || ||_|| |
|_||_||_||_| --> | || ||_||_|
Expanding on greenturtle3141's answer:
Using tetration notation we can express $$^{11000}11$$ which is $\underbrace{11^{11^{...^{11}}}}_{11000\mbox{~times}}$
Looking at the examples, even the number of digits of this number will be insanely high.
9900
Here are the sticks on their initial positions:+--------+ +--------+ +--------+ +--------+ | | | | | | | | | | | | | | | | | | | | | | | | + + + + + + + + | | | | | | | | | | | | | | | | | | | | | | | | +--------+ +--------+ +--------+ +--------+Just flip two, and...+--------+ +--------+ +--------+ +--------+ | | | | | | | | | | | | | | | | | | | | | | | | +--------+ +--------+ + + + + | | | | | | | | | | | | | | | | | | +--------+ +--------+ +--------+ +--------+
Take the top and bottom of the first 0 and place around the remaining matches to form the absolute value function. Then we have $|\dfrac{1}{000}|=\infty$.
Inspired by MooseBoys:
_ _ _ _ _ _ _ | || || || | --> | || || || | |_||_||_||_| |_|| ||_||_| _|
g1100 is quite a bit greater than g900. Not sure that it's greater than BB110, though.
I'm new here but couldn't resist this one. How about
Move the bottom sticks of the first two numbers up to the middle row which gives AA00 which is hexadecimal for 43520
EDIT
Can even go a little further with this one and
Move the two right sticks from the first 0 to the middle row of the middle two 0s giving C880 which is hex for 51328
If you count this as $900!$ (900 factorial) then it is
$6752680220964584158387906136180081422426942786958938431219826870368509164318041$$696913244695269830379422601037057867290859319834769988692859190650103158765184$$697675968111260952478709384800442863618689339527278445063035408024321764665802$$469665906595179375722352022923557754865383368110217097389374605464912641590914$$315017286072115668581065575923001145013299217645498322753869634011261044702900$$233700488787726638770458607729358543315161251880014776446118268082286709278669$$498283183864180099749981933920657941532564974848626523391891108711459244089659$$406267591429492581671986217837467927209263752478693903629003592427178225373805$$988693392344787776958300301670536333903141306915583751852476107834205263547563$$211316961877454927570148010693336299000373258937059355732529943473445929586672$$898874079417465439147992600084884668670872973671320728520371273220127241083083$$691305263536508288872517163608158715160346829110675464039823214667362737089593$$409077782882754955423243619046482799868392717924602991944325102646445233793959$$919852829782859112268996062036123824831315807164339584840504726141268003987773$$376184987444732386791171263002317174596827846578055856806703501388527508029213$$736049187516494772446422169353375503530006535006513749083203952338296374702618$$565305033183238099184484256075092354377518858209648747695025441836519899967468$$441728626544278665159440478162294690187916638293071419690822746013302760581786$$487737771219314213762543035371844826939073261577664528319882860291768022404108$$899389261050680219591724783890010691069805703037919057105760584932311330863445$$200817988116561644976764835416122506696796129760969874273792338939161520744115$$231939284568767331189924708532770342186297287164449540957225998556321547148208$$332565323177711327132657997031075560497396970894947737425497448029465242702243$$670538018406400885345721451851527098556319541299314527405768863444881244944580$$061763116276824312560642484470937202214990846357225491265490776344575854398099$$914912299810437896562678189865522144326360140515207319970658508028873504020541$$737127725309624320000000000000000000000000000000000000000000000000000000000000$$000000000000000000000000000000000000000000000000000000000000000000000000000000$$000000000000000000000000000000000000000000000000000000000000000000000000000000$$0000000$
With number of trailing 0s $= 224$ and total number of digits $= 2270$
Assuming calculator font only with no superscript or letters or other formatting changes, but still allowing the addition of numbers:
_ _ _ _ _ _ _ _ | || || || | -> || || || || | |_||_||_||_| | ||_||_||_|
Thus 17000
Answer:
gogol, which is French for Googol ($10^{100}$)
Why:
_ _ _ _ _ _ _ _ | || || || | --> | | || | | | |_||_||_||_| |_||_||_||_| |
Move the two horizontal bars of the first 0 to make a slash:
11/000
which evaluates to infinity!
_ _ _ _ _ _ _ _
| || || || | --> |_||_|| || |
|_||_||_||_| --> |_||_| ||_|
i.e.
BB70, the 70th Busy Beaver number, which is uncomputable, most likely even independent from ZFC and thus bigger than any other natural number mentioned so far.
_ _ _ _ _ _ _ _
| || || || | --> |_||_|| || |
|_||_||_||_| --> | | _||_||_|
That is, in the spirit of the Graham and Busy Beaver answers, A(900) where A is the one-argument version of the Ackermann Function.
I'm pretty sure this loses to the BB answer, but I'm less certain about Graham's. I just thought Ackermann could use some love, too. At the very least this is also an unimaginably large number.
Late answer but here's one for fans of out of the box thinking:
Pick up two sticks, take a walk down to the beach with someone you love, draw this in the sand
and define this symbol to represent a number larger than any ever conceived. That's right, it gets bigger the more you think about it. By definition x < ♡ is true for all x. Yes even that one. Now that's a big heart. Who could love you more than that?
Theres a lot of good answers but I though this one is worth mentioning as it is the only one I can see that wouldn't result in badly justified or sized numbers.
Move the lower left of the first two digits up to be the middle horizontal bar giving 9900
Take the bottom stick from each of the first two digits, giving
_ _ _ _ _ _ _ _ | || || || | --> | || || || | |_||_||_||_| | || ||_||_|
i.e.
171700 .
Then
rotate them to make an 11, and raise this to the power 171700:
_ _ _ _ | || || || | | || ||_||_| | |
i.e.
$11^{171700}$.
This is
$1.33 * 10^{178807}$
to 3 significant figures.
How about:
Which is read as:
$$9^{{1717}^6}$$
That is rougly:
88110
Here are the sticks on their initial positions:
+--------+ +--------+ +--------+ +--------+
| | | | | | | |
| | | | | | | |
| | | | | | | |
+ + + + + + + +
| | | | | | | |
| | | | | | | |
| | | | | | | |
+--------+ +--------+ +--------+ +--------+
Just flip two, and...
+--------+ +--------+ + + +--------+
| | | | | | | |
| | | | | | | |
| | | | | | | |
+--------+ +--------+ + + + +
| | | | | | | |
| | | | | | | |
| | | | | | | |
+--------+ +--------+ + + +--------+
Move two sticks to make 1/0 (can be infinite). I change the 0 into a C in the process.
1
_
000C
C
? The speed of light? An hexadecimal 12? Either case, if C
is dividing the number, then you have a small number, not a big one
$\endgroup$
000C
hexadecimal, it's 12, not 0.
$\endgroup$
Commented
Sep 2, 2016 at 23:12
110,001
can be made as follows:
_ _ _
| | | | | | | | |
| | |_| |_| |_| |
Take the right hand side 2 of the last two zero making them into two CC. Then create two 1 like this:
1100CC which is 1100*C squared where C is the speed of light
(as in E=MC squared)
1100 * 299792458 * 299792458 = 98,863,069,661,049,940,400
ie. 98 quintillion give or take a few quadrillion
1/0=infinity
. Unless you use the fact that1/x --> INF
whenx --> 0
, that's not true. So... Do you consider that a valid answer? $\endgroup$