MathDB

In an exam with k questions, n students are taking part. A student fails the exam if he answers correctly less than half of all questions. Call a question easy if more than half of all students answer it correctly. For which pairs (k, n) of positive integers is it possible that (a) all students fail the exam although all questions are easy; (b) no student fails the exam although no question is easy?

Problem Statement