Discrete Mathematics with Applications

Discrete Mathematics with Applications

Volumn , Issue , 2003, Pages 1-1045

  Koshy, Thomas ^a  

^a NONE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; CURRICULA; DIGITAL COMPUTERS; LINEAR ALGEBRA; NUMBER THEORY; PATTERN RECOGNITION; PROBLEM SOLVING; PROGRAM COMPILERS; STUDENTS;

ALGORITHM DEVELOPMENT; COMPUTER SCIENCE COURSE; COMPUTER SCIENTISTS; DISCRETE MATHEMATICS; MODERN APPLICATIONS; NUMERIC COMPUTATION; PROBLEM SOLVING TECHNIQUE; WRITING PROJECTS;

COMPUTER PROGRAMMING LANGUAGES;

EID: 84942110399     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1016/B978-0-12-421180-3.X5000-1     Document Type: Book

References (250)

1. Carroll L. Symbolic Logic and the Game of Logic 1958, Dover.
2. Carroll L. Alice's Adventures in Wonderland and Through the Looking-Glass and What Alice Found There 1982, Oxford, New York.
3. Falletta N. The Paradoxicon 1990, Wiley, New York.
4. Gardner M. Mathematical Puzzles and Diversions 1987, The University of Chicago Press, New York.
5. Johnson J.T. Fuzzy Logic. Popular Science July 1990, Vol. 237:87-89.
6. Kosko B., Isaka S. Fuzzy Logic. Scientific American July 1993, Vol. 269:76-81.
7. Nguyen H.T., Walker E.A. A First Course in Fuzzy Logic 2000, Chapman and Hall/CRC, Chicago. 2nd ed.
8. Smullyan R.M. Alice in Puzzle-land 1984, Penguin, Boca Raton, FL.
9. Smullyan R.M. What is the name of this book? 1978, Prentice Hall, New York.
10. Smullyan R.M. The Lady or the Tiger? 1992, Random House, Englewood Cliffs, NJ.
11. Solow D. How to Read and Do Proofs 1982, Wiley, New York.
12. Christian R.R. Introduction to Logic and Sets 1965, Blaisdell, New York.
13. Guillen M. Bridges to Infinity: The Human Side of Mathematics 1983, 41-60. J.P. Tarcher Inc., Waltham, MA.
14. Halmos P.R. Naive Set Theory 1960, Van Nostrand, Los Angeles.
15. Sahni S. Concepts in Discrete Mathematics 1985, 93-111. Camelot, New York, 2nd.
16. Suppes P.C. Axiomatic Set Theory 1960, Van Nostrand, Fridley, MN.
17. Wilder R.L. Evolution of Mathematical Concepts:An Elementary Study 1968, Wiley, New York.
18. Bailey W.T. Friday-the-Thirteenth. Mathematics Teacher May 1969, Vol. 62:363-364.
19. Camp D.R. Secret Codes with Matrices. Mathematics Teacher Dec. 1985, Vol. 78:676-680.
20. Cohen D.I.A. Basic Techniques of Combinatorial Theory 1978, 144-178. Wiley, New York.
21. Graham R.L., et al. Concrete Mathematics 1989, 397-424. Addison-Wesley, New York.
22. Horowitz E., Sahni S. Fundamentals of Computer Algorithms 1978, Computer Science Press, Reading, MA.
23. Koltz F.S. When Is a Program Like a Function?. Mathematics Teacher Nov. 1986, Vol. 79:648-651.
24. Usiskin Z. The Greatest Integer Symbol. Mathematics Teacher Dec. 1977, Vol. 70:739-743.
25. Archibald R.G. An Introduction to the Theory of Numbers 1970, 1-95. Merrill, Rockville, MD.
26. Brassard G., Bratley P. Algorithmics:Theory & Practice 1988, Prentice Hall, Columbus, OH.
27. Dugle J. The Twelve Days of Christmas and Pascal's Triangle. Mathematics Teacher Dec. 1982, Vol. 75:755-757.
28. Hardy G.H. A Mathematician's Apology 1941, Cambridge University Press, Englewood Cliffs, NJ.
29. Koshy T. Elementary Number Theory with Applications 2002, 1-189. Harcourt/Academic Press, Cambridge.
30. Oliver C. The Twelve Days of Christmas. Mathematics Teacher Dec. 1977, Vol. 70:752-754.
31. Wilf H.S. Algorithms and Complexity 1986, 8-22. 137-175, Prentice-Hall, Boston.
32. Brassard G., Bratley P. Algorithmics: Theory & Practice 1986, 26-34. 48-61, Prentice-Hall, Englewood Cliffs, NJ.
33. Grimaldi R.P. Discrete and Combinatorial Mathematics:An Applied Introduction 1999, 351-403. 4th edition, Addison-Wesley, Englewood Cliffs, NJ.
34. Jackson B.W., Thro D. Applied Combinatorics with Problem Solving 1990, 226-252. Addison-Wesley, Boston, MA.
35. Koshy T. Fibonacci and Lucas Numbers with Applications 2001, Wiley, Reading, MA.
36. Oliver C. The Twelve days of Christmas. Mathematics Teacher Dec. 1977, Vol. 70:752-754.
37. Sahni S. Concepts in Discrete Mathematics 1985, 205-335. 2nd edition, Camelot, New York.
38. Sedgewick R. Algorithms 1988, 3-189. 2nd edition, Addison-Wesley, Fridley, MN.
39. Strangeman K.B. The Sum of n Polygonal Numbers. Mathematics Teacher Nov. 1974, Vol. 67:655-658.
40. Trigg C.W. Palindromic Triangular Numbers. J.Recreational Mathematics Spring 1973, Vol. 6:146-147.
41. Tucker A. Applied Combinatorics 1984, 222-298. Wiley, Reading, MA.
42. Wilf H.S. Algorithms and Complexity 1986, 26-34. 48-61, Prentice-Hall, New York.
43. Berman G., Fryer K.D. Introduction to Combinatorics 1972, 35-125. Academic Press, Englewood Cliffs, NJ.
44. Bogart K.P. Introductory Combinatorics 1983, Pitman, New York.
45. Chinn P.Z. Inductive Patterns, Finite Differences, and a Missing Region. Mathematics Teacher Sept. 1988, Vol. 81:446-449.
46. Cohen D.I.A. Basic Techniques of Combinatorial Theory 1978, 13-178. Wiley, Boston, MA.
47. Dugle J. The Twelve Days of Christmas and Pascal's Triangle. Mathematics Teacher Dec. 1982, Vol. 75:755-757.
48. Eckhardt P.O. Discretely Deranged Squares. Mathematics Teacher April 1990, Vol. 83:318-320.
49. Edwards A.W.F. Pascal's Arithmetical Triangle 2002, The Johns Hopkins University Press, New York.
50. Eng M., Casey J. Pascal's Triangle- A Serendipitous Source for Programming Activities. Mathematics Teacher Dec. 1983, Vol. 76:686-690.
51. Jackson B.W., Thoro D. Applied Combinatorics with Problem Solving 1990, 42-133. Addison-Wesley, Baltimore, MD.
52. Litwiller B.H., Duncan D.R. Poker Probabilities. Mathematics Teacher Dec. 1977, Vol. 70:766-771.
53. Oliver C. The Twelve Days of Christmas. Mathematics Teacher Dec. 1977, Vol. 70:752-754.
54. Varnadore J. Pascal's Triangle and Fibonacci Numbers. Mathematics Teacher April 1991, Vol. 84:314-316. 319.
55. Aho A.V., et al. Data Structures and Algorithms 1983, Addison-Wesley, Reading, MA.
56. Bailey W.T. Friday-the-Thirteenth. Mathematics Teacher May 1969, Vol. 62:363-364.
57. Gallian J.A. Assigning Driver's License Numbers. Mathematics Magazine Feb. 1991, Vol. 64:13-22.
58. Gallian J.A. The Mathematics of Identification Numbers. The College Mathematics Journal May 1991, Vol. 22:194-202.
59. Gallian J.A., Winters S. Modular Arithmetic in the Market-place. The American Mathematical Monthly June-July 1988, Vol. 95:548-551.
60. Hardy D.W., Walker C.L. Applied Algebra:Codes, Ciphers, and Discrete Algorithms 2003, Prentice-Hall, Reading, MA.
61. Koshy T. Elementary Number Theory with Applications 2002, 210-436. Harcourt/Academic Press, Upper Saddle River, NJ.
62. Lefton P. Number Theory and Public-Key Cryptology. Mathematics Teacher Jan. 1991, Vol. 84:54-62.
63. Lewand R.E. Cryptological Mathematics 2000, Math. Association of America, Boston, MA.
64. Shockley J.E. Introduction to Number Theory 1967, 36-69. Holt, Rinehart and Winston, Washington, D.C.
65. Snow J.R. An Application of Number Theory to Cryptology. Mathematics Teacher Jan. 1989, Vol. 82:18-26.
66. Tuchinsky P.M. International Standard Book Number. The Umap. Journal 1985, Vol. 5:41-54.
67. Appel K., Haken W. Every Planar Map is 4-Colorable. Bulletin of the American Mathematical Society 1976, Vol. 82:711-712.
68. Bondy J.A., Murty U.S.R. Graph Theory with Applications 1976, Elsevier, New York.
69. Brualdi R.A. Introductory Combinatorics 1999, Prentice-Hall, New York. 3rd edition.
70. Cristofides N. Graph Theory: An Algorithmic Approach 1975, Academic Press, Upper Saddle River, NJ.
71. Jackson B.W., Thoro D. Applied Combinatorics with Problem Solving 1990, 134-200. Addison-Wesley, New York.
72. McHugh J.A. Algorithmic Graph Theory 1990, Prentice-Hall, Reading, MA.
73. Ralston A. Debruijn Sequences - A Model Example of the Interac-tion of Discrete Mathematics and Computer Science. Mathematics Magazine May 1982, Vol. 55:131-143.
74. Skieno S.S. Implementing Discrete Mathematics 1990, Addison-Wesley, Englewood Cliffs, NJ.
75. Thulasiraman K., Swamy M.N.S. Graphs:Theory and Algo-rithms 1992, Wiley, Reading, MA.
76. Tucker A. Applied Combinatorics 1984, 3-79. 389-410, 2nd edition, Wiley, New York.
77. West D. Introduction to Graph Theory 2001, Prentice-Hall, New York. 2nd edition.
78. Wilson R.J., Watkins J.J. Graphs:An Introductory Approach 1990, Wiley, Upper Saddle River, NJ.
79. Aho A.V., et al. Data Structures and Algorithms 1983, 75-196. 230-292, Addison-Wesley, New York.
80. Carmen T.H., et al. Introduction to Algorithms 1990, McGraw-Hill, Reading, MA.
81. Cohen D.I.A. Basic Techniques of Combinatorial Theory 1978, 228-282. Wiley, New York.
82. Grimaldi R.P. Discrete and Combinatorial Mathematics:An Applied Introduction 1999, 547-590. 4th edition, Addison-Wesley, New York.
83. Horowitz E., Sahni S. Fundamentals of Computer Algorithms 1978, 152-370. Computer Science Press, Reading, MA.
84. Kruse R.L. Data Structures & Program Design 1987, 318-498. 512-517, 2nd edition, Prentice Hall, Rockville, MD.
85. McHugh J.A. Algorithmic Graph Theory 1990, Prentice-Hall, Englewood Cliffs, NJ.
86. Sahni S. Concepts in Discrete Mathematics 1985, 391-448. 2nd edition, Camelot, Englewood Cliffs, NJ.
87. Skieno S.S. Implementing Discrete Mathematics 1990, Addison-Wesley, Fridley, MN.
88. Tucker A. Applied Combinatorics 1984, 80-122. 2nd edition, Wiley, Reading, MA.
89. Wilson R.J., Watkins J.J. Graphs: An Introductory Approach 1990, 185-214. Wiley, New York, NY.
90. Aho A.V., et al. Data Structures and Algorithms 1983, 198-229. Addison-Wesley, New York.
91. Ahuja R.K., et al. Network Flows 1993, Prentice-Hall, Reading, MA.
92. Bondy J.A., Murty U.S.R. Graph Theory with Applications 1976, Elsevier, Englewood Cliffs, NJ.
93. Cormen T.H. Introduction to Algorithms 1990, McGraw-Hill, New York.
94. Ford L., Fulkerson D. Flows and Networks 1962, Princeton University Press, New York.
95. Grimaldi R.P. Discrete and Combinatorial Mathematics:An Applied Introduction 1999, 324-480. 4th edition, Addison-Wesley, Princeton, NJ.
96. Horowitz E., Sahni S. Fundamentals of Data Structures 1976, 301-334. Computer Science Press, Reading, MA.
97. Sahni S. Concepts in Discrete Mathematics 1985, 379-397. 2nd edition, Camelot, Potomac, MD.
98. Wilson R.J., Watkins J.J. Graphs:An Introductory Approach 1990, 80-111. Wiley, Fridley, MN.
99. Barnier W.J. Finite-State Machines as Recognizers. The Umap Module 1986, 671:209-232.
100. Hayes B. On the Finite-State Machine, a Minimal Model of Mouse-traps, Ribosomes, and the Human Soul. Scientific American Dec. 1983, Vol. 249:19-28. 178.
101. Hopcroft J.E., Ullman J.D. Introduction to Automata Theory, Languages, and Computation 1979, Addison-Wesley, New York.
102. Kohavi Z. Switching and Finite Automata Theory 1978, McGraw-Hill, Reading, MA. 2nd edition.
103. Linz P. An Introduction to Formal Languages and Automata 1990, D.C. Heath, New York.
104. Martin J.C. Introduction to Languages and the Theory of Computation 1997, McGraw-Hill, Lexington, MA. 2nd edition.
105. Sipser M. Introduction to the Theory of Computation 1997, PWS, New York.
106. Wulf W.A., et al. Fundamental Structures of Computer Science 1981, 1-64. Addison-Wesley, Boston.
107. Abbot J.C. Sets, Lattices, and Boolean Algebras 1969, Allyn and Bacon, Reading, MA.
108. Arnold B.H. Logic and Boolean Algebra 1962, Prentice-Hall, Boston.
109. Flegg H.G. Boolean Algebra and Its Applications 1964, Wiley, Englewood Cliffs, NJ.
110. Gopolan K.G. Introduction to Digital Microelectronic Circuits 1996, Irwin, New York.
111. Hohn F.E. Applied Boolean Algebra 1966, Macmillan, Chicago. 2nd edition.
112. Whitesitt J.E. Boolean Algebra and Its Applications 1961, Addison-Wesley, New York.
113. Wakerly J.F. Digital Design:Principles and Practices 1994, Prentice-Hall, Reading, MA. 2nd edition.
114. Williams G.E. Boolean Algebra with Computer Applications 1970, McGraw-Hill, Englewood Cliffs, NJ.
115. Aho A.V. Compilers Principles Techniques and Tools 1986, Addison Wesley, New York.
116. Alagar V.S. Fundamentals of Computing Theory and Practice 1989, Prentice-Hall, Reading MA.
117. Appel K., Haken W. Every Planar Graph is 4-colorable. Bulletin of the American Mathematical Society Sept. 1976, Vol.82:711-712.
118. Archibald R.G. An Introduction to the Theory of Numbers 1972, Wiley, Englewood Cliffs NJ. 3rd edition.
119. Bain V. An Algorithm for Drawing the n-cube. The College Mathematics Journal Sept. 1998, Vol.29:320-322.
120. Baltus C. A TruthTable on the Island of Truthtellers and Liars. Mathematics Teacher Dec. 2001, Vol.94:730-732.
121. Barneir W.J. Finite-State Machines as Recognizers. The UMAP Journal 1986, 7(3):209-232.
122. Barnier W., Chan J.B. Discrete Mathematics with Applications 1989, West, New York.
123. Barwell B. Solution to Problem 702. J.Recreational Mathematics 1979-1980, Vol.12(1):67-68.
124. Barwell B. Solution to Problem 1046. J.Recreational Mathematics 1981-1982, Vol.15(1):70-72.
125. Bellman R. Algorithms Graphs and Computers 1970, Academic Press, St.Paul MN.
126. Bellmore M., L.Nemhauser G. The Traveling Salesman Problem. Operations Research 1968, Vol.16:538-558.
127. Bezsuska S.J. Solution to Problem 791. J.Recreational Mathematics 1979-1980, 12(4):311.
128. Bissinger B. Ask Marilyn. Parade Magazine April 25, 1993, 15.
129. Bittinger M.L. Logic and Proof 1972, Addison-Wesley, New York.
130. Brown W.G. Historical Note on a Recurrent Combinatorial Problem. The American Mathematical Monthly Nov. 1965, Vol.72:973-977.
131. Boyd A.V., Glencorss M.J. Dissecting a Circle by Chords through nPoints. Mathematics Teacher April 1991, Vol.84:318-319.
132. Burling J. Using Graphs to Solve the Traffic Light Problem 1989, FAIM Module COMAP Inc., Reading MA.
133. Burns D. Problem 596. J.Recreational Mathematics 1977-1978, Vol.10(1):52.
134. Bussey W.H. Origin of Mathematical Induction. The American Mathematical Monthly May 1917, Vol.24:199-207.
135. Calendar Problems. Mathematics Teacher Oct. 1990, Vol.83:550.
136. Calendar Problems. Mathematics Teacher Dec. 1992, Vol.85:736.
137. Calendar Problems. Mathematics Teacher April 1986, Vol.79:274.
138. Calendar Problems. Mathematics Teacher Nov. 1986, Vol.79:627.
139. Campbell D.M. The Computation of Catalan Numbers. Mathematics Magazine Sept. 1984, Vol.57:195-208.
140. Carlitz L. Solution to Problem B-180. The Fibonacci Quarterly Dec. 1970, Vol 8(5):547-548.
141. Caudill M. Using Neural Nets: Fuzzy Decisions. AI Expert April 1990, Vol.5:59-64.
142. Charosh M. Problem 1160. J.Recreational Mathematics 1983-1984, Vol.15(1):58.
143. Codd E.F. Relational Model of Data for Large Shared Databanks. Communications of the ACM 1970, Vol.13:377-387.
144. Cohen F., Selfridge J.L. Not Every Integer Is the Sum or Difference of Two Prime Powers. Mathematics of Computation 1975, Vol.29:79.
145. Comfort E. Solution to Problem 596. J.Recreational Mathematics 1978-1979, Vol.11(1):66.
146. Cortada J.W. Historical Dictionary of Data Processing: Biographies 1987, Greenwood Press, Lexington MA.
147. Coughlin M., Kerwin C. Mathematical Induction and Pascal's Problem of the Points. Mathematics Teacher May 1985, Vol.78:376-380.
148. Crilly T. A Victorian Mathematician. The Mathematical Gazette July 1995, Vol.79:259-262.
149. Cull P., Ecklund E.F. Towers of Hanoi and Analysis of Algorithms. The American Mathematical Monthly June-July 1985, Vol.92:407-420.
150. Deo N. Graph Theory with Applications to Engineering and Computer Science 1974, Prentice Hall, New York.
151. Drake R.C. Problem B-180. The Fibonacci Quarterly Feb. 1970, Vol.8(1):106.
152. Duffy L.R. The Duffinian Numbers. J.Recreational Mathematics 1979-1980, Vol. 12(2):112-115.
153. Euler R. Problem 1551. J.Recreational Mathematics 1987, Vol.19(2):151.
154. Eves H. Problem E579. The American Mathematical Monthly June-July 1943, Vol.50:386.
155. Eves H. An Introduction to the History of Mathematics 1969, HoltRinehart Winston, Englewood Cliffs NJ. 3rd edition.
156. Filz A. Problem 1046. J.Recreational Mathematics 1981-1982, Vol. 14(1):64.
157. Fletcher T. Problem 602. J.Recreational Mathematics 1978-1979, Vol.10(1):52.
158. G.Forder H. Some Problems in Combinatorics. The Mathematical Gazette 1961, Vol.45:199-201.
159. Friedland A.J. Puzzles in Math &Logic 1970, Dover, New York.
160. Gallian J.A., Winters S. Modular Arithmetic in the Market Place. The American Mathematical Monthly June-July 1988, Vol.95:548-551.
161. Gardner M. Mathematical Games. Scientific American Sept. 1968, Vol. 219:218-230.
162. Gardner M. Catalan Numbers: An Integer Sequence That Materializes in Unexpected Places. Scientific American June 1976, Vol.234:120-125.
163. Gardner M. Mathematical Circus 1979, Knopf, New York.
164. Gardner M. Mathematical Puzzles and Diversions 1987, The University of Chicago Press, New York NY.
165. Gardner M. Ask Marilyn. Parade Magazine April 18, 1993, 12.
166. Golomb S.W. Pairings and Groupings. Johns Hopkins Magazine April 1993, Vol.45(2):7.
167. Graham R.L. Concrete Mathematics 1990, Addison-Wesley, Chicago IL.
168. Gray J.J. Arthur Cayley (1821-1895). The Mathematical Intelligencer 1995, Vol. 17(4):62-63.
169. Green T.M. Pascal's Pizza. Mathematics Teacher Sept. 1988, Vol.81:445. 454.
170. Grimaldi R.P. Discrete and Computational Mathematics 1999, Addison Wesley, Reading MA. 4th ed.
171. Guckin A. The Euler Circuit Project 1989, COMAP Inc., Reading MA.
172. Gudder S. A Mathematical Journey 1976, McGraw-Hill, Lexington MA.
173. Hamilton B. Brainteasers and Mindbenders 1992, Freeside, New York.
174. K.Hanson D. Matching, Derangements, and Rencontres. Mathematics Magazine Sept. 1983, Vol.56:224-229.
175. Harray F., Maybee J.S. Graphs and Applications 1985, Wiley, New York.
176. Hayes B. On the Finite-State Machine A Minimal Model of Mousetraps Ribosomes, and the Human Soul. Scientific American Dec. 1983, Vol. 249:20-28.
177. Henkin L. On Mathematical Induction. The American Mathematical Monthly April 1960, Vol.67:323-338.
178. Hoggatt V.E. Fibonacci and Lucas Numbers. Houghton Mifflin Boston 1963.
179. Hoggatt V.E., Basin S.L. A Primer on the Fibonacci Sequence Part II. The Fibonacci Quarterly April 1963, Vol.1(2):61-68.
180. Hoggatt V.E. Some Special Fibonacci and Lucas Generating Functions. The Fibonacci Quarterly April 1971, Vol.9(2):121-133.
181. Hu T.C. Combinatorial Algorithms 1982, Addison-Wesley, New York.
182. Huang K.K. Solution to Problem 1160. J.Recreational Mathematics 1983-1984, Vol.16(1):69.
183. Jean R.V. The Fibonacci Sequence. The UMAP Journal 1984, Vol.5(1):23-47.
184. Johnson J.T. Fuzzy Logic. Popular Science July 1990, Vol.237:87-89.
185. Johnsonbaugh R. Discrete Mathematics 2001, Prentice-Hall Upper Saddle, Reading MA. 5th ed.
186. Just E. A Note on the nth Term of the Fibonacci Sequence. Mathematics Magazine Sept.-Oct. 1971, Vol. 44:199.
187. Karnaugh M. The Map Method for Synthesis of Combinational Logic Circuits. Transactions of the AIEE, Part I Nov. 1953, Vol. 72(9):593-599.
188. Kierstead F.H. Problem 791. J.Recreational Mathematics 1978-1979, Vol. 11(4):302.
189. Kierstead F.H. Problem 1014. J.Recreational Mathematics 1981-1982, Vol. 14(4):309.
190. Keith M., Carver T. The Ultimate Perpetual Calendar. J.Recreational Mathematics 1990, Vol. 22(4):280-282.
191. Knuth D.E. Algorithms. Scientific American April 1977, Vol.243:63-80.
192. Knuth D.E. Algorithmic Thinking and Mathematical Thinking. The American Mathematical Monthly March 1985, Vol. 92:170-181.
193. Kolman B. Discrete Mathematical Structures 2000, Prentice-Hall, River NJ. 4th ed.
194. Koshy T. Finite Mathematics and Calculus with Applications 1979, Goodyear Pacific, Upper Saddle River NJ.
195. Koshy T. Fibonacci and Lucas Numbers with Applications 2001, Wiley, Palisades CA.
196. Koshy T. Elementary Number Theory with Applications 2002, Harcourt/Academic Press, New York.
197. Kosko B., Isaka S. Fuzzy Logic. Scientific American July 1993, Vol. 269:76-81.
198. Kruskal J.B. On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem. Proceedings of the American Mathematical Society 1956, 48-50.
199. Kuehls E.A. The Truth-Value of {∀,∃,P(x,y)} A Graphical Approach. Mathematics Teacher Nov. 1970, Vol. 43:260-261.
200. Kuenzi N.J., Prielipp B. Problem 4026. School and Science Mathematics Dec. 1985, Vol. 85:714-716.
201. Lander L.J. A Survey of Equal Sums of Like Powers. Mathematics of Computation 1967, Vol. 21:446.
202. Lawler E.L. The Traveling Salesman Problem 1986, Wiley, Boston.
203. Long C.T. On Pigeons and Problems. Mathematics Teacher Jan. 1988, Vol. 81:28-30.
204. Maier E. Counting Pizza Pieces and Other Combinatorial Problems. Mathematics Teacher Jan. 1988, Vol. 81:22-26.
205. Mallows C.L. Conway's Challenge Sequence. The American Mathematical Monthly Jan. 1991, Vol. 98:5-20.
206. Mauland L.E. An Exercise with Polygonal Numbers. Mathematics Teacher May 1985, Vol.78:340-344.
207. Maurer S.B., Ralston A. Discrete Algorithmic Mathematics 1991, Addison Wesley, New York.
208. Martelli M. The Farmer and the Goose- a Generalization. Mathematics Teacher March 1993, Vol. 86:202-203.
209. McCulloch W.S., Pitts W. A Logical Calculus of the Ideas Imminent in Nervous Activity. Bulletin of Mathematical Biophysics 1943, Vol. 5:115-133.
210. Miller W.A. Polynomial Numbers and Recursion. Mathematics Teacher Oct. 1990, Vol.83:555-558.
211. Myers B.R. Number of Spanning Trees in a Wheel. IEEE Transactions on Circuit Theory CT-18 March 1971, 280-281.
212. Nelson H.L. Problem 702. J.Recreational Mathematics 1978-1979, Vol.11(1):36.
213. Nelson H.L. Two Counterfeits. J.Recreational Mathematics 1982-1983, Vol. 15(1):65.
214. Nichols J.C. Solution to Problem 602. J.Recreational Mathematics 1978-1979, Vol. 11(1):75.
215. Polya G. Mathematical Discovery combined 1981, Wiley, Reading MA.
216. Prim R.C. Shortest Connection Networks Some Generalizations. Bell. System Technical Journal 1957, Vol. 36:1389-1401.
217. Vun I., Belcher P. Catalan Numbers. Mathematical Spectrum 1996-1997, Vol.29(3):3-5.
218. Wayne A. Solution to Problem E579. The American Mathematical Monthly March 1944, Vol. 51:165.
219. Ralston A. De Bruijn Sequences - A Model Example of the Interaction of Discrete Mathematics and Computer Science. Mathematics Magazine May 1982, Vol. 55:131-143.
220. Recaman B. The Games of Ham. J.Recreational Mathematics 1977-1978, Vol. 10:251-253.
221. Roberti J.V. The Indirect Method. Mathematics Teacher Jan. 1987, Vol. 80:41-43.
222. Rosen K.H. Discrete Mathematics and Its Applications 1999, McGraw-Hill, New York. 4th ed.
223. Ross K.A., Wright C.R.B. Discrete Mathematics 1992, Prentice-Hall, New York. 3rd ed.
224. Ritter G.L., et al. An Aid to the Superstitious. Mathematics Teacher May 1977, Vol. 70:456-457.
225. Sahni S. Concepts in Discrete Mathematics 1985, Camelot, Englewood Cliffs, NJ. 2nd ed.
226. Schwartz B.J. Solution to Problem 1014. J.Recreational Mathematics 1981-1982, Vol. 14(4):309.
227. J.Sedlacek, "On the Skeletons of a Graph or Digraph," Proceedings of the Calgary International Conference of Combinatorial Structures and their Applications, Gordon & Breach, New York, pp. 387-391.
228. Shasha D.E. Out of their Minds: The Lives and Discoveries of 15 Great Computer Scientists 1995, 89-101. Copernicus, New York.
229. Sherbert D.R. Difference Equations with Applications. UMAP Module 322 1980, Arlington, MA.
230. Smullyan R.M. What is the name of this book? 1978, Prentice-Hall, New York.
231. Smullyan R.M. Alice in Puzzle-Land: A Carrollian Tale for Children Under Eighty 1982, Penguin Books, Englewood Cliffs, NJ.
232. Smullyan R.M. Leaps of Logic. Discover March 1993, 96.
233. Stein S.K. The Mathematician as an Explorer. Scientific American May 1961, Vol. 204:149-158.
234. Stein S.K. Mathematics: The Man-Made Universe 1969, W.H. Freeman, New York.
235. Sterrett A. Gambling Doesn't Pay. Mathematics Teacher March 1967, Vol. 60:210-214.
236. Stevens P. Patterns in Nature 1974, Little Brown, San Francisco, CA.
237. Stone D.R. A Different Prime Proof. Mathematics Teacher Jan. 1990, Vol. 83:63.
238. Tanenbaum A.S. Structured Computer Organization 1976, 420-423. Prentice-Hall, Boston.
239. The Official LSAT PrepBook 1991, Law Services, Englewood Cliffs, NJ.
240. Thrall R.M. Insulin Requirements as a Linear Process in Time. Some Mathematical Models in Biology 1967, 0L2.1-0L2.4. The University of Michigan Press, Newtown, PA. R.F. Baum (Ed.).
241. Tuchinsky P.M. International Standard Book Numbers. The UMAP Journal 1985, Vol. 6(1):41-53.
242. Tucker A. Applied Combinatorics 1980, Wiley, Ann Arbor, MI.
243. Tymoczko T. Computers, Proofs, and Mathematics: A Philosophical Investigation of the Four-Color Proof. Mathematics Magazine May 1980, Vol. 53:131-138.
244. van Lint J.H., Wilson R.M. A Course in Combinatorics 1992, Cambridge University Press, New York, NY.
245. M.Vos Savant, Ask Marilyn, St. Martin Press, New York, p. 228.
246. Warshall S. A Theorem on Boolean Matrices. J.of the Association of Computing Machinery 1962, Vol. 9:11-12.
247. Williams J. Graph Coloring Used to Model Traffic Lights. Mathematics Teacher March 1992, Vol. 85:212-214.
248. Wilson R.J., Watkins J.J. Graphs: An Introductory Approach 1990, Wiley, New York.
249. Wood D. Towers of Brahma and Hanoi Revisited. J.Recreational Mathematics 1981-1982, Vol. 14(1):17-24.
250. Notable Mathematicians 1997, Gale Research, New York. R.V. Young (Ed.).