Discrete Mathematics Answers

Show that whether x5 + 10x3 + x + 1 is O(x4) or not?

Prove that the map f : C → R

2

, x + iy 7→ (x, y) is a bijection, i.e., a cardinal equivalence

C ≈ R

Show that inclusion relation ⊆ is a partial ordering on the power set of a set S. Draw the Hasse diagram for the partial ordering {(A,B) | A ⊆ B} on the power set P(S) where S = {a,b,c}.

Asim, a student in this class, knows how to write programs in Java. Everyone who knows how to write programs in Java can get a high-paying job. Therefore, someone in this class can get a high-paying job

p ↔ ¬ (r˅q)

We call a positive integer perfect if it equals the sum of its positive divisors

other than itself.

(a) Prove that 6 and 28 are perfect numbers

(b) Prove that if 2p − 1 is prime, then 2p−1

Construct a truth tabal for each of these compound proposition

Prove the identity laws in Table 1 by showing that a) A U 0 A. b) A n U = A.

p ^   ~ (q ^ r)

Use iteration, either forward or backward substitution, to solve the recurrence relation a_n=a_n−1−1 for any positive integer n, with initial condition, a₀=1. Use mathematical induction to prove the solution you find is correct.