If a^2 divides b^2, a divides b

  • Thread starter Thread starter DerpyPenguin
  • Start date Start date
Click For Summary
If a^2 divides b^2, it implies that b^2 can be expressed as a^2 multiplied by some integer c, leading to the conclusion that c must be a perfect square for a to divide b. The discussion highlights confusion regarding the sufficiency of c being a perfect square to prove that a divides b. For the second statement, if a^2 divides b^3, the same reasoning does not apply, and participants suggest exploring alternative methods or counterexamples. The conversation emphasizes the need for a deeper understanding of the relationships between divisibility and perfect squares. Overall, the thread focuses on the mathematical implications of divisibility in relation to prime factors.
DerpyPenguin
Messages
3
Reaction score
0

Homework Statement


If a^2 divides b^2, then a divides b
Also
If a^2 divides b^3, then a divides b

Homework Equations

The Attempt at a Solution


For the first question, if a^2 divides b^2, then b^2=(a^2)c where c is some integer
c=(b^2)/(a^2)
c=(b/a)^2
The answers in the back say that it is enough to show that c is a perfect square, but I don't see how that's sufficient. If c is a perfect square, then c is an integer, which implies that a^2 divides b^2, which we already knew.

No idea where to go for the second question. The same strategy doesn't seem to work.
 
Physics news on Phys.org
It might help to try to establish this fact: the square root of an integer is either an integer or an irrational number.
 
DerpyPenguin said:

Homework Statement


If a^2 divides b^2, then a divides b
Also
If a^2 divides b^3, then a divides b

Homework Equations

The Attempt at a Solution


For the first question, if a^2 divides b^2, then b^2=(a^2)c where c is some integer
c=(b^2)/(a^2)
c=(b/a)^2
The answers in the back say that it is enough to show that c is a perfect square, but I don't see how that's sufficient. If c is a perfect square, then c is an integer, which implies that a^2 divides b^2, which we already knew.

No idea where to go for the second question. The same strategy doesn't seem to work.

A more general approach to those problems would start with:

Let ##p## be a prime divisor of ##a## of order ##n##.
 
DerpyPenguin said:
No idea where to go for the second question. The same strategy doesn't seem to work.

You could try to find a counterexample!
 
  • Like
Likes SammyS

Similar threads

Replies
11
Views
2K
Replies
1
Views
1K
  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 9 ·
Replies
9
Views
2K
Replies
13
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 19 ·
Replies
19
Views
2K
  • · Replies 18 ·
Replies
18
Views
2K