DETAIL BUKU
  • Discrete mathematics: an open introduction

    Discrete mathematics: an open introduction

    • Oscar Levin
    • University of Northern Colorado
    • 2015
    • -
    Sinopsis

    The text began as a set of lecture notes for the discrete mathematics course at the University of Northern Colorado. This course serves both as an introduction to topics in discrete math and as the "introduction to proofs" course for math majors. The course is usually taught with a large amount of student inquiry, and this text is written to help facilitate this. Originally designed to support future math teachers, the text has a friendly and informal tone, and puts an emphasis on understanding the included concepts, rather than simply memorizing procedures. The book has also been successfully used in courses catering to computer science students, who also benefit from the deeper understanding it promotes. Four main topics are covered: counting, sequences, logic, and graph theory. Along the way, proofs are introduced, including proofs by contradiction, proofs by induction, and combinatorial proofs. An introductory chapter covering mathematical statements, sets, and functions helps students gain familiarity with the language of mathematics, and two additional topics (generating functions and number theory) are also included.

    Kata Kunci
    Tersedia di Perpustakaan Kampus:
    • BSD
    Silahkan Login untuk dapat Melakukan Peminjaman Online
Kode Buku : 240446
Kode Klasifikasi : 511
Judul Buku : Discrete mathematics: an open introduction
Edisi : Fall
Penulis : Oscar Levin
Penerbit : University of Northern Colorado
Bahasa : Inggris
Tahun : 2015
ISBN : -
Tajuk Subjek : Matematika
Deskripsi : ix, 283 hal., 29 cm
Eksemplar : 2
Stok : 2
Petugas : Salsabila Hasna Dhia
The text began as a set of lecture notes for the discrete mathematics course at the University of Northern Colorado. This course serves both as an introduction to topics in discrete math and as the "introduction to proofs" course for math majors. The course is usually taught with a large amount of student inquiry, and this text is written to help facilitate this. Originally designed to support future math teachers, the text has a friendly and informal tone, and puts an emphasis on understanding the included concepts, rather than simply memorizing procedures. The book has also been successfully used in courses catering to computer science students, who also benefit from the deeper understanding it promotes.

Four main topics are covered: counting, sequences, logic, and graph theory. Along the way, proofs are introduced, including proofs by contradiction, proofs by induction, and combinatorial proofs. An introductory chapter covering mathematical statements, sets, and functions helps students gain familiarity with the language of mathematics, and two additional topics (generating functions and number theory) are also included.
Terkait Subjek Buku yang sama