How Hard Do You Have to Slap A Piece of Chicken to Cook It?

-

How Hard Do You Have to Slap A Piece of Chicken to Cook It?


I don’t think this question can answer by looking at how hard a piece of chicken must slap, but how fast to slap it? To solve this, let two assumptions be made: The law of conservation of momentum and a total elastic collision where all energy is transferred to the chicken from kinetic to thermal energy.

Let us take the following into consideration:

Specific heat capacity of chicken: 1.77 kJ/kg K = 1770 J/kg K

Mass of Chicken = 1 kg

Mass of an average hand (male): 0.65 kg

Standard temperature: 25 C

Internal Temperature to Cook a Chicken: 74 C

Now, with all the variables in hand, the answer to the question can be found.

(0.5) (Mass hand) (speed squared) = (Mass Chicken) (Specific heat Capacity Chicken) (Change in Temperature)

Speed squared = [(1) (1770) (74-25)]/ [(0.5) (0.65)]

Speed = 516 m/s

Or

Speed = 1857.6 kmph or Speed = 1176.63 mph

So, theoretically, if you move your hand at either 1858 kmph or 1177 mph, assuming you don’t die in the process, you can slap a chicken so hard that you can cook it!!!!

References
Images: https://www.cookingclassy.com/slow-cooker-chicken/

Comments

Post a Comment

Popular posts from this blog

The Zeta Function Derivation of the Ramanujan’s Summation

-
Image
Please note that the famous Ramanujan Summation has three derivations: Heuristic (Infinity Manipulation), Zeta Function Regularisation and the Cutoff Regularisation. This article presents represents the  Zeta Function Regularisation proof  of the summation. To read more on the other methods of summation,  click on this . Moving on to the article: In one of my previous articles , I talked about the Ramanujan’s summation and its derivation with countable Heuristics method, infinity manipulation. It was an interesting approach, however, the hypothesis that 1+2+3+4+5+… = -1/12 is a viable hypothesis in many perspectives. For the purpose of this article, I will be talking about the Riemann Zeta Function, a complex analysis method, and how it is used to prove the Ramanujan Summation through a different perspective. The Riemann Zeta Function is defined as follows: This function is interesting as it always converges into a fraction including a power of Pi for even integers (Bernoulli Numbers
Read more

The Sum of All Positive Numbers Is A Negative Number- Heuristic (Infinity Manipulation) Method of Deriving the Ramanujan Summation!

-
Image
Please note that the famous Ramanujan Summation has three derivations: Heuristic (Infinity Manipulation), Zeta Function Regularisation and the Cutoff Regularisation. This article presents represents the  Heuristic (Infinity Manipulation)  of the summation and is simplified for understanding the power of infinity. To read more on the other methods of summation,  click on this . Moreover, this method of divergent summation proves to be an interesting approach.
Read more