Professional Documents
Culture Documents
Solution Manual For Discrete Mathematics For Computer Scientists Cliff L Stein Robert Drysdale Kenneth Bogart
Solution Manual For Discrete Mathematics For Computer Scientists Cliff L Stein Robert Drysdale Kenneth Bogart
Editorial Reviews
From the Back Cover
Discrete Mathematics for Computer Scientists provides computer science students the foundation
they need in discrete mathematics. It gives thorough coverage to topics that have great importance
to computer scientists and provides a motivating computer science example for each math topic,
helping answer the age-old question, "Why do we have to learn this?"
This title is available as an eTextbook from CourseSmart. Purchase your assigned textbook as a
CourseSmart eTextbook, and stop lugging books around campus! You can also access
CourseSmart eTextbooks from your iPhone.
Instructors, request your exam copies online and get instant access. Learn more at
coursesmart.com.
About the Author
Clifford Stein is a Professor of IEOR at Columbia University. He also holds an appointment in the
Department of Computer Science. He is the director of Undergraduate Programs for the IEOR
Department. Prior to joining Columbia, he spent 9 years as an Assistant and Associate Professor in
the Dartmouth College Department of Computer Science.
His research interests include the design and analysis of algorithms, combinatorial optimization,
operations research, network algorithms, scheduling, algorithm engineering and computational
biology. Professor Stein has published many influential papers in the leading conferences and
journals in his field, and has occupied a variety of editorial positions including the journals ACM
Transactions on Algorithms, Mathematical Programming, Journal of Algorithms, SIAM Journal on
Discrete Mathematics and Operations Research Letters. His work has been supported by the
National Science Foundation and Sloan Foundation. He is the winner of several prestigious awards
including an NSF Career Award, an Alfred Sloan Research Fellowship and the Karen Wetterhahn
Award for Distinguished Creative or Scholarly Achievement. He is also the co-author of two
textbooks: Discrete Math for Computer Science with Scot Drysdale and Introduction to Algorithms,
with T. Cormen, C. Leiserson and R. Rivest—the best-selling textbook in algorithms, which has been
translated into 8 languages.
(Robert L.) Scot Drysdale, III is a professor of Computer Science at Dartmouth College and served
as Chair of the Computer Science department for eight years. His main research area is algorithms,
primarily computational geometry. He is best known for papers describing algorithms for computing
variants of a geometric structure called the Voronoi Diagram and algorithms that use the Voronoi
Diagram to solve other problems in computational geometry. He has also developed algorithms for
planning and testing the correctness of tool path movements in Numerical Control (NC) machining.
His work has been supported by grants from the National Science Foundation and Ford Motor
Company and he was awarded a Fulbright Fellowship.
1. Contents
2. List of Theorems, Lemmas, and Corollaries
3. Preface
4. CHAPTER 1 Counting
5. 1.1 Basic Counting
6. The Sum Principle
7. Abstraction
8. Summing Consecutive Integers
9. The Product Principle
10. Two-Element Subsets
11. Important Concepts, Formulas, and Theorems
12. Problems
13. 1.2 Counting Lists, Permutations, and Subsets
14. Using the Sum and Product Principles
15. Lists and Functions
16. The Bijection Principle
17. k-Element Permutations of a Set
18. Counting Subsets of a Set
19. Important Concepts, Formulas, and Theorems
20. Problems
21. 1.3 Binomial Coeficients
22. Pascal’s Triangle
23. A Proof Using the Sum Principle
24. The Binomial Theorem
25. Labeling and Trinomial Coeficients
26. Important Concepts, Formulas, and Theorems
27. Problems
28. 1.4 Relations
29. What Is a Relation?
30. Functions as Relations
31. Properties of Relations
32. Equivalence Relations
33. Partial and Total Orders
34. Important Concepts, Formulas, and Theorems
35. Problems
36. 1.5 Using Equivalence Relations in Counting
37. The Symmetry Principle
38. Equivalence Relations
39. The Quotient Principle
40. Equivalence Class Counting
41. Multisets
42. The Bookcase Arrangement Problem
43. The Number of k-Element Multisets of an n-Element Set
44. Using the Quotient Principle to Explain a Quotient
45. Important Concepts, Formulas, and Theorems
46. Problems
47. CHAPTER 2 Cryptography and Number Theory
48. 2.1 Cryptography and Modular Arithmetic
49. Introduction to Cryptography
50. Private-Key Cryptography
51. Public-Key Cryptosystems
52. Arithmetic Modulo n
53. Cryptography Using Addition mod n
54. Cryptography Using Multiplication mod n
55. Important Concepts, Formulas, and Theorems
56. Problems
57. 2.2 Inverses and Greatest Common Divisors
58. Solutions to Equations and Inverses mod n
59. Inverses mod n
60. Converting Modular Equations to Normal Equations
61. Greatest Common Divisors
62. Euclid’s Division Theorem
63. Euclid’s GCD Algorithm
64. Extended GCD Algorithm
65. Computing Inverses
66. Important Concepts, Formulas, and Theorems
67. Problems
68. 2.3 The RSA Cryptosystem
69. Exponentiation mod n
70. The Rules of Exponents
71. Fermat’s Little Theorem
72. The RSA Cryptosystem
73. The Chinese Remainder Theorem
74. Important Concepts, Formulas, and Theorems
75. Problems
76. 2.4 Details of the RSA Cryptosystem
77. Practical Aspects of Exponentiation mod n
Another random document with
no related content on Scribd:
The Project Gutenberg eBook of The show must
go on
This ebook is for the use of anyone anywhere in the United States
and most other parts of the world at no cost and with almost no
restrictions whatsoever. You may copy it, give it away or re-use it
under the terms of the Project Gutenberg License included with this
ebook or online at www.gutenberg.org. If you are not located in the
United States, you will have to check the laws of the country where
you are located before using this eBook.
Language: English
By HENRY SLESAR
Illustrated by ENGLE
"Now kill her," said the voice. "And you can go free."
"I WON'T!" he shouted again. He scrambled to his feet and made a
dive for the weapon. He took it in his hand and waved it threateningly
at the surrounding woods.
"Come out! Come out!" he screamed. The eyes of the forest blinked
back at him in silence.
He flung the sword from his hand, as if in loathing. Then he crashed
into the forest once more.
The man raised himself from the ground. His limbs felt weak, and he
had to force the breaths through his lungs.
He got to his feet, feeling somewhat stronger. The forest seemed as
impenetrable as ever, but he faced its challenge now with more
confidence.
That girl! he thought. My God—she was really going to kill him! He
shook his head bewilderedly. Such a young, pretty girl! What had he
done to her? What made her want to do it?
He moved through the forest slowly, ducking branches, trailing the
sources of dim lights in the distance. But as he approached, they
proved to be illusory, odd reflections of moonlight among the trees.
She didn't want to kill him, not really. He could sense that. It was
something more. She was compelled to do it—that was it. Someone
had put her up to it. But who? Who hated him enough?
The speculation made his head ache. He blanked out his thoughts
and decided to concentrate on his predicament. There had to be a
way out. The girl had entered the forest at some point. But where?
He heard the sound of voices, and he stopped breathing.
"Manford means business," one of them said.
"He's plenty worried. T.D. was watching tonight—"
"The sponsors kick T.D., T.D. kicks Manford, and Manford kicks us.
Who do we kick?"
"I don't know about you. I got an old dog home—"
"Okay. Let's separate and find this bird."
"Right. Hey, Lou! Let's have some tracer lights!"
He concealed himself in the brush as a burst of light exploded over
the treetops. He watched the men parade past; ordinary-looking men,
executive types, with white collars and knit ties and flannel suits.
Strangely enough, they seemed quite at home in this wilderness.
He waited until they passed his hiding place. Then he started on a
nimble run in the direction from which they had come.
Miss Stitch slipped her compact back into her purse, and straightened
the corners of the stack of mail on her desk blotter. She looked
towards the empty office of the Producer, and smiled with secretive
pleasure. Then she slit open the envelopes in front of her, and
leisurely read the morning mail.
"Dear Mr. Donnelly.... Boy, oh boy! What a thriller you gave us the
other night! I thought 'Pit and the Pendulum' was one of the best Thrill
Shows yet.... I sure was disappointed when I saw the title card and
thought you were going to re-hash that old Poe bit, but that new
ending of yours really knocked me cold.... I sure got a kick out of
seeing that fat old guy going over the edge of the Pit. What a terrific
wind-up!... I wonder if you would be interested in a really great story
idea?... You see, there's this crazy old guy who has a secret
laboratory on a mountain-top.... Well, one night it's raining and
lightning like mad.... And this beautiful blonde comes along in a
classy convertible...."
*** END OF THE PROJECT GUTENBERG EBOOK THE SHOW
MUST GO ON ***
Updated editions will replace the previous one—the old editions will
be renamed.
1.D. The copyright laws of the place where you are located also
govern what you can do with this work. Copyright laws in most
countries are in a constant state of change. If you are outside the
United States, check the laws of your country in addition to the terms
of this agreement before downloading, copying, displaying,
performing, distributing or creating derivative works based on this
work or any other Project Gutenberg™ work. The Foundation makes
no representations concerning the copyright status of any work in
any country other than the United States.