search
Log In
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
0 votes
365 views

The $n^{th}$ order difference of a polynomial of degree $n$ is

  1. zero
  2. one
  3. some constant
  4. undefined

Please explain the solution.

in Set Theory & Algebra
edited by
365 views

1 Answer

1 vote
 
Best answer

Answer is C, i.e. Some Constant

First Order Difference is nothing but First order derivative. Similarly, nth order difference means nth  order Derivative. 

Take polynomial f(x) of Order n : 
poly

(Where ais any Real Number and  ais NOT equal to Zero.) 

First Order Difference will be : $f'(x) = a_{0}\,n\, x^{n-1} + a_1 (n-1)\, x^{n-2} + \cdot \cdot \cdot \cdot +\,\, a_{n-1}$    i.e. a polynomial of (n-1) degree.

Similarly, You can see that Second Order difference (or Derivative) will be a Polynomial of (n-2) degree. And So on, The 

$n^{th}$ degree polynomial would just be a "Zero Degree" Polynomial which is : 
10d

Which is Some Constant. 

We can note the following :

  1. The nth difference, Δn,   is n! a0
  2. The n+1 difference, Δn+1, and higher differences, are all  zero.

Note That : 

Zero Degree Polynomial : $f(x) = a_0\,x^{0} = a_0$  (Where $a_0$ is any Real Number and can even be Zero) 

One Degree Polynomial : $f(x) = a_0\,x^{1} + a_1 = a_0 \,x + a_1$  (Where $a_i$ is any Real Number and $a_0$ Can NOT be Zero)

and So on.


selected by

Related questions

0 votes
0 answers
1
597 views
A byte addressable computer has a memory capacity of 2^m kbytes and can perform 2^n operations. An instruction involving 3 operands and one operator needs a maximum of - (a) 3m bits (b) 3m+n bits (c) m+n bits (d) none of the above. Please provide a detailed explanation ...
asked Apr 10, 2018 in CO and Architecture DEEPAK PANDEY 1 597 views
4 votes
1 answer
2
1.5k views
Memory Protection is of no use in a) single user systems b) non multiprogrammed systems c) non multitasking systems d) none of the above
asked Aug 23, 2016 in Operating System Sankaranarayanan P.N 1.5k views
1 vote
2 answers
3
3.7k views
Has anybody tried this book?Is this book good to practice for gate and psus especially psus?
asked May 22, 2016 in Others jenny101 3.7k views
0 votes
4 answers
4
305 views
A sorting technique that guarantees that records with same primary key in the same order in the sorted list as in the original unsorted list is said to be....
asked Sep 22, 2019 in DS Nukku 305 views
...