AB

AB

book type
0 Review(s) 
LF/324060/R
English
In stock
грн157.50
грн141.75 Save 10%

  Instant download 

after payment (24/7)

  Wide range of formats 

(for all gadgets)

  Full book 

(including for Apple and Android)

In the area of combinatorial identities computers are able to find very elegant proofs of difficult theorems unassisted by human intervention. This autonomy means that not only is it possible to use a PC to find such a proof, but also the proof can be checked easily. This book shows how several recently developed computer algorithms can master the difficult job of simplifying complex summations and if there is no such simplification they will prove this to be the case. The authors present the underlying mathematical theory of these methods, the principle theorems and proofs, and include a package of computer programs that can do these tasks.
LF/324060/R

Data sheet

Name of the Author
Petkovsek M.
et al.
Language
English
Release date
1996

Reviews

Write your review

AB

In the area of combinatorial identities computers are able to find very elegant proofs of difficult theorems unassisted by human intervention. This autonomy ...

Write your review

15 books by the same author:

Products from this category: