Logo
Unionpedia
Communication
Get it on Google Play
New! Download Unionpedia on your Android™ device!
Free
Faster access than browser!
 

Concrete Mathematics and Generating function

Shortcuts: Differences, Similarities, Jaccard Similarity Coefficient, References.

Difference between Concrete Mathematics and Generating function

Concrete Mathematics vs. Generating function

Concrete Mathematics: A Foundation for Computer Science, by Ronald Graham, Donald Knuth, and Oren Patashnik, first published in 1989, is a textbook that is widely used in computer-science departments as a substantive but light-hearted treatment of the analysis of algorithms. In mathematics, a generating function is a way of encoding an infinite sequence of numbers (an) by treating them as the coefficients of a power series.

Similarities between Concrete Mathematics and Generating function

Concrete Mathematics and Generating function have 7 things in common (in Unionpedia): Binomial coefficient, Donald Knuth, Mathematics, Number theory, Recurrence relation, Sequence, The Art of Computer Programming.

Binomial coefficient

In mathematics, any of the positive integers that occurs as a coefficient in the binomial theorem is a binomial coefficient.

Binomial coefficient and Concrete Mathematics · Binomial coefficient and Generating function · See more »

Donald Knuth

Donald Ervin Knuth (born January 10, 1938) is an American computer scientist, mathematician, and professor emeritus at Stanford University.

Concrete Mathematics and Donald Knuth · Donald Knuth and Generating function · See more »

Mathematics

Mathematics (from Greek μάθημα máthēma, "knowledge, study, learning") is the study of such topics as quantity, structure, space, and change.

Concrete Mathematics and Mathematics · Generating function and Mathematics · See more »

Number theory

Number theory, or in older usage arithmetic, is a branch of pure mathematics devoted primarily to the study of the integers.

Concrete Mathematics and Number theory · Generating function and Number theory · See more »

Recurrence relation

In mathematics, a recurrence relation is an equation that recursively defines a sequence or multidimensional array of values, once one or more initial terms are given: each further term of the sequence or array is defined as a function of the preceding terms.

Concrete Mathematics and Recurrence relation · Generating function and Recurrence relation · See more »

Sequence

In mathematics, a sequence is an enumerated collection of objects in which repetitions are allowed.

Concrete Mathematics and Sequence · Generating function and Sequence · See more »

The Art of Computer Programming

The Art of Computer Programming (sometimes known by its initials TAOCP) is a comprehensive monograph written by Donald Knuth that covers many kinds of programming algorithms and their analysis.

Concrete Mathematics and The Art of Computer Programming · Generating function and The Art of Computer Programming · See more »

The list above answers the following questions

Concrete Mathematics and Generating function Comparison

Concrete Mathematics has 30 relations, while Generating function has 122. As they have in common 7, the Jaccard index is 4.61% = 7 / (30 + 122).

References

This article shows the relationship between Concrete Mathematics and Generating function. To access each article from which the information was extracted, please visit:

Hey! We are on Facebook now! »