NORTH CAROLINA CENTRAL UNIVERSITY
DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE
COMP2200
Prof. H. Melikyan,
HW 3
spring 2014
Assigned 03/06/14
Due
03/20 /14
Show all your work on the problems to receive full credit. Justify all your answers. Explain
all
Conditional Statement
2.2
The Implication (conditional)
Definition: If P and Q are propositions then P Q is a
new proposition which referred to as P implies Q. The
proposition P Q is false if P is true and Q is not true.
P is called the hypothesis and q i
Conditional Statement
2.2
The Implication (conditional)
Definition: If P and Q are propositions then P Q is a
new proposition which referred to as P implies Q. The
proposition P Q is false if P is true and Q is not true.
P is called the hypothesis and q i
Chapter 3: Elementary Number Theory
and Methods of Proofs
3.1-.3.4 Direct Methods and Counterexamples
Introduction
Rational Numbers
Divisibality
Divisopn Algorith
Instructor: Hayk Melikya
Introduction to Abstract Mathematics
[email protected]
1
Basic
Chapter 3:
The Logic of Quantified Statements.
Predicate Calculus
3.1 3.2 Predicates and Quantified Statements
Instructor: Hayk Melikya
Introduction to Abstract Mathematics
[email protected]
1
Predicates (open sentences)
A predicate (an open sentence) is
The Logic of Compound Statements
2.1 and 2.2
Instructor: Hayk Melikya
Introduction to Abstract Mathematics
[email protected]
1
Logic
Logic is not only the foundation of mathematics, but also is
important in numerous fields including law, medicine, and
sci
Valid AND Invalid Arguments
Instructor: Hayk Melikya
Introduction to Abstract Mathematics
2.3
[email protected]
1
Argument
An argument is a sequence of propositions (statements ), and propositional
forms.
All statements but the final one are called assump
Sets
Section 6.1 Basic Definitions of Sets Theory
Section 6.2 Properties of sets
Section 6.3 Proofs and Boolean Algebras
The most fundamental notion in all of mathematics is that of a set.
We say that a set is a specified collection of objects, called
el
Applications : Digital Logic Circuits 1.4 and
Number Systems
1.5
Instructor: Hayk Melikya
Introduction to Abstract Mathematics
[email protected]
1
Simple electrical switching device
Here are more complicated circuits
Introduction to Abstract Mathematics
2
Introduction to Automata and Formal Languages
Section 1. First Definitions.
An alphabet is a finite collection of arbitrary symbols, usually called letters. A word
(over the alphabet ) is a finite sequence 12 3n of letters in ; the same letter
might occu
NORTH CAROLINA CENTRAL UNIVERSITY
DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE
COMP2200
Prof. H. Melikyan,
HW 2
spring 2014
Assigned 02/18/14
Due 02/25 /14
Show all your work on the problems to receive full credit. Justify all your answers. Explain
all
NORTH CAROLINA CENTRAL UNIVERSITY
DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE
COMP2200
Prof. H. Melikyan,
HW 1B
Spring 2012
Assigned 02/13/12
Due 02/16/12
Proof each of the following by using derivation method:
a) (P R)
b) P
~ (Q
c) (P Q)
d) P
Q, (P T)
NORTH CAROLINA CENTRAL UNIVERSITY
DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE
COMP2200
02/06/14
Prof. H. Melikyan,
HW 1
Assigned
spring 2014
Due
02/13 /14
Show all your work on the problems to receive full credit. Justify all your answers. Explain
all