1. Find the number of multiples of 7 among the integers from 200 to 500.

We begin by identifying the _rst and last multiples of 7 in our list. _ Since 250 _ 7 = 35 R 5, the smallest multiple of 7 in our list must be a little bit larger: 36 _ 7 = 252. _ Since 500 _ 7 = 71 R 3, the largest multiple of 7 in our list must be a little bit smaller: 71 _ 7 = 497. Now, we could write our list as 252; 259; 266; 273; : : : ; 490; 497: However, we might as well write it as 36 _ 7; 37 _ 7; 38 _ 7; 39 _ 7; : : : ; 70 _ 7; 71 _ 7: Now we can divide each number in the list by 7 to give us a list of consecutive two-digit numbers: 36; 37; 38; 39; : : : ; 70; 71: Now we subtract 35 from each number in the list to get a simple list: 1; 2; 3; 4; : : : ; 35; 36: So, there are 36 multiples of 7 between 250 and 500.

Spring- 2012 Bachelor of Science in Information Technology (BScIT) Semester 2/ Diploma In Information Technology Semester - II Discrete Mathematics 4 Credits BT0069
(Book ID: B0953) Assignment Set 1 (60 Marks) Answer All Questions 6 X 10 = 60 Marks 1. Find the number of multiples of 7 among the integers from 200 to 500. 2. How many numbers between 4000 and 6000 can be formed by using the integers 1, 2, 3, 4, 5, 6, 7 and 8 if any integer is not used more than once? 3. Solve an = 2an-1 + 3an-2 + 5n, n a0 = -2, a1 = 1.

4. Let S = {a, b, c P(S), the power set of S as set inclusion. Draw the Hasse diagram for the partially ordered set (P(S 5. In a distributive lattice, if an element has a complement, then prove that it is unique. 6. Define the terms: Graph, finite graph, infinite graph, incidence, degree, isolated vertex, pendent vertex, null graph

Assignment Set II (60 Marks) Answer All Questions 6 X 10 = 60 Marks 1. If a group G has only three elements, show that it must be abelian 2. If there was a meeting then catching the bus was difficult. If they arrived on time catching the bus was not difficult. They arrived on time. Therefore there was no meeting. Show that the statement constitutes a valid argument .

4. Write the Boolean function values for f : A2 A, where A = {0, 1} with f (x1, x2

5. Construct the grammar which generates the following language and also specify their types.

6. What is DFA ? Explain with example