Dr. Rosen received his B.S. in Mathematics from the University of Michigan, Ann Arbor

(1972), and his Ph.D. in Mathematics from M.LT. (1976).

Dr. Rosen has published numerous articles in professional journals in the areas of number theory and mathematical modeling. He is the author of the textbooks Elementary Number Theory and Its Applications, published by Addison-Wesley and currently in its fifth edition, and Discrete Mathematics and Its Applications

Kenneth H. Rosen is the author of books: Discrete Mathematics and Its Applications, Student Solutions Guide For Discrete Mathematics And Its Applications, Elementary Number Theory and Its Applications, UNIX: The Complete Reference, Handbook of Discrete and Combinatorial Mathematics, UNIX System V release 4 : an introduction for new and experienced users, Mc Graw Hill: Instructor's Resource Guide For Discrete Mathematics And Its Applications 5th Edition, Introducing Game Theory and Its Applications, Open Computing's Best UNIX Tips Ever, Exploring Discrete Mathematics with Maple

#

Title

Description

01

Discrete Mathematics and its Applications is a focused introduction to the primary themes in a discrete mathematics course, as introduced through extensive applications, expansive discussion, and detailed exercise sets. These themes include mathematical reasoning, combinatorial analysis, discrete structures, algorithmic thinking, and enhanced problem-solving skills through modeling. Its intent is to demonstrate the relevance and practicality of discrete mathematics to all students. The Fifth Edition includes a more thorough and linear presentation of logic, proof types and proof writing, and mathematical reasoning. This enhanced coverage will provide students with a solid understanding of the material as it relates to their immediate field of study and other relevant subjects. The inclusion of applications and examples to key topics has been significantly addressed to add clarity to every subject. True to the Fourth Edition, the text-specific web site supplements the subject matter in meaningful ways, offering additional material for students and instructors. Discrete math is an active subject with new discoveries made every year. The continual growth and updates to the web site reflect the active nature of the topics being discussed. The book is appropriate for a one- or two-term introductory discrete mathematics course to be taken by students in a wide variety of majors, including computer science, mathematics, and engineering. College Algebra is the only explicit prerequisite.

03

The fourth edition of Kenneth Rosen's widely used and successful text, Elementary Number Theory and Its Applications, preserves the strengths of the previous editions, while enhancing the book's flexibility and depth of content coverage.The blending of classical theory with modern applications is a hallmark feature of the text. The Fourth Edition builds on this strength with new examples, additional applications and increased cryptology coverage. Up-to-date information on the latest discoveries is included.Elementary Number Theory and Its Applications provides a diverse group of exercises, including basic exercises designed to help students develop skills, challenging exercises and computer projects. In addition to years of use and professor feedback, the fourth edition of this text has been thoroughly accuracy checked to ensure the quality of the mathematical content and the exercises.

04

A handbook on the UNIX operating system. It contains discussion of UNIX/NT integration, along with material showing readers how UNIX fits in with today's real world of multiple operating systems and client-server architecture.

05

The importance of discrete mathematics has increased dramatically within the last few years but until now, it has been difficult-if not impossible-to find a single reference book that effectively covers the subject. To fill that void, The Handbook of Discrete and Combinatorial Mathematics presents a comprehensive collection of ready reference material for all of the important areas of discrete mathematics, including those essential to its applications in computer science and engineering. Its topics include:

Logic and foundations

Counting

Number theory

Abstract and linear algebra

Probability

Graph theory

Networks and optimization

Cryptography and coding

Combinatorial designs

The author presents the material in a simple, uniform way, and emphasizes what is useful and practical. For easy reference, he incorporates into the text:

Many glossaries of important terms

Lists of important theorems and formulas

Numerous examples that illustrate terms and concepts

Helpful descriptions of algorithms

Summary tables

Citations of Web pages that supplement the text

If you have ever had to find information from discrete mathematics in your work-or just out of curiosity-you probably had to search through a variety of books to find it. Never again. The Handbook of Discrete Mathematics is now available and has virtually everything you need-everything important to both theory and practice.

Logic and foundations

Counting

Number theory

Abstract and linear algebra

Probability

Graph theory

Networks and optimization

Cryptography and coding

Combinatorial designs

The author presents the material in a simple, uniform way, and emphasizes what is useful and practical. For easy reference, he incorporates into the text:

Many glossaries of important terms

Lists of important theorems and formulas

Numerous examples that illustrate terms and concepts

Helpful descriptions of algorithms

Summary tables

Citations of Web pages that supplement the text

If you have ever had to find information from discrete mathematics in your work-or just out of curiosity-you probably had to search through a variety of books to find it. Never again. The Handbook of Discrete Mathematics is now available and has virtually everything you need-everything important to both theory and practice.

06

An informative introductory text to the UNIX operating system. The book givesusers a solid background in UNIX basics before covering the many new featuresand functions included in AT&T's latest UNIX release.

07

08

The mathematical study of games is an intriguing endeavor with implications and applications that reach far beyond tic-tac-toe, chess, and poker to economics, business, and even biology and politics. Most texts on the subject, however, are written at the graduate level for those with strong mathematics, economics, or business backgrounds.

In a clear and refreshing departure from this trend, Introducing Game Theory and its Applications presents an easy-to-read introduction to the basic ideas and techniques of game theory. After a brief introduction, the author begins with a chapter devoted to combinatorial games--a topic neglected or treated minimally in most other texts. The focus then shifts to two-person zero-sum games and their solution. Here the author presents the simplex method, based on linear programming, for solving these games and develops within his presentation the required background in linear programming. The final chapter presents some of the fundamental ideas and tools of non-zero-sum games and games with more than two players, including an introduction to cooperative game theory.

This book will not only satisfy the curiosity of those whose interest in the subject was piqued by the 1994 Nobel Prize awarded to Harsanyi, Nash, and Selten. It also prepares its readers for more advanced study of game theory's applications in economics, business, and the physical, biological, and social sciences.

In a clear and refreshing departure from this trend, Introducing Game Theory and its Applications presents an easy-to-read introduction to the basic ideas and techniques of game theory. After a brief introduction, the author begins with a chapter devoted to combinatorial games--a topic neglected or treated minimally in most other texts. The focus then shifts to two-person zero-sum games and their solution. Here the author presents the simplex method, based on linear programming, for solving these games and develops within his presentation the required background in linear programming. The final chapter presents some of the fundamental ideas and tools of non-zero-sum games and games with more than two players, including an introduction to cooperative game theory.

This book will not only satisfy the curiosity of those whose interest in the subject was piqued by the 1994 Nobel Prize awarded to Harsanyi, Nash, and Selten. It also prepares its readers for more advanced study of game theory's applications in economics, business, and the physical, biological, and social sciences.

09

From shell shortcuts and mail tricks to password aging strategies and crisis control, here's a reference bible for everything UNIX users always wanted to do with UNIX but were too busy to figure out for themselves. UNIX novices and veterans alike will savor Open Computing's tips dealing exclusively with UNIX.

10

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.