harivars
Q8 must have 3 prime factors, and so does root over Q
can u plz explain this one
In my previous post here, I showed why Q must have 3 prime factors. Here I'll show for a general case why Q having 3 prime factors implies Q^(1/2) must have 3 prime factors.
Suppose we have some integer z > 1.
As we always do, we can decompose z into the product of any grouping of its factors: z = f_1 * f_2 * f_3 * f_4 ... f_n
Without the loss of generality, we can further break up the factors of z into powers of its unique prime factor, e.g.: z = p_1^a * p_2^b * p_3^c ...
What happens when we square z? We just get z * z = (p_1^a * p_2^b * p_3^c ...) * (p_1^a * p_2^b * p_3^c ...) = (p_1^2a * p_2^2b * p_3^2c ...)
So taking powers of z just changes the exponents on its prime factors -- it doesn't change the count of unique prime factors p_1 ... p_n. You can use induction to show this for any power over 1, which is kinda neat.
Because we know Q is the square of an integer, we can safely apply the logic backwards, and just halve the exponents on its prime factors.
----- Example ----
Suppose z is 12^2 = 144
We can break up z into 12 * 12 = 3 * 4 * 3 * 4 = 3^2 * 2^4; it has just two distinct prime factors.
If we take the root of z, that's just 12, which is simply 3^1 * 2^2. Note that we just cut the exponents in half.