341
Hari Shankar
·2010-08-29 06:52:26
1) Repeated use of the recursion yields x_{n+5}=x_n
Since 2011 is of the form 5k+1, we have x_{2011}=x_1
1
sri 3
·2010-08-29 08:35:16
Is there any shortcut for problem 1 ??
Thnx 4 the answer sir...
And can sum1 try prob 2....
1
sri 3
·2010-09-01 10:44:55
Can some1 plz do sum 2...
71
Vivek @ Born this Way
·2010-09-06 06:13:23
Why it seems to me that second one can be solved.. though not in first try!!
1
Abhisek
·2010-09-18 11:54:09
(log2x)4 ≥0 (as it has a power of 4)
or, log2x ≥ 0
or, x ≥ 20
or, x ≥ 1....
from this expression we can deduce that Option.2 MAY BE correct....
By the way, in the LHS, is it
log2x2x . (log2x)2
OR
log2x[2x(log2x)2 ]
I mean, is the 2x(log2x)2 part inside the log2x operator ?
1
sri 3
·2010-09-19 02:02:40
Yeah...The eq. is
log2x[2x] * (log2x)2 + (log2x)4 = 1
1
Avinav Prakash
·2010-09-19 02:10:27
for 2..if i ve perceivd the operators corrctly then by observation
for x=2 the eqn is satisfied
1
Abhisek
·2010-09-24 10:38:36
Well we have that 2 is the root.....so option (b) then ?