Let $2n = 2^a k$ for $k$ odd. Prove that the number of Sylow $2$-subgroups of $D_{2n}$ is $k$.
I managed to prove this result by showing that the normalizer of any Sylow $2$-subgroup is itself. The result immediately follows, in that case.
However, my problem is that I came across a different solution to this problem, and it appeals to me because it (claims to) enumerate all subgroups of $D_{2n}$ of order $2^a$.
The claim is that you can construct all the Sylow $2$-subgroups of $D_{2n}$ as follows: Let $j \in \{0, 1, \dots, k-1\}$ and let $t \in \{0, 1, \dots 2^{a-1}\}$. Then $A_{j} = \{r^{tk}, sr^{tk + j}\}$ is an enumeration of all subgroups of order $2^a$. That is, for each fixed $j$, we iterate over the values of $t$.
My problem is that, while this construction gives $k$ distinct subgroups of the desired order, they all have the element $r^k$ in common. But is it not the case that distinct Sylow $p$-subgroups intersect trivially?