0
Lots of places. In engineering, anything that involves approximating behaviors using Taylor expansions, for example. In business, compound interest and rate of return calculations are two areas that require knowledge of polynomials. I assume you are asking this because you are studying them in school and are having trouble seeing why they are relevant. In part, the study of algebra teaches you to think in certain analytical ways that become very valuable even if you don't use all of the specific techniques you've learned. After all, no one pays to hear a musician practice scales, but the skills they learn in doing that practice are part of the foundation for their actual performance. And if you do end up in a business that requires a lot of math, as I did, those skills - and a lot more - come up all the time. So yeah, math matters!
Still curious? Ask our experts.
Chat with our AI personalities
Blake
Professor
CoachAdd your answer:
Earn +20 pts
How do civil engineers use radical expressions?
lick my sac
Can you use Perl regular expressions in PHP?
Yes, by using the preg_match() function
How linked list can be used for the polynomial manipulation?
Header linked list are frequently used for maintaining polynomials in memory. The header node plays an important part in this representation, since it is needed to represent the zero polynomial. This representation of polynomial will be presented in the context of a specific
What is The statements written by the programmer?
In languages that use a C-style syntax (e.g., C, C++ and Java) all code is written using expressions. Expressions may be combined to produce more complex expressions, however an expression or group of expressions only becomes a statement when terminated by a semi-colon. A group of statements enclosed by braces {} is known as a compound statement or code block.
Why do compilers convert infix expressions to postfix?
people almost exclusively use infix notation to write mathematical expressions, computer languages almost exclusively allow programmers to use infix notation. However, if a compiler allowed infix expressions into the binary code used in the compiled version of a program, the resulting code would be larger than needed and very inefficient. Because of this, compilers convert infix expressions into postfix notation expressions, which have a much simpler set of rules for expression evaluation. Postfix notation gets its name from the fact that operators in a postfix expression follow the operands that they specify an operation on. Here are some examples of equivalent infix and postfix expressions Infix Notation Postfix Notation 2 + 3 2 3 + 2 + 3 * 6 3 6 * 2 + (2 + 3) * 6 2 3 + 6 * A / (B * C) + D * E - A - C A B C * / D E * + A C * - Where as infix notation expressions need a long list or rules for evaluation, postfix expressions need very few.
