I am tasked to write a simple logical statement on this statement "All primes $n$, $n$ greater or equals to $3$, are odd.".

For a start, I have

$\forall n \in \mathbb{Z}^+ (n \geq 3 ...)$

I apologise for the formatting, quite new though I followed the MathJax guide.

Can anyone please point me in the right direction?


$\forall p\in P: p \ge 3 \Rightarrow \exists n \in \mathbb N \; \& \; p=2n+1$, where $P$ denotes the set of all primes.


$$\forall n > 2 \wedge n \in \mathbb{P}, \exists k \in \mathbb{Z}^+ {\rm s.t.}\ n = 2k + 1$$

Where ${\rm s.t.}$ is read "such that."


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.