Difference between revisions of "Pascal's Bomb"
Bestzack66 (talk | contribs) (→Disclaimer: Pascal's Bomb is not real and should not be taken seriously.) |
Ripkobe 745 (talk | contribs) (→Note: Currently it is more silly than educational, but soon will have more detail and math explanations.) |
||
| (15 intermediate revisions by 4 users not shown) | |||
| Line 1: | Line 1: | ||
| − | ==Pascal's Bomb== | + | ==Pascal's Bomb(Introduction)== |
| − | |||
| − | |||
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. | 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. | ||
Latest revision as of 02:49, 2 January 2021
Contents
Pascal's Bomb(Introduction)
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.
Pascal's Bomb is 1% Adihaya Jayasharmaramankumarguptareddybavarajugopal's lemma, and 99% pure big brain.
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
make
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 
apples. He needs to distribute them among 
of his very distinguished friends(not including himself). Each friend must get at least 
apples. How many 
distributions are there?
Solution 1
By applying the Pascal's Bomb, we Munkey it and get an answer of 
.
Solution 2
By Adihaya Jayasharmaramankumarguptareddybavarajugopal's lemma, the answer is again.
Solution 3(slower)
We first proceed to give each friend apples. We then have 
apples left to distribute among the two friends. The first one can have 
apples and the second will have 
apples. There are values of 
, from 
to , and that is the answer.
