BMAD

I drove x miles at 55 mph. I then drove x + 20 miles at 40 mph. I drove for a total of 100 minutes. How far did I drive?

Licorice

A chandelier?

Does it have at least 3 vowels in its name?

Within the outlined rectangle and Using vertical and horizontal line segments as a chain connect the squares of the same color but do not let the chains that connect common squares cross. All white squares must be occupied.

Is it a solid?

Can you buy it?

Earring?

a bicycle?

Go for it

Cucumber it is

For a while...so let's make this count. Here is a personal favorite from our interview process. Are there more McDonalds or Nationally chained grocery stores in a small town (let's assume that we are talking about America)? How much more? Provide support for your answer.

No correct answer yet. One more guess then a 'better' image will be posted

Nice try, but no.

This picture has been significantly distorted. In approximately five guess intervals, a better image will be posted. What is this?

Colerain High School, Cincinnati, Ohio 39° 13′ 55″ N, 84° 36′ 11″ W 39.231944, -84.603056

Damn

I am thinking of an integer n with 0 <= n <= 15. To figure out what number I'm thinking of, you can ask me 7 yes-or-no questions --questions that can only be answered with either "yes" or "no". The questions must be independent of each other, their answers, and the order in which they are answered. (So you can't ask a question like, "if the answer to the previous question was "yes", then is n larger than 10, otherwise is n even?") When you ask me your seven questions, I am allowed to LIE about at most one of the answers. What seven questions can you ask to determine n?

Trianglia is a jacked-up island where no road has a dead end, and all the crossroads are "Y" shaped. The young prince of Trianglia mounts his horse, and is about to go on a quest to explore the land of Trianglia. He gets to the road by his palace, when the mother queen comes out and shouts: "But Charles, how will you find your way back?". "Don't worry Elizabeth", the prince replies, "I will turn right in every second crossroad to which I arrive, and left otherwise. Thus I shall surely return to the palace sooner or later." Is the prince right?

If we take 47, reverse and add, 47 + 74 = 121, which is palindromic. Not all numbers produce palindromes so quickly. For example, 349 + 943 = 1292, 1292 + 2921 = 4213 4213 + 3124 = 7337 That is, 349 took three iterations to arrive at a palindrome. Although no one has proved it yet, it is thought that some numbers, like 196, never produce a palindrome. A number that never forms a palindrome through the reverse and add process is called a Lychrel number. Due to the theoretical nature of these numbers, and for the purpose of this problem, we shall assume that a number is Lychrel until proven otherwise. In addition you are given that for every number below ten-thousand, it will either (i) become a palindrome in less than fifty iterations, or, (ii) no one, with all the computing power that exists, has managed so far to map it to a palindrome. In fact, 10677 is the first number to be shown to require over fifty iterations before producing a palindrome: 4668731596684224866951378664 (53 iterations, 28-digits). Surprisingly, there are palindromic numbers that are themselves Lychrel numbers; the first example is 4994. How many Lychrel numbers are there below ten-thousand? (Here's a problem for my programmers)

From wikipedia Suppose that at least one person is not drinking. For any particular nondrinking person, it still cannot be wrong to say that if that particular person is drinking, then everyone in the pub is drinking because that person is, in fact, not drinking. In this case the condition is false, so the statement is vacuously true due to the nature of material implication in formal logic, which states that "If P, then Q" is always true if P (the condition or antecedent) is false. [1][2] Either way, there is someone in the pub such that, if he is drinking, everyone in the pub is drinking. A slightly more formal way of expressing the above is to say that if everybody drinks then anyone can be the witness for the validity of the theorem. And if someone doesn't drink, then that particular non-drinking individual can be the witness to the theorem's validity. [3] The proof above is essentially model-theoretic (can be formalized as such). http://en.m.wikipedia.org/wiki/Drinker_paradox

So if someone is not drinking then p is false, so...

Think about which in the P&Q (if p then q) is false with the second scenario.