0 Members and 1 Guest are viewing this topic.

I guess you're right. Say you have 3 matrix size variables, m, n and p, you can only multiply a mxp with a pxn matrix, which would result in a mxn matrix. I guess you can easily calculate something out of this, I assume you'll have to fit all three matrices in RAM.So (11+9m+9p)+(11+9p+9n)+(11+9m+9n)<24389 where m,n,p are integers >1. It isn't easy because there's 3 variables...For the homescreen it's kinda simple, you would only do [A]*[B]->[C] (which is 8 bytes if the [A] tokens are 2 bytes), so 24389-8.To simplify, maximize 33+18m+18n+18p < 24381.

Now do it for the TI-Nspire CX.Ready, Steady, Go.

Quote from: Juju on January 27, 2013, 03:52:04 pmI guess you're right. Say you have 3 matrix size variables, m, n and p, you can only multiply a mxp with a pxn matrix, which would result in a mxn matrix. I guess you can easily calculate something out of this, I assume you'll have to fit all three matrices in RAM.So (11+9m+9p)+(11+9p+9n)+(11+9m+9n)<24389 where m,n,p are integers >1. It isn't easy because there's 3 variables...For the homescreen it's kinda simple, you would only do [A]*[B]->[C] (which is 8 bytes if the [A] tokens are 2 bytes), so 24389-8.To simplify, maximize 33+18m+18n+18p < 24381.You don't need to put the "*", and you also need to think about Ans.