According to the fundamental theorem of arithmetic, any positive integer \(n\) can be written as:
Where \(p_i\) is a prime factor of \(n\), and \(a_i \ge 1\). Now pick any random group of \(i\)'s, let's say 1, 3 and 5. We can assign \(p_i^{a_i}\) of our selected \(i\)'s to \(b\), and the rest of the \(p_i^{a_i}\) to \(c\):
Since \(b\) and \(c\) have no common prime factors, they are coprime, and since the prime factors of both \(b\) and \(c\) together are also the prime factors of \(n\), then \(bc=n\). We can again select a other group of \(p_i^{a_i}\) and repeated the same process to get another pair of coprime integers that multiply to give \(n\).
As an example, let \(n=1746360=2^3 * 3^4 * 5 * 7^2 * 11\). We can assign random \(p_i^{a_i}\) to \(b\) and the rest to \(c\):
Since \(b\) and \(c\) share no common prime factors, they are coprime, and also \(bc=1746360=n\).