ترغب بنشر مسار تعليمي؟ اضغط هنا

A probabilistic way to discover the rainbow

43   0   0.0 ( 0 )
 نشر من قبل Joscha Prochno
 تاريخ النشر 2020
  مجال البحث
والبحث باللغة English




اسأل ChatGPT حول البحث

No two rainbows are the same. Neither are two packs of Skittles. Enjoy an odd mix!. Using an interpretation via spatial random walks, we quantify the probability that two randomly selected packs of Skittles candy are identical and determine the expected number of packs one has to purchase until the first match. We believe this problem to be appealing for middle and high school students as well as undergraduate students at University.



قيم البحث

اقرأ أيضاً

100 - N. J. A. Sloane 2021
An introduction to the On-Line Encyclopedia of Integer Sequences (or OEIS, https://oeis.org) for graduate students in mathematics
45 - Anton Petrunin 2018
We discuss a recursive formula for number of spanning trees in a graph. The paper is written primary for school students.
136 - Anthony B. Morton 2010
The Monty Hall problem is the TV game scenario where you, the contestant, are presented with three doors, with a car hidden behind one and goats hidden behind the other two. After you select a door, the host (Monty Hall) opens a second door to reveal a goat. You are then invited to stay with your original choice of door, or to switch to the remaining unopened door, and claim whatever you find behind it. Assuming your objective is to win the car, is your best strategy to stay or switch, or does it not matter? Jason Rosenhouse has provided the definitive analysis of this game, along with several intriguing variations, and discusses some of its psychological and philosophical implications. This extended review examines several themes from the book in some detail from a Bayesian perspective, and points out one apparently inadvertent error.
The maximal subgroup of unipotent upper-triangular matrices of the finite general linear groups are a fundamental family of $p$-groups. Their representation theory is well-known to be wild, but there is a standard supercharacter theory, replacing irr educible representations by super-representations, that gives us some control over its representation theory. While this theory has a beautiful underlying combinatorics built on set partitions, the structure constants of restricted super-representations remain mysterious. This paper proposes a new approach to solving the restriction problem by constructing natural intermediate modules that help factor the computation of the structure constants. We illustrate the technique by solving the problem completely in the case of rainbow supercharacters (and some generalizations). Along the way we introduce a new $q$-analogue of the binomial coefficients that depend on an underlying poset.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا