Discrete Math

0.0(0)
studied byStudied by 0 people
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
Card Sorting

1/26

encourage image

There's no tags or description

Looks like no tags are added yet.

Study Analytics
Name
Mastery
Learn
Test
Matching
Spaced

No study sessions yet.

27 Terms

1
New cards

A coin is flipped 10 times where each flip comes up either heads or tails. How many possible outcomes

a. Are there in total

b. Contain at least three heads

c. Contain the same number of heads and tails

2
New cards

How many permutations of the letters ABCDEFGH contain

a. The string ED?

b. The Strings CAB and BED?

3
New cards

Suppose that a department contains 10 men and 15 women. How many ways are there to form a committee

with six members if it must have more women than men?

4
New cards

Find the solution to this recurrence relations with the given initial conditions

an = 2an-1 − 3, a0 = −1

5
New cards

Find the solution to this recurrence relations with the given initial conditions

an = 2an-1 + n , a0 = 1

6
New cards

Find the solution to this recurrence relations with the given initial conditions

an = 2nan-1 , a0 = 1

7
New cards

Find the solution to this recurrence relations with the given initial conditions

an = an-2 for n >= 2, a0 = 5, a1 = -1

8
New cards

Find the solution to this recurrence relations with the given initial conditions

an + 2 = -4an+1 + 5an for n >= 0, a0 = 2, a1 = 8

9
New cards

Find the solution to this recurrence relations with the given initial conditions

an = 5an-2 - 4an-4

a0 = 3, a1 = 2, a2 = 6, a3 = 8

10
New cards

Show that in a simple graph with at least two vertices there must be two vertices that have the same degree.

11
New cards
<p>Determine if the graph is bipartite</p>

Determine if the graph is bipartite

12
New cards
<p>Determine if the graph is bipartite</p>

Determine if the graph is bipartite

13
New cards

Let G be a graph with v vertices and e edges. Let M be the maximum degree of the vertices of G, and let m be the minimum degree of the vertices of G. Show that

a. 2e/v >= m

b. 2e/v <= M

14
New cards
<p>Find the adjacency matric of the given multigraph with respect to the vertices listed in alphabetic order</p>

Find the adjacency matric of the given multigraph with respect to the vertices listed in alphabetic order

15
New cards
<p>Determine whether the given pair of graphs is isomorphic. If so, show the isomorphic function.</p>

Determine whether the given pair of graphs is isomorphic. If so, show the isomorphic function.

16
New cards
<p>Determine whether the given pair of graphs is isomorphic. If so, show the isomorphic function.</p>

Determine whether the given pair of graphs is isomorphic. If so, show the isomorphic function.

17
New cards

Show that in every simple graph there is a path from every vertex of odd degree to some other vertex of odd degree

18
New cards

Are the following expressions ¬p → (q → r) and q → (p ∨ r) logically equivalent?

True

19
New cards

Determine the truth value of the statement
∃w ∀b (b⁶ > w)
if the domain of the variables consists of positive (non-zero) real numbers.

20
New cards

Prove: For every integer a > 0: If a is irrational then a1/7 is irrational

21
New cards

Prove that: (2/3) * 41/3- 6 is an irrational number

22
New cards

Provide the best big-O estimate for

(n4+n2log25n)(15400log126n+n) + (n! + 56n4566)(163n + 78n2log129n)

23
New cards

Suppose a password for a computer system must have at least 7, but no more than 11 characters where each character in the password is a lower case letter, upper case letter, binary digit, or one of 7 special characters (*, >, <, !, +, =, $})
How many of these passwords contain at least 1 occurrence of at least 1 of the 7 special characters?

24
New cards

How many functions are there from a set {1, 2, 3, …., n} to the set {x, y} that assign y to both 1 and n?

25
New cards

Prove that 8 (exactly) divides: 34k+1 + 52k+1

26
New cards

Prove that 35n is not O(34n), where n is the size of the input

27
New cards

Let y, x and we be a positive integer:

Prove that among any group of 1+yxw integers, there are at least (xy + 1) with exactly the same remainder when they are divided by w.