Suppose that $a,b \in \mathbb{N}$ are both odd and $m \in \mathbb{Z}.$ I want to show that
$$\left(\dfrac{m}{ab}\right) = \left(\dfrac{m}{a}\right) \left(\dfrac{m}{b}\right)$$
Here, we are talking about the Jacobi Symbol, hence why I put the $\ell$ subscript on each term. I have solved the case when
$$\left(\dfrac{ab}{m}\right) = \left(\dfrac{a}{m}\right) \left(\dfrac{b}{m}\right)$$
Here, we can let $m$ = $p_1 p_2...p_r,$ be the prime factorization of $m$ and we can re-write this as
$$\left(\dfrac{ab}{m}\right) = \left(\dfrac{ab}{p_1}\right) \left(\dfrac{ab}{p_2}\right)... \left(\dfrac{ab}{p_r}\right) = \left(\dfrac{a}{p_1}\right) \left(\dfrac{b}{p_1}\right)... \left(\dfrac{a}{p_r}\right) \left(\dfrac{b}{p_r}\right) = \left(\dfrac{a}{p_1}\right) \left(\dfrac{a}{p_2}\right)... \left(\dfrac{a}{p_r}\right) \left(\dfrac{b}{p_1}\right) \left(\dfrac{b}{p_2}\right)...\left(\dfrac{b}{p_r}\right) = \left(\dfrac{a}{m}\right)\left(\dfrac{b}{m}\right)$$
For the original problem, I want to flip the numerator and denominator in a way that I want get to the form of $\left(\dfrac{ab}{m}\right)$ Is there any way of doing this, or does this question require a completely different proof?