Question

In: Advanced Math

Number Theory

Why does the product of two numbers -having no common factors- that results in a perfect square, make them-the two numbers- perfect squares themselves?

 

Solutions

Expert Solution

states that every positive integer > 1 can be uniquely expressed as a product of primes. These primes may be occur more than once.

 

A positive integer n is a perfect square if and only if each prime that divides n appears an even number of times in this prime factorization.

 

Now suppose a⋅b is a perfect square, and gcd(a,b)=1 .

 

Since a⋅b is a perfect square, each prime p that divides a⋅b appears an even number of times, say 2e , in the prime factorization of a⋅b . Now the number of times p appears in a⋅b equals the number of times it appears in a plus the number of times it appears in b .

 

Since gcd(a,b)=1 , the prime can’t appear in the prime factorization of both a and b .

 

Therefore, p appears 2e times in one of them and zero times in the other. This is true for each prime p that divides a⋅b .

 

For primes p that do not divide a⋅b , p appears zero times in each.

 

We have shown that p appears an even number of times in both a and b , for each prime p . We conclude that both a and b are perfect squares


An extension of this argument yields the following generalization:

 

If a1⋅a2⋅a3⋯an is a perfect kth power and if gcd(ai,aj)=1 for i≠j , then each ai is a perfect kth power.

Related Solutions

Number Theory
Given integers a, b, c, g.c.d.(a, b, c) = 1 if and only if g.c.d.(a, b) = 1 and g.c.d.(a, c) = 1
Number theory 2
What percentage of the first 500 natural number can be written as the difference of two perfect square?
Number Theory 1
What is the quickest way to determine if a number is a perfect square?
Basic Number theory
What is the least natural number that should be added to 7832 to make it a perfect square?
Number theory 3
How do I determine if a big number (6+ digits) is a perfect square or not?
Number Theory: Let p be an odd number. Recall that a primitive root, mod p, is...
Number Theory: Let p be an odd number. Recall that a primitive root, mod p, is an integer g such that gp-1 = 1 mod p, and no smaller power of g is congruent to 1 mod p. Some results in this chapter can be proved via the existence of a primitive root(Theorem 6.26) (c) Given a primitive root g, and an integer a such that a is not congruent to 0 mod p, prove that a is a square...
Number Theory Show that 18! = -1 (mod 437 = 19x23)
Number Theory Show that 18! = -1 (mod 437 = 19x23)
The theory of contestable markets concludes that a.a small number of firms in an industry is...
The theory of contestable markets concludes that a.a small number of firms in an industry is strong evidence that they will perform in a non-competitive way b.even if the number of sellers in an industry is small profits can be zero in the industry c.inefficient producers can survive in a contestable market d.a firm in a contestable market will sell at a price above marginal cost e.all of the above The profit-maximizing oligopolist produces where a.price equals marginal cost b.marginal...
NUMBER THEORY QUESTION: Find the partition of {1, 2, . . . , 16} determined by...
NUMBER THEORY QUESTION: Find the partition of {1, 2, . . . , 16} determined by the dynamics of (a) addition of 2, modulo 16. (b) addition of 4, modulo 16 (c) multiplication by 2, modulo 17. (d) multiplication by 4, modulo 17.
The theory of behavioral or communication-style bias is based on a number of underlying principles. List...
The theory of behavioral or communication-style bias is based on a number of underlying principles. List the principles and give very detailed examples.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT