Scribd
Upload
11 views2 pages

Descrete

descret worksheet for engineering students

Uploaded by

kidusmekonnen9
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
11 views2 pages

Descrete

descret worksheet for engineering students

Uploaded by

kidusmekonnen9
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

1.

To calculate the number of possible telephone numbers based on your criteria, we


can use the principle of counting.

For the first two digits, since each can be between 2 and 9 inclusive, there are 8
possibilities for each digit. For the third digit, which can be between 1 and 9 inclusive,
there are 9 possibilities. For each of the remaining four digits, which can be between 0
and 9 inclusive, there are 10 possibilities for each digit.

So, the total number of possible telephone numbers is: 8 (possibilities for the first digit)
* 8 (possibilities for the second digit) * 9 (possibilities for the third digit) * 10
(possibilities for the fourth digit) * 10 (fifth) * 10 (sixth) * 10 (seventh).

Calculating this gives us: 8 * 8 * 9 * 10 * 10 * 10 * 10 = 5,760,000 possible telephone


numbers.

2. To find the distinct equivalence classes for the relation ( R ) on ( \mathbb{N} \times \
mathbb{N} ) defined by ( (x, y)R(m, n) ) if and only if ( x + n = y + m ), we need to
identify all pairs ( (x, y) ) that are related to each other.

This relation is saying that two pairs ( (x, y) ) and ( (m, n) ) are related if the sum of the
first element of one pair and the second element of the other pair is equal to the sum of
the second element of the first pair and the first element of the other pair.

The equivalence class for a pair ( (a, b) ) can be found by fixing ( a + b ) and finding all
pairs ( (x, y) ) such that ( x + y = a + b ). This means that every pair in an equivalence
class will have the same sum.

So, for each natural number ( k ), there is an equivalence class consisting of all pairs ( (x,
y) ) such that ( x + y = k ). These are the distinct equivalence classes for relation ( R ).

For example:

 The equivalence class for ( k = 2 ) would include pairs like ( (1, 1), (2, 0), (0, 2) ).
 The equivalence class for ( k = 3 ) would include pairs like ( (1, 2), (2, 1), (3, 0), (0, 3) ).

And so on for each natural number ( k ). Each natural number defines a distinct
equivalence class.

4. To solve this discrete mathematics problem, we need to schedule the exams in such a
way that no student has more than one exam per day. This is a classic example of a
graph coloring problem where we need to assign colors (representing days) to each
vertex (representing courses) such that no two adjacent vertices share the same color.

Based on the table provided, we can infer the following:


 Course 1 has common students with all other courses, so it should be scheduled on a
separate day.
 Courses 2, 3, and 4 have common students with each other and with Course 1, so they
cannot be scheduled on the same day as Course 1 or with each other.
 Course 5 has common students with Courses 1 and 2.
 Course 6 has common students only with Course 7.

A possible schedule to minimize the number of days could be:

 Day 1: Courses 5 and 6 (since they don’t share students with any other courses except
each other).
 Day 2: Courses 2 and 7 (since after removing Courses 5 and 6, Course 7 is now
independent, and Course 2 only shares students with courses which are already
assigned).
 Day 3: Courses 3 and 4 (both are now independent of each other and everything else).
 Day 4: Course 1 (it’s the only one left).

Therefore, the least number of days needed to schedule all exams is 4 days.

Please note that there may be other valid solutions as well, but this is one way to ensure
that no student has more

You might also like