Classify the sentence below as an atomic statement, a molecular statement, or not a

statement at all. If the statement is molecular, identify what kind it is (conjuction,

disjunction, conditional, biconditional, negation).
Everybody needs somebody sometime.
Atomic N/ A

In my safe is a sheet of paper with two shapes drawn on it in colored crayon. One is a
square, and the other is a triangle. Each shape is drawn in a single color. Suppose you
believe me when I tell you that if the square is blue, then the triangle is green. What do you
therefore know about the truth value of the following statement?
The statement is TRUE
If the triangle is not green, then the square is not blue.

Classify the sentence below as an atomic statement, a molecular statement, or not a

statement at all. If the statement is molecular, identify what kind it is (conjuction,
disjunction, conditional, biconditional, negation).
The Broncos will win the Super Bowl or I’ll eat my hat.
Molecular Conjunction

Classify the sentence below as an atomic statement, a molecular statement, or not a

statement at all. If the statement is molecular, identify what kind it is (conjuction,
disjunction, conditional, biconditional, negation).
The sum of the first 100 odd positive integers.
Atomic N/ A

Determine whether the sentence below is an atomic statement, a molecular statement, or

not a statement at all.

 The customers wore shoes.

ATOMIC
Consider the statement, “If you will give me a cow, then I will give you magic beans.”
Determine whether the statement below is the converse, the contrapositive, or neither.

 If I will not give you magic beans, then you will not give me
Contrapositive
a cow.

In my safe is a sheet of paper with two shapes drawn on it in colored crayon. One is a
square, and the other is a triangle. Each shape is drawn in a single color. Suppose you
believe me when I tell you that if the square is blue, then the triangle is green. What do you
therefore know about the truth value of the following statement?
The statement is FALSE
The square and the triangle are both blue.

Suppose P and Q are the statements:

P: Jack passed math.
Q: Jill passed math.
Translate "¬(P ν Q) → Q" into English.
If Jack or Jill did not pass math, then Jill passed math.

Suppose P and Q are the statements:

P: Jack passed math.
Q: Jill passed math.
Which of the following translates into “Jack and Jill both passed math” into symbols?
PΛQ

Determine whether the sentence below is an atomic statement, a molecular statement, or

not a statement at all.

Not a Statement
 Customers must wear shoes.
Consider the statement, “If you will give me a cow, then I will give you magic beans.”
Determine whether the statement below is the converse, the contrapositive, or neither.

 If you will not give me a cow, then I will not give you
Converse
magic beans.

Consider the statement, “If you will give me a cow, then I will give you magic beans.”
Determine whether the statement below is the converse, the contrapositive, or neither.

Contrapositive
 You will give me a cow and I will not give you magic beans.

Classify the sentence below as an atomic statement, a molecular statement, or not a

statement at all. If the statement is molecular, identify what kind it is (conjuction,
disjunction, conditional, biconditional, negation).
We can have donuts for dinner, but only if it rains.
Molecular Conditional

Classify the sentence below as an atomic statement, a molecular statement, or not a

statement at all. If the statement is molecular, identify what kind it is (conjuction,
disjunction, conditional, biconditional, negation).
Every natural number greater than 1 is either prime or composite.
Molecular Conditional

In my safe is a sheet of paper with two shapes drawn on it in colored crayon. One is a
square, and the other is a triangle. Each shape is drawn in a single color. Suppose you
believe me when I tell you that if the square is blue, then the triangle is green. What do you
therefore know about the truth value of the following statement?
The statement is TRUE
If the triangle is green, then the square is blue.

Consider the statement, “If you will give me a cow, then I will give you magic beans.”
Determine whether the statement below is the converse, the contrapositive, or neither.

Converse
 If you will give me a cow, then I will not give you magic beans.
Consider the statement, “If you will give me a cow, then I will give you magic beans.”
Determine whether the statement below is the converse, the contrapositive, or neither.

Neither
 If I will give you magic beans, then you will give me a cow.

In my safe is a sheet of paper with two shapes drawn on it in colored crayon. One is a
square, and the other is a triangle. Each shape is drawn in a single color. Suppose you
believe me when I tell you that if the square is blue, then the triangle is green. What do you
therefore know about the truth value of the following statement?
The statement is FALSE
Customers must wear shoes

In my safe is a sheet of paper with two shapes drawn on it in colored crayon. One is a
square, and the other is a triangle. Each shape is drawn in a single color. Suppose you
believe me when I tell you that if the square is blue, then the triangle is green. What do you
therefore know about the truth value of the following statement?
The statement is FALSE
The square is not blue or the triangle is green.

Determine whether the sentence below is an atomic statement, a molecular statement, or

not a statement at all.

Molecular
 The customers wore shoes and they wore socks.

When a connected graph can be drawn without any edges crossing, it is called
________________ .

Planar graph
Which of the following is false?

A graph with one odd vertex will have an Euler Path but not an Euler Circuit.

¬P ∨ Q is equivalent to :

P→Q

In my safe is a sheet of paper with two shapes drawn on it in colored crayon. One is a square,
and the other is a triangle. Each shape is drawn in a single color. Suppose you believe me when I
tell you that if the square is blue, then the triangle is green. What do you therefore know about
the truth value of the following statements?

If the triangle is green, then the square is blue

range
The is a subset of the codomain. It is the set of all elements which are assigned to
at least one element of the domain by the function. That is, the range is the set of all
outputs.

The cardinality of {3, 5, 7, 9, 5} is 5.

False

A graph has no isolated vertices.

connected

In my safe is a sheet of paper with two shapes drawn on it in colored crayon. One is a
square, and the other is a triangle. Each shape is drawn in a single color. Suppose you
believe me when I tell you that if the square is blue, then the triangle is green. What do you
therefore know about the truth value of the following statement?
The statement is TRUE
If the triangle is green, then the square is blue.
A sequence of vertices such that consecutive vertices (in the sequence) are adjacent (in the
graph). A walk in which no edge is repeated is called a trail, and a trail in which no vertex is
repeated (except possibly the first and last) is called a path.
Walk
Answer:
A sequence that involves a common difference in identifying the succeeding terms.

Arithmetic Progression
bijection
A is a function which is both an injection and surjection. In other words, if every
element of the codomain is the image of exactly one element from the domain

A Bipartite graph is a graph for which it is possible to divide the vertices into two disjoint
sets such that there are no edges between any two vertices in the same set.

True

A path which visits every vertex exactly once

Hamilton path
Classify the sentence below as an atomic statement, a molecular statement, or not a
statement at all. If the statement is molecular, identify what kind it is (conjuction,
disjunction, conditional, biconditional, negation).
Everybody needs somebody sometime.
Atomic N/ A

How many edges would a complete graph have if it had 6 vertices?

15

Paths start and stop at the same vertex.

False

In my safe is a sheet of paper with two shapes drawn on it in colored crayon. One is a
square, and the other is a triangle. Each shape is drawn in a single color. Suppose you
believe me when I tell you that if the square is blue, then the triangle is green. What do you
therefore know about the truth value of the following statement?
The statement is FALSE
The square and the triangle are both green.

The number of edges incident to a vertex

Degree of a vertex
Answer:

Determine whether the sentence below is an atomic statement, a molecular statement, or

not a statement at all.

Atomic
 The customers wore shoes.

Indicate which, if any, of the following graphs G = (V, E, φ), |V | = 5, is not connected.

φ = ( a {1,2} b {2,3} c {1,2} d {1,3} e {2,3} f {4,5} )

Arithmetic progression is the sum of the terms of the arithmetic series.

False

Suppose P and Q are the statements:

P: Jack passed math.
Q: Jill passed math.
Translate "¬(P ν Q) → Q" into English.
If Jack or Jill did not pass math, then Jill passed math.

Let A = {1, 2, 3, 4, 5} and B = {3, 4, 5, 6, 7}

Find A ∩ B
{3, 4, 5}

An argument is said to be valid if the conclusion must be true whenever the premises are all
true.

True
Euler circuit Euler path
A is a which starts and stops at the same vertex.

In my safe is a sheet of paper with two shapes drawn on it in colored crayon. One is a
square, and the other is a triangle. Each shape is drawn in a single color. Suppose you
believe me when I tell you that if the square is blue, then the triangle is green. What do you
therefore know about the truth value of the following statement?
The statement is TRUE
If the triangle is not green, then the square is not blue.
Classify the sentence below as an atomic statement, a molecular statement, or not a
statement at all. If the statement is molecular, identify what kind it is (conjuction,
disjunction, conditional, biconditional, negation).
Every natural number greater than 1 is either prime or composite.
Molecular Conditional

Does this graph have an Euler Path, Euler Circuit, both, or neither?

Both

Two edges are adjacent if they share a vertex.

True
A graph in which every pair of vertices is adjacent.
complete graph
Answer:
Proofs that is used when statements cannot be rephrased as implications.
Proof by Contradiction
Answer:
What is the line covering number of for the following graph?

3
Identify the propositional logic of the truth table given

Negation

A set of statements, one of which is called the conclusion and the rest of which are called
premises.
argument
Answer:
¬(P ∨ Q) is logically equal to which of the following expressions?

¬P ∧ ¬Q.

Consider the statement, “If you will give me a cow, then I will give you magic beans.”
Determine whether the statement below is the converse, the contrapositive, or neither.

 If I will not give you magic beans, then you will not give me
Contrapositive
a cow.
Determine whether the sentence below is an atomic statement, a molecular statement, or
not a statement at all.
Not a statement at all
(a) Customers must wear shoes.
Atomic statement
(b) The customers wore shoes.
Molecular statement
(c) The customers wore shoes and they wore socks.

Logic Equivalence
is the same truth value under any assignment of truth values to their
atomic parts.

Find | R | when R = {2, 4, 6,..., 180}

90
Answer:
Let A = {3, 4, 5}. Find the cardinality of P(A).
8
Answer:
For all n in rational, 1/n ≠ n – 1

False

A connected graph with no cycles.

Tree
Does a rational r value for r2 =6 exist?

No, a rational r does not exist.

A graph is complete if there is a path from any vertex to any other vertex.

False

A simple graph has no loops nor multiple edges.

True

Two graphs that are the same are said to be _______________

isomorphic
How many spanning trees are possible in the given figure?

7(try)
Given the series : 2,5,8,11....

What is the type of progression?

Arithmetic

What is the sum from 1st to 5th element?

40

match the following formulas to its corresponding sequence

Double Summation

Geometric Series
In my safe is a sheet of paper with two shapes drawn on it in colored crayon. One is a
square, and the other is a triangle. Each shape is drawn in a single color. Suppose you
believe me when I tell you that if the square is blue, then the triangle is green. What do you
therefore know about the truth value of the following statements?
FALSE
(a) The square and the triangle are both blue.
FALSE
(b) The square and the triangle are both green.
TRUE
(c) If the triangle is not green, then the square is not blue.
TRUE
(d) If the triangle is green, then the square is blue.
FALSE
(e) The square is not blue or the triangle is green.
The ________________________ states that if event A can occur in m ways, and event B can occur
in n disjoint ways, then the event “A or B” can occur in m + n ways.

Additive principle

The study of what makes an argument good or bad.

Logic
is a function from a subset of the set of integers.

sequence
What is the minimum height height of a full binary tree?
3

Which of the following statements is NOT TRUE?

Any tree with at least two vertices has at least two vertices of degree two (trY)

Euler paths must touch all edges.

True

A sequence of vertices such that every vertex in the sequence is adjacent to the vertices
before and after it in the sequence

Walk
A spanning tree that has the smallest possible combined weight.

minimum spanning tree

A statement which is true on the basis of its logical form alone.

Tautology

How many simple non-isomorphic graphs are possible with 3 vertices?

If n is a rational number, 1/n does not equal n-1.

True
 tree
A connected graph with no cycles. (If we remove the requirement that the
graph is connected, the graph is called a forest.) The vertices in a tree with degree 1 are
leaves
called .

The sum of the geometric progression is called geometric series

True

A tree is the same as a forest.

False

surjective and injecive are opposites of each other.

False

The given graph is planar.

True

The number of simple digraphs with |V | = 3 is

9 (try)

Tracing all edges on a figure without picking up your pencil or repeating and starting and
stopping at different spots

Euler Circuit

Match the truth tables to its corresponding propositional logic

Conjunction
Disjunction

Implication
forest
A graph F is a if and only if between any pair of vertices in F there is at
one path
most
bipartite
A graph has two distinct groups where no vertices in either group connecting to
members of their own group

is the simplest style of proof.

direct proof
Deduction rule is an argument that is not always right.

False

Find f (1).

4
The geometric sequences uses common _________ in finding the succeeding terms.

ratio (try)
nodes
The tree elements are called
An undirected graph G which is connected and acyclic is called ____________.

tree

The child of a child of a vertex is called

Grandchild
A graph T is a tree if and only if between every pair of distinct vertices of T there is a unique
path.

True

All graphs have Euler's Path

False
inverse image
The of a a subset B of the codomain is the set f −1 (B) {x ∈ X : f (x) ∈ B}.

What is the 4th and 8th element of a(n)= n^(2) ?

16,64

The minimum number of colors required in a proper vertex coloring of the graph.

Chromatic Number
Let A = {1, 2, 3, 4, 5} and B = {3, 4, 5, 6, 7}
Find A U B
{1, 2, 3, 4, 5, 6, 7}

Find | R | when R = {2, 4, 6,..., 180}

90

Find |A ∩ B| when A = {1, 3, 5, 7, 9} and B {2, 4, 6, 8, 10}

0

Find the cardinality of R = {20,21,...,39, 40}

|R|=
21

Let A = {1, 2, 3, 4, 5} and B = {3, 4, 5, 6, 7}

Find A \ B
{1, 2}
Let A = {3, 4, 5}. Find the cardinality of P(A).
8

{∅,{3},{4},{5},{3,4},{3,5},{4,5},{3,4,5}}

Let A = {1, 2, 3, 4, 5} and B = {3, 4, 5, 6, 7}

Find A ∩ B
{3, 4, 5}

Let A = {1, 2, 3, 4, 5}, B = {3, 4, 5, 6, 7}, and C = {2, 3, 5}.

Find A ∩ (B U C)

3
{1, 2, 3, 4, 5}∩({3, 4, 5, 6, 7}U{2, 3, 5})

{1, 2, 3, 4, 5}∩{2, 3, 4, 5, 6, 7}

{2, 3, 4, 5}

The cardinality of {3, 5, 7, 9, 5} is 5.

False

Find the cardinality of S = {1, {2,3,4},0}

|S|=
3

Exercise 3
It is a rule that assigns each input exactly one output

Function

GIven the function :

f : Z → Z defined by f(n) = 3n
Which of the following is a possible range of the function?
all multiples of three

Rule that states that every function can be described in four ways: algebraically (a formula),
numerically (a table), graphically, or in words.

Rule of four
Consider the function f : N → N given by f (0) 0 and f (n + 1) f (n) + 2n + 1. Find f (6).

36

A simple graph has no loops nor multiple edges. f : N → N, a

recursive

definition consists of an

initial condition

together with a

recurrence relation
range
The is a subset of the codomain. It is the set of all elements which are assigned to
at least one element of the domain by the function. That is, the range is the set of all
outputs.
bijection
A is a function which is both an injection and surjection. In other words, if every
element of the codomain is the image of exactly one element from the domain
inverse image
• The of a a subset B of the codomain is the set f −1 (B) {x ∈ X : f (x) ∈ B}.

Answer the following:

4
f (1) =
2
What is the element n in the domain such as f(n) = 1
3
Find an element n of the domain such that f (n) = n.
surjective and injecive are opposites of each other.

False

The ________________________ states that if event A can occur in m ways, and event B can occur
in n disjoint ways, then the event “A or B” can occur in m + n ways.

Additive principle
Determine the number of elements in A U B.

18

Additive principle states that if given two sets A and B, we have |A × B| |A| · |B|.

False

Let A, B and C represent people who like apples, bananas, and carrots respectively. The
number of people in A = 10, B = 12 and C = 16. Three people are such that they enjoy
apples, bananas as well as carrots. Two of them like apples and bananas. Let three people
like apples and carrots. Also, four people are such that they like bananas and carrots.

How many people like apples only?

How many people like only one of the three?

26

Given the diagram, answer the following questions :

How many people takes tea and wine?

32

How many people takes coffee but not tea and wine?

45

What is the difference of persons who take wine and coffee to the persons who the persons
who takes tea only?

15

Out of 7 consonants and 4 vowels, how many words of 3 consonants and 2 vowels can be
formed?

210
Defined as the product of all the whole numbers from 1 to n.

Factorial

In how many different ways can the letters of the word 'OPTICAL' be arranged so that the
vowels always come together?

720

IN combinations, the arrangement of the elements is in a specific order.

False

How many 3-letter words with or without meaning, can be formed out of the letters of the
word, 'LOGARITHMS', if repetition of letters is not allowed?

720

Identify the propositional logic of the truth table given

negation

Deduction rule is an argument that is not always right.

False

It is an algorithm for traversing or searching tree or graph data structures.

breadth first search

A graph for which it is possible to divide the vertices into two disjoint sets such that there
are no edges between any two vertices in the same set.

Bipartite graph

It is a connected graph containing no cycles.

Tree

The ________________________ states that if event A can occur in m ways, and event B can occur
in n disjoint ways, then the event “A or B” can occur in m + n ways.

Additive principle

Let ‘G’ be a connected planar graph with 20 vertices and the degree of each vertex is 3. Find
the number of regions in the graph.

12

Solution
By the sum of degrees theorem,
20 ∑ i=1 deg(Vi) = 2|E|
20(3) = 2|E|
|E| = 30
By Euler’s formula,
|V| + |R| = |E| + 2
20+ |R| = 30 + 2
|R| = 12
Hence, the number of regions is 12.
If two vertices are adjacent, then we say one of them is the parent of the other, which is
child
called the of the parent.

Determine whether the sentence below is an atomic statement, a molecular statement, or

not a statement at all.
Not a Statement
Customers must wear shoes.

Find the cardinality of R = {20,21,...,39, 40}

|R|=
21
¬(P ∨ Q) is logically equal to which of the following expressions?

¬P ∧ ¬Q.

The number of edges incident to a vertex

Degree of a vertex

How many edges would a complete graph have if it had 6 vertices?

15

How many 3-letter words with or without meaning, can be formed out of the letters of the
word, 'LOGARITHMS', if repetition of letters is not allowed?

Assume the sequence: 1,3,5,7,9, ….

29
What is the 20th term?
Arithmetic
What type of progression this suggest?

A path which visits every vertex exactly once

Hamilton path
Consider the statement, “If you will give me a cow, then I will give you magic beans.”
Determine whether the statement below is the converse, the contrapositive, or neither.
Converse
If I will give you magic beans, then you will not give me a cow.

The number of edges incident to a vertex.

Degree of a vertex

Find the contrapositive of the given statement.

If you travel to London by train, then the journey takes at least two hours.
If your journey by train takes less than two hours, then you don’t travel to London.

Consider the statement, “If you will give me a cow, then I will give you magic beans.”
Determine whether the statement below is the converse, the contrapositive, or neither.

Neither
 If I will give you magic beans, then you will give me a cow.
Find | R | when R = {2, 4, 6,..., 180}
90

Determine whether the sentence below is an atomic statement, a molecular statement, or

not a statement at all.

Molecular
 The customers wore shoes and they wore socks.

A sequence of vertices such that consecutive vertices (in the sequence) are adjacent (in the
graph). A walk in which no edge is repeated is called a trail, and a trail in which no vertex is
repeated (except possibly the first and last) is called a path.

Walk

Match the following properties of trees to its definition.

Answer 1
Propositi
A graph T is a tree if and only if between every pair of distinct vertices of T there is a unique path.
on 4.2.1

Answer 2
Corollary
A graph F is a forest if and only if between any pair of vertices in F there is at most one path
4.2.2

Answer 3
Propositi
Any tree with at least two vertices has at least two vertices of degree one.
on 4.2.3

Answer 4
Propositi
4 Let T be a tree with v vertices and e edges. Then e v - 1.
on 4.2.4

Indicate which, if any, of the following three graphs G = (V, E, φ), |V | = 5, is not isomorphic
to any of the other two.

φ = (A {1,3} B {2,4} C {1,2} D {2,3} E {3,5} F {4,5} )

GIven the function :

f : Z → Z defined by f(n) = 3n
Which of the following is a possible range of the function?
all multiples of three

An argument is said to be valid if the conclusion must be true whenever the premises are all
true.

True
In my safe is a sheet of paper with two shapes drawn on it in colored crayon. One is a
square, and the other is a triangle. Each shape is drawn in a single color. Suppose you
believe me when I tell you that if the square is blue, then the triangle is green. What do you
therefore know about the truth value of the following statement?
The statement is FALSE
The square and the triangle are both green.

Let A = {1, 2, 3, 4, 5}, B = {3, 4, 5, 6, 7}, and C = {2, 3, 5}.

Find A ∩ (B U C)

{1, 2, 3, 4, 5}∩({3, 4, 5, 6, 7}U{2, 3, 5})

{1, 2, 3, 4, 5}∩{2, 3, 4, 5, 6, 7}

{2, 3, 4, 5}

Circuits start and stop at _______________

same vertex

In a simple graph, the number of edges is equal to twice the sum of the degrees of the
vertices.

False

Solve for the value of n in :

−4= n+7 over 6
-31

In my safe is a sheet of paper with two shapes drawn on it in colored crayon. One is a
square, and the other is a triangle. Each shape is drawn in a single color. Suppose you
believe me when I tell you that if the square is blue, then the triangle is green. What do you
therefore know about the truth value of the following statement?
The statement is TRUE
If the triangle is not green, then the square is not blue.
As soon as one vertex of a tree is designated as the blank , then every other vertex on the
tree can be characterized by its position relative to the root.

root

If the right angled triangle t, with sides of length a and b and hypotenuse of length c, has area
equal to c2/4, what kind of triangle is this?
isosceles triangle

Your answer is correct.

(a2+b2)/4=(1/2)ab
Multiply both sides by 4 to get:
a2+b2=2ab
Solving for 0 we get:
a2-2ab+b2=0
And factoring the polynomial we get:
(a-b)2=0
Take the square root of both sides:
±(a-b)=0
a=b
Therefore, a triangle with two equal sides is an ISOSCELES Triangle.
Which of the following statements are equivalent to the implication, “if you win the lottery,
then you will be rich,”?

You will be rich if you win the lottery.

It is necessary for you to win the lottery to be rich.

It is sufficient to win the lottery to be rich.

What is the matching number for the following graph?

It is a rule that assigns each input exactly one output

Function

What is the missing term?

3,9,__,81....

27
De Morgan's law is used in finding the equivalence of a logic expression using other logical
functions.

True

Consider the statement, “If you will give me a cow, then I will give you magic beans.”
Determine whether the statement below is the converse, the contrapositive, or neither.

Contrapositive
 You will give me a cow and I will not give you magic beans.

It is the switching the hypothesis and conclusion of a conditional statement.

Converse
Consider the statement, “If you will give me a cow, then I will give you magic beans.” Decide
whether each statement below is the converse, the contrapositive, or neither.
Converse
(a) If you will give me a cow, then I will not give you magic beans.
Contrapositive
(b) If I will not give you magic beans, then you will not give me a cow.
Neither
(c) If I will give you magic beans, then you will give me a cow.
(d) If you will not give me a cow, then I will not give you magic
Converse
beans.
Contrapositive
(e) You will give me a cow and I will not give you magic beans.
Converse
(f) If I will give you magic beans, then you will not give me a cow.

Arithmetic progression is the sum of the terms of the arithmetic series.

False

An argument form which is always valid.

deduction rule
These are lines or curves that connect vertices.

Nodes (Try)

surjective and injecive are opposites of each other.

False
A graph is an ordered pair G (V, E) consisting of a nonempty set V (called the vertices) and a
set E (called the edges) of two-element subsets of V.

True

How many possible output will be produced in a proposition of three statements?

8
A graph in which every pair of vertices is adjacent.

complete graph
Consider the statement, “If you will give me a cow, then I will give you magic beans.”
Determine whether the statement below is the converse, the contrapositive, or neither.

Converse
 If you will give me a cow, then I will not give you magic beans.

 Classify each of the sentences below as an atomic statement, a molecular statement,

or not a statement at all. If the statement is molecular, say what kind it is (conjuction,
disjunction, conditional, biconditional, negation).
 (a) The sum of the first 100 odd positive integers.
Atomic N/ A


 (b) Everybody needs somebody sometime.

Atomic N/ A


 (c) The Broncos will win the Super Bowl or I’ll eat my hat.
Molecular Conjunction


 (d) We can have donuts for dinner, but only if it rains.

Molecular Conditional


 (e) Every natural number greater than 1 is either prime or composite.

Molecular Conditional


 (f) This sentence is false.

Atomic N/ A

Every connected graph has a spanning tree.

True

A function which renames the vertices.

isomorphism

Let A = {1, 2, 3, 4, 5} and B = {3, 4, 5, 6, 7}

Find A ∩ B
{3, 4, 5}

Which of the following the logic representation of proof by contrapositive?

P → Q = ¬Q → ¬P