Let A = [ 2 0 3 1 ] . If A 2 0 − 2 A 1 9 + A = [ 2 0 b 0 ] , find the value of b .
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Nice problem and solution.. @Saail Narvekar ....... I did a bit different .. I found A , A 2 , A 3 and then it was easy to sense a pattern:-
A n = ( 2 n 0 3 ( 2 n − 1 ) 1 )
And then the answer follows..
Nice problem and solution. @Saail Narvekar
You can further improve your problem and solution by adding latex and text instead of just an image. You can find the latex guide here . Thanks!
Log in to reply
Thanks for the suggestion @Sandeep Bhardwaj .As this was the 1 st time posting questions in brilliant i had no idea about latex guide.
Log in to reply
Ping me anytime if you need any kind of assistance. :-)
Log in to reply
@Sandeep Bhardwaj – hey @Sandeep Bhardwaj the latex code we write in publish box is the original form not visible after preview ??
Let
I
=
[
1
0
0
1
]
,
B
=
[
1
0
3
0
]
These little properties allow us to find
A
n
easily:
A
=
I
+
B
,
I
B
=
B
I
=
B
and
B
n
=
B
for positive integers
n
.
A
n
=
(
I
+
B
)
n
=
i
=
0
∑
n
C
i
n
I
i
B
n
−
i
(usually this is not true, but this time it is, becuase
I
B
=
B
I
)
=
I
+
i
=
1
∑
n
C
i
n
I
i
B
n
−
i
=
I
+
i
=
1
∑
n
C
i
n
B
(
I
is identity,
B
is an idempotent element)
=
I
+
(
2
n
−
1
)
B
=
[
2
n
0
3
×
2
n
−
3
1
]
b
=
(
3
×
2
2
0
−
3
)
−
2
(
3
×
2
1
9
−
3
)
+
3
=
6
Let A = [ 2 0 3 1 ] = [ 1 0 0 1 ] + [ 1 0 3 0 ] = I + B , where B = [ 1 0 3 0 ] . We note that B 2 = [ 1 0 3 0 ] [ 1 0 3 0 ] = [ 1 0 3 0 ] = B ⟹ B n = B , where n ∈ N . Therefore,
A n = ( I + B ) n = I + ( 1 n ) B + ( 2 n ) B 2 + ( 3 n ) B 3 + ⋯ + ( n n ) B n = I + k = 1 ∑ n ( k n ) B k = I + k = 0 ∑ n ( k n ) B − B = I + 2 n B − B = I + ( 2 n − 1 ) B Note that B k = B By binomial theorem
Then we have:
X = A 2 0 − 2 A 1 9 + A = I + ( 2 2 0 − 1 ) B − 2 ( I + ( 2 1 9 − 1 ) B ) + I + B = 2 2 0 B − B − 2 2 0 B + 2 B + B = 2 B = [ 2 0 6 0 ]
Therefore, b = 6 .
We can establish a recurrence A ( n + 1 ) = [ 2 T 1 1 ( n ) 0 2 T 1 2 ( n ) + 3 1 ]
Where A ( 1 ) = [ 2 0 3 1 ] , A ( 2 ) = [ 4 0 9 1 ] , A ( 3 ) = [ 8 0 2 1 1 ] , A ( 4 ) = [ 1 6 0 4 5 1 ] , ⋯
Thus, you can view the above equation as,
A 2 0 − 2 A 1 9 + A = [ T 1 1 ( n + 1 ) − 2 T 1 1 ( n ) + 2 0 2 T 1 2 ( n + 1 ) − 2 T 1 2 ( n ) + 3 1 − 2 + 1 ] = [ 2 0 b 0 ]
We can see that A 2 1 a n d A 2 2 are pretty obvious.
A 1 1 = T 1 1 ( n + 1 ) − 2 T 1 1 ( n ) + 2 = 2 T 1 1 ( n ) − 2 T 1 1 ( n ) + 2 = 2 and,
A 1 2 = T 1 2 ( n + 1 ) − 2 T 1 2 ( n ) + 3 = 2 T 1 2 ( n ) + 3 − 2 T 1 2 ( n ) + 3 = 6
Thus, b = 6 .
It's actually not necessary to calculate A 1 9 . Instead, assume that
A 1 9 = [ p r q s ]
Then we can write out
[ 0 0 3 − 1 ] [ p r q s ] = [ 0 0 b − 3 − 1 ]
Therefore
{ 3 s − s = b − 3 = − 1 ⇒ b = 6
Problem Loading...
Note Loading...
Set Loading...