Главная    Ex Libris    Книги    Журналы    Статьи    Серии    Каталог    Wanted    Загрузка    ХудЛит    Справка    Поиск по индексам    Поиск    Форум   
blank
Авторизация

       
blank
Поиск по указателям

blank
blank
blank
Красота
blank
Benjamin A.T., Quinn J. — Proofs That Really Count The Art of Combinatorial Proof
Benjamin A.T., Quinn J. — Proofs That Really Count The Art of Combinatorial Proof

Читать книгу
бесплатно

Скачать книгу с нашего сайта нельзя

Обсудите книгу на научном форуме



Нашли опечатку?
Выделите ее мышкой и нажмите Ctrl+Enter


Название: Proofs That Really Count The Art of Combinatorial Proof

Авторы: Benjamin A.T., Quinn J.

Аннотация:

'This book is written in an engaging, conversational style, and this reviewer found it enjoyable to read through (besides learning a few new things). Along the way, there are a few surprises, like the 'world's fastest proof by induction' and a magic trick. As a resource for teaching, and a handy basic reference, it will be a great addition to the library of anyone who uses combinatorial identities in their work.' Society for Industrial and Applied Mathematics Review.


Язык: en

Рубрика: Математика/

Статус предметного указателя: Готов указатель с номерами страниц

ed2k: ed2k stats

Год издания: 2003

Количество страниц: 194

Добавлена в каталог: 10.04.2010

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID
blank
Предметный указатель
3-bonacci      41
Binary representation      76
Binet's formula      12 125 136
Binomial coefficient      4 63
Binomial theorem      67
Board, circular      17
Board, n-board      1
Bonferroni's inequality      84
Bracelet      17
Bracelet, colored      36
Bracelet, in-phase      17
Bracelet, n-bracelet      17
Bracelet, out-of-phase      17
Breakable      3
Cassini's identity      7
Catalan numbers      79
Circular n-board      17
Colored bracelet      36
Colored tiling      36
Companion sequence      36
composition      79
Condition      2
Continuants      57
Continued fraction      49
Continued fraction, finite      49
Continued fraction, infinite      54
Continued fraction, nonsimple      58
Convergent      54
CYCLE      92
Cycle, left      97
Cycle, right      97
deMoivre theorem      139
Diameter      22
Discriminant      37
Domino      1
Domino, staggered      8
Euclidean algorithm      11 119
Euler's theorem      116
Factorial      92
Factorial, falling      104
Factorial, rising      95
fault      7
Fault-free      8
Fermat's little theorem      115
Fibonacci numbers      1
Fibonacci polynomial      141
Fibonacci Society      13
Fibonacci, generalized      17
Fibonacci, generalized, 3-bonacci      41
Fibonacci, generalized, k-bonacci      43
Fibonacci, generalized, Tribonacci      41
Fibonomial coefficient      15
Finite continued fraction      49
Fixed point      114
Freshman, binomial theorem      121
Freshman, sum      31
GCD      11 118
Generalized 3-bonacci      42
Generating function      104
Geometric series      113
Gibonacci numbers      17
Gibonacci polynomials      142
Goalpost      42
Greatest common divisor      11 118
Harmonic number      91
Harmonic number, r-harmonic numbers      107
Height conditions      50
Ideal initial conditions      36
In-phase      17
Inclusion-exclusion      82
Infinite continued fraction      54
Initial conditions, ideal      36
k-bonacci numbers      43
Kronecker delta      84
Lagrange's theorem      118
Left cycle      97
Linear recurrence      35
Lucas numbers      17
Lucas polynomials      142
Lucas sequences, first kind      35
Lucas sequences, second kind      33
Lucas theorem      122
Lucas, Edouard      32
Magic trick      30
Mathemagics      30
Median      68
Median square      5
Mediant      31
Middlest square      126
Multichoose coefficient      63
Multinomial coefficient      43
Multisubset      70
n-board      1
n-bracelet      17
n-tiling      4
Nonsimle finite continued fraction      58
Orbit      114
Ordered partition      79
Out-of-phase      17
Partitions of integers      79
Partitions, ordered      79
Pascal's triangle      64 75
Path counting      79
Permutation      92
Permutation notation      92
Phased colored tiling      37
Phased restricted colored tiling      47
Phased tiling      23
Pisano, Leonardo      12
Polynomial, Fibonacci      141
Polynomial, Gibonacci      142
Polynomial, Lucas      142
Pythagorean triple      13
Recurrence, Fibonacci      1
Recurrence, Gibonacci      17
Recurrence, linear      36
Recurrence, linear, kth order      35 43
Recurrence, linear, second-order      38
Recurrence, linear, third-order      40
Restricted phased colored tiling      47
Right cycle      97
Rising factorial      95
Series, geometric      113
Set partition notation      103
Signed involution technique      89
Signed set principle      89
Simson's formula      7
Square      1
Square, median      5
Square, middlest      126
Square, stackable      50
Staggered formation      8
Stirling numbers, first kind      91 93
Stirling numbers, r-Stirling number      107
Stirling numbers, second kind      91 103
Symmetric difference      81
tail      7
Tail swap      7 27
Telescoping sum      114
Tiling, colored      36
Tiling, n-tiling      4
Tiling, phased      23
Tiling, phased colored      37
Tiling, restricted      47
Tiling, weighted tiling      44 59
Total weight      44
Totient function      116
Tribonacci numbers      41
Unbreakable      4
Vandermonde's identity      66
Weighted      44 59
Wilson's theorem      117
Zeckendorf's theorem      15
blank
Реклама
blank
blank
HR
@Mail.ru
       © Электронная библиотека попечительского совета мехмата МГУ, 2004-2019
Электронная библиотека мехмата МГУ | Valid HTML 4.01! | Valid CSS! О проекте