next_fib.mw

I want to find the next fib number in the sequence given an input number.

I know there are previous posts using a recurance formula...i don't want to do that.

I want my code to work like the nextprime command. but i have problems..

If the number i/p is not a fib no. .....error.  it needs to find the next actual fib no.

there is also the problem that because the...

silver_coin_braintea.mw

Experts. This is something like the subset sum problem with a twist.

Jane has some Australian silver coins in her pocket. When buying an apple, she
realises she has more than $1 in silver coins, but can’t make exactly $1 with
her coins. How is this possible? (Silver Australian coins come in 5c, 10c, 20c,
and 50c.)

answer: obviously, you can't...

Hello folks,

simplify(max(x[1],y[1])) assuming x[1]>y[1] produces thr correct result but if we do f:=k->max(x[k],y[k]);

and try simplify(f(1)) assuming x[1]>y[1] we do not get any result.

I suspect that is something related to global versus local variables, any ideas?

Hello,

I have a little question concerning the definition of the rotation matrix in the rigid body frame.

The rotation matrix is defined like that in the help menu : "The rotation matrix that transforms a vector expressed in the outboard frame to the inboard frame".

Consequently, we have :

Hello,

I would like to define my model with symbolic parameters. Consequently, i have to define the symbolic parameters and theirs values in main folder.

To illustrate, i define my parameters a1, a2 like this.

After, i need to define a frame by using the parameter a1. This frame is define like this :

Solve the system of equations:
,

Find

Good afternoon Professor.

I am M.Anand working for SRIIT, as Assistant Professor in Mathematics in Hyderabad, INDIA.

Is there any direct approach like Jacobi,Gauss-seidel, & SOR methods in Maple to solve a given linear system of equations by using Conjugate gradient method & Preconditioned Conjugate method.

I request you to help me out to generate Maple commands to solve.

If are the roots of the equations .
Prove that min

When executing "P, k := LyapunovSolve(A, C)" command, I got the following warning: 

"Warning, Matrices have common or very close eigenvalues; perturbed values were used to solve the equation"

Although Maple can give the solution, P and k don't satisfy the equation: 

A.P+P.A^%T-C = 0        (1)

Are there any other ways to solve the Lyapunov equation (1)?

Using ScientificConstants[GetElement] I'm supposed to get all the element constants, but I don't see the molar mass and have trouble believing that it isn't defined.

Question how do I get the molar mass of an element?

Hi everyone. Someone should pls. teach me how to plot a graph in maple. i've never done this before and I hope what I'm about to do is very much feasible. I don't have a function to plot, I'm plotting the errors from my computation against time(t) at interval 0 t 1. Someone shoukd pls. explain this for me with random values or use the sample values below .

  time           error1         error2

Good morning Professor.

I am M.Anand working for SRIIT, as Assistant Professor in Mathematics in Hyderabad, INDIA.

I request you to help me out to create an Augmented Matrix of a given system of linear equations with more number of variables.

With thanks & regards.

M.Anand

Assistant professor in Mathematics

SR International Institute of Technology

Hyderabad, Andhra Pradesh, INDIA.

Good morning professor.

I am M.Anand working for SRIIT, as Assistant professsor in Matematics in Hyderabad, INDIA.

I request you to help me out in generating Maple procedures for conjugate gradient method & Preconditioned Conjugate gradient method as it is consuming much time  for me to find out every iteration individually to solve linear systems with sparse coefficient matrices which arises in Numerical Analysis.

Hi all,

seq(a[i],i=1..3);

Works fine.

seq(a[i],i=3..1);

gives nothing.

But if what I really want, is a ordered sequence

for i from 3 by -1 to 1 do

r:=[op(r),a[i]];

end do;

a[3],a[2],a[1]

What's the best way to get it? (apart from writing a loop)

Casper