Ononot — Let S be the set of all students, C be the set of all course

Guest Session: 1 Question Remaining. Create Account to save progress.

Logichard

0:00.0

Let $S$ be the set of all students, $C$ be the set of all courses, and $E(s, c)$ represent the predicate 'student $s$ is enrolled in course $c$ '. Let $M(c)$ represent ' $c$ is a math course'. What is the formal negation of the statement: 'For every student, there is at least one course they are enrolled in, and if they are enrolled in any course, they are enrolled in at least one math course'?