edited by
500 views
1 votes
1 votes
Let $a,b,c$ and $d$ be real number such that $a+b=c+d$ and $ab=cd$. Prove that $a^{n}+b^{n}=c^{n}+d^{n}$ for all positive integer $n$.
edited by

1 Answer

Best answer
4 votes
4 votes

Statement $P(n) : a^n +b^n = c^n +d^n $

here we have to prove $P(n)$ is true for all $n \in N$

So, $P(1) : a+b = c+d$

hence $P(1)$ is true (given in the question)

Now, assume  $P(m) : a^m +b^m = c^m + d^m $ is true for all $m \leq k$ for some $m,n \in N$.................. (1)

Now, with the help of the assumption (1)  we have to prove $a^{k+1} + b^{k+1}= c^{k+1} + d^{k+1}$

Now, 

        $(a^k + b^k) (a+b) = (c^k +d^k) \ (c+d)$  ( since we have assumed in $1$ that $a^m +b^m = c^m+d^m$ for all $m \leq k$ )

$\Rightarrow$     $a^{k+1} + ab^k + a^k b + b^{k+1} = c^{k+1} + cd^k + c^k d + d^{k+1}$

$\Rightarrow$     $a^{k+1}+ b^{k+1} +ab( b^{k-1} + a^{k-1}) = c^{k+1} + d^{k+1} + cd(d^{k-1} + c^{k-1})$

$\Rightarrow$     $a^{k+1}+ b^{k+1} = c^{k+1} +d^{k+1}$  ( Here $ab = cd$ (given) and $(a^{k-1} + b^{k-1}) = (c^{k-1} +d^{k-1})$ (from assumption (1))

So, $P(n)$ is true for all $n \in N$

edited by

Related questions

0 votes
0 votes
1 answer
1
Aakanchha asked May 3, 2018
675 views
Let R(A, B, C) be a relation with primary key (A) and S(A, D, E) a relation with primary key (A, D). Each of the relations has n tuples. If the number of tuples in R natu...
0 votes
0 votes
1 answer
3
MiNiPanda asked May 9, 2018
600 views
Let R(A,B,C) be a relation with primary key (A) and S(A,D,E) a relation with primary key (A,D). Each of the relations has n tuples. If the number of tuples in R natural j...
1 votes
1 votes
1 answer
4
Debasmita Bhoumik asked May 12, 2018
382 views
Consider the Boolean function F(x1, x2, . . . , x10) realised by the following combinational circuit.Determine the number of input combinations for which the output funct...