Jon Pierre Fortney

Calculus for Business and Economics: An Example-Based Introduction is designed for first-year university students specializing in business and economics. This book is crafted in a clear, easy-to-read style, covering all the essential calculus-related topics that students are likely to encounter in their studies. With real-world business and economics applications seamlessly integrated around the core calculus concepts, students will find the book of real practical value throughout their time in university and beyond. Features Three hundred easy-to-follow examples throughout, carefully crafted to illustrate the concepts and ideas discussed. Numerous exercises to practice, with solutions available online to help you learn at your own pace. Each chapter concludes with a section showcasing the real-world business and economics applications of the discussed mathematical concepts.

Calculus for Business and Economics: An Example-Based Introduction is designed for first-year university students specializing in business and economics. This book is crafted in a clear, easy-to-read style, covering all the essential calculus-related topics that students are likely to encounter in their studies. With real-world business and economics applications seamlessly integrated around the core calculus concepts, students will find the book of real practical value throughout their time in university and beyond. Features Three hundred easy-to-follow examples throughout, carefully crafted to illustrate the concepts and ideas discussed. Numerous exercises to practice, with solutions available online to help you learn at your own pace. Each chapter concludes with a section showcasing the real-world business and economics applications of the discussed mathematical concepts.

Discrete Mathematics for Computer Science: An Example-Based Introduction is intended for a first- or second-year discrete mathematics course for computer science majors. It covers many important mathematical topics essential for future computer science majors, such as algorithms, number representations, logic, set theory, Boolean algebra, functions, combinatorics, algorithmic complexity, graphs, and trees. Features Designed to be especially useful for courses at the community-college level Ideal as a first- or second-year textbook for computer science majors, or as a general introduction to discrete mathematics Written to be accessible to those with a limited mathematics background, and to aid with the transition to abstract thinking Filled with over 200 worked examples, boxed for easy reference, and over 200 practice problems with answers Contains approximately 40 simple algorithms to aid students in becoming proficient with algorithm control structures and pseudocode Includes an appendix on basic circuit design which provides a real-world motivational example for computer science majors by drawing on multiple topics covered in the book to design a circuit that adds two eight-digit binary numbersJon Pierre Fortney graduated from the University of Pennsylvania in 1996 with a BA in Mathematics and Actuarial Science and a BSE in Chemical Engineering. Prior to returning to graduate school, he worked as both an environmental engineer and as an actuarial analyst. He graduated from Arizona State University in 2008 with a PhD in Mathematics, specializing in Geometric Mechanics. Since 2012, he has worked at Zayed University in Dubai. This is his second mathematics textbook.

Discrete Mathematics for Computer Science: An Example-Based Introduction is intended for a first- or second-year discrete mathematics course for computer science majors. It covers many important mathematical topics essential for future computer science majors, such as algorithms, number representations, logic, set theory, Boolean algebra, functions, combinatorics, algorithmic complexity, graphs, and trees. Features Designed to be especially useful for courses at the community-college level Ideal as a first- or second-year textbook for computer science majors, or as a general introduction to discrete mathematics Written to be accessible to those with a limited mathematics background, and to aid with the transition to abstract thinking Filled with over 200 worked examples, boxed for easy reference, and over 200 practice problems with answers Contains approximately 40 simple algorithms to aid students in becoming proficient with algorithm control structures and pseudocode Includes an appendix on basic circuit design which provides a real-world motivational example for computer science majors by drawing on multiple topics covered in the book to design a circuit that adds two eight-digit binary numbersJon Pierre Fortney graduated from the University of Pennsylvania in 1996 with a BA in Mathematics and Actuarial Science and a BSE in Chemical Engineering. Prior to returning to graduate school, he worked as both an environmental engineer and as an actuarial analyst. He graduated from Arizona State University in 2008 with a PhD in Mathematics, specializing in Geometric Mechanics. Since 2012, he has worked at Zayed University in Dubai. This is his second mathematics textbook.

This book explains and helps readers to develop geometric intuition as it relates to differential forms. It includes over 250 figures to aid understanding and enable readers to visualize the concepts being discussed. The author gradually builds up to the basic ideas and concepts so that definitions, when made, do not appear out of nowhere, and both the importance and role that theorems play is evident as or before they are presented. With a clear writing style and easy-to- understand motivations for each topic, this book is primarily aimed at second- or third-year undergraduate math and physics students with a basic knowledge of vector calculus and linear algebra.