61. Discrete Math/Theory Of Computing Seminar discrete math/Theory of Computing Seminar. Rutgers University, Piscataway,NJ. Fall 2001. Organizers Eric Allender and Michael Saks. Other semesters. http://www.math.rutgers.edu/~saks/DMSEM/F01/

Discrete Math/Theory of Computing Seminar Rutgers University, Piscataway, N.J. Fall 2001 Organizers: Eric Allender and Michael Saks Other semesters September 11 Speaker: Eric Allender, Rutgers University Title: The circuit complexity of division Time: 4:30-5:30 Place: CORE 431 September 18 Speaker: Michael Elkin, Weizmann Institute of Science, Rehovot, Israel Title: Construction of (1+epsilon,beta)-Spanners on General Graphs Time: 4:30-5:30 Place: CORE 431 September 25 Speaker: Mario Szegedy, Rutgers University Title: Computing boolean functions from multiple faulty copies of input bits Time: 4:30-5:30 Place: CORE 431 October 2 Speaker: Ehud Friedgut, Hebrew University, Jerusalem Title: Ramsey properties of random graphs: A sharp thresholds via Szemeredi-regularity in hypergraphs. Time: 4:30-5:30 Place: Hill 705 (NOTE ROOM CHANGE) October 9 NO SEMINAR: DIMACS Mixer at NEC Research October 16 Title: Monotone Graph Properties Time: 4:30-5:30 Place: CORE 431 October 23 Speaker: Alexander Razborov, Institute for Advanced Study and Steklov Math. Institute

62. Discrete Math/Theory Of Computing Seminar discrete math/Theory of Computing Seminar. Rutgers University, Piscataway,NJ. Spring 2003. Organizers Eric Allender and Michael Saks. Other semesters. http://www.math.rutgers.edu/~saks/DMSEM/

Discrete Math/Theory of Computing Seminar Rutgers University, Piscataway, N.J. Spring 2003 Organizers: Eric Allender and Michael Saks Other semesters January 28 Speaker: Noga Alon, Tel Aviv University and Institute for Advanced Study Title: Testing large directed graphs Time: 4:30-5:30 Place: CORE 431 February 4 Speaker: Alexander Barg, DIMACS Title: Digital fingerprinting codesproblems, constructions and identification of traitors Time: 4:30-5:30 Place: CORE 431 February 11 Speaker: Ehud Friedgut, Hebrew University, Jerusalem Title: Coloring products of graphs, a Fourier approach Time: 4:30-5:30 Place: CORE 431 February 18 (CANCELLED DUE TO SNOW; TO BE RESCHEDULED) Speaker: Moses Charikar, Princeton University Title: Dimension reduction in the l_1 norm Time: 4:30-5:30 Place: CORE 431 February 25 Speaker: Michael Elkin, Institute for Advanced Study, Princeton

63. Second Bay Area Discrete Math Day The Bay Area discrete math Day, SPRING 2001. The Second BADMath Daywill take place at San Francisco State University, April 14, 2001. http://fener.sfsu.edu/~serkan/BADMath.html

The Bay Area Discrete Math Day, SPRING 2001 The Second BADMath Day will take place at San Francisco State University , April 14, 2001. As the First BADMath Day , this one-day meeting hopes to facilitate the communication between researchers and graduate students of discrete mathematics around the San Francisco bay area. BADMath Days happen semi-annually where we create a fairly informal atmosphere to talk about discrete mathematics. The term ``discrete mathematics'' is chosen to include at least the following topics: Algebraic and Enumerative Combinatorics, Discrete Geometry, Graph Theory, Coding and Design Theory, Combinatorial Aspects of Computational Algebra and Geometry, Combinatorial Optimization, Probabilistic Combinatorics, Combinatorics in Mathematical Physics, etc. The Second BADMath Day will be held in the Blakeslee Room on the top floor of Thurnton Hall , the building where the Mathematics Department is. The Math department is on the ninth floor of the building and you need to take the elevator to this floor, and then walk one flight up to Blakeslee Room. There will be clearly marked signs on the day of the meeting. Andrei Okounkov from UC Berkeley and postcript or in pdf format. If you have questions please contact the local organizer

64. Discrete Math For Middle And High School Teachers Summer 2002 discrete math for Middle and High School Math Teachers. Topicsin discrete math are integrated throughout the math curricula http://amath.colorado.edu/outreach/discrete/2002/

Count the Possibilities at The Summer Institute in Applied Mathematics, 2002 Hosted by The Department of Applied Mathematics Instructor: Mary Nelson Instructor: Joanie Funderburk ... Outreach Page Other Workshops: Calculus Probability/Statistics Summer 2002 Discrete Math for Middle and High School Math Teachers Topics in Discrete Math are integrated throughout the math curricula at the middle and high school levels. Join this workshop and we'll explore selected topics in combinatorics, election theory and fair division problems, graph theory and recursion relations. We will include the use of technology and JAVA-based simulations in order to reinforce the concepts of the course. This workshop will help prepare you to teach these topics with depth and enthusiasm. This material is aligned with the Colorado model content standards. Two units of graduate credit can be given for completion of the course. This course will be offered July 8-18, 2002 at the University of Colorado Boulder campus. We will meet from 8:30 until 3pm from Monday through Thursday of both weeks in the Muenzinger Psychology building room E118. There will be a combination of lectures and labs during the morning sessions and the afternoons will be spent in problem sessions. Summer 2001 Participants Contact Information: Anne Dougherty Department of Applied Math Associate Chair Phone: (303)492-4011

65. Fourth Biannual Bay Area Discrete Math Day The Bay Area discrete math Day, SPRING 2002. The Fourth Bay Area DiscreteMath Day will take place at Stanford University on Saturday http://math.stanford.edu/~maclagan/badiscretemath.html

The Bay Area Discrete Math Day, SPRING 2002 The Fourth Bay Area Discrete Math Day will take place at Stanford University on Saturday March 30, 2002 between 10:00 and 6:00. The location is Room 380-380C in the basement of Building 380 (the math department). There will be clearly marked signs on the day of the meeting. All parking lots near the math department are free on Saturdays. Bay Area Discrete Math Days are one-day meetings aimed at facilitating communication between researchers and graduate students of discrete mathematics around the San Francisco Bay Area. These days happen semi-annually and strive to create a fairly informal atmosphere to talk about discrete mathematics. The term "discrete mathematics" is chosen to include at least the following topics: Algebraic and Enumerative Combinatorics, Discrete Geometry, Graph Theory, Coding and Design Theory, Combinatorial Aspects of Computational Algebra and Geometry, Combinatorial Optimization, Probabilistic Combinatorics, and Combinatorics in Mathematical Physics A poster to advertise the meeting is available in postscript and pdf formats.

66. Discrete Math Homework Classwork and Homework for discrete math Taught by Mr. Thompson Last updated Monday,December 2, 2002. discrete math does not meet during second trimester. http://hs.riverdale.k12.or.us/~dthompso/homework/discretemath12.html

Back to: Homework Central RHS Home Page Mr. Thompson's Page email Mr Thompson Classwork and Homework for Discrete Math Taught by Mr. Thompson Last updated Monday, December 2, 2002 Previous Months' Assignments June May April March ... September Discrete Math does not meet during second trimester.

67. COMS W3203-2 Discrete Math COMS W32032 discrete math. Tentative schedule (subject to change). Course Outlinefor COMS W3203-2 discrete math. Original Date. Class No. Semester Date. http://www.cvn.columbia.edu/Courses/Spring2003/COMSW3203-2.html

COMS W3203-2: Discrete Math Registration Information Online Course Preview COURSE BENEFITS: Foundations: logic, sets, sequences, strings, proofs, mathematical induction, recursion. Number theory: Euclidean algorithm, modular arithmetic, Chinese remainder theorem, RSA encryption. Combinatorics: permutations and combinations, elementary finite probability, recurrence relations, inclusion-exclusion principle. Graph theory: isomorphism, planarity, circuits, trees, directed graphs. PROFESSOR GRUNSCHLAG: Assistant Professor, Computer Science Department research interests include both theoretical and applied aspects of Computer Science; the theoretical research concerns connections between classes of groups and corresponding complexity classes of formal languages. The techniques employed are of a geometric nature. His main applied research area is that of Image Compression. For more information about Professor Grunschlag, please visit: http://www.cs.columbia.edu/~zeph// APPLICABLE DEGREE PROGRAMS This course is a co-requesite for Data Structures (CS 3137 or 3139) and together, these two courses are pre-requisite for most of the junior and senior level course offered by the CS department.

68. COMS W3203-2 Discrete Math COMS W32032 discrete math. http://www.cvn.columbia.edu/courses/Fall2002/COMSW3203-2.html

COMS W3203-2: Discrete Math Registration Information Online Course Preview COURSE BENEFITS Understanding of the theory behind useful techniques in Computer Science. PROFESSOR GRUNSCHLAG Assistant in the Computer Science Department since 1999 Ph.D., U.C. Berkeley See: http://www.cs.columbia.edu/~zeph APPLICABLE DEGREE PROGRAMS Computer Science Masters breadth requirement ADDITIONAL COURSE FEES Please visit the course homepage at http://www.cs.columbia.edu/~zeph/3203 for additional information. For more information, comments, or suggestions, please email us at cvn@columbia.edu Last Update: 23-Aug-02

69. Kenston High School ~ Discrete Math discrete math. Where Do I go From Here? Students who pass discrete math are encouragedto continue where they left off in the traditional mathematics sequence. http://www.kenston.k12.oh.us/khs/math/math_placement_discrete_2001.htm

Search Our Site Our School Academics Athletics Extracurriculars Guidance ... Student Life Our Site Home What's New Contact Us Forums ... Entertainment Our District Alumni District Home Discrete Math Structure: 9 weeks 0.5 credits Prerequisites: C or better in Advanced Algebra or Honors Advanced Algebra. Description: This course is dedicated to getting more students into advanced math classes. Discrete topics include an introduction to logic, an in depth study of matrices, combinatorics and an examination of graph theory. A calculator or computer with statistical graphing capabilities is assumed throughout the text. Where Do I go From Here?

70. Discrete Math Implementation discrete math Implementation. ABET mathematics. To ensure adequate coverageof discrete math concepts, the UPC followed the following steps http://www.ece.wpi.edu/~mcneill/uprogc/discmath.html

Discrete Math Implementation ABET criteria state that students graduating with an ECE major demonstrate a knowledge of discrete mathematics. To ensure adequate coverage of discrete math concepts, the UPC followed the following steps Determine what topics constitute discrete math Determine: which topics are covered in existing courses (both within ECE and in other departments), and which topics are not covered in existing courses Identify best "home" for topics not covered: within ECE (modify existing ECE course or add course) within another department (require an existing out-of-department course) Prof. Whitmal chaired an ad hoc discrete math subcommittee which reported on these issues. After research on definitions of discrete math from organizations such as MAA and ACM/IEEE, the following topics were identified: Sets / Functions Boolean algebra Proofs Graph theory Matrices Analysis of algorithms Sequences / recurrence relations Probability / combinatorics Although there was coverage of discrete math topics in existing courses (e.g. Boolean algebra in EE2022), some topics traditionally associated with discrete math (e.g. graph theory, proofs/algorithms) were not covered in ECE courses. The UPC considered a number of options for increasing coverage of the discrete mathematics, including:

71. APC515 Data Structures And Discrete Math APC515 Data Structures and discrete math. 3 credits. Scheduling Data Structuresand discrete math is scheduled to be offered at the following times. http://www.cse.ogi.edu/courses/APC515/

Department of Computer Science and Engineering Education Admission Research Student Life ... Etc. Education Advising and Orientation Master of Science... ...in CSE ...in Computational Finance ...in Software Engineering Should I write a master's thesis M.S. thesis option in CSE Ph.D. in CSE Course Index Class Schedule this term 2002-2003 academic year 2001-2002 academic year Distance Learning ... Online registration APC515 Data Structures and Discrete Math 3 credits Description This course covers fundamental topics in data structures and discrete mathematics. The topics are presented in an integrated manner that provides the discrete math foundations for data structures and computing applications of discrete mathematics concepts. Topics covered include stacks, queues, linked lists, trees, algorithms for searching and sorting, finite state automata, and concepts of computability and decidability. Topics from discrete math include sets and various types of relations (functions, graphs, trees, lattices), recursion and inductive proofs, boolean logic, relational algebra, predicate calculus, series and limits, and asymptotic behavior of searching and sorting algorithms. Programming exercises are assigned throughout the course. Prerequisites Or equivalent knowledge of C or C++.

72. APC515 Data Structures And Discrete Math | Oregon Graduate Institute APC 515 Data Structures and discrete math (3 credits) This course coversfundamental topics in data structures and discrete mathematics. http://www.cse.ogi.edu/AppliedComputing/apc515.html

Applied Computing Courses Further Information Registration APC 515 Data Structures and Discrete Math (3 credits) This course covers fundamental topics in data structures and discrete mathematics. The topics are presented in an integrated manner that provides the discrete math foundations for data structures and computing applications of discrete mathematics concepts. Topics covered include stacks, queues, linked lists, trees, algorithms for searching and sorting, finite state automata, and concepts of computability and decidability. Topics from discrete math include sets and various types of relations (functions, graphs, trees, lattices), recursion and inductive proofs, boolean logic, relational algebra, predicate calculus, series and limits, and asymptotic behavior of searching and sorting algorithms. Programming exercises are assigned throughout the course. Prerequisites APC505a and APC505b or equivalent knowledge of C or C++ Also see the CSE Summer 2002 schedule.

73. Summary Of Discrete Math Seminars At SFU - 2001-1 To 2002-2 discrete math Seminars at Simon Fraser University 2001-1 to 2002-2. These pageschange regularly. Press Reload on your browser to get the latest information. http://www.math.sfu.ca/~goddyn/Seminars/dmsem.html

Discrete Math Seminars at Simon Fraser University - 2001-1 to 2002-2 These pages change regularly. Press "Reload" on your browser to get the latest information This seminar series is distinct from the informal Instructional Combinatorics Seminar and the Combinatorics Problem Session Semesters are listed in reverse chronological order. The symbol indicates that the anouncement is now official. Date / Time / Room Speaker Title (link to abstract) Summer 2002 Tue 14 May / 3:30 / EAA 1100 Rados Rodoicic, MIT Rainbow Arithmetic Progressions Tue 28 May / 3:30 / EAA 1100 Sean McGuinness, U. Umea and Montana Circuits intersecting cocircuits in graphs and matroids. Tue 11 Jun / 3:30 / EAA 1100 Claude Tardif, U. Regina The projectivity of the graphs $G_d^k$ Tue 18 Jun / 3:30 / K 9509 Joergen Bang-Jensen, U. Southern Denmark Steiner type problems in tournament-like digraphs Tue 25 Jun / 3:30 / K 9500 (!) Winfried Hochstaettler, Brandenburg U. of Tech. Max-flow min-cut duality for a paint shop problem Tue 02 Jul / 3:30 / EAA 1100 Luis Goddyn, Mathematics, SFU

74. Why We Teach Discrete Math The summary for this Japanese page contains characters that cannot be correctly displayed in this language/character set. http://www.is.titech.ac.jp/~watanabe/myhome/DM.html

$B:G6a=q$$$?J8$NCf$+$i!'(J $BN%;6?t3X$HEE;R>pJsDL?.(J $B!JEE;R>pJsDL?.3X2q;o$X4s9F!K(J $B?t3XE*5"G <+?H$r(J $B $B?^#1!'4v2?$N>ZL@$NNc!JFsEyJU;03Q7A$NN>Dl3Q$,Ey$7$$$3$H$N>ZL@!K(J $B2>Dj!'"$(JABC $B$K$*$$$F!$(JAB$B!a(JAC $B>ZL@!'"$(JABC $B$H(J $B"$(JACB $B$K$*$$$F!$(J $B!!!!(JAB$B!a(JAC$B!!!!!!!J2>Dj!K(J $B!!!!(JAC$B!a(JAB$B!!!!!!!J2>Dj!K(J $B!h"$(JABC$B"a"$(JACB$B!!!JFsJU643Q!K(J <%k$d%^%J! <$r3X$s$@$N$G$"$k!%(J $B$^$?!$(J $B>ZL@ $B?tNs(J a_n $B$KBP$7$F!$ r7o$,@.$jN)$D$H$-!$(J a_n $B$,(J b $B$K $B$5$F!$(J $B$3$N%7%j! <%:$N$M$i$$$O!$(J $B?t3X$,$I$NDxEY!$(J $BEE;R>pJsDL?.J,Ln$K4XO"$7$F$$$k$N$+(J $B!JC ZK!$,$I$l$/$i$$Bg@Z$+$K$+$+$C$F$/$k!%(J $B$^$?!$(J $B <+J, ZK!$,?H$KIU$$$F$$$J$$$+$i$G$"$k!%(J $B <1$H$7$F65$($J$1$l$P$J$i$J$$$3$H$O!$(J $B$=$l <+BN$G$O;j6KC1=c$J$3$H$,B?$$$+$i$@!%(J ZK!$r3X$V$N$KE,$7$?NcBj$,I,MW$J$N$@$,!$(J $B$=$l$r:n$j=P$9$N$O!$(J $B$^$5$KC4Ev6541$NNONL$K$+$+$C$F$$$k$N$G$"$k!%(J /0-$/$F$b!$(J $B@-G=$N$h$$%3%s%T%e! <$G$J$/$F$b!$(J $B:G6a$N%3%s%T%e!

75. Discrete Math & Logic Sequence 21201, Undergraduate Colloquium, 1. xx-xxx, discrete math/Logic, 9. xx-xxx, TechnicalElective, 9. xx-xxx, Elective, 9. 45. Senior Year Fall. xx-xxx, discrete math/Logic,9. http://www.math.cmu.edu/~rw1k/undergrad/dmlseq.htm

Discrete Mathematics and Logic Suggested course sequence Sophomore Year: Fall Units Fundamental Data Structures and Algorithms Undergraduate Colloquium Combinatorial Analysis Linear Algebra I Modern Biology xx-xxx Humanities Elective Spring Principles of Programming Undergraduate Colloquium xx-xxx Discrete Math/Logic xx-xxx Technical Elective xx-xxx Humanities Elective Junior Year: Fall Computer Science Elective Basic Logic Advanced Calculus I xx-xxx Humanities Elective xx-xxx Elective Spring Computer Science Elective Algebraic Structures Graph Theory xx-xxx Humanities Elective xx-xxx Elective Senior Year: Fall xx-xxx Discrete Math/Logic xx-xxx Technical Elective xx-xxx Humanities Elective xx-xxx Elective xx-xxx Elective Spring xx-xxx Discrete Math/Logic xx-xxx Technical Elective xx-xxx Technical Elective xx-xxx Humanities Elective xx-xxx Elective Discrete Mathematics and Logic (Three of the following): Set Theory Field Theory Number Theory Recursion and Hierarchies Any of the following graduate courses: Introduction to Set Theory Introduction to Model Theory 21-610 Algebra I Mathematical Logic II Computer Science electives : Any two courses at the 300 level or above. The following are specifically suggested:

76. 21-228: Discrete Math, Summer II 2000 Along the way we will meander through many of the topics typically presented inan introductory discrete math course as well as some that are overlooked by http://www.math.cmu.edu/~odp/DiscreteN00/

for a typical day in class. Discrete Mathematics, 21-228 Carnegie Mellon University Department of Mathematics Summer Session II, 2000 M-F 1:30-2:50pm Wean 6423 Final Exam due Th 8/10 by Schedule Exercises Practice problems Resources Eric Weisstein's World of Mathematics A huge hyperlinked dictionary of mathematics highly recommended Ian Stobert's Graph Theory site Includes many links to graph theory tutorials, notes, exercises, and open problems Instructor: Ojas Parekh E-mail: odp@cmu.edu Office: Physical Plant 342 (Exit Wean 1st Floor, cross the street, and take a left onto the sidewalk. Continue on sidewalk until patio area and follow "Math Dept." sign.) Office Phone: Home Phone: Office Hours: M-F 3-4pm and by appointment Prerequisites: The most important and only real prerequisite is (mathematical) curiousity. We can shape this to fill just about any other prerequisite. Exposure to a "ransition to modern math" course such as 15-127 or 21-127 is helpful but not absolutely necessary. Please contact me if you have any doubts about your qualifications. Course Description: The emphasis of this course will be on solving problems, and this is what we and you will spend a significant amount of time doing. Along the way we will meander through many of the topics typically presented in an introductory discrete math course as well as some that are overlooked by such a course. We will try to focus on problems that are easy to state, require creative application of course concepts, have elegant but not necessarily simple solutions, and most importantly, are fun to solve.

77. Discrete Math Group Page Department of Computer Science Florida State University. The discrete mathgroup deals mostly with number theory and modern algebra problems. http://websrv.cs.fsu.edu/~mascagni/research/dm.html

Group: DM Discrete Mathematics Department of Computer Science Florida State University The discrete math group deals mostly with number theory and modern algebra problems. The group's current focus is developing software that generates primitive polynomials over GF(2) of a Mersenne Prime degree. After this software has been fully optimized, we will use it to help us implement the Mersenne Twister psuedorandom number generator. GROUP MEETINGS Time: Wednesdays 8:00 AM Place: 486 Dirac Science Library MEMBERS Dr. Chi-Ok Hwang Chi-Ok's home page Shyam Lakshmin Jason Parker NAVIGATION Home PRNG Group Testing Group QRNG Group Discrete Group MCPDE Group QMC Group Finance Group PRINCIPLE INVESTIGATOR Prof. Michael Mascagni WEBMASTER Ethan Kromhout Project 6 Software Determining ith Primitive Polynomial Primitive polynomials are essential and basic in pseudo-random and quasi-random number generation. In this project of software developement determining i-th primitive polynomial, given a primitive polynomial of degree d, we find all the other primitive polynomials of degree d. Project 8 Finding Primitive Roots One problem necessary to our group's research is finding primitive roots of a prime p. We are mostly concerned with p being a Mersenne Prime, where p=2^k-1. A number a is a primitive root of an integer n if a is relatively prime to n and a is of order phi(n) modulo n. In the case where n is prime, phi(n) = n-1. For a to have order n-1, n-1 must be the smallest exponent j for which 2^j = 1 mod n. This happens if a^((n-1)/d)!=1 for every prime divisor d of n-1. The main obstacle in this process is finding all prime factor of n-1. If one only checks prime divisors below a certain bound, he has only some probablity of a being a primitive root of n-1. If one has found a primitive root a, a^i is also a primitive root for all i such that gcd(i,n-1)=1.

78. Algebra And Discrete Math Subfaculty Gao); Shannon Purvis (NJ Calkin); Virginia M. Rodrigues (S. Gao); JohnVillalpando (R. Laskar). Additional Algebra/discrete math Links. http://virtual.clemson.edu/groups/mathsci/graduate/algebra.html

Algebra and Discrete Mathematics The area of algebra and discrete mathematics encompasses both theoretical and applied aspects of mathematics that are foundational for matrix analysis, modern algebra, number theory, combinatorics, and graph theory. This area of study has a significant impact on applications arising in statistics (linear models, experimental designs), probability (random models), operations research (mathematical programming, network analysis), communication engineering (coding theory, cryptography), and computer science (analysis of algorithms, nonnumerical computing). Students interested in the underlying theory of algebraic and discrete structures will also gain insights into how these concepts are fundamental to a wide array of practical problems. Faculty J. V. Brawley N. J. Calkin S. Gao W. R. Hare, Jr. ... G. Matthews Curriculum Courses abstract algebra I abstract algebra II applicable algebra matrix analysis ... computational algebra II Sample Curricula - Sample Program for M.S. Concentration in Algebra FALL: 805, 810, 853

79. CMSC-203: Discrete Math (spring 2001) CMSC203 discrete math (spring 2001). Instructor. Millennium Math Problems - Earnmillions of dollars!! Some resources for research in discrete mathematics. http://www.csee.umbc.edu/~sherman/Courses/203/spring01/

CMSC-203: Discrete Math (spring 2001) Instructor Dr. Alan T. Sherman Email: sherman@umbc.edu (send only to this address and include "203" in the subject) Office Hours: Monday/Wednesday, 12:30-1pm, ECS 225j Tele: (410) 455-2666 Teaching Assistant Wen Ze Xi Email: wxi1@csee.umbc.edu tele: (410) 455-1631 Office Hours: Tuesday 12:00-1:00pm in ECS 334. Class Meetings Mondays and Wednesdays 2:00-3:15pm SS (Social Science) 209 Textbook Epp, Susan, Discrete Mathematics with Applications , Brooks/Cole (1995). [We will cover Chapters 5, 1-4, 7-8, 10, 6, in that order.] Maple and Latex Every student is required to learn how to use Maple , which is a software package for doing symbolic and numerical mathematics. It is available for free on all UMBC mainframes (type "xmaple" under unix). The UMBC Bookstore sells Mac and PC versions of Maple for the standard student discounted price of about $120). Maple is the modern "calculator," which can empower you to visualize and compute better than you can do alone. There is an on-line tutorial and help feature. I have selected Maple (rather than Macsyma, Matlab, Mathematica) because it is the UMBC standard. Although you are not required to do so, you may find it helpful also to learn how to use the document-preparation system

80. Math Lab discrete math Lab. When you visit the lab, you will be greeted and assistedby the discrete math Lab Tutor. Course Served MATH 222. http://www.bgsu.edu/offices/acen/mathlab/discrete.htm

Page 4     61-80 of 116    Back | 1  | 2  | 3  | 4  | 5  | 6  | Next 20