[理工] [線代] 線性映射

看板Grad-ProbAsk作者 (Up2u)時間14年前 (2012/02/02 22:09), 編輯推噓4(404)
留言8則, 5人參與, 最新討論串6/6 (看更多)
E={u1,u2,u3} , F= {b1,b2} u1=(1,0,-1)^t u2=(1,2,1)^t u3=(-1,1,1)^t b1=(1,-1)^t b2=(2,-1)^t L(X)=(X1+X2,X1-X3)^t from R3 to R2 find representing L with respect to the order base E and F 可以這樣解嗎 [1 2]^-1 [1 1 0] [ 1 1 1] [-1 -1] [1 0 -1] [ 0 2 1] [-1 1 1] -- When we toss a coin , we obtain either head or tail. Now we toss a coin 5 times. There are 2^5 possible outcomes. How many of them contain no two consecutive heads? -- ※ 發信站: 批踢踢實業坊(ptt.cc) ◆ From: 59.105.81.56

02/02 22:23, , 1F
不是本來就這樣解嗎@@
02/02 22:23, 1F

02/02 22:29, , 2F
yes
02/02 22:29, 2F

02/02 22:32, , 3F
我怎麼解出來答案不對QQ
02/02 22:32, 3F

02/02 22:35, , 4F
ok吧 矩陣最後一個元素是-1 是你打錯嗎 還是抄錯
02/02 22:35, 4F
抄錯了,難怪都算錯 [1 2]^-1 [1 1 0] [ 1 1 -1] [-1 -1] [1 0 -1] [ 0 2 1] [-1 1 1] [-5 -3 4] [ 3 3 -2] ※ 編輯: bjk 來自: 59.105.81.56 (02/02 22:44)

02/02 22:44, , 5F
有人有算嗎,這樣對嗎?
02/02 22:44, 5F

02/02 22:49, , 6F
你不要計算錯誤 就是答案了 0.0
02/02 22:49, 6F

02/02 23:08, , 7F
恩恩 3QQ
02/02 23:08, 7F

02/03 00:00, , 8F
想請問這種算法是用換底公式嗎? 不是很懂@@"
02/03 00:00, 8F
文章代碼(AID): #1FAfadWS (Grad-ProbAsk)
文章代碼(AID): #1FAfadWS (Grad-ProbAsk)