Diskret matematik
Se alle bogdetaljer →
A = B
Udgivet af Taylor & Francis Ltd
ISBN
9780367448714
Om denne bog
This book is of interest to mathematicians and computer scientists working in finite mathematics and combinatorics. It presents a breakthrough method for analyzing complex summations. Beautifully written, the book contains practical applications as well as conceptual developments that will have applications in other ar…
Boghandelspriser
| Boghandel | Titel | Format | ISBN | Pris | Lagerstatus | Levering | |
|---|---|---|---|---|---|---|---|
Ingen boghandelstilbud endnuVi har titlen i kataloget. Priser vises her, når boghandlere lister den. |
|||||||
5
0
4
0
3
0
2
0
1
0
0%
Anbefaler
0
Verificeret
Ingen anmeldelser endnu
Bogdetaljer
Forfatter
Marko Petkovsek, Doron Zeilberger, Herbert S Wilf
Forlag
Taylor & Francis Ltd
Kategori
Diskret matematik
ISBN-13
9780367448714
EAN
9780367448714
Format
Hæftet
Sprog
Engelsk
sider
230
Produktbeskrivelse
This book is of interest to mathematicians and computer scientists working in finite mathematics and combinatorics. It presents a breakthrough method for analyzing complex summations. Beautifully written, the book contains practical applications as well as conceptual developments that will have applications in other areas of mathematics.From the table of contents: * Proof Machines * Tightening the Target * The Hypergeometric Database * The Five Basic Algorithms: Sister Celine''s Method, Gosper&''s Algorithm, Zeilberger''s Algorithm, The WZ Phenomenon, Algorithm Hyper * Epilogue: An Operator Algebra Viewpoint * The WWW Sites and the Software (Maple and Mathematica) Each chapter contains an introduction to the subject and ends with a set of exercises.
Prishistorik
Indlæser prishistorik...