Can You Prove These Divisibility Questions on Positive Integers?

  • Thread starter Thread starter 1+1=1
  • Start date Start date
  • Tags Tags
    Divisibility
Click For Summary

Homework Help Overview

The discussion revolves around two divisibility questions involving positive integers. The first question examines the relationship between the divisibility of cubes and squares, while the second question addresses the concept of exact divisibility in the context of prime factorization.

Discussion Character

  • Exploratory, Conceptual clarification, Mathematical reasoning

Approaches and Questions Raised

  • The original poster attempts to establish a proof for the first question by using definitions of divisibility but expresses uncertainty about the next steps. They also outline their understanding of the second question but feel stuck. Other participants suggest focusing on algebraic manipulation and prime factorization as potential approaches.

Discussion Status

Some participants have provided insights into the algebraic aspects of the first question, while others have noted the importance of prime factors in proofs. There is a mix of interpretations and suggestions, but no consensus has been reached on the proofs themselves.

Contextual Notes

The original poster indicates a lack of clarity in their understanding of the problems, and some participants question the assumptions made in their reasoning. There is also a mention of the need for a thorough proof, which suggests constraints on the level of detail expected in the responses.

1+1=1
Messages
93
Reaction score
0
Two questions here. I know the definitions, but cannot formulate a through proof.

1.a and b are positive integers. If a^3 | (is divisible by) b^2, then a | (is divisible by) b.

Now, by definition, I know that a^3*k=b^2, for some k. Also, I know that a * j = b for some j. But where do I go from here?

2.If p^a || (exactly divides) m, then p^ka || (exactly divides) m^k.

Again, by definition, p^a | (is divisible by) m and p^a+1 is not divisible by m. Also, p^ka | (is divisible by) m^k and p^ka+1 is not divisible by m^k+1.

This is all I can get. I just do not know where to go from here. Does anyone have any suggestions?? Thank you all, and you are all very smart on this website, if I have never mentioned that before!
 
Last edited:
Physics news on Phys.org
a^3 k = b^2
a (a^2 k) = b b
a (a^2 k/b) = b
j = a^2 k/b

Show j is the "same kind of number" as k. If k is a positive integer then show that so is j.
 
Last edited:
Ahhhh, I knew it was something with algebra. Thank you very much. I understand that now. because something multiplied by a must mean that a is divisible by b. Thanks much! If only I can get this second one. :mad:
 
1+1=1 said:
Two questions here. I know the definitions, but cannot formulate a through proof.
1.a and b are positive integers. If a^3 | (is divisible by) b^2, then a | (is divisible by) b.
Now, by definition, I know that a^3*k=b^2, for some k. Also, I know that a * j = b for some j.
It's the other way round : a|b means that a divides b, or b is divisible by a.
 
EnumaElish said:
a^3 k = b^2
a (a^2 k) = b b
a (a^2 k/b) = b
j = a^2 k/b

Show j is the "same kind of number" as k. If k is a positive integer then show that so is j.
I don't see how this has reduced the difficulty of the problem ... :confused:..or what the OP has understood from it.
 
1. One only ever need consider prime factors, with multiplicty, for a direct proof. Or you could prove it by contradiction.

2. is easier. p^a exactly divides n is the same as saying n=m*p^a where p does not divide m. The solution should just leap out at you.
 

Similar threads

Replies
15
Views
4K
Replies
3
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 9 ·
Replies
9
Views
3K
  • · Replies 9 ·
Replies
9
Views
3K
  • · Replies 22 ·
Replies
22
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
Replies
1
Views
1K