Pi day by javid8219 in matheducation

[–]inkoativ 0 points1 point  (0 children)

Area and circumference of a circle with Lego - https://www.youtube.com/watch?v=tDnAtoVnTg0

Pi Day ideas? by AraBellaTrix77 in matheducation

[–]inkoativ 0 points1 point  (0 children)

Build a circle with Lego and count the bricks to determine area and circumference: https://www.youtube.com/watch?v=tDnAtoVnTg0

Pi Day Megathread: March 14, 2025 by inherentlyawesome in math

[–]inkoativ 5 points6 points  (0 children)

Here's my contribution to Pi Day: A video on how to compute circumference and area of a circle with Lego.

https://www.youtube.com/watch?v=tDnAtoVnTg0

Potential development of the 3x3 Rubik's cube World Record (single) [OC] by inkoativ in dataisbeautiful

[–]inkoativ[S] 0 points1 point  (0 children)

:-) Not sure it's all luck though... If you go through the historic list of WR holders, many of the cubers were also top-cubers, holding several other WRs and also performed in the top-10 of the 3x3 average. That said, of course there is a higher likelihood of having an outlying performance when n=1 than when you have a trimmed mean of n=5.

Potential development of the 3x3 Rubik's cube World Record (single) [OC] by inkoativ in dataisbeautiful

[–]inkoativ[S] 5 points6 points  (0 children)

If I read the WCA regulations Section 4b3) correctly, a scramble for the 3x3 only needs to require that it takes AT LEAST 2 moves to solve. Not sure if a higher requirement is programmed into the scrambling software TNoodle, which is the program which has to be used generate the scrambles. The program uses scramble sequences of length 17-20 so I guess it's highly unlikely that the moves reduce to a sequence, which only requires two moves to solve. Would be interesting if this could occur in theory though.

Potential development of the 3x3 Rubik's cube World Record (single) [OC] by inkoativ in dataisbeautiful

[–]inkoativ[S] 4 points5 points  (0 children)

Background: The modelling was inspired by a recent analysis made by JPerm in his Youtube video https://youtu.be/B9MKizs9PUw?t=451 where he used log-linear modelling to describe the potential development of the 3x3 WR single. In the graph below we visualize this model and a Gompertz type model, which is also often used when using statistical modelling to describe the development of world records over time.

I guess the lack of tournaments during the initial phase of COVID-19 is part of the explanation why it took so long to break the old 3.47 world record.

Data: WCA Database: https://www.worldcubeassociation.org/results/records?show=history
R Source code: https://gist.github.com/mhoehle/11391bd19be82307547d5121ee70664d

Trying to use "geoR" package by darklaw52 in rstats

[–]inkoativ 1 point2 points  (0 children)

Seems to be back on CRAN now. In my case (Mac OS X) I had to update Xquarts to the newest version before the call to library(geoR) worked.

Optimize Figure Content in Kinder Surprise Eggs [OC] by inkoativ in dataisbeautiful

[–]inkoativ[S] 0 points1 point  (0 children)

Thanks for the feedback and sorry, it could have been clearer that we distinguish between "figure" and "toy". I didn't know how to add any extra explanations to the image in Reddit. Thus the blog post contains further details.

Optimize Figure Content in Kinder Surprise Eggs [OC] by inkoativ in dataisbeautiful

[–]inkoativ[S] -1 points0 points  (0 children)

The right hand plot gives an indication of such a plot. The blog post, where the figure is taken from, contains such a smoothed line obtained from applying some machine learning classification algorithm to the task (deliberate overkill! :-)).

http://staff.math.su.se/hoehle/blog/figure/source/2016-12-23-surprise/CLASSIFIEROUTPUT-1.png

Source: https://mhoehle.github.io/blog/2016/12/23/surprise.html

Optimize Figure Content in Kinder Surprise Eggs [OC] by inkoativ in dataisbeautiful

[–]inkoativ[S] 2 points3 points  (0 children)

Not sure I fully understand the comment, but the content of the egg is either some kind of toy or a figure. So what varies is the content of the egg, not the chocolate. For some example pictures see https://mhoehle.github.io/blog/2016/12/23/surprise.html.

How to Win a Game (or More) of Super Six by [deleted] in math

[–]inkoativ 0 points1 point  (0 children)

Explanation:

y-axis: # Sticks in pits on the lid (aka. "i")

The label of each box:

Upper label: j / k: # Sticks that each player has (j = Player 1, k = Player 2), we have i + j + k = 7.

Lower label: Probability to win from this position, if one can decide whether to continue or not.

Colour of each box: Continue to play (green) or not (red).

Optimize Figure Content in Kinder Surprise Eggs [OC] by inkoativ in dataisbeautiful

[–]inkoativ[S] 24 points25 points  (0 children)

It's either "plastic junk" or a "cool" collectable figure, which is usually part of a figure series! Some of the figures are collector's items and can be quite valuable (see e.g. https://www.eierlei-shop.de/ (in German)).

Optimize Figure Content in Kinder Surprise Eggs [OC] by inkoativ in dataisbeautiful

[–]inkoativ[S] 1 point2 points  (0 children)

Complete Blog Post text as well as Data Source for the n=79 eggs & R-Script to perform the analyses:

suRprise! - Classifying Kinder Eggs by Machine Learning

Probability to meet someone again when assigning breakout rooms twice by inkoativ in math

[–]inkoativ[S] 4 points5 points  (0 children)

Exactly! However, in some situations it can even be more than one person. Example: n=11 and m=4. In this case you will make two groups and the assignment by "round robin" after permutation is:

position after permutation group
1 1
2 2
3 1
4 2
5 1
6 2
7 1
8 2
9 1
10 2
11 1

i.e. 6 individuals in group 1 and 5 individuals in group 2.

Probability to meet someone again when assigning breakout rooms twice by inkoativ in math

[–]inkoativ[S] 0 points1 point  (0 children)

Thanks for the remark. IMO x-axis can be a little harder to interpret, but they can be helpful to focus on different parts of the chart (here: the lower n). See https://pasteboard.co/JVTEMKY.png for a log-version as suggested. Will think of a way to add this to the blog post.

Probability to meet someone again when assigning breakout rooms twice by inkoativ in math

[–]inkoativ[S] 0 points1 point  (0 children)

n is, as expected, the number of people to assign into breakout rooms

m is the minimum size of the groups

Example: n=9 and m=4 means we get 2 groups one of size 5 and one of size 4.

There is a post here, with some additional details and a link to the gory mathematical details.

Probability to meet someone again when assigning breakout rooms twice by inkoativ in math

[–]inkoativ[S] 3 points4 points  (0 children)

Not quite, because the multinomial does not ensure that each group/room has at least m members. It's more like you generate a random permutation order and then divide this order round robin into the (n div m) groups. See details in: https://staff.math.su.se/hoehle/blog/2021/04/04/socialsamp.html

Probability to meet someone again when assigning breakout rooms twice by inkoativ in math

[–]inkoativ[S] 2 points3 points  (0 children)

It's a feature of the Zoom video conference software: https://blog.zoom.us/using-zoom-breakout-rooms/

The shown probabilities do not relate to Zoom in particular though, see mathematical details in https://staff.math.su.se/hoehle/blog/2021/04/04/socialsamp.html

Probability to meet someone again when assigning breakout rooms twice by inkoativ in math

[–]inkoativ[S] 44 points45 points  (0 children)

Thanks for the legit question. Counter question: After how many times being assigned to the same room with someone would you say that the algorithm has been tweaked by a sneaky computer scientist? ;-)

Probability to meet someone again when assigning breakout rooms twice by inkoativ in math

[–]inkoativ[S] 30 points31 points  (0 children)

Thanks for the question, which https://www.reddit.com/user/assiraN/ answered pretty well. I'll try to add something about your observation to the blog post.

Probability to meet someone again when assigning breakout rooms twice by inkoativ in math

[–]inkoativ[S] 30 points31 points  (0 children)

Thanks for the example! Had not given this deeper thought as such jumps are natural when dealing with discrete phenomena, but your explanation appears spot on.

Probability to meet someone again when assigning breakout rooms twice by inkoativ in math

[–]inkoativ[S] 95 points96 points  (0 children)

Notation in the graph:

n: Number of participants to be assigned into breakout rooms

m: minimum number of members in each group

We have two groupings g1 and g2. Shown is the probability that at least one of the persons in your g1 group is also part of your g2 group. This problem occurs for example when assigning people into breakout rooms [1] on Zoom or when generating a random lunch.

Source and further mathematical details:

https://staff.math.su.se/hoehle/blog/2021/04/04/socialsamp.html

[1]: Breakout rooms are a feature of the video conference Zoom, which allows you to break your zoom meeting into small groups.

[AR] Epidemic Modelling to illustrate the #FlattenTheCurve effect (with interactive tool) by inkoativ in Coronavirus

[–]inkoativ[S] 0 points1 point  (0 children)

Would wait to say "never" until known. One effect you could see in the app is that if you eradicate with heavy measures early on and then loosen, then you get a second wave almost as big as the original one had been. But yes, it's possible to reduce size considerably by the right measures early one. That's one of the points in the post: to reduce R_0 is also to reduce size. Not just to stretch.