If $p \rightarrow (p \wedge \neg q)$ is false,then the truth values of $p$ and $q$ are respectively

Consider the following statements:
$p$: the switch $S_1$ is closed.
$q$: the switch $S_2$ is closed.
$r$: the switch $S_3$ is closed.
Then the switching circuit represented by the statement $(p \wedge q) \vee (\sim p \wedge (\sim q \vee p \vee r))$ is

If ${(p \wedge \sim q) \wedge (p \wedge r)} \rightarrow (\sim p \vee q)$ has a truth value of $False$,then the truth values of the statements $p, q, r$ are respectively:

Write the negation of the following statement:
$p:$ For every real number $x, x^{2} > x.$

Given below are two pairs of statements. Combine these two statements using "if and only if".
$p:$ If the sum of digits of a number is divisible by $3,$ then the number is divisible by $3.$
$q:$ If a number is divisible by $3,$ then the sum of its digits is divisible by $3.$

The statement $[(p \wedge q)$ $\rightarrow p]$ $\rightarrow (q \wedge \sim q)$ is