Polynomial: Difference between revisions
Jump to navigation
Jump to search
(Created page with "A '''polynomial''' is any function which obtains its result solely by some combination of: multiplying its inputs together, adding them together, or rescaling them. == Examples == The volume of a cube is a polynomial in its side length. Every linear transformation is uniquely associated to a polynomial called its characteristic polynomial. A computer program consisting of some number of <code>for</code> loops (and no recursion or <code>goto</code>...") |
mNo edit summary |
||
| Line 7: | Line 7: | ||
A computer program consisting of some number of <code>for</code> loops (and no recursion or <code>goto</code>s or other loops), where each <code>for</code> loop runs exactly <math>n</math> times, will take a number of steps to run which is given by some polynomial in <math>n</math>. In fact, any polynomial at all can be realized in this way. | A computer program consisting of some number of <code>for</code> loops (and no recursion or <code>goto</code>s or other loops), where each <code>for</code> loop runs exactly <math>n</math> times, will take a number of steps to run which is given by some polynomial in <math>n</math>. In fact, any polynomial at all can be realized in this way. | ||
Generating functions in combinatorics. | |||
Revision as of 03:25, 16 April 2024
A polynomial is any function which obtains its result solely by some combination of: multiplying its inputs together, adding them together, or rescaling them.
Examples
The volume of a cube is a polynomial in its side length.
Every linear transformation is uniquely associated to a polynomial called its characteristic polynomial.
A computer program consisting of some number of for loops (and no recursion or gotos or other loops), where each for loop runs exactly times, will take a number of steps to run which is given by some polynomial in . In fact, any polynomial at all can be realized in this way.
Generating functions in combinatorics.