Scribd
Upload
5 views1 page

DMGT Unit IV - Proofs Practice Problems

The document is a practice problem set for a Discrete Mathematics course, containing 14 proof-based questions. Topics include properties of integers, rational numbers, induction, and inequalities. The problems require various proof techniques such as contrapositive, induction, and construction of examples.

Uploaded by

aviijunior3865
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
5 views1 page

DMGT Unit IV - Proofs Practice Problems

The document is a practice problem set for a Discrete Mathematics course, containing 14 proof-based questions. Topics include properties of integers, rational numbers, induction, and inequalities. The problems require various proof techniques such as contrapositive, induction, and construction of examples.

Uploaded by

aviijunior3865
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Proofs: Methods & Strategies

Practice Problem Set


Course : Discrete Mathematics

Questions
1. Prove that an integer n is odd iff n2 is odd.

2. Prove (by contrapositive): if 3n + 2 is odd then n is odd.

3. Prove that there is no smallest positive rational number.

4. Prove that there exist two distinct irrational numbers a and b such that ab is rational.

5. Prove by induction that for all n ≥ 1,

1 + 3 + 5 + · · · + (2n − 1) = n2 .

6. Prove by strong induction that every integer n > 1 can be written as a product of prime
numbers.

7. Prove that for any integer n, n2 ≡ 0 or 1 (mod 4).

8. Prove that if a solution to 2x + 5 = 9 exists in integers it is unique; then find the solution.

9. Prove that the sum of an even integer and the square of an odd integer is odd.

10. Prove: if a | b and b | c (integers a, b, c) then a | c.

11. Prove there exists a real number x > 1 such that 2x > x10 .

12. Prove there exists an integer n such that 2n2 − 5n + 2 is prime. (Exhibit one such n.)

13. Let a and b be positive integers. Prove there exist integers s and t such that

gcd(a, b) = sa + tb.

14. Prove Bernoulli’s inequality: if h > −1 and n is a nonnegative integer, then

(1 + h)n ≥ 1 + nh.

You might also like