Step 1: Analyze inequality (2).
\[3p + 2q < 6\] Given that \(p\) and \(q\) are positive integers, their minimum value is 1. For \(p=1\): \[3(1) + 2q < 6 \Rightarrow 3 + 2q < 6 \Rightarrow 2q < 3 \Rightarrow q < 1.5\] Therefore, the only possible integer value for \(q\) is 1.
Step 2: Verify inequality (1).
\[p^2 - 4q < 4\] Substituting \(p=1\) and \(q=1\): \[1^2 - 4(1) = 1 - 4 = -3 < 4 \text{(condition met).}\]
Step 3: Calculate \(p+q\).
\[p+q = 1+1 = 2\] \[\boxed{2}\]
The number of values of $r \in\{p, q, \sim p, \sim q\}$ for which $((p \wedge q) \Rightarrow(r \vee q)) \wedge((p \wedge r) \Rightarrow q)$ is a tautology, is :
Among the statements :
\((S1)\) \((( p \vee q ) \Rightarrow r ) \Leftrightarrow( p \Rightarrow r )\)
\((S2)\)\((( p \vee q ) \Rightarrow r ) \Leftrightarrow(( p \Rightarrow r ) \vee( q \Rightarrow r ))\)