Question

Please Respond! 2 Discrete Structures Direct Proofs Questions! 1) Show that the product of two odd...

Please Respond! 2 Discrete Structures Direct Proofs Questions!

1) Show that the product of two odd integers is odd.

2) Consider two integers a and b, with a≠0. We say that a divides b, and we write a|b, iff there exists and integer m such that b=am. Now, consider three integers a, b and c, with a≠0 and b≠0; show that if a|b and b|c then a|c.

0 0
Add a comment Improve this question Transcribed image text
Answer #1

According to Chegg guidelines I have to solve first question only

Please do next post for second answer

Add a comment
Know the answer?
Add Answer to:
Please Respond! 2 Discrete Structures Direct Proofs Questions! 1) Show that the product of two odd...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • Proofs Use the following definitions and facts about integers in writing your proofs. . Suppose n...

    Proofs Use the following definitions and facts about integers in writing your proofs. . Suppose n є Z. We say n is odd if there exists k є Z such that n-2k + 1 . Suppose n є Z. We say n is even if there exists ke Z such that n-2k . Suppose m, n є Z and m -0. We say ma divides n (written mln) if there exists k Z such that n mk. is either ever...

  • PROOFS: Use these theorems and others to prove these statements. Theorem 1: The sum of two...

    PROOFS: Use these theorems and others to prove these statements. Theorem 1: The sum of two rational numbers is rational. Theorem 2: The product of two rational numbers is rational. Theorem 3: √ 2 is irrational. Induction: Prove that 6 divides n 3 − n for any n ≥ 0 Use strong induction to prove that every positive integer n can be written as the sum of distinct powers of 2. That is, prove that there exists a set of...

  • please answer questions #7-13 7. Use a direct proof to show every odd integer is the...

    please answer questions #7-13 7. Use a direct proof to show every odd integer is the difference of two squares. [Hint: Find the difference of squares ofk+1 and k where k is a positive integer. Prove or disprove that the products of two irrational numbers is irrational. Use proof by contraposition to show that ifx ty 22 where x and y are real numbers then x 21ory 21 8. 9. 10. Prove that if n is an integer and 3n...

  • Discrete Math - Please be detailed. Thanks! . Below is one of the classic fallacies. Note...

    Discrete Math - Please be detailed. Thanks! . Below is one of the classic fallacies. Note that each step is justified. This is the amount of details we would like to see in your proofs. Identify the fallacious step and explain. 5 points STEP 1: Let ab. STEP 2: Multiply both sides by a, we get a2 ab STEP 3: Add a2 to both sides, we get a2 + a2-ab + a2b STEP 4: Collecting like terms, we get 2a2...

  • Discrete Mathematics. (a) Use the method of generalizing from the generic particular in a direct proof...

    Discrete Mathematics. (a) Use the method of generalizing from the generic particular in a direct proof to show that the sum of any two odd integers is even. See the example on page 165 of the 5th edition of Discrete Mathematics with Applications, Metric Version for how to lay this proof out. (b) Determine whether 0.151515... (repeating forever) is a rational number. Give reasoning. (c) Use proof by contradiction to show that for all integers n, 3n + 2 is...

  • #7. TRUE/FALSE. Determine the truth value of each sentence  (no explanation required). ________(a)   k in Z  k2 + 9 = 0....

    #7. TRUE/FALSE. Determine the truth value of each sentence  (no explanation required). ________(a)   k in Z  k2 + 9 = 0. ________(b)  m, n in N,   5m 2n  is in N.    ________(c)   x in R, if |x − 2| < 3, then |x| < 5. #8. For each statement, (i) write the statement in logical form with appropriate variables and quantifiers, (ii) write the negation in logical form, and (iii) write the negation in a clearly worded unambiguous English sentence....

  • 1. Consider the following claim. Claim: For two integers a and b, if a + b...

    1. Consider the following claim. Claim: For two integers a and b, if a + b is odd then a is odd or b is odd. (a) If we consider the claim as the implication P =⇒ Q, which statement is P and which is Q? (b) Write the negations ¬P and ¬Q. (c) (1 point) Write the contrapositive of the claim. (d) Prove the contrapositive of the claim. 2. Use contraposition (proof by contrapositive )to prove the following claim....

  • Only need 2-5. Need it done ASAP, thank you in advance!! Proofs 1) (1.7.16) Prove that...

    Only need 2-5. Need it done ASAP, thank you in advance!! Proofs 1) (1.7.16) Prove that if m and n are integers and nm is even, then m is even or n is even. * What is the best approach here, direct proof, proof by contraposition, or proof by contradiction why? * Complete the proof. 2) Prove that for any integer n, n is divisible by 3 iff n2 is divisible by 3. Does your proof work for divisibility by...

  • Discrete Mathematics Question 1: (a) Use the method of generalizing from the generic particular in a...

    Discrete Mathematics Question 1: (a) Use the method of generalizing from the generic particular in a direct proof to show that the sum of any two odd integers is even. See the example on page 152 (4th edition, Discrete Mathematics with Applications) for how to lay this proof out. (b) Determine whether 0.151515... (repeating forever) is a rational number. Give reasoning. (c) Use proof by contradiction to show that for all integers n, 3n + 2 is not divisible by...

  • Discrete Mathematics and Its Applications |(7th Edition See this solution in the app :5 Chapter 5.3,...

    Discrete Mathematics and Its Applications |(7th Edition See this solution in the app :5 Chapter 5.3, Problem 6E 13 Bookmarks Show all steps: ON Problem Determine whether each of these proposed definitions is a valid recursive definition of a function f from the set of nonnegative integers to the set of integers. Iff is well defined, find a formula for f(n) when n is a nonnegative integer and prove that your formula is valid. a) f(0) = 1, f(n) =...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT