Recent content by maxmilian

I resolved it by using "hold on" But I am getting a error with my function when I am trying this ; function figureplot(m) load -ascii shapes.txt for i=1:m ... ? Input argument "m" is undefined. What I am trying to do, is making a function where I can tell it how many plots I want...

subplot is unfortunately not what I need. I need the plots to overlap each other

Thanks for your nice reply - what would I need to do if I wanted to have multiple plots in the same figure ?

Hi all I am novice MATLAB programmer, and I need alittle help with plotting points, given in a txt. file. I have a text file containing 56 points for 40 pictures. I've loaded the txt file by "load -ASCII nameofthefile.TXT" - and thereby created a matrix <112x40 double> the first 56 rows...

right. so I start with my hypothesis, then prove basis , then assume P(n) is true , then last prove P(n+1) is true. How do I prove P(n+1) is true?

is recursion not a part of induction ? I might have misunderstood the "determine the closed expression - without using recursion" wrong. but if I wanted to prove it by induction. I would; 1. prove the basis ; b(0)=2^(2^0) +1 = 3 , true , basis proven. 2. prove inductionstep b(n)...

right. b(2) = 17 b(3) = 257 b(4) = 65537 as far as a pattern goes for b(n) , I think I have a good idea (Fermet)

then b(2) = 2 + ∏(k from 0 to 1)b(k) = 2 + b(0)*b(1) = 2 + 3*b(1) b(3) = 2 + ∏(k from 0 to 2)b(k) = 2 + b(0)*b(1)*b(2) = 2 + 3*b(1)*b(2) b(4) = 2 + ∏(k from 0 to 3)b(k) = 2 + b(0)*b(1)*b(2)*b(3) = 2 + 3*b(1)*b(2)*b(3) b(5) = 2 + ∏(k from 0 to 4)b(k) = 2 + b(0)*b(1)*b(2)*b(3)*b(4) =...

any help is still appreciated

Thx for your reply. so for n = 1 , I am getting ; 2 + b(0) *b(1) = 2 + 3 * b(1) for n = 2 ; 2 + 3 * b(1) * b(2) edit: could 2+3*b(n)! be a solution to the pattern ? Can anyone give me a hint for what I should do next ?

oh sry, want to is my street slang for "want to". And no I havent

determine a closed expression for b(n), given b(0) = 3 b(n+1) = 2+\prod (k=0 to n) * b(k) , n >= 0 , without using recursion og or the product given by \prod. I want to start out by b(n+1) -1 = (b(n)-1)^2 for n >= 0 , but I am not sure. kind regards Maxmilian