Study sets matching "discrete math"

Study sets
Classes
Users

Study sets matching "discrete math"

Discrete Math
p --> q... p... So q
p --> q... ~q... So ~p
x1=x x0=0
not(not x)
modus ponens
modus tollens
dominance
x
p --> q... p... So q
modus ponens
p --> q... ~q... So ~p
modus tollens
Discrete Math
fundamental Counting Principle
Addition Principle
recursive definition
Fibonacci sequence
if one event can have x possible different outcomes, and afte…
address situations in which two different tasks are completed…
whenever one element of a sequence is defined in terms of a p…
0,1,1,2,3,5,8,13,21
fundamental Counting Principle
if one event can have x possible different outcomes, and afte…
Addition Principle
address situations in which two different tasks are completed…
DISCRETE MATH
statement
negation of ¬p
conjunction p^q
conjunction
an expression which is either true or false
p... and goes to or... and p goes to ¬p... MAKES P NOT TRUE
AND... "p and q"... both HAVE to be TRUE
p^q
statement
an expression which is either true or false
negation of ¬p
p... and goes to or... and p goes to ¬p... MAKES P NOT TRUE
53 terms
DISCRETE MATH
statement
negation of ¬p
conjunction p^q
conjunction
an expression which is either true or false
p... and goes to or... and p goes to ¬p... MAKES P NOT TRUE
AND... "p and q"... both HAVE to be TRUE
p^q
statement
an expression which is either true or false
negation of ¬p
p... and goes to or... and p goes to ¬p... MAKES P NOT TRUE
25 terms
Discrete Math
fundamental Counting Principle
Addition Principle
recursive definition
Fibonacci sequence
if one event can have x possible different outcomes, and afte…
address situations in which two different tasks are completed…
whenever one element of a sequence is defined in terms of a p…
0,1,1,2,3,5,8,13,21
fundamental Counting Principle
if one event can have x possible different outcomes, and afte…
Addition Principle
address situations in which two different tasks are completed…
Discrete Math
Bipartite Graph
Circuit
Complement Graph
Complete Graph
A graph whose vertices can be divided into 2 sets such that n…
A walk that begins and ends at the same vertex, and has no re…
A graph with the same # of vertices as G but has an edge betw…
A simple graph in which each pair of vertices is joined by an…
Bipartite Graph
A graph whose vertices can be divided into 2 sets such that n…
Circuit
A walk that begins and ends at the same vertex, and has no re…
Discrete Math
Set
N
Z
Q
is a collection of items called its elements
Natural Numbers
Integers
Rationales
Set
is a collection of items called its elements
N
Natural Numbers
27 terms
Discrete Math'
composite
prime
substituted
predicate
合成关系, 合成数;... An integer n is prime if, and only if, n>1 and for…
素数, 质数;
vicarious;... When an element in the domain of the variable of a…
a sentence that contains a finite number of variables and beco…
composite
合成关系, 合成数;... An integer n is prime if, and only if, n>1 and for…
prime
素数, 质数;
Discrete Math
Permutation is how many arrangements a…
1
A traveler can choose from three airli…
Sequence
What is the difference between permutation and combination?
Compute ₅P₀
Multiplication Principle
An ordered list of numbers
Permutation is how many arrangements a…
What is the difference between permutation and combination?
1
Compute ₅P₀
117 terms
Discrete Math
Converse
Contrapositive
Inverse
m | n
if B then A
If (notB) then (notA)
If (notA) then (notB)
exists x s.t. mx=n, also, anything divides 0.
Converse
if B then A
Contrapositive
If (notB) then (notA)
Discrete Math
population
sample frame
p; what you should get
<p; what you get in the experiment
everyone you want to know about
people chosen
population parameter
sample statistic
population
everyone you want to know about
sample frame
people chosen
47 terms
Discrete Math Test 1
Set
Sub-Set
Union
Intersection
A well defined collection of objects, one is able to say if a…
Let A and B be two sets. We say A is a _______ of B provided…
Let A and B be two sets. The _______ of A and B is denoted by…
Let A and B be two sets. The __________ of A and B is denoted…
Set
A well defined collection of objects, one is able to say if a…
Sub-Set
Let A and B be two sets. We say A is a _______ of B provided…
27 terms
Discrete Math
Proposition
Propositional variables (or statement…
Compound propositions
p → q (Conditional Statement)
A proposition is a declarative sentence (that is, a sentence…
We use letters to denote propositional variables (or statemen…
The propositions formed from existing propositions using logi…
False only when p is True and q is False.... (Or)... Always True wh…
Proposition
A proposition is a declarative sentence (that is, a sentence…
Propositional variables (or statement…
We use letters to denote propositional variables (or statemen…
Discrete Math
set of integers
non-negative integers
rational numbers
set of real numbers
Z
N
Q
R
set of integers
Z
non-negative integers
N
Discrete Math Vocabulary
Irrational Numbers
Rational Numbers
Natural Numbers
Whole Numbers
do not terminate or repeat, cannot be written as a fraction
numbers that terminate or repeat, can be written as a fraction
Counting Numbers
0 and counting numbers
Irrational Numbers
do not terminate or repeat, cannot be written as a fraction
Rational Numbers
numbers that terminate or repeat, can be written as a fraction
Discrete Math
Modus Ponens
Modus Tollens
Disjuntive Syllogism
Chain Rule
p , p→q infers q
p→q, ~q infers ~p
p∨q , ~p infers q
p→q, q→r infers p→r
Modus Ponens
p , p→q infers q
Modus Tollens
p→q, ~q infers ~p
7 terms
Discrete Math
leibniz
boole
de morgan
turing
- diplomat, librarian, historian, and genealogist in the serv…
- son of poor shopkeeper in England ... - opened a school and st…
- attended trinity college in Cambridge... - anti- social ... - hum…
- student fellowship in computer science at cambridge univers…
leibniz
- diplomat, librarian, historian, and genealogist in the serv…
boole
- son of poor shopkeeper in England ... - opened a school and st…
11 terms
Discrete math
Mortage
Interest
Principal
Commerical bank
A conveyance of a leim against propery that becomes void upon…
The percentage changed of a sum of mondy that is borrowing
The total amoumt of money borrowed
A bank that offers services to the general public and to comp…
Mortage
A conveyance of a leim against propery that becomes void upon…
Interest
The percentage changed of a sum of mondy that is borrowing
11 terms
Discrete Math
What is a function?
Why is the codomain and domain necessa…
How is the vertical line test related…
What are injective functions?
a function is simply a relation between a set of inputs and a…
let f be the function from x maps to x^2 -- why is this an in…
Can test whether or not each x input maps to exactly one y in…
The function is injective (one-to-one) if every element of th…
What is a function?
a function is simply a relation between a set of inputs and a…
Why is the codomain and domain necessa…
let f be the function from x maps to x^2 -- why is this an in…
13 terms
discrete math
modus tollens (contrapositive)
modus ponens (law of detachment)
law of addition
simplification
p -->q and ~q... ...~p
p-->q and p... ...q
p... ...p or q
p and q... ...p... ...q
modus tollens (contrapositive)
p -->q and ~q... ...~p
modus ponens (law of detachment)
p-->q and p... ...q
discrete math
universal quantifier
existential quantifier
De Morgan's laws for quantifiers
set
a formal expression used in asserting that a stated general p…
"There exists an element x in the domain such that P(x)"
Precedence:... ∃ and ∀ has higher precedence over the other logi…
is an unordered collection of objects, where each object can…
universal quantifier
a formal expression used in asserting that a stated general p…
existential quantifier
"There exists an element x in the domain such that P(x)"
9 terms
Discrete Math
Tree
Forest
Leaf
Cut-point
connected graph without cycles
graph without cycles
a vertex with one degree
each vertex of degree more than one
Tree
connected graph without cycles
Forest
graph without cycles
8 terms
Discrete Math
Even
Odd
Prime
Rational
n is even if n=2k, for some integer k.
n is odd if n=2k+1, for some integer k.
n is prime if n>1 and if n=rs then r=1 or s=1, for any intege…
n is rational if n=p/q where p,q are integers and q does not…
Even
n is even if n=2k, for some integer k.
Odd
n is odd if n=2k+1, for some integer k.
62 terms
Discrete Math
isolated vertex
loop
parallel
adjacent
vertex unconnected by edge to any other vertex
edge that connects vertex to itself
two edges that connect the same pair of vertices
vertices that are connected by an edge
isolated vertex
vertex unconnected by edge to any other vertex
loop
edge that connects vertex to itself
11 terms
Discrete Math
Kennth Arrow
Llyod Shapely
Hugo Steinhaus
Leonhard Euler
Best known/most versatile mathematical economists and awarded…
One of the giants of modern game theory and known for the Sha…
He is polish and made the discovery of the Ham sandwich theorem
One of the greatest mathematical geniuses
Kennth Arrow
Best known/most versatile mathematical economists and awarded…
Llyod Shapely
One of the giants of modern game theory and known for the Sha…
Discrete Math
Simple graph
walk
trail
path
a graph with no multi-edges or loops
A walk from V0 to Vn is a sequence of edges E1, ..., En deter…
a trail is a walk in which all edges are distint
a path is a trail in which all vertices are distinct
Simple graph
a graph with no multi-edges or loops
walk
A walk from V0 to Vn is a sequence of edges E1, ..., En deter…
100 terms
Discrete Math
1. Acute Angle
2. Adjacent Angles
3. Area
4. Circle
An angle with a measure of less than 90 degrees.
Angles that share a common side and a common vertex.
The space within a closed plane figure, measured in square un…
The set of all points in a plane that are equidistant from a…
1. Acute Angle
An angle with a measure of less than 90 degrees.
2. Adjacent Angles
Angles that share a common side and a common vertex.
10 terms
Discrete Math
plurality
majority
borda count method
run off method
whoever has the most first place votes wins
first on more than half of the preferences
first place gets n points, second gets n-1 points, and so on
eliminate all but the top two, and determine the winner
plurality
whoever has the most first place votes wins
majority
first on more than half of the preferences
26 terms
Discrete Math
p ∧ T ≡ p ... p ∨ F ≡ p
p ∨ T ≡ T ... p ∧ F ≡ F
p ∨ p ≡ p ... p ∧ p ≡ p
¬(¬p) ≡ p
Identity laws
Domination laws
Idempotent laws
Double Negation laws
p ∧ T ≡ p ... p ∨ F ≡ p
Identity laws
p ∨ T ≡ T ... p ∧ F ≡ F
Domination laws
Discrete Math
Set
Power Set
intersection -- ∩
union -- U
a collection of objects (or elements) separated by commas.
the set of all subsets
what is in common in BOTH sets. AND
what exists in ALL sets without repetition. In one set OR the…
Set
a collection of objects (or elements) separated by commas.
Power Set
the set of all subsets
5 terms
discrete math
vacuous proof
tautology
contradiction
contingency
p->q is always true when p is false
A compound proposition that is always true, no matter what th…
A compound proposition that is always false
A compound proposition that is either true or false depending…
vacuous proof
p->q is always true when p is false
tautology
A compound proposition that is always true, no matter what th…
12 terms
Discrete Math Definitions
Propositional Variable
Natural numbers
Tautology
Contradiction
A variable that can be either true or false. Propositional va…
The numbers in the infinite sequence 1, 2, 3, . . . The set o…
All true
All false
Propositional Variable
A variable that can be either true or false. Propositional va…
Natural numbers
The numbers in the infinite sequence 1, 2, 3, . . . The set o…
13 terms
Discrete math
Arrows impossibility theorem
Borda count
Condorcet candidate
Condorcet criterion
Mathematically impossible for a democratic voting method to s…
Each place on ballot is assigned points
Candidate preferred by majority in head to head comparison
If there a condorcet candidate they should be the winner of t…
Arrows impossibility theorem
Mathematically impossible for a democratic voting method to s…
Borda count
Each place on ballot is assigned points
17 terms
Discrete Math
Graph
Directed Graph
Multiple Edges
Loop
A graph G = (V, E) consists of a nonempty set of vertices, V…
A directed graph (or digraph) is a graph in which each edge i…
We say a graph has multiple edges if two or more edges connec…
A loop is a vertex that connects a vertex to itself.
Graph
A graph G = (V, E) consists of a nonempty set of vertices, V…
Directed Graph
A directed graph (or digraph) is a graph in which each edge i…
discrete math
universal conditional statement
universal statement... "for all"
conditional statement ... "if then"
existential statement... "there is"
both universal and conditional statement
a certain property is true for all elements in a set
if one thing is true, some other thing has to be true
given a property that may or may not be true, there is at lea…
universal conditional statement
both universal and conditional statement
universal statement... "for all"
a certain property is true for all elements in a set
12 terms
discrete math
area of a trapezoid
volume of a cylinder
Volume of a rectangular prism
volume of sphere
b1+b2/2xH
pie.r^2xh
lxwxh
4/3x3.14xr^3
area of a trapezoid
b1+b2/2xH
volume of a cylinder
pie.r^2xh
18 terms
Discrete Math
Nonconstructive Proof
direct proof
Proof by cases
Indirect Proofs
A proof which indirectly shows a mathematical object exists w…
a way of showing the truth or falsehood of a given statement…
a method of mathematical proof in which the statement to be p…
-Contradiction... -Contrapositive... -Induction
Nonconstructive Proof
A proof which indirectly shows a mathematical object exists w…
direct proof
a way of showing the truth or falsehood of a given statement…
82 terms
Discrete Math
Statement
Negation
Conjunction
Disjunction
A statement (proposition) is a sentence that is either true o…
A negation of a statement p is the statement "not p" or "it i…
The conjunction of two statements p and q is the statement "p…
The disjunction of two statements p and q is the statement "p…
Statement
A statement (proposition) is a sentence that is either true o…
Negation
A negation of a statement p is the statement "not p" or "it i…
Discrete math
Algorithms
Union
intersection
Difference
An algorithm is a precise set of instructions (steps) for per…
The union of sets A and B, denoted by A∪B, is the set that co…
The intersection of sets A and B , denoted by A ∩ B, is the s…
Set Operations Definition (Difference) The difference of sets…
Algorithms
An algorithm is a precise set of instructions (steps) for per…
Union
The union of sets A and B, denoted by A∪B, is the set that co…
28 terms
Discrete Math
Statement
Statement form
Logically equivalent
De Morganʼs Laws
A sentence that is either true or false.
A statement that consists of statement variables (p, q) and l…
When two statements have corresponding statement forms that h…
~ (p∧q) ≡~ p∨ ~ q, and... ~ (p∨q) ≡~ p∧ ~ q
Statement
A sentence that is either true or false.
Statement form
A statement that consists of statement variables (p, q) and l…
29 terms
Discrete Math
addition principle
adjacency matrix
bipartite
brute force
when events a and b can occur in A + B ways
a matrix with rows and columns labeled by graph vertices with…
graph whose vertices can be divided into two distinct sets
from starting vertex list every possible circuit and find its…
addition principle
when events a and b can occur in A + B ways
adjacency matrix
a matrix with rows and columns labeled by graph vertices with…
16 terms
Discrete math
Graph
Vertices
Edges
Degree of a vertex
Consists of a finite set of points
Set of points
Line segments or curves
The number of edges at that vertex
Graph
Consists of a finite set of points
Vertices
Set of points
18 terms
Discrete Math
Set
Element
Infinite Set
Finite Set
Collection of things
Things in collection
Has infinite elements
Set is finite if it is not infinite
Set
Collection of things
Element
Things in collection
8 terms
discrete math
universal quantifier
existential quantifier
De Morgan's laws for quantifiers
set
a formal expression used in asserting that a stated general p…
"There exists an element x in the domain such that P(x)"
Precedence:... ∃ and ∀ has higher precedence over the other logi…
is an unordered collection of objects, where each object can…
universal quantifier
a formal expression used in asserting that a stated general p…
existential quantifier
"There exists an element x in the domain such that P(x)"
11 terms
Discrete Math
A ⊆ B
A ∈ B
A ∉ B
A is a subset of B.
A is an element of B.
A is not an element of B.
null set
A ⊆ B
A is a subset of B.
A ∈ B
A is an element of B.
24 terms
Discrete Math
Walk
Trail
Path
Closed Walk
alternating vertex/edge set
walk with no repeated edges
trail with no repeated vertices
starts and ends on the same vertex
Walk
alternating vertex/edge set
Trail
walk with no repeated edges
46 terms
Discrete Math
vertices
edges
directed graph
degree
the points of the graph
the lines that connect the vertices
graph that has directed edges, and order matters
how many edges are going in or out of the vertex
vertices
the points of the graph
edges
the lines that connect the vertices
Discrete Math
Modes Ponens
Modes Tollens
Hypothetical Syllogism
Disjunctive Syllogism
p p-->q | q
!q p-->q | !p
p-->q q-->r | !p
pvq !p | q
Modes Ponens
p p-->q | q
Modes Tollens
!q p-->q | !p
57 terms
Discrete Math
not p
p and q
p or q
p or q but not both p and q
∼p
p∧q
p∨q
p ⊕ q or p XOR q
not p
∼p
p and q
p∧q
72 terms
Discrete Math
Divisible: b|a
Odd
Prime
Composite
a is divisible by b if there is an integer c such that bc=a
a is odd provided there is integer x s.t. a=2x+1
p is prime if p>1 and only positive divisors of p are 1 and p
a is composite provided there is a b such that 1<b<a and b|a
Divisible: b|a
a is divisible by b if there is an integer c such that bc=a
Odd
a is odd provided there is integer x s.t. a=2x+1
1 of 10