Piña here- I had the best time, thank you so much to everyone at Check, please! It was an experience I'll never forget 💜 this episode was so fun and funny! Francis and Sonya, what a treat to share a table with you two! And to Leslie- you are truly amazing and kind! Getting to sit next to you was a dream come true for little Piña that grew up watching Check, please! 🍽️
Parade balloon here! 🎈 Wherever I float to, it'll be fun for everyone :-) after all, parade balloons are expensive, iconic, and the highlight of the year-just like me 🥰 Life's tough as it is, why not have some fun when you can 💜 Thanks for watching the episode!
The total number of combinations for 𝑛 n options (in this case, 𝑛 = 40 n=40) is the sum of the binomial coefficients from choosing 1 item up to choosing all 40: Total combinations = ∑ 𝑘 = 1 40 ( 40 𝑘 ) Total combinations= k=1 ∑ 40 ( k 40 ) Using the binomial theorem, this is equal to: 2 40 − 1 2 40 −1 We subtract 1 because choosing 0 soups (an empty combination) isn’t counted in our scenario. Calculation 2 40 − 1 = 1 , 099 , 511 , 627 , 775 2 40 −1=1,099,511,627,775 So, there are 1,099,511,627,775 different combinations of soups you could make with 40 options.
Piña here- I had the best time, thank you so much to everyone at Check, please! It was an experience I'll never forget 💜 this episode was so fun and funny! Francis and Sonya, what a treat to share a table with you two! And to Leslie- you are truly amazing and kind! Getting to sit next to you was a dream come true for little Piña that grew up watching Check, please! 🍽️
I love your aesthetic. You're gorgeous.
Another great show! I love Piña’s colorful enthusiasm and look forward to trying the hot pot restaurant in Oakland.
9 days C I keep my can’t s
Io😅 z✌️
n😅😮m😅
Maybe😅m frv. R🎉xe cd
💿 o
😂
Someone didn’t tie down the giant parade balloon. It got loose.
That’s just mean.
@briesthoughts2261 Yet accurate. Sometimes, those looks are just too much.
Parade balloon here! 🎈 Wherever I float to, it'll be fun for everyone :-) after all, parade balloons are expensive, iconic, and the highlight of the year-just like me 🥰 Life's tough as it is, why not have some fun when you can 💜 Thanks for watching the episode!
I think she is very stylish and beautiful 😍
@canadianeskimogirl thank you 🥹💜!!!
The total number of combinations for
𝑛
n options (in this case,
𝑛
=
40
n=40) is the sum of the binomial coefficients from choosing 1 item up to choosing all 40:
Total combinations
=
∑
𝑘
=
1
40
(
40
𝑘
)
Total combinations=
k=1
∑
40
(
k
40
)
Using the binomial theorem, this is equal to:
2
40
−
1
2
40
−1
We subtract 1 because choosing 0 soups (an empty combination) isn’t counted in our scenario.
Calculation
2
40
−
1
=
1
,
099
,
511
,
627
,
775
2
40
−1=1,099,511,627,775
So, there are 1,099,511,627,775 different combinations of soups you could make with 40 options.
Are you a math whiz or something? That's amazing
@ chat GPT. Work smarter not harder😂