Draw the Hasse diagram for the “divides” relation on {2, 3, 5, 10, 11, 15, 25, 36, 42, 108}
Determine whether each of these functions is a bijection from R to R?f (x) = (x2 + 1)/(x2 + 2)
Find the transitive closure A={1,2,3,4,5}
R={ (2,3),(3,5),((1,2),(2,5),(1,3),(4,5),(5,2)} by using Warshall’s Algorithm.
Find these terms of the sequence (An}, where An = 2(3)n + 5
a recursive function is defined by can=2an-1 with a0=1. find the value of a3
Show that ¬ (P"\\iff"Q)"\\iff"(P V Q) Λ ¬(P Λ Q) "\\iff"(P Λ ¬Q) V (¬ P Λ Q) without using truth table