What show is Glenn Quagmire from?
Family Guy.
Which state is lake Chargoggagoggmanchauggagoggchaubunagungamaugg located in?
Massachusetts.
What is checks and balances?
This is the system where one branch of government “watches over” another branch.
Which band wrote the song “Separate Ways”?
Journey.
What is Caleb’s last name?
Haarman.
What show is Frank Reynolds from?
It’s always sunny in Philadelphia.
Suppose that there is a building with 100 floors. You are given two identical eggs. The most interesting property of the eggs is that every egg has its own “threshold” floor. Let’s call that floor N. What this means is that the egg will not break when dropped from any floor below floor N, but the egg will definitely break from any floor above floor N, including floor N itself. For example, if the property of the eggs is that N equals 15, those eggs will always break on any floor higher than or equal to the 15th floor, but those eggs will never break on any floor below floor 15. The same holds true for the other egg, since they are identical. Here is the question: What strategy should be taken in order to minimize the number of egg drops used to find floor N (the threshold floor) for the egg? Also, what is the minimum number of drops for the worst case using this strategy?
We want to minimize the number of drops for the worst case, while still using an approach that works well for other scenarios. So, how can we do this? Well, we should rephrase that question and ask ourselves what is really holding us back here? The main reason why it takes such a large number of drops in the worst case with our approach above (19 drops) is because in order to test out the higher floors of the building we have to start at the lower floors of the building, and at that point we have already used a large number of drops just to get to that point. What we should try to get with our next approach is to try to reduce the worst case scenario by trying to make all possible scenarios take the same number of drops. What if we tried to reduce the number of drops that would be required with the linear search (with the 2nd egg) after we get to one of the higher floors? This way we counteract the fact that getting to the higher floor took so many drops, and if we use less drops for the linear search we are balancing out the worst case. Let’s try to figure this out using some simple algebra. Suppose we drop an egg from floor x. If the egg breaks, then we would have to go through the previous x-1 floors one by one using a linear search. But, if the egg doesn’t break, in our original algorithm we would go up x floors to find the next floor to test from. Why not just go up x-1 floors instead of x floors? This would save us 1 drop if we have to do a linear search with the 2nd egg whenever the first egg breaks – because we would be doing the linear search from floors x+1 to floor ( (x+1) + (x-1)) instead of floors x+1 to floor (x+1) + x. So, that is 1 less egg drop. This means that the next floor that should be attempted to drop from is x + (x-1) if the egg does not break from floor x. And by the same reasoning the floor after that would be x + (x-1) + (x-2) if the egg does not break on floor x + (x-1). This would go on to form a series that looks like this: x + (x-1) + (x-2) + (x-3) + ... + 1 The series above is what’s called a triangular series which is equal to x(x+1)/2. Because there are 100 floors in the building, we set the sum equal to 100 to solve for x: x(x+1)/2 = 100 When the sum of the series above equals 100, we get x = 13.651, which rounds up to 14. This means that we should start from floor 14 (which is our x) and then move up x-1 (13) floors to floor 27 if the egg doesn’t break and then move up x-2 (12) floors to floor 39 and so on if the egg still does not break. The solution for the worst case in this scenario occurs when the threshold floor is floor number 14 – because we will drop the first egg on floor 14, and it will break. Then we have to test floors 1-13 with the 2nd egg to see where the egg breaks again, and the egg will not break on any of those floors. But since the egg broke on the floor 14, we can conclude that the threshold floor is floor number 14.
What is an oligarchy?
Rule by a small group in an unlimited government.
Which band wrote the song “Shoot to Thrill”?
AC/DC.
Who has the name “Gorghorglorgalorg” for their dnd character?
Charles.
What show is Walter White from?
Breaking Bad.
Pick a number 1-10, you have a 1 in 10 shot at guessing this right.
4.
Where does money from a check go when you deposit it to your bank account.
To your bank account balance.
Which band wrote the song “Jump”?
Van Halen.
What do I have as my contact information for myself set to on my phone? (Hint, it’s a character from a comedy movie I praise quite frequently)
Bill S Preston Esquire.
What show is Kyle Broflovski from?
South Park.
Sing the quadratic formula to the tune of pop goes the weasel.
(Host will decide if points are awarded here).
What is Judicial Review?
The ability of the Supreme Court to declare laws passed by Congress and signed by the President unconstitutional.
Which band wrote the song “Here Comes My Girl”?
Tom Petty and the Heartbreakers.
Kevin weighs about how many pounds?
140.
What show is Daryl Dixon from?
The Walking Dead.
What would the correct ignition timing be on a 1955 Bel Air Chevrolet with a 327 cubic inch engine and a 4 barrel carburetor?
It’s a bullshit question. Cause Chevy didn’t make a 327 in 55, the 327 didn’t come out till 62. And it wasn’t offered in the Bel Air with a 4 barrel carb till 64. However, in 1964 the correct ignition timing would be 4 degrees before top dead center.
The refusal to sign a proposed bill.
Which band wrote the song “Nothin’ but a Good Time”?
Poison.
Who has once played doom on ultra nightmare mode for 24 hours straight before with only two breaks?
Tyler Pierre (fun fact, he damaged his wall when he lost).