Discrete math practice problems. Prove whether true or false. If a^2 divides b^2, then a^3 divides b^4. I think it is false because it is true that if a^2 divides b^2 then a divides b, and also true that if a^2 divides b^2 then a^4 divides b^4.

Bruno Thompson 2022-07-18 Answered
Discrete math practice problems
prove whether true or false
If a 2 divides b 2 , then a 3 divides b 4
I think it is false because it is true that if a 2 divides b 2 then a divides b ,
and also true that if a 2 divides b 2 then a 4 divides b 4 .
could anyone check this one?
You can still ask an expert for help

Want to know more about Discrete math?

Expert Community at Your Service

  • Live experts 24/7
  • Questions are typically answered in as fast as 30 minutes
  • Personalized clear answers
Learn more

Solve your problem for the price of one coffee

  • Available 24/7
  • Math expert for every subject
  • Pay only if we can solve it
Ask Question

Answers (1)

kamphundg4
Answered 2022-07-19 Author has 20 answers
Explanation:
if a divides b then a 3 divides b 3 . If a 3 divides b 3 then a 3 divides b b 3 so a 3 divides b 4
Not exactly what you’re looking for?
Ask My Question

Expert Community at Your Service

  • Live experts 24/7
  • Questions are typically answered in as fast as 30 minutes
  • Personalized clear answers
Learn more

You might be interested in

asked 2021-07-28

Let A, B, and C be sets. Show that (AB)C=(AC)(BC)
image

asked 2021-08-15
How many elements are in the set { 0, { { 0 } }?
asked 2021-08-02
Suppose that A is the set of sophomores at your school and B is the set of students in discrete mathematics at your school. Express each of these sets in terms of A and B.
a) the set of sophomores taking discrete mathematics in your school
b) the set of sophomores at your school who are not taking discrete mathematics
c) the set of students at your school who either are sophomores or are taking discrete mathematics
Use these symbols:
asked 2020-11-09
Use proof by Contradiction to prove that the sum of an irrational number and a rational number is irrational.
asked 2022-07-17
Proof: [ a c a + b c + d ]
Reflextivity: R is reflexive if (a,b)R(a,b) for all a , b Z
Antisymmetry: ...
Transitivity: Suppose (a,b)R(c,d) and (c,d)R(a,b)
asked 2022-07-07
asked 2022-06-24
Combinatorics, Hall's marriage theorem for bipartite graphs, where 2 vertices cannot be connected to more than one common vertex from the other side
I have a problem I'm trying to solve. the problem is: given Bipartite graph G = ( A B , E ), where | A | = | B | = n > 100. and all edges are from A to B (all edges are symmetric), additionaly, lets assume that a 1 a 2 in A, | { b B : { a 1 , b } , { a 2 , b } E } | 1..
(in the original problem I had to prove it, which I actually did, So its a given now, you can also assume that the same applies with 2 vertices of B and one vertex from A if you need, just like the topic mentions ). Furthermore, the degree of every vertex in A is at least n 4 , prove that there is a perfect matching in the graph. any hints or solutions would be great, thanks in advance!. edit: Hey, I might've done a mistake by not telling an important information, the original question included the following assumption: assume that for each a 1 a 2 in A and for each b 1 b 2 in B at least one of the pairs { a 1 , b 1 } , { a 1 , b 2 } , { a 2 , b 1 } , { a 2 , b 2 } isn't an edge in the graph.

New questions

Solve your problem for the price of one coffee

  • Available 24/7
  • Math expert for every subject
  • Pay only if we can solve it
Ask Question