Exploring Discrete Mathematics with Maple PDF Download

Author: Kenneth H. Rosen
Publisher: McGraw-Hill Science, Engineering & Mathematics
ISBN: 9780070541283
Category : Computer science
Languages : en
Pages : 0

View

Book Description
This is the first supplement in discrete mathematics to concentrate on the computational aspects of the computer algebra system Maple. Detailed instructions for the use of Maple are included in an introductory chapter and in each subsequent chapter. Each chapter includes discussion of selected Computational and Exploration exercises in the corresponding chapter of Ken Rosen's text Discrete Math and It's Applications, Third Edition. New exercises and projects are included in each chapter to encourage further exploration of discrete mathematics using Maple. All of the Maple code in this supplement is available online via the Waterloo Maple Web site, in addition to new Maple routines that have been created which extend the current capabilities of Maple.

Author:
Publisher:
ISBN: 9780071155038
Category : Computer science
Languages : en
Pages : 391

View

Book Description

Author: R.J. Stroeker
Publisher: Birkhäuser
ISBN: 3034887264
Category : Computers
Languages : en
Pages : 240

View

Book Description
This unusual introduction to Maple shows readers how Maple or any other computer algebra system fits naturally into a mathematically oriented work environment. Designed for mathematicians, engineers, econometricians, and other scientists, this book shows how computer algebra can enhance their theoretical work. A CD-ROM contains all the Maple worksheets presented in the book.

Author: Frank Garvan
Publisher: CRC Press
ISBN: 1420035606
Category : Mathematics
Languages : en
Pages : 496

View

Book Description
Maple is a very powerful computer algebra system used by students, educators, mathematicians, statisticians, scientists, and engineers for doing numerical and symbolic computations. Greatly expanded and updated from the author's MAPLE V Primer, The MAPLE Book offers extensive coverage of the latest version of this outstanding software package, MAPLE 7.0 The MAPLE Book serves both as an introduction to Maple and as a reference. Organized according to level and subject area of mathematics, it first covers the basics of high school algebra and graphing, continues with calculus and differential equations then moves on to more advanced topics, such as linear algebra, vector calculus, complex analysis, special functions, group theory, number theory and combinatorics. The MAPLE Book includes a tutorial for learning the Maple programming language. Once readers have learned how to program, they will appreciate the real power of Maple. The convenient format and straightforward style of The MAPLE Book let users proceed at their own pace, practice with the examples, experiment with graphics, and learn new functions as they need them. All of the Maple commands used in the book are available on the Internet, as are links to various other files referred to in the book. Whatever your level of expertise, you'll want to keep The MAPLE Book next to your computer.

Author: Oscar Levin
Publisher: Createspace Independent Publishing Platform
ISBN: 9781724572639
Category :
Languages : en
Pages : 238

View

Book Description
Note: This is a custom edition of Levin's full Discrete Mathematics text, arranged specifically for use in a discrete math course for future elementary and middle school teachers. (It is NOT a new and updated edition of the main text.)This gentle introduction to discrete mathematics is written for first and second year math majors, especially those who intend to teach. The text began as a set of lecture notes for the discrete mathematics course at the University of Northern Colorado. This course serves both as an introduction to topics in discrete math and as the "introduction to proof" course for math majors. The course is usually taught with a large amount of student inquiry, and this text is written to help facilitate this.Four main topics are covered: counting, sequences, logic, and graph theory. Along the way proofs are introduced, including proofs by contradiction, proofs by induction, and combinatorial proofs.While there are many fine discrete math textbooks available, this text has the following advantages: - It is written to be used in an inquiry rich course.- It is written to be used in a course for future math teachers.- It is open source, with low cost print editions and free electronic editions.

Author: Victor Aladjev
Publisher: Fultus Corporation
ISBN: 1596820802
Category : Computers
Languages : en
Pages : 405

View

Book Description
The book consists of two parts. The first part consists of seven chapters and presents a new software for package Maple of releases 6-10. The tools represented in this chapters increase the range and efficiency of use of Maple on Windows platform. The basic attention is devoted to additional tools created in the process of practical use and testing the Maple of releases 4 - 10 which by some parameters extend essentially the opportunities of the package and facilitate the work with it.Whereas the algorithms of physical and engineering problems of the second part mainly use the finite element method (FEM). The part consists of eight chapters and solves in Maple environment the physical and engineering problems from such fields as: thermal conductivity, mechanics of deformable bodies, theory of elasticity, hydrodynamics, hydromechanics, etc. At last, application of Maple for solution of optimization problems is presented.

Author: Martha L. Abell
Publisher: Academic Press
ISBN: 9780120415601
Category : Differential equations
Languages : en
Pages : 740

View

Book Description
Through the use of numerous examples that illustrate how to solve important applications using Maple V, Release 2, this book provides readers with a solid, hands-on introduction to ordinary and partial differental equations. Includes complete coverage of constructing and numerically computing and approximating solutions to ordinary and partial equations.

Author: Darel W. Hardy
Publisher: CRC Press
ISBN: 1439894698
Category : Computers
Languages : en
Pages : 410

View

Book Description
Using mathematical tools from number theory and finite fields, Applied Algebra: Codes, Ciphers, and Discrete Algorithms, Second Edition presents practical methods for solving problems in data security and data integrity. It is designed for an applied algebra course for students who have had prior classes in abstract or linear algebra. While the con

Author: Silvia Heubach
Publisher: CRC Press
ISBN: 9781420072686
Category : Mathematics
Languages : en
Pages : 504

View

Book Description
A One-Stop Source of Known Results, a Bibliography of Papers on the Subject, and Novel Research Directions Focusing on a very active area of research in the last decade, Combinatorics of Compositions and Words provides an introduction to the methods used in the combinatorics of pattern avoidance and pattern enumeration in compositions and words. It also presents various tools and approaches that are applicable to other areas of enumerative combinatorics. After a historical perspective on research in the area, the text introduces techniques to solve recurrence relations, including iteration and generating functions. It then focuses on enumeration of basic statistics for compositions. The text goes on to present results on pattern avoidance for subword, subsequence, and generalized patterns in compositions and then applies these results to words. The authors also cover automata, the ECO method, generating trees, and asymptotic results via random compositions and complex analysis. Highlighting both established and new results, this book explores numerous tools for enumerating patterns in compositions and words. It includes a comprehensive bibliography and incorporates the use of the computer algebra systems MapleTM and Mathematica®, as well as C++ to perform computations.

Author: Eric Lehman
Publisher:
ISBN: 9789888407064
Category : Business & Economics
Languages : en
Pages : 988

View

Book Description
This book covers elementary discrete mathematics for computer science and engineering. It emphasizes mathematical definitions and proofs as well as applicable methods. Topics include formal logic notation, proof methods; induction, well-ordering; sets, relations; elementary graph theory; integer congruences; asymptotic notation and growth of functions; permutations and combinations, counting principles; discrete probability. Further selected topics may also be covered, such as recursive definition and structural induction; state machines and invariants; recurrences; generating functions.