Matt C Anderson

50 Reputation

0 Badges

1 years, 273 days

MaplePrimes Activity


These are questions asked by Matt C Anderson

HI MaplePrimes,

The input -

rsolve(f(n)=f(n-1)+10*f(n-2),f(k))

returns a large expression.

My had calculations reduce this to

f(k) = [(41-19*sqrt(41))/820]*[((1-sqrt(41))/2)^k+((1+sqrt(41))/2)^k)].

There may be an error.

We let f(1)=1 and f(2)=2.

The sequence, starting with 1 should read -

1,2,12,32,152,472,...

What is the correct expression for f(k)?

 

Regards,

Matt

Hi Mapleprimes people and robots,


My question is regarding a recursive sequence.  It can be defined non-recursively as - 


a(r) :=  0.8*3^r + 0.2*(-2)^r.

The first few terms are - 

1,2,8,20,68,188, and so on.

Here is my Maple Worksheet.
recursive_sequence_A133467.mw      recursive_sequence_A133467.pdf

I want some Maple code that will produce 30 terms of this sequence.  It is defined as

s[1]:=1:
s[2]:=2:

for n>2 we let s[n] = s[n-1] + 6*s[n-2].

Let me know if my question does not make sense.

Regards,
Matt

 

HI experts,

fibonacci_sequence_with_coefficient.pdf

Is there a Last name associated with a double 'hailstone problem' with variable integer coefficients?

Just curious.

Regards,

Matt

 

Hi MaplePrimes,

As an amataeur with this computer tool, I want to know the arrow notation.

For example " l -> 8*l ".

a_quandry_MaplePrimes.mw

I'm sure this easy question is okay.

Regards,

Matt

 

 

HI Maple primes.  We try to make sense of 'rsolve' in the Maple world.  What is command for source code?

 

Regards,

Matt

 

1 2 3 Page 1 of 3