Some definitions $$ \def\flecheTF{\mathop{\rightharpoonup}\limits_{\mbox{$\leftharpoondown $}}} \def\TFI#1#2#3{{\displaystyle{\int_{-\infty}^{+\infty} #1 ~e^{j2\pi #2 #3} ~\dr{#2}}}} \def\TF#1#2#3{{\displaystyle{\int_{-\infty}^{+\infty} #1 ~e^{-j2\pi #3 #2} ~\dr{#2}}}} \def\tf#1{{\mathrm{FT}\left\{ #1 \right\}}} \def\sinc#1{{\mathrm{sinc}\left( #1 \right)}} \def\rect{\mathrm{rect}} \def\egalpardef{\mathop{=}\limits^\triangle} \def\dr#1{\mathrm{d}#1} $$
Consider the Fourier pair $$ x(n) \flecheTF X(f). $$ When $x(n)$ is complex valued, we have $$ \fbox{$x^*(n) \flecheTF X^*(-f)$}. $$ This can be easily checked beginning with the definition of the Fourier transform: \begin{eqnarray*} \tf{x^*(n)} & = & \sum_n {x^*(n)}e^{-j2\pi fn}, \\ & = & \left(\int_{[1]}{x(n)}e^{j2\pi fn} \dr{f} \right)^*, \\ & = & X^*(-f). \end{eqnarray*} In addition, for any signal $x(n)$, we have $$ \fbox{$x(-n) \flecheTF X(-f)$}. $$ This last relation can be derived directly from the Fourier transform of $x(-n)$ $$ \tf{x(-n)} = \TF{x(-n)}{t}{f}, $$ using the change of variable $-t \rightarrow t$, we get \begin{eqnarray*} \tf{x(-n)} & = & \TFI{x(n)}{t}{f}, \\ & = & X(-f). \end{eqnarray*}
using the two last emphasized relationships, we obtain $$ \fbox{$x^*(-n) \flecheTF X^*(f)$}. $$ To sum it all up, we have $$ \fbox{ $ \begin{array}{lll} x(n) & \flecheTF & X(f) \\ x(-n) & \flecheTF & X(-f) \\ x^*(n) & \flecheTF & X^*(-f) \\ x^*(-n) & \flecheTF & X^*(f) \end{array} $} $$
These relations enable to analyse all the symetries of the Fourier transform. We begin with the \textem{Hermitian symmetry} for \textbf{real signals}: $$ \fbox{$X(f) = X^*(-f)$} $$ from that, we observe that if $x(n)$ is real, then \label{prop:prop-sym}
\begin{itemize} \item the real part of $X(f)$ is \textem{even}, \item the imaginary part of $X(f)$ is \textem{odd}, \item the modulus of $X(f)$, $|X(f)|$ is \textem{even}, \item the phase of $X(f)$, $\theta(f)$ is \textem{odd}. \end{itemize}Moreover, if $x(n)$ is odd or even ($x(n)$ is not necessarily real), we have \label{prop:tf-sym} $$ \fbox{ $ \begin{array}{lllll} \text{[even] } & x(n)=x(-n) & \flecheTF & X(f)=X(-f) & \text{ [even]}\\ \text{[odd] } & x(n)=-x(-n) & \flecheTF & X(f)=-X(-f) & \text{ [odd]} \end{array} $} $$
The following table summarizes the main symmetry properties of the Fourier transform:\
$$ \begin{array}{||l|l|l|l|l||} \hline\hline \mathbf{x(n)} & \mathbf{\text{Symmetry}} & \mathbf{\text{Time}} & \mathbf{\text{Frequency}} & \mathbf{\text{consequence on $X(f)$}}\\ \hline\hline \text{real} & \text{any} & x(n)=x^*(n) & X(f) = X^*(-f) & \text{Re. even, Im. odd} \\ \hline \text{real} & \text{even} & x(n)=x^*(n)=x(-n) & X(f) = X^*(-f)=X(-f) & \text{Real and even} \\ \hline \text{real} & \text{odd} & x(n)=x^*(n)=-x(-n) & X(f) = X^*(-f)=-X(-f) & \text{Imaginary and odd} \\ \hline \text{imaginary} & \text{any} & x(n)=-x^*(n) & X(f) = -X^*(-f) & \text{Re. odd, Im. even} \\ \hline \text{imaginary} & \text{even} & x(n)=-x^*(n)=x(-n) & X(f) = -X^*(-f)=X(-f) & \text{Imaginary and even} \\ \hline \text{imaginary} & \text{odd} & x(n)=-x^*(n)=-x(-n) & X(f) = -X^*(-f)=-X(-f) & \text{Real and odd} \\ \hline\hline \end{array} $$Finally, we have $$ \fbox{ $ \begin{array}{lll} \text{Real even + imaginary odd } & \flecheTF & \text{ Real}\\ \text{Real odd + imaginary even } & \flecheTF & \text{ Imaginary} \end{array} $} $$
The following table lists the main properties of the Discrete time Fourier transform. The table is adapted from the article on discrete time Fourier transform on Wikipedia.
Some examples of Fourier pairs are collected below: