Hello everyone,

I am trying to solve an equation using the "solve(...)" function but the coefficients of the equation are changing.

I am using the coefficients as list but the "solve(...)" function gives error: "Error, (in assuming) when calling 'Engine:-Dispatch'. Received: 'badly formed input to solve: not fully algebraic'"

I am attaching the Maple document.

However, what I want to achieve, is the solution for each value in the list.

Here is an easy example of what I am saying:

a=3*x+k where k=[list of values], a=[another list of values].

I want to find "x" for each pair of values (a,k) in the list.

Thank you !
 

Download LCC_gain_freqFinder.mwLCC_gain_freqFinder.mw

H all expert

first this Expression 

ni := diff(Q(x, t), t)+a*Q*(x, t)*(diff(Q(x, t), x))+b*(diff(Q(x, t), t$3))+d*(diff(Q(x, t), t$5)) = 0

then I want to solve  diff(Q(x, t), t$5) 

diff(Q(x, t), t$5) = solve(ni, diff(Q(x, t), t$5))#eq2

p (x, t) :=H1(t)*Q(x*H2(t), H3(t)) #assumption 

k := diff(p(x, t), t)+a*p(x, t)*(diff(p(x, t), x))+diff(p(x, t), t$3)+d*(diff(p(x, t), t$5))+c*p(x, t) #eq3

r := subs(diff(Q(x, t), t$5), k) #subs eq2 in eq3

i recived error

SUBS1.mw

Hi,

I have a code (see below) for the following number sequence and want to produce a graph as well as the numerical data, please advise how to do it.

Sequence definition: Lexicographicaly least sequence of nonnegative integers commencing 1,3,5,7 such that any four  consecutive terms are mutually coprime.

The code I have so far is: 

ina := proc (n) false end :

a := proc (n) option remember; local k;

if n < 5 then k := 2*n-1

else for k from 2 while ina(k) or igcd(k, a(n-1)) <> 1 or igcd(k, a(n-2)) <> 1 or igcd(k, a(n-3)) <> 1

do  od 

fi; ina(k) := true; k

end proc;

seq(a(n), n = 1 .. 100);
1, 3, 5, 7, 2, 9, 11, 13, 4, 15, 17, 19, 8, 21, 23, 25, 16, 27, 

  29, 31, 10, 33, 37, 41, 14, 39, 43, 47, 20, 49, 51, 53, 22, 35, 

  57, 59, 26, 55, 61, 63, 32, 65, 67, 69, 28, 71, 73, 45, 34, 77, 

  79, 75, 38, 83, 89, 81, 40, 91, 97, 87, 44, 85, 101, 93, 46, 

  95, 103, 99, 52, 107, 109, 105, 58, 113, 121, 111, 50, 119, 

  127, 117, 62, 115, 131, 123, 56, 125, 137, 129, 64, 133, 139, 

  135, 68, 143, 149, 141, 70, 151, 157, 153

I have tried listplot but for some reason cant get the correct format

Hope you can help

Best regards

David.

Hi, I'm trying to solve auxilary equation to find its familes but I don't know what I'm doing wrong as I'm using following code:

famtemp := (diff(z(xi), xi))^2-a*z(xi)^2-b*z(xi)^3-c*z(xi)^4;

fam1 := simplify(`assuming`([dsolve(famtemp)], [b::real, a::real, c::real, -4*a*c+b^2 > 0, a > 0]))

I want to get the following family:

fam1 := 2*a*sech(sqrt(a)*xi)/(sqrt(-4*a*c+b^2)-b*sech(sqrt(a)*xi));

I hope someone will help me to solve it.

Thanks

Given  3000 linear equations in 3000 unknowns, with coefficients in a field of rationals with one algebraic number extension, which Maple solver would be fastest in solving the system?

have table like table(symmetric, [() = x]) from other code not mine, strange syntax

how to extract x from table thanks

I have an array with a list of parameters. Suppose there are three parameters, t1, t2 and t3. I like to evaulate the array for different values of the parameters. I can do it manually by a command such as

eval(array, {t1=1, t2=5, t3=10})

What is a more systematic approach and how can it be done? Suppose I do not know the number of paramters in advance and the number of parameters could possible be large. Once I know the number of parameters, I would like to map a list of values to the parameters.

Thanks in advance!

with(GroupTheory):
MinimumPermutationRepresentationDegree(PermutationGroup({[[2, 3], [4, 5]], [[2, 5], [3, 4]]}, degree = 5, supergroup = PermutationGroup({[[2, 3, 4]], [[1, 2], [4, 5]]}, degree = 5)));

#an error appears in Maple 2017
 

How does Maple interpret the second line to get that result ??

I had to put expicitly a dot between the brackets to fix it.

Kind regards, Detlef Hoyer

ff := dsolve({eq1, Vt(0)=0}, Vt(t), type=numeric, method=classical, start=0, stepsize=.00001);

this is a old syntax of maple 5, with maple 2017 version it is not working, is it possible to solve non linear equatins with maple

When trying to understand what a proof is trying to show, I like to construct some examples to see what the proof is trying to show. For example, constructing some sequence to show whether it converges, visualizing some functions to understand the squeeze theorem in calculus, etc. I found Maple has worked well for this kind of work.

Now I am taking course in Measure Theory and everything is so abstract and I am not sure if Maple is capable of building the objects discussed. For example, this is from the book Probability Essentials:

How can I use Maple to support understanding the proofs? It would be nice if I can build the objects discussed and write functions to verify their properties and just play around with them in general to get an intuition of how the proof works.

Requesting a code to compute (and graph) the following self referencing sequence:

a(1)=1. If a(n) is a novel term (seen for the first time) then a(n+1)= d(a(n)) where d(k) is the number of divisors of k. 
if a(n) has been seen before then a(n+1) = a(n)+m where m is the least prior term which has not already been used in this way (once m is used it cannot be used again).

Sequence starts:

1,1,2,2,3,2,4,3,5,2,4,6,4,7,2,5,7,11,2...,

note that there are often multiple copies of the least unused term, which might make accounting for them tricky. 

Thanks in advance 

Can anyone please help with this?  I don't know what is the problem in this code.

Download DistanceModulus.mw

sum2N := proc (N::integer) local summation, i, k; summation := 0; k := 0;

for i from 0 to N do if i = 1 then k := k+1

end if; summation := (i+k)^2 end do

end proc;
sum2N(10);

the result shows 121 but its not correct i think the right answer show be 2985
 

Hello MaplePrimes, 

So, I have used the discont=true option in the past and it has worked fine for me but for some reason with these functions I am using now the plots are still containing the veritcal asymptotes. Anyone spot something I am forgetting or doing incorrectly?

I have attached my maple file for easy viewing. 

Thanks. 

DiscontQuestion.mw