Difference between revisions of "Pascal's Bomb"

(Pascal's Bomb(introduction))
(Replaced content with "{{delete|Spam}}")
(Tag: Replaced)
 
(72 intermediate revisions by 12 users not shown)
Line 1: Line 1:
==Pascal's Bomb(Introduction)==
+
{{delete|Spam}}
 
 
Pascal's Bomb is a (not)widely known theorem, applying it will solve almost every problem. However, the concept is quite hard to grasp, yet it is very important.
 
 
 
==Discovery==
 
 
 
In the year 69, Munkey man first developed the idea. It was then sent to Gmaas for review, approved by Gmaas, and became published.
 
 
 
Forgotten by the year 696, it was later re-discovered. In the year 4269, bestzack66 got on FTW and said "Pascal's" and MathHayden said "Bomb". Thus, it became a real theorem.
 
 
 
Later on, bestzack66 and MathHayden contributed to mankind by re-publishing the theorem, this time onto the AoPS wiki. It is now here for all AoPS users to learn from.
 
 
 
==Diagram==
 
 
 
==Explanation==
 
 
 
Pascal's Bomb begins with 69. It becomes infinitely large, although many people believe that it ends with 8947. Pascal's Bomb is a series of Munkeys. To apply this, you can use Complete the Circle or the Buadratic Bormula. After you have substituted for one of the variables, you can proceed to solve, using Inches or Watts. This is applicable on all Maff problems.
 
 
 
==Example==
 
 
 
Suppose that MathHayden has <math>69</math> apples. He needs to distribute them among <math>2</math> of his very distinguished friends(not including himself). Each friend must get at least <math>14</math> apples. How many <math>Possible</math> distributions are there?
 
 
 
==Solution==
 
By applying the Pascal's Bomb, we Munkey it and get an answer of <math>\boxed{43}</math>.
 

Latest revision as of 23:34, 5 March 2021

This article has been proposed for deletion. The reason given is: Spam.

Sysops: Before deleting this article, please check the article discussion pages and history.

Invalid username
Login to AoPS