Suppose you are traveling and come to a fork in the road. One of them leads to something good like a cat shelter and a company handing out free ice cream and money, while the other leads to something terrible like a series of pasta parties you can't join.
The path is guarded by $n>1$ guards. Each one either always tells the truth or tells lies. They all have perfect knowledge of which of them is honest or dishonest and which path goes to which destination. You know that at least one guard is honest and at least one is dishonest, but you don't know which or how the others answer questions.
As a function of $n$, what is the smallest number of questions you must ask to be guaranteed to discover which path to take? To keep the problem mathematically formal, questions should be able to be expressed as Boolean logic expressions, which the guards will then answer with true or false, depending on their dispositions. You solve the puzzle when you can use the guards' answers to know which path to take. You can decide which questions to ask depending on the responses you get, but if an approach has an upper and lower bound for how many questions you must ask, you want to minimize the upper bound.
Also, the guards know how to evaluate the statement $H(G)$, which is true if guard $G$ is honest, and $I(P)$, which is true if the path $P$ takes you to your destination. If you can think of other statements that make sense for the context of the puzzle, feel free to use them.