Homepage for MAT 140-801: Discrete Mathematics I

Homework Assignments: 1    2    3   4   5   6   7   8    9   10       

Proof Flow Chart

Review Guide for the Final Exam

Tips for Success with Proofs and Disproofs

Corrections for the 1st Printing of Discrete Mathematics with Applications, 3rd Edition

Assignment #1 (due January 12)

1. Read Sections 1.1 - 1.3 and 2.1 - 2.2.

2 . Do the following exercises for practice, but do not hand them in. Certain of these exercises will be included on the quiz given on January 12. 1.1 # 1, 3, 5a, 6, 8ad, 10ac, 11, 12, 14, 16, 19, 29, 31, 35, 37 1.2 # 1, 3, 5, 9, 12, 13a, 19, 20adf, 22adf, 23adf, 24, 26, 32, 35, 43, 45, 47 1.3 # 1, 3, 6-8, 13a, 21, 24-27 2.1 # 1ab, 2, 3, 9, 11

3. Hand in the following exercises : 1.1 # 5cd, 8bc, 10bde, 30, 32, 36, 38 1.2 # 2, 4, 8, 20b, 17, 23b, 33, 36, 44, 46, 48 1.3 # 5, 11, 28 2.1 # 1c-f, 12

4. As you enter the classroom each week, please write the section and number of any problems you wish to have discussed during class.

Assignment #2 (due January 19)

1. Read Sections 2.3 - 2.4 and 3.1 (especially pages 125-127 and 131-137).

2 . Do the following exercises for practice, but do not hand them in. Certain of these exercises will be included on the quiz given on January 19. 2.1 # 13, 14, 16ace, 17a, 18abe, 19, 21ac, 22a, 23a, 25ab, 26bd, 30ac 2.2 # 1, 3ac, 4ac, 5ace, 6a, 7, 9, 11, 13, 15ac, 18, 24, 29, 35, 38, 40 2.3 # 1ab, 3ab, 4a, 5, 7, 9a, 10ac, 12ad 3.1 #1, 2ab, 19, 24, 25

3. Hand in the following exercises: 2.1 # 15, 16b, 21bd, 25cd, 26ac, 29, 30b 2.2 # 3b, 4b, 5d, 19, 30 2.3 # 2cd, 3c, 6, 8, 9b, 10bd-f, 12bc 3.1 # 26, 27

4. As you enter the classroom on January 19, please write on the right side of the blackboard the section and number of any problems you wish to have discussed during class. If you think you have a solution to any problems that are listed, please take a section of the blackboard and write your solution there.

Assignment #3 (due January 26)

1. Read Sections 3.1 – 3.3 and 1.4.

2 . Do the following exercises for practice, but do not hand them in. Certain of these exercises will be included on the quiz given on January 26. 1.4 # 1, 3, 5, 7, 9, 11, 13, 16, 20, 22, 24 2.2 # 11 (review), 16d, 17a, 20, 22, 27, 42, 44 2.3 # 13a, 14, 20a 2.4 # 1bd, 2, 3, 5, 7-9 3.1 # 4, 7, 11, 14, 17, 20, 22, 29, 31, 34-36 3.2 # 1, 3, 4, 6, 9, 11-13 3.3 # 1, 4, 6-8, 10, 12, 14, 15

3. Hand in the following exercises : 2.2 # 12, 14, 16d, 17b, 19 2.3 # 13b, 17, 20b 2.4 # 1ac, 4, 6, 11, 12 3.1 # 30 3.2 # 8, 15 3.3 # 16

4. As you enter the classroom on January 26, please write on the right side of the blackboard the section and number of any problems you wish to have discussed during class. If you think you have a solution to any problems that are listed, please take a section of the blackboard and write your solution there.

Assignment #4 (due February 2)

1. Read Sections 1.3 (pages 39-40), 1.5 (pages 57-63), 3.4, and 3.5.

2 . Do the following exercises for practice, but do not hand them in. Certain of these exercises will be included on the quiz given on February 2. 1.3 # 36, 37, 38a 1.4 # 22 (review), 24 1.5 # 4, 7, 13, 15 2.3 # 18, 20a, 21, 30-33, 45a, 47a 2.4 # 10, 16, 28 3.3 # 21, 23, 29 3.4 # 1, 3, 5, 7, 13, 20, 27, 28a 3.5 # 1, 3, 8, 12, 14, 15

3. Hand in the following exercises : 1.3 # 38bc 1.4 # 19 1.5 # 3, 14 2.3 # 15, 34, 35 3.3 # 25, 26 3.4 # 29 3.5 # 2, 4, 6, 7, 9

4. As you enter the classroom on February 2, please write on the right side of the blackboard the section and number of any problems you wish to have discussed during class. If you think you have a solution to any problems that are listed, please take a section of the blackboard and write your solution there.

Assignment #5 (due February 9)

1. Read Section 3.6.

2 . Do the following exercises for practice, but do not hand them in. Certain of these exercises may be included on the midterm exam given on February 9. 1.5 # 21, 38, 41, 44 3.3 # 33b-d, 34b, 35c, 39bc 3.5 # 30 3.6 # 1, 3, 5, 8

3. Hand in the following exercises : 1.4 # 23 1.5 # 39, 42 3.3 # 33a, 34a, 35ab, 39a 3.5 # 16 3.6 # 2, 9

4. Study for the midterm exam! Part I of the midterm will consist of definitions questions; Part II will consist of problems similar to those that have been assigned as homework. The midterm will cover the material included in Assignments 1-6. You may bring a 3''x5'' crib sheet to the exam which may contain information such as definitions and formulas BUT NOT actual proofs or proof fragments. You will not be allowed to use your crib sheet for the definitions questions, but you may use it freely for the rest of the exam.

5. Because of the exam on February 9, I will hold office hours in our classroom instead of in my office that day. As always, you are also welcome to contact me during the week if you have questions.

Assignment #6 (due February 16)

1. Read Sections 3.7 (especially pages 179-182), 3.8 (especially pages 192-195), 4.1 (pages 202-204), and 4.2 (pages 215-218). You may also find it helpful to read pages 1-3 of an excerpt from Understanding Analysis by Stephen Abbott, which is posted on the amazon.com website. (Click here to see it.)

2 . Do the following exercises for practice, but do not hand them in. Certain of these exercises will be included on the quiz given on February 16, so it is important that you understand the solutions. If any of them are unclear to you, be sure to ask about them. 3.6 # 10, 16, 17, 21, 28a, 29ab 3.7 # 1, 3, 5, 7, 9 3.8 # 9, 10, 13 4.1 # 18ab, 19, 23, 29 4.2 # 3abc

3. Hand in the following exercises : 3.6 # 18, 23, 28bc, 29cd, 30 3.7 # 4 3.8 # 11, 15 4.1 # 21, 30 4.2 # 4abc

4. As you enter the classroom on February 16, please write on the right side of the blackboard the section and number of any problems you wish to have discussed during class. If you think you have a solution to any problems that are listed, please take a section of the blackboard and write your solution there.

Assignment #7 (due February 23)

1. Finish reading Sections 4.1 and 4.2. Reread parts of 3.6 and 3.7 as needed. Learn the proofs that the square root of 2 is irrational and that there are infinitely many prime numbers.

2 . Do the following exercises for practice, but do not hand them in. Certain of these exercises will be included on the quiz given on February 23, so it is important that you understand the solutions. If any of them are unclear to you, be sure to ask about them – preferably before class, by phone, e-mail, or during office hours. 3.6 # 19 3.8 # 17 4.1 # 1, 3, 10-12, 14, 32, 35, 36 4.2 # 5, 6, 8, 19, 21, 23, 24

3. Hand in the following exercises : 3.6 # 20, 28c (again) 3.7 # 2, 6, 8, 26, 27 3.8 # 18 4.1 # 15, 33, 39 4.2 # 7, 9, 20, 22, 25, 26 Extra Credit: 3.7 #31

4. As you enter the classroom on February 23, please write on the right side of the blackboard the section and number of any problems you wish to have discussed during class. If you think you have a solution to any problems that are listed, please take a section of the blackboard and write your solution there.

Assignment #8 (due March 1)

1. Read Sections 4.3, 6.1, 6.2 (especially pages 306-309), 6.3 (pages 321-323), 6.4 (pages 334, 335, 337)

2 . Do the following exercises for practice, but do not hand them in. Certain of these exercises will be included on the quiz given on March 1, so it is important that you understand the solutions. If any of them are unclear to you, be sure to ask about them – preferably before class, by phone, e-mail, or during office hours. 4.1 # 52, 54, 58 4.2 # 10, 13 4.3 # 1, 8 6.1 # 2, 3, 5, 7, 9, 21, 23c, 24 6.2 # 1, 6, 8, 9, 11ab, 13ab, 14abd, 29ab, 36ac 6.3 # 1, 4, 6 6.4 # 1, 5ab, 6a

3. Hand in the following exercises : 4.1 # 56, 59 4.2 # 12, 15 4.3 # 9 6.1 # 6, 10, 23ab 6.2 # 7, 11cd, 13c, 14ce, 29c, 36bd 6.3 # 2 6.4 # 2, 5cf, 7a

4. As you enter the classroom on March 1, please write on the right side of the blackboard the section and number of any problems you wish to have discussed during class. If you think you have a solution to any problems that are listed, please take a section of the blackboard and write your solution there.

Assignment #9 (due March 8)

1. Read Sections 4.5 (pages 244-247), 6.2 (remainder of section), 6.3 (remainder of section), 6.4 (remainder of section), 6.6, 6.7

2 . Do the following exercises for practice, but do not hand them in. Certain of these exercises will be included on the quiz given on March 8, so it is important that you understand the solutions. If any of them are unclear to you, be sure to ask about them – preferably before class, by phone, e-mail, or during office hours. 4.2 # 1 4.3 # 24 6.1 # 11ab( i ), 12ab( i ), 13ab( i ), 14ab( i ) 6.2 # 16a, 21, 32, 34a, 35a 6.3 # 9, 12, 14, 26abd 6.4 # 6b-d, 13ad, 19 6.6 # 1, 3, 5, 6, 9 6.7 # 1, 3, 5, 17, 24

3. Hand in the following exercises: 4.2 # 2 4.3 # 32 6.1 # 11b(ii)(iii), 12b(ii)(iii), 13b(ii)(iii), 14b(ii)(iii) 6.2 # 16bc, 22, 33, 35b 6.3 # 15, 26cef 6.4 # 7b-d, 8, 13bce, 20 6.6 # 7, 10 6.7 # 4, 18, 25

4 . Start your review process for the final exam so that you can bring questions to class on March 8. Take a look at the “ Review Guide for the Final Exam ,” the “ Tips for Success with Proofs and Disproofs ” sheet, and the “ Proof Flow Chart .” Click on the titles to see them. (Or click here to see a MS-Word version of the Review Guide.) They have been updated for the final exam.

5. As you enter the classroom on March 8, please write on the right side of the blackboard the section and number of any problems you wish to have discussed during class. If you think you have a solution to any problems that are listed, please take a section of the blackboard and write your solution there.

Assignment #10 (due March 15)

Prepare for the final exam. The exam will be in the usual classroom (LC 346) from 5:45-9:00 PM on March 15.   The final will cover all the material of the course, with somewhat more complete coverage of the post-midterm material than the pre-midterm material. Part I of the exam will consist of two definitions questions; Part II will consist of problems similar to those that have been assigned as homework. You may bring a 3''x5'' crib sheet to the exam, which may contain any information you wish EXCEPT actual proofs or proof fragments. Please put your name on your crib sheet and turn it in along with your exam. You will not be allowed to use your crib sheet for the definitions questions, but you may use it freely for the rest of the exam.

Academia.edu no longer supports Internet Explorer.

To browse Academia.edu and the wider internet faster and more securely, please take a few seconds to  upgrade your browser .

Enter the email address you signed up with and we'll email you a reset link.

  • We're Hiring!
  • Help Center

First page of “Discrete mathematics Assignment-1”

Download Free PDF

Discrete mathematics Assignment-1

Profile image of PRANJAL JAIN

Related papers

Discussiones Mathematicae Graph Theory, 2008

Australas. J Comb., 2015

Given a set of cycles C of a graph G, the tree graph of G defined by C is the graph T(G,C) whose vertices are the spanning trees of G and in which two trees R and S are adjacent if the union of R and S contains exactly one cycle and this cycle lies in C. Li et al [Discrete Math 271 (2003), 303--310] proved that if the graph T(G,C) is connected, then C cyclically spans the cycle space of G. Later, Yumei Hu [Proceedings of the 6th International Conference on Wireless Communications Networking and Mobile Computing (2010), 1--3] proved that if C is an arboreal family of cycles of G which cyclically spans the cycle space of a $2$-connected graph G, then T(G, C) is connected. In this note we present an infinite family of counterexamples to Hu's result.

In graph theory connectivity is stated, prevailingly, in terms of paths. While exploiting a proof assistant to check formal reasoning about graphs, we chose to work with an alternative characterization of connectivity: for, within the framework of the underlying set theory, it requires virtually no preparatory notions. We say that a graphs devoid of isolated vertices is connected if no subset of its set of edges, other than the empty set and the set of all edges, is vertex disjoint from its complementary set. Before we can work with this notion smoothly, we must prove that every connected graph has a non-cut vertex, i.e., a vertex whose removal does not disrupt connectivity. This paper presents such a proof in accurate formal terms and copes with hypergraphs to achieve greater generality.

Discrete Mathematics, 2004

Discrete Mathematics, 1982

Involve, a Journal of Mathematics, 2008

Journal of Graph Theory, 1989

Discrete Mathematics, 2005

Loading Preview

Sorry, preview is currently unavailable. You can download the paper by clicking the button above.

Discrete Mathematics, 1985

Oberwolfach Reports, 2000

Electronic Notes in Discrete Mathematics, 2008

Discussiones Mathematicae Graph Theory, 2000

ArXiv, 2021

International Journal of Applied Mathematical Research, 2012

Discrete Mathematics, 1995

Lecture Notes in Mathematics, 1983

Canadian Journal of Mathematics, 1967

Information Processing Letters, 1996

Pesquisa Operacional, 2013

International Journal of Research Publication and Reviews, 2022

Graphs and Combinatorics, 2000

Mathematical Problems in Engineering, 2015

Studia Scientiarum Mathematicarum Hungarica, 2003

  •   We're Hiring!
  •   Help Center
  • Find new research papers in:
  • Health Sciences
  • Earth Sciences
  • Cognitive Science
  • Mathematics
  • Computer Science
  • Academia ©2024

swayam-logo

Discrete Mathematics

--> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> -->

Page Visits

Course layout, books and references, instructor bio.

discrete mathematics assignment 1

Course certificate

discrete mathematics assignment 1

DOWNLOAD APP

discrete mathematics assignment 1

SWAYAM SUPPORT

Please choose the SWAYAM National Coordinator for support. * :

Browse Course Material

Course info, instructors.

  • Prof. Tom Leighton
  • Dr. Marten van Dijk

Departments

  • Electrical Engineering and Computer Science
  • Mathematics

As Taught In

  • Computer Science
  • Applied Mathematics
  • Discrete Mathematics
  • Probability and Statistics

Learning Resource Types

Mathematics for computer science, course description.

Four dice representing the course number 6.042.

You are leaving MIT OpenCourseWare

swayam-logo

Discrete Mathematics

Course Status : Completed
Course Type : Not Applicable
Duration : 12 weeks
Category :
Credit Points : 2
Undergraduate
Start Date : 13 Jan 2020
End Date :
Enrollment Ends : 08 Mar 2020
Exam Date :
--> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> -->

Note: This exam date is subject to change based on seat availability. You can check final exam date on your hall ticket.

Page Visits

Course layout, books and references, instructor bio.

discrete mathematics assignment 1

Prof. Sudarshan Iyengar

discrete mathematics assignment 1

Prof. Prabuchandran K.J

Course certificate.

discrete mathematics assignment 1

DOWNLOAD APP

discrete mathematics assignment 1

SWAYAM SUPPORT

Please choose the SWAYAM National Coordinator for support. * :

Course Name: Discrete Mathematics

  • About Course
  • Certificate Type
  • Toppers list

Course abstract

In this course we will cover the basics of discrete mathematics. We will be learning about the different proof techniques and how to use them for solving different kind of problems. We will introduce graphs and see how graphs can be used for modeling of different problems and see how this can help in solving problems. We will learn how to count the number of possibilities that can arise in different situations.

Course Instructor

Media Object

Prof. Sourav

Teaching assistant(s).

Pranjal Dutta

Pranjal Dutta

B.Sc. 3rd Year (Pursuing) Bachelors in Mathematics and Computer Science Chennai Mathematical Institute

Sanath Kumar Krishna Murthy

Sanath Kumar Krishna Murthy

B.Sc. Mathematics and Computer Science (3rd yr. Pursuing), Chennai Mathematical Institute

R. Goutham

B.Sc. 3rd year Mathematics, Chennai Mathematical Institute

 Course Duration : Jan-Apr 2016

  view course,  syllabus,  enrollment : 05-dec-2015 to 04-feb-2016,  exam date : 24-apr-2016, 30-apr-2016,   course statistics will be published shortly, certificate eligible, certified category count, successfully completed, participation.

discrete mathematics assignment 1

Category : Successfully Completed

discrete mathematics assignment 1

Category : Elite

discrete mathematics assignment 1

Category : Gold

>=90 - Elite+Gold 60-89 - Elite 35-59 - Successfully Completed <=34 - Certificate of Participation

Final Score Calculation Logic

  • Assignment Score = Average of all 3 quizzes
  • Score on display: Assignment 1 to 3 indicates quiz.
  • NOTE:Quiz 1 to 3 are only taken for final calculation other practice quizzes are not considered .
  • FINAL SCORE (Score on Certificate) = 70% of Exam Score + 30% of Assignment Score.

SAMPURNA PAL

SAMPURNA PAL 85%

INDIAN INSTITUTE OF ENGINEERING SCIENCE AND TECHNOLOGY SHIBPUR

KABYA BANERJEE

KABYA BANERJEE 81%

CHAITANYA G K

CHAITANYA G K 81%

KARAN KUMAR GUPTA

KARAN KUMAR GUPTA 79%

BANSAL INSTITUTE OF ENGINEERING & TECHNOLOGY

RISHABH KARNAD

RISHABH KARNAD 78%

SIES GRADUATE SCHOOL OF TECHNOLOGY

ARPAN DAS

ARPAN DAS 76%

SANKAR BANERJEE

SANKAR BANERJEE 76%

RISHABH MITTAL

RISHABH MITTAL 69%

DELHI COLLEGE OF ENGINEERING

NAGA MARUTHI KUMARI NANDIRAJU

NAGA MARUTHI KUMARI NANDIRAJU 69%

REVA UNIVERSITY

MRADUL KUMAR JAIN

MRADUL KUMAR JAIN 66%

ABES ENGINEERING COLLEGE

Score Distribution Graph - Legend

Assignment score: distribution of average scores garnered by students per assignment., exam score : distribution of the final exam score of students., final score : distribution of the combined score of assignments and final exam, based on the score logic..

  • For educators
  • English (US)
  • English (India)
  • English (UK)
  • Greek Alphabet

This problem has been solved!

You'll get a detailed solution from a subject matter expert that helps you learn core concepts.

Question: MA161: Discrete Mathematics I Assignment 1 Instructions: - This assignment is due on 23rd September, 2022: 11pm FIJI TIME. - The assignment should be done in a group of 2-3 students. - You are to TYPE your solutions and submit them as a PDF document on Moodle Assignment 1 Dropbox. One submission per group. - Answer ALL the questions and show full working. 1.

student submitted image, transcription available below

As per Chegg policy, in case of multiple questions, we will answer only 1st question. To get assista...

answer image blur

Not the question you’re looking for?

Post any question and get expert help quickly.

IMAGES

  1. Maths Assignment 1

    discrete mathematics assignment 1

  2. (Discrete Mathematics)Math 1302 Discussion assignment Unit 1

    discrete mathematics assignment 1

  3. Solved Discrete Mathematics Writing Assignment #1 1. (6

    discrete mathematics assignment 1

  4. discrete mathematics tutorial 2

    discrete mathematics assignment 1

  5. Discrete Mathematics 1 Assignment 3

    discrete mathematics assignment 1

  6. Chapter 1

    discrete mathematics assignment 1

VIDEO

  1. MTH202_Lecture31

  2. NPTEL||DISCRETE MATHEMATICS ||WEEK 8||ASSIGNMENT ANSWERS||CSIT_CODING

  3. Discrete mathematics assignment ( Deakin University)

  4. Discrete Mathematics

  5. NPTEL||DISCRETE MATHEMATICS||WEEK3||ASSIGNMENT ANSWERS||CSIT_CODING

  6. NPTEL||DISCRETE MATHEMATICS ||WEEK 10||ASSIGNMENT ANSWERS||CSIT_CODING

Course Status : Completed
Course Type : Core
Duration : 12 weeks
Category :
Credit Points : 3
Undergraduate
Start Date : 25 Jul 2022
End Date : 14 Oct 2022
Enrollment Ends : 08 Aug 2022
Exam Date : 30 Oct 2022 IST