Option C is correct.
p: n is a prime number
q: n mod 30 is a prime number
Option A -
$p\rightarrow q$
Statement - If n is a prime number then n mod 30 is a prime number
Counter Example
- let n = 31
If 31 is a prime number then 31 mod 30 is a prime number
31 mod 30 = 1
1 is not a prime number.
$p\rightarrow q$ = $T\rightarrow F $ = F
Options B and D are same.
B is $ q\rightarrow p$
Option D-
($p\rightarrow q$) $\rightarrow$ ($ q\rightarrow p$)
= $\neg$($\neg p$ $\vee q$) $\vee$ ($\neg q$ $\vee p$)
=($p \wedge \neg q $) $\vee$ ($\neg q$ $\vee p$)
=(($p \wedge \neg q $) $\vee$ $\neg q$) $\vee$ (($p \wedge \neg q $) $\vee p$)
=$\neg q$ $\vee p$
= $ q\rightarrow p$
Statement - If n mod 30 is a prime number then is a prime number
Counter-example
for options B and D -
Take n = 32
n mod 30 = 2 which is a prime number but n is not a prime number.
$q\rightarrow p$ = $T\rightarrow F $ = F
Option C -
($p\rightarrow q$) $\vee$ ($ q\rightarrow p$)
Now see.
If $p\rightarrow q$ is false then $q\rightarrow p$ must be true and vice versa.
($p\rightarrow q$) $\vee$ ($ q\rightarrow p$)
($\neg p$ $\vee q$) $\vee$ ($\neg q$ $\vee p$)
T
It's a tautology so it will always be true irrespective the value of n.