//After Daniel's 25 minute presentation, and Bosse's 25 minutes of feedback Hannah: That was 50 minutes of pure pleasure! Kevin: Emphasis on "50".
//Kevin Qian has pandas stacked on his head //Rose looks at him with interest and walks over //Favid tries to stack the huge panda on his head but fails Rose: All people are learning. Some people are learning combinatorics. Some people are ... learning.
//Practicing interviews Stav: How many letter a’s are on our website? *steeples fingers* Naveen: Well, uh… the most common vowel is e, so.. if we assume that your website has 2000 characters, then… Bosse: (Starts clapping) Thank you two for the interview! //Another interview Daniel: A permutation of n elements is chosen uniformly at random. A partition of the permutation into contiguous blocks is correct if, when each block is sorted independently, the entire permutation becomes sorted. Find the expected value of the maximum number of blocks into which the permutation can be partitioned correctly. Kevin Qian: Nice job stealing a question from a math competition. Have you even solved this? Daniel: To be honest, Bosse: (Starts clapping) Thank you two for the interview!
//Discrete, continuing a proof of the Euclidean Division Algorithm that started on Friday. Kevin Qian was not here on Friday. //Rose asks about what the cases are. Kevin: I guess for that case, you factor and get b-1, and for the other case you get b+1... Rose: Kevin Qian. You're going to learn some things in this class. But not a whole lot.
// Kevin looks bored in functions class Rose: What's your favorite class? Kevin: Lunch. Hayden: So you mean functions!