The Centrifuge Problem - Numberphile
Video Statistics and Information
Channel: Numberphile
Views: 586,972
Rating: 4.9286914 out of 5
Keywords: numberphile, centrifuge problem, holly krieger
Id: 7DHE8RnsCQ8
Channel Id: undefined
Length: 9min 18sec (558 seconds)
Published: Mon Dec 03 2018
Please note that this website is currently a work in progress! Lots of interesting data and statistics to come.
Background: The task is to take N symmetrically distributed slots on a circular centrifuge, and fill k of them with test tubes and have the resulting pattern be balanced. The video discusses building the pattern of filled slots by filling smaller patterns that are symmetric. These small symmetric patterns always have a prime factor of filled slots. The conclusion reached is if and only if both k and N-k must be formable by adding prime factors of N, then the k test tubes can fill slots to form a symmetric pattern.
My thoughts: Once you have 3 or more prime factors, you can build a balanced pattern that includes negative contributions from a symmetric pattern. For example, for N=60 (2*2*3*5 with an extra factor of 2 just so the dots correspond to minute marks on a clock) slots:
The final k=6 pattern is balanced, but it isn't built from simply filling slots that are part of a symmetric pattern. Basically, any linear combination of symmetric slot patterns is allowed, as long as the final result only has values of 0 or 1 at the locations of the N slots.
So are there any N,k that can be balanced like this but couldn't be balanced using the simple fill-or-don't logic discussed in the video?
For a second i thought it was Amy Adams presenting a Numberphile video
Is it possible to visualize it with group theory? For example with subgroups of cyclic groups or finitely generated Abelian groups.
When she did 7 in 12, that blew my mind. It's one thing to go through the maths, but to see it so viscerally... it's like being shown a missing number between 23 and 24!
How does one write 0 as a sum of the prime factors of n?
I fucking love numberphile
How would this look like if we generalize this problem for Rn with n>2? I'm guessing it should be possible to generalize this, as it works for n=2 as shown in the video and clearly works for n=1, with z1+z2+..+zk=0, too.
In the case where 7/12 is being shown as 3/12 + 2/12 + 2/12, what is the guarantee that there will be a place to put that last pair?
Buy centrifuge Please come to https://www.zonkia.net