Consider the elliptic curve $$\mathcal{C}: y^2 = x^3 + x.$$
Let us consider the reduction of $\mathcal{C} \mod{p}$.
Some explicit computation show that $\# \tilde{\mathcal{C}}(\mathbb{F}_3) = 4$, $\# \tilde{\mathcal{C}}(\mathbb{F}_5) = 4$, $\# \tilde{\mathcal{C}}(\mathbb{F}_7) = 8$, and $\# \tilde{\mathcal{C}}(\mathbb{F}_{11}) = 12$ (these totals include the point at infinity).
On page 138, Example 4.6, Silverman and Tate go on to say that it is "not hard to check that" $4 | \# \tilde{\mathcal{C}}(\mathbb{F}_p)$ for all $p \geq 3$.
However, I am struggling to verify this fact myself, and would be very grateful for any assistance!
From working the smaller cases by hand, it seems like a natural divide would be between $p \equiv 1 \mod{4}$ and $p \equiv 3 \mod{4}$. However, if feels like there must be some theorems about solution in these two separate cases that I am missing right now.
Yes, a simple way is to split the argument into two cases according to residue class of $p$ modulo $4$.