Assignment 0 : Problem 4

0 views

Skip to first unread message

unread,

Sep 6, 2010, 8:14:53 PM9/6/10

to CSC 2511 Fall 2010

A and B are int -> AB is int

Converse

AB is int -> A and B are int

Contrapositive

!(A and B are int) -> !(AB is int)

Negation

A and B are int !-> AB is int

unread,

Sep 6, 2010, 8:19:54 PM9/6/10

to CSC 2511 Fall 2010

G is a planer graph -> G can be colored with at most 4 colors

Converse

G can be colored with at most 4 colors -> G is a planer graph

Contrapositive

!(G is a planer graph) -> !(G can be colored with at most 4 colors)

Negation

G is a planer graph !-> G can be colored with at most 4 colors

Reply all

Reply to author

Forward

0 new messages