Category: Discrete Math

Hello,

I need help and mentoring with my assignment in discrete math, logic to finizlize it. Thank you for your support.

Mathematics is the study of numbers, structure, space, and change, involving logical reasoning and quantitative calculation. It encompasses pure mathematics (theoretical) and applied mathematics (real-world modeling), using techniques like algebra, geometry, calculus, and statistics to solve problems and establish truths through deductive reasoning and axioms. Wikipedia +3

Key aspects and branches of mathematics include:

• Fundamental Areas:
  • : Basic numerical operations.
  • : The study of formulas and structures where symbols represent numbers.
  • : The study of shapes, sizes, and spatial relationships.
  • : The study of continuous change and limits.
  • : Data analysis and the math of chance.
• Pure vs. Applied: Pure mathematics focuses on theoretical concepts, while applied mathematics applies these tools to fields like engineering, physics, and economics.
• Key Concepts: Mathematics relies on axioms (assumed truths) to prove theorems. Key tools include formulas, variables, and rigorous logical deduction.
• Importance: It is crucial for scientific technological advancements, ranging from engineering to data science. Wikipedia +6

The field is continuously evolving, with modern applications involving AI and advanced modeling

Mathematics is the study of numbers, structure, space, and change, involving logical reasoning and quantitative calculation. It encompasses pure mathematics (theoretical) and applied mathematics (real-world modeling), using techniques like algebra, geometry, calculus, and statistics to solve problems and establish truths through deductive reasoning and axioms. Wikipedia +3

Key aspects and branches of mathematics include:

• Fundamental Areas:
  • : Basic numerical operations.
  • : The study of formulas and structures where symbols represent numbers.
  • : The study of shapes, sizes, and spatial relationships.
  • : The study of continuous change and limits.
  • : Data analysis and the math of chance.
• Pure vs. Applied: Pure mathematics focuses on theoretical concepts, while applied mathematics applies these tools to fields like engineering, physics, and economics.
• Key Concepts: Mathematics relies on axioms (assumed truths) to prove theorems. Key tools include formulas, variables, and rigorous logical deduction.
• Importance: It is crucial for scientific technological advancements, ranging from engineering to data science. Wikipedia +6

The field is continuously evolving, with modern applications involving AI and advanced modeling

Reflection on Social Justice and Sustainable Development Goals

Week 8 Assignment: Languages and Automata Problems

For this assignment students will solve problems of languages and automata problems. Specifically students will:

• Address the problems at the end of each of the above chapters in Gill 9-12, 16
• Students must show all the steps of their work, providing a specific rationale as to why they solved the problem in the manner they did.

For this assignment students will solve problems of construction technique problems. Specifically, students will:

Solve all odd problems from Chapter 7
Students must show all the steps of their work, providing a specific rationale as to why they solved the problem in the manner they did.
Students will submit their work, via GAP. You must provide a clear screenshot of all of your work, including your processes and procedures.

For this discussion you will examine the ideas regarding sets and functions. In your discussion,

post and provide an example of the following:
What are some real-world examples of inductively defined sets, and how do their
definitions relate to the recursive structures we see in computer science?
o (Hint: think about common data structures (like lists or trees) and how inductive
definitions can model them)

How would you use an inductively defined set to represent a complex structure, such as
a binary tree or an arithmetic expression?
What challenges might arise when defining or working with such structures?
o (Hint: How might you apply inductive definitions to hierarchical structures and
discuss potential edge cases or limitations?)

Section 1: Logic

1. If p = true and q = false, find the truth value of:

p land q

Answer: False

2. What is the negation of:

It is sunny and warm.

Answer: It is not sunny OR not warm.

3. Complete the statement:

If p rightarrow q is false, what must be true?

Answer:

p is true and q is false.

Section 2: Sets

Let

A = {1, 2, 3}

B = {3, 4, 5}

4. Find A cup B

Answer: {1,2,3,4,5}

5. Find A cap B

Answer: {3}

6. How many elements are in the power set of A?

Answer: 2^3 = 8

Section 3: Even & Odd Reasoning

7. Is this statement true or false?

The sum of two odd numbers is odd.

Answer: False

Example: 3 + 5 = 8 (even)

8. An even number can be written as ___.

Answer: 2n (where n is an integer)

Section 4: Counting & Combinatorics

9. How many ways can you arrange the letters in CAT?

Answer:

3! = 6

10. How many different 2-digit numbers can be made using digits 1, 2, 3 without repetition?

Answer:

3 choices for first digit

2 choices for second

3 2 = 6

11. In how many ways can 4 students sit in a row?

Answer:

4! = 24

Section 5: Relations & Functions

12. On the set {1,2,3}, does the relation

R = {(1,1), (2,2), (3,3)}

have the reflexive property?

Answer: Yes

For this assignment students will solve problems regarding tools and techniques. Specifically, students will:

Solve all problems from Chapter 1
Solve all problems from Chapter 13
Solve problems 1 5 in Gill Chapter 2
Students must show all the steps of their work, providing a specific rationale as to why they solved the problem in the manner they did.
Students will submit their work, via GAP. You must provide a clear screenshot of all of your work, including your processes and procedures.

For this discussion you will examine the ideas regarding summations, closed-forms and the Big

Oh. In your discussion, post and provide an example of the following:
When analyzing the time complexity of an algorithm, we often encounter summations
that describe the total number of operations. How would you approach evaluating a
summation and finding its closed form?
What are some common techniques or strategies, and how do they help in determining
the Big-O complexity?