MATH Seminar
| Title: On a problem from Crux Mathematicorum |
|---|
| Seminar: Combinatorics |
| Speaker: Bill Sands of Math and Statistics, University of Calgary |
| Contact: Dwight Duffus, dwight@mathcs.emory.edu |
| Date: 2009-04-17 at 4:00PM |
| Venue: MSC W301 |
| Download Flyer |
| Abstract: Suppose you are given four cards, each containing four nonnegative real numbers, written one below the other, so that the sum of the numbers on each card is 1. You are allowed to put the cards in any order you like, then you write down the first number from the first card, the second number from the second card, the third number from the third card, and the fourth number from the fourth card, and you add these four numbers together. What is the smallest interval [a, b] so that, no matter which cards you are given, there is always an ordering of the cards so that the sum will lie in [a, b]? I will give the history of this problem and what I know about it. |
See All Seminars