Interline Publishing info@interlinepublishing.com +91 98867 328 23 / 24 / 25   +91 80 2333 2824 Sign Up   Sign In Procedure video Title      : Math 1.4 Discrete Mathematics Subject      : Mathematics copyright © 2018   : Karnataka State Open University Author      : KSOU Publisher      : Karnataka State Open University Chapters/Pages      : 12/110 Total Price      : Rs.      : 76 To Purchase, select the individual chapter(s) or click "Select all" for the complete book. Please scroll down to view chapter(s).
Chapters

Total views (733)
In this chapter, we study the structure of simple and compound statement through various logical connectives and different type of combination of statements.
 Pages: 11 Price: Rs 0

Total views (733)
Usually mathematical theorems are stated in the form of an implication p --> q or equivalence. Here P is called the Premises or hypothesis and q is called conclusion.
 Pages: 10 Price: Rs 7.5

Total views (744)
Aft.er going through this unit you should be able to learn the principle of Mathematical induction and establish some of the results involving a positive integer n.
 Pages: 4 Price: Rs 3

Total views (739)
This principle will assist us in establishing the formulae and also other applications of this principle will demonstrate its versatile nature in combinatorial mathematics.
 Pages: 2 Price: Rs 1.5

Total views (736)
After going through this unit you should able to define a recurrence relation with examples and setup recurrence relations also to write recurrences for divide and conquer algorithms.
 Pages: 8 Price: Rs 6

Total views (734)
The number C(n, r) are called Binomial Coefficients because they appear in the expansion of the binomial x + y raised to a power. This interplay between numbers that arise in counting problems. For example, in analyzing a problem involving counting we may derive some algebraic relation.
 Pages: 6 Price: Rs 4.5

Total views (736)
This unit mainly deals with the study of recurrence relation with examples to familiarize with the process of formulating recurrences.
 Pages: 13 Price: Rs 9.75

Total views (738)
After going through this unit we can define and construct generating functions for sequences arising in various types of combination problems. Also we use generating functions to find the number of integer solution to linear equations. We solve recurrence relation using generating functions.
 Pages: 16 Price: Rs 12

Total views (739)
This section deals with the study of concept of binary relation and give you several geometric, computer and algebraic method of representations. Relationship between number, people, sets and any other entities can be formulated in the idea of the binary relation. In this section you will also learn the different properties that a binary relation can posess.
 Pages: 11 Price: Rs 8.25

Total views (740)
Through this unit we discuss about matrix digraphs relation along with transitive closure. Also of interest in how the relation matrix is used in the study of Graph theory.
 Pages: 15 Price: Rs 11.25

Total views (738)
We shall emphasize the study of a relation on a set A. various properties of relations are developed along with ways to represent finite relation.
 Pages: 8 Price: Rs 6

Total views (741)
In this section we learn more advanced feature on the relation like partial ordered sets and Lattices. These structures are useful in set theory, algebra, sorting and searching.
 Pages: 6 Price: Rs 4.5  Safe and Secure Payment All major credit and debit cards are accepted. 