#### Study sets matching "discrete math"

#### Study sets matching "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…

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

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

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…

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…

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 ﬁnite number of variables and beco…

composite

合成关系, 合成数;... An integer n is prime if, and only if, n>1 and for…

prime

素数, 质数;

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₀

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…

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…

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

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…

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

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…

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)"

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.

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

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…

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…

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.

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

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

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…

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…

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

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…

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

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…

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…

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…

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…

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…

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)"

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