Qualification > Math

IGCSE MATHS Doubts

<< < (142/240) > >>

Falken_07:
Hi, I'm new here and I'm taking IGCSE for maths (and other subject) this examination session (May/June 2010)

I have a question about finding 2 by 2 matrix for transformation

Though I'm already taught how to solve it, I think it is too long and is not worth the usual 2-3 mark given for it. So anyway, here is a summary on how the solution work:
Take the 2 coordinate of the object and their respective image
ie    object--> ( 1,5 )  image--> ( -5,-1 )
      object--> ( 1,2 )  image--> ( -2,-1 )
then use formula : matrix * object = image
(a  b) * ( 1 ) = ( -5)
(c  d)    ( 5 )    ( -1)

( a+5b ) = ( -5 )
( c+5d ) = ( -1 )
and do the same for the other coordinate and finally use simultaneous equation to solve a, b, c and d

As you can see, it is quite a long procedure and I'm wondering if there is any simpler method to solve the question

Thanks in advance  :)

Vin:

first of all welcome to SF !! hope u hav good time here ..

and even i use tht method .. though its quite lengthy but if u have understood it .. stick to it !! this method is really good and thers no way u may go wrong .. ;)

Falken_07:

--- Quote from: ~VIN1094~ on May 15, 2010, 07:24:06 am ---first of all welcome to SF !! hope u hav good time here ..

and even i use tht method .. though its quite lengthy but if u have understood it .. stick to it !! this method is really good and thers no way u may go wrong .. ;)

--- End quote ---

ok, thank you very much for the help  :)

Vin:

always feel free to ask anytime !! By the way wat other subjects do u take ??

$H00t!N& $t@r:
actually you dont have to do the long method if you know what the tranformation is. For example, if you know that the object has been reflected and where (whether it has been reflected in the x-axis or the y-axis) you can just write the matrix for it. Or do you not know the the matrices for tranformation?? cz its really easy if you know the matrices for each of them.

Navigation

[0] Message Index

[#] Next page

[*] Previous page

Go to full version