Ronan

1471 Reputation

16 Badges

14 years, 155 days
East Grinstead, United Kingdom

MaplePrimes Activity


These are answers submitted by Ronan

I parameterised the points on the ellipse. I made them projective points [x,y,1] in the form of vectors. Reason the equation of the  line through two projective points is the Cross Product of the two points as another vector . P1 X P2  = L12 Now the intersect point of two lines as vectors is L1 X L2= Pintersect.

A line in vector form <a , b, c>   represents a*x + b*y + c=0

The use of factrix by @Robert B. Isreal  reduces the projective vectors, as in projective geometry vectors can be scaled without changing the answers.

Edit:- Correction.  Replece this into the document.  The intersection points were scaled incorrectly.

The 3 collinear points

for i to 3 do
    pPint || i := convert(Pint || i[1 .. 2]/Pint || i[3], list);
    eval(pPint || i, pramsplot);
    evalf(%);
end do;


 

restart

NULLNULL

NULL

with(LinearAlgebra)

LinePts := proc (p1, p2) description " Calculates a line through two points"; (p2[2]-p1[2])*x+(p1[1]-p2[1])*y-p1[1]*p2[2]+p1[2]*p2[1] end proc

proc (p1, p2) description " Calculates a line through two points"; (p2[2]-p1[2])*x+(p1[1]-p2[1])*y-p1[1]*p2[2]+p1[2]*p2[1] end proc

(1)

factrix := proc (M) local Mt, t, v, f, i, j, m, n, q, S, Si, res, u; options `Maple Advisor Database 1.01 for Maple 6`, `Copyright (c) 2000 by Robert B. Israel.  All rights reserved`; Mt := M; if not type(Mt, {Matrix, Vector}) then Mt := evalm(Mt) end if; if hastype(eval(Mt), float) then S := map(proc (t) options operator, arrow; t = `tools/gensym`(f) end proc, indets([flatten(Mt)], float)); Mt := map2(subs, S, Mt); Si := map(proc (e) options operator, arrow; rhs(e) = lhs(e) end proc, S) else Si := {} end if; if type(Mt, matrix) then m := linalg[rowdim](Mt); n := linalg[coldim](Mt); v := factor(q*add(add(f[i, j]*Mt[i, j], i = 1 .. m), j = 1 .. n)); t, u := selectremove(hastype, v, f[anything, anything]); Mt := subs(q = 1, [seq([seq(coeff(t, f[i, j]), j = 1 .. n)], i = 1 .. m)]); if hastype(M, matrix) then Mt := matrix(Mt) end if elif type(Mt, vector) then m := linalg[vectdim](Mt); v := factor(q*add(f[i]*Mt[i], i = 1 .. m)); t, u := selectremove(hastype, v, f[anything]); Mt := subs(q = 1, [seq(coeff(t, f[i]), i = 1 .. m)]); if hastype(M, vector) then Mt := vector(Mt) end if elif type(Mt, Matrix) then m := LinearAlgebra:-RowDimension(Mt); n := LinearAlgebra:-ColumnDimension(Mt); v := factor(q*add(add(f[i, j]*Mt[i, j], i = 1 .. m), j = 1 .. n)); t, u := selectremove(hastype, v, f[anything, anything]); Mt := Matrix(m, n, proc (i, j) options operator, arrow; subs(q = 1, coeff(t, f[i, j])) end proc) elif type(Mt, Vector) then m := LinearAlgebra:-Dimension(Mt); n := VectorOptions(Mt, orientation); v := factor(q*add(f[i]*Mt[i], i = 1 .. m)); t, u := selectremove(hastype, v, f[anything]); Mt := Vector(m, proc (i) options operator, arrow; subs(q = 1, coeff(t, f[i])) end proc, orientation = n) else ERROR(M, `does not evaluate to a matrix, vector, Matrix or Vector`) end if; if type(Mt, {Matrix, Vector}) then subs(res = u, q = 1, Si, delayDotProduct(res, Mt)) else subs(res = u, q = 1, Si, res*(eval(Mt))) end if end proc

proc (M) local Mt, t, v, f, i, j, m, n, q, S, Si, res, u; options `Maple Advisor Database 1.01 for Maple 6`, `Copyright (c) 2000 by Robert B. Israel.  All rights reserved`; Mt := M; if not type(Mt, {Matrix, Vector}) then Mt := evalm(Mt) end if; if hastype(eval(Mt), float) then S := map(proc (t) options operator, arrow; t = `tools/gensym`(f) end proc, indets([flatten(Mt)], float)); Mt := map2(subs, S, Mt); Si := map(proc (e) options operator, arrow; rhs(e) = lhs(e) end proc, S) else Si := {} end if; if type(Mt, matrix) then m := linalg[rowdim](Mt); n := linalg[coldim](Mt); v := factor(q*add(add(f[i, j]*Mt[i, j], i = 1 .. m), j = 1 .. n)); t, u := selectremove(hastype, v, f[anything, anything]); Mt := subs(q = 1, [seq([seq(coeff(t, f[i, j]), j = 1 .. n)], i = 1 .. m)]); if hastype(M, matrix) then Mt := matrix(Mt) end if elif type(Mt, vector) then m := linalg[vectdim](Mt); v := factor(q*add(f[i]*Mt[i], i = 1 .. m)); t, u := selectremove(hastype, v, f[anything]); Mt := subs(q = 1, [seq(coeff(t, f[i]), i = 1 .. m)]); if hastype(M, vector) then Mt := vector(Mt) end if elif type(Mt, Matrix) then m := LinearAlgebra:-RowDimension(Mt); n := LinearAlgebra:-ColumnDimension(Mt); v := factor(q*add(add(f[i, j]*Mt[i, j], i = 1 .. m), j = 1 .. n)); t, u := selectremove(hastype, v, f[anything, anything]); Mt := Matrix(m, n, proc (i, j) options operator, arrow; subs(q = 1, coeff(t, f[i, j])) end proc) elif type(Mt, Vector) then m := LinearAlgebra:-Dimension(Mt); n := VectorOptions(Mt, orientation); v := factor(q*add(f[i]*Mt[i], i = 1 .. m)); t, u := selectremove(hastype, v, f[anything]); Mt := Vector(m, proc (i) options operator, arrow; subs(q = 1, coeff(t, f[i])) end proc, orientation = n) else ERROR(M, `does not evaluate to a matrix, vector, Matrix or Vector`) end if; if type(Mt, {Matrix, Vector}) then subs(res = u, q = 1, Si, delayDotProduct(res, Mt)) else subs(res = u, q = 1, Si, res*(eval(Mt))) end if end proc

(2)

NULL

NULL

NULL

Firstly Paramaterise a conic centred on the Origin using projective points

Conic := proc (x, y) options operator, arrow; a*x^2+b*y^2+c*x*y+d end proc

proc (x, y) options operator, arrow; a*x^2+b*y^2+c*x*y+d end proc

(3)

sol1 := solve(eval(Conic(x, y), y = 0), x)

(-a*d)^(1/2)/a, -(-a*d)^(1/2)/a

(4)

NULL

xint := `assuming`([combine(simplify(sol1[2]))], [a::real, a > 0, d < 0])

-(-d/a)^(1/2)

(5)

linet := LinePts([xint, 0], [0, t])

t*x-(-d/a)^(1/2)*y+(-d/a)^(1/2)*t

(6)

sol2 := solve([Conic(x, y), linet], [x, y]); map(allvalues, %)

[[x = -(-d/a)^(1/2), y = 0], [x = -(-d/a)^(1/2)*(b*t^2+d)/(c*(-d/a)^(1/2)*t+b*t^2-d), y = t*(c*(-d/a)^(1/2)*t-2*d)/(c*(-d/a)^(1/2)*t+b*t^2-d)]]

(7)

CparmPt := `<,>`(rhs(sol2[2, 1]), rhs(sol2[2, 2]), 1)

Vector[column](%id = 36893490806110780580)

(8)

CparmPt := unapply(CparmPt, t)

proc (t) options operator, arrow; rtable(1 .. 3, {1 = -(-d/a)^(1/2)*(b*t^2+d)/(c*(-d/a)^(1/2)*t+b*t^2-d), 2 = t*(c*(-d/a)^(1/2)*t-2*d)/(c*(-d/a)^(1/2)*t+b*t^2-d), 3 = 1}, datatype = anything, subtype = Vector[column], storage = rectangular, order = Fortran_order) end proc

(9)

NULLCparmPt(t)

Vector[column](%id = 36893490806134464372)

(10)

Create 6 Projective Ponits on the conic

P0 := CparmPt(t[0])

Vector[column](%id = 36893490806134620156)

(11)

P1 := CparmPt(t[1])

Vector[column](%id = 36893490806134630388)

(12)

P2 := CparmPt(t[2])

Vector[column](%id = 36893490806134722556)

(13)

P3 := CparmPt(t[3])

Vector[column](%id = 36893490806134740980)

(14)

P4 := CparmPt(t[4])

Vector[column](%id = 36893490806134845436)

(15)

P5 := CparmPt(t[5])

Vector[column](%id = 36893490806127228916)

(16)

Create 6 Projective Lines through pairs of Ponits P0P4, P0P5:  P1P3, P1P5:  P2P3, P2P4 uning crossproduct of vectors

 

l04 := op(2, factrix(`&x`(P0, P4)))

Vector[column](%id = 36893490806134060444)

(17)

 

l05 := op(2, factrix(`&x`(P0, P5)))

Vector[column](%id = 36893490806134290060)

(18)

l13 := op(2, factrix(`&x`(P1, P3)))

Vector[column](%id = 36893490806188406652)

(19)

l15 := op(2, factrix(`&x`(P1, P5)))

Vector[column](%id = 36893490806188440500)

(20)

l23 := op(2, factrix(`&x`(P2, P3)))

Vector[column](%id = 36893490806188465316)

(21)

l24 := op(2, factrix(`&x`(P2, P4)))

Vector[column](%id = 36893490806130202612)

(22)

Get 3 intersection points in projective form

Pint1 := op(2, factrix(`&x`(l04, l13)))

Vector[column](%id = 36893490806134736044)

(23)

Pint2 := op(2, factrix(`&x`(l05, l23)))

Vector[column](%id = 36893490806192605772)

(24)

Pint3 := op(2, factrix(`&x`(l15, l24)))

Vector[column](%id = 36893490806145831988)

(25)

From a square matrix using the 3 points. If the determinant is 0 the points are colinear

M := `<|>`(Pint1, Pint2, Pint3)

Matrix(%id = 36893490806102267172)

(26)

Determinant(M)

0

(27)

Plotting

play with t_0 ..t_5 to move the points on the Conic

pramsplot := [a = 2, b = 1, c = -1, d = -4, t[0] = 1/10, t[1] = 1/2, t[2] = -1/3, t[3] = -9/10, t[4] = 55, t[5] = -8]

[a = 2, b = 1, c = -1, d = -4, t[0] = 1/10, t[1] = 1/2, t[2] = -1/3, t[3] = -9/10, t[4] = 55, t[5] = -8]

(28)

 

NULL

for i from 0 to 5 do p || i := convert(P || i[1 .. 2], list) end do

[-(-d/a)^(1/2)*(b*t[5]^2+d)/(c*(-d/a)^(1/2)*t[5]+b*t[5]^2-d), t[5]*(c*(-d/a)^(1/2)*t[5]-2*d)/(c*(-d/a)^(1/2)*t[5]+b*t[5]^2-d)]

(29)

ll := proc (v::Vector) options operator, arrow; x*v[1]+y*v[2]+v[3] end proc

proc (v::Vector) options operator, arrow; x*v[1]+y*v[2]+v[3] end proc

(30)

ll04 := ll(l04)

x*((-d/a)^(1/2)*t[0]*a*c+(-d/a)^(1/2)*t[4]*a*c-2*t[0]*t[4]*a*b+t[0]*t[4]*c^2-2*a*d)+y*(2*(-d/a)^(1/2)*t[0]*a*b+2*(-d/a)^(1/2)*t[4]*a*b+t[0]*t[4]*b*c-d*c)-2*(-d/a)^(1/2)*t[0]*t[4]*a*b+2*(-d/a)^(1/2)*a*d+t[0]*c*d+t[4]*c*d

(31)

ll05 := ll(l05)

x*((-d/a)^(1/2)*t[0]*a*c+(-d/a)^(1/2)*t[5]*a*c-2*t[0]*t[5]*a*b+t[0]*t[5]*c^2-2*a*d)+y*(2*(-d/a)^(1/2)*t[0]*a*b+2*(-d/a)^(1/2)*t[5]*a*b+t[0]*t[5]*b*c-d*c)-2*(-d/a)^(1/2)*t[0]*t[5]*a*b+2*(-d/a)^(1/2)*a*d+t[0]*c*d+t[5]*c*d

(32)

ll13 := ll(l13)

x*((-d/a)^(1/2)*t[1]*a*c+(-d/a)^(1/2)*t[3]*a*c-2*t[1]*t[3]*a*b+t[1]*t[3]*c^2-2*a*d)+y*(2*(-d/a)^(1/2)*t[1]*a*b+2*(-d/a)^(1/2)*t[3]*a*b+t[1]*t[3]*b*c-d*c)-2*(-d/a)^(1/2)*t[1]*t[3]*a*b+2*(-d/a)^(1/2)*a*d+t[1]*c*d+t[3]*c*d

(33)

ll15 := ll(l15)

x*((-d/a)^(1/2)*t[1]*a*c+(-d/a)^(1/2)*t[5]*a*c-2*t[1]*t[5]*a*b+t[1]*t[5]*c^2-2*a*d)+y*(2*(-d/a)^(1/2)*t[1]*a*b+2*(-d/a)^(1/2)*t[5]*a*b+t[1]*t[5]*b*c-d*c)-2*(-d/a)^(1/2)*t[1]*t[5]*a*b+2*(-d/a)^(1/2)*a*d+t[1]*c*d+t[5]*c*d

(34)

ll23 := ll(l23)

x*((-d/a)^(1/2)*t[2]*a*c+(-d/a)^(1/2)*t[3]*a*c-2*t[2]*t[3]*a*b+t[2]*t[3]*c^2-2*a*d)+y*(2*(-d/a)^(1/2)*t[2]*a*b+2*(-d/a)^(1/2)*t[3]*a*b+t[2]*t[3]*b*c-d*c)-2*(-d/a)^(1/2)*t[2]*t[3]*a*b+2*(-d/a)^(1/2)*a*d+t[2]*c*d+t[3]*c*d

(35)

ll24 := ll(l24)

x*((-d/a)^(1/2)*t[2]*a*c+(-d/a)^(1/2)*t[4]*a*c-2*t[2]*t[4]*a*b+t[2]*t[4]*c^2-2*a*d)+y*(2*(-d/a)^(1/2)*t[2]*a*b+2*(-d/a)^(1/2)*t[4]*a*b+t[2]*t[4]*b*c-d*c)-2*(-d/a)^(1/2)*t[2]*t[4]*a*b+2*(-d/a)^(1/2)*a*d+t[2]*c*d+t[4]*c*d

(36)

The 3 collinear points

NULL

for i to 3 do pPint || i := convert(Pint || i[1 .. 2], list); eval(pPint || i, pramsplot); evalf(%) end do

[-430., -1748.992977]

(37)

``

plots:-display(plots:-implicitplot([eval(Conic(x, y), pramsplot), eval(ll04, pramsplot), eval(ll05, pramsplot), eval(ll13, pramsplot), eval(ll15, pramsplot), (eval(ll23, pramsplot)).(eval(ll24, pramsplot))], x = -3 .. 3, y = -5 .. 5, colour = [red, green, pink, blue, yellow, grey, orange]))

 

NULL

NULL

NULL


 

Download 2023-12-23_A_Pascal_Conic_parameterised.mw

You basically have a 5th order polynomail in h. In general there is no explicit solution for a 5th order or higher polynomial.

I asked the same question a couple on months age

@C_R answered it as follows

inserts a new execution group before the cursor.

For pasted text you could try F3 to split the text at the postition of the cursor.

from the menu should also work.

Here are two possible ways assuming I have understood you question correctly. I renamed your list to l to avoid confusion.

restart

with(LinearAlgebra)

l := [seq(2*i-1, i = 1 .. 10)]

[1, 3, 5, 7, 9, 11, 13, 15, 17, 19]

(1)

for i in l do A[i] := (x/a)^(i+1)*(1-x/a)^2 end do

x^2*(1-x/a)^2/a^2

 

x^4*(1-x/a)^2/a^4

 

x^6*(1-x/a)^2/a^6

 

x^8*(1-x/a)^2/a^8

 

x^10*(1-x/a)^2/a^10

 

x^12*(1-x/a)^2/a^12

 

x^14*(1-x/a)^2/a^14

 

x^16*(1-x/a)^2/a^16

 

x^18*(1-x/a)^2/a^18

 

x^20*(1-x/a)^2/a^20

(2)

~# Or use seq

A := [seq((x/a)^(i+1)*(1-x/a)^2, `in`(i, l))]

[x^2*(1-x/a)^2/a^2, x^4*(1-x/a)^2/a^4, x^6*(1-x/a)^2/a^6, x^8*(1-x/a)^2/a^8, x^10*(1-x/a)^2/a^10, x^12*(1-x/a)^2/a^12, x^14*(1-x/a)^2/a^14, x^16*(1-x/a)^2/a^16, x^18*(1-x/a)^2/a^18, x^20*(1-x/a)^2/a^20]

(3)

A[4]

x^8*(1-x/a)^2/a^8

(4)

 

Download 3a.mw

Square brackets are incorrect use parenthesis ()

1/2*int(D__11*diff(w, x, x)^2 + 2*D__12*diff(w, x, x)*diff(w, y, y) + 4*D[66]*diff(w, x, y)^2 + D[22]*diff(w, y, y)^2 - 2*q*w, [x = 0 .. b, y = 0 .. a])

I got 

(((144*D__11*c[1]^2)/(5*a^8*b^3) - 72*D__11*c[1]^2/(a^7*b^4) + 64*D__11*c[1]^2/(a^6*b^5) - 24*D__11*c[1]^2/(a^5*b^6) + 4*D__11*c[1]^2/(a^4*b^7))*a^9)/18 + ((-(576*D__11*c[1]^2)/(5*a^8*b^2) + 288*D__11*c[1]^2/(a^7*b^3) - 256*D__11*c[1]^2/(a^6*b^4) + 96*D__11*c[1]^2/(a^5*b^5) - 16*D__11*c[1]^2/(a^4*b^6))*a^8)/16 + ((((288*D__12*c[1]^2/(a^8*b^8) + 1024*D[66]*c[1]^2/(a^8*b^8))*b^7)/7 + ((-864*D__12*c[1]^2/(a^7*b^8) - 3072*D[66]*c[1]^2/(a^7*b^8))*b^6)/6 + ((864*D__11*c[1]^2/(a^8*b^6) + 912*D__12*c[1]^2/(a^6*b^8) + 3328*D[66]*c[1]^2/(a^6*b^8))*b^5)/5 + ((-1728*D__11*c[1]^2/(a^7*b^6) - 384*D__12*c[1]^2/(a^5*b^8) - 1536*D[66]*c[1]^2/(a^5*b^8))*b^4)/4 + ((1152*D__11*c[1]^2/(a^6*b^6) + 48*D__12*c[1]^2/(a^4*b^8) + 256*D[66]*c[1]^2/(a^4*b^8))*b^3)/3 - 144*D__11*c[1]^2/(a^5*b^4) + 24*D__11*c[1]^2/(a^4*b^5))*a^7)/14 + ((((-864*D__12*c[1]^2/(a^8*b^7) - 3072*D[66]*c[1]^2/(a^8*b^7))*b^7)/7 + ((2592*D__12*c[1]^2/(a^7*b^7) + 9216*D[66]*c[1]^2/(a^7*b^7))*b^6)/6 + ((-576*D__11*c[1]^2/(a^8*b^5) - 2736*D__12*c[1]^2/(a^6*b^7) - 9984*D[66]*c[1]^2/(a^6*b^7))*b^5)/5 + ((1152*D__11*c[1]^2/(a^7*b^5) + 1152*D__12*c[1]^2/(a^5*b^7) + 4608*D[66]*c[1]^2/(a^5*b^7))*b^4)/4 + ((-768*D__11*c[1]^2/(a^6*b^5) - 144*D__12*c[1]^2/(a^4*b^7) - 768*D[66]*c[1]^2/(a^4*b^7))*b^3)/3 + 96*D__11*c[1]^2/(a^5*b^3) - 16*D__11*c[1]^2/(a^4*b^4))*a^6)/12 + ((16*D[22]*c[1]^2*b/a^8 - 72*D[22]*c[1]^2/a^7 + ((912*D__12*c[1]^2/(a^8*b^6) + 3328*D[66]*c[1]^2/(a^8*b^6) + 864*D[22]*c[1]^2/(a^6*b^8))*b^7)/7 + ((-2736*D__12*c[1]^2/(a^7*b^6) - 9984*D[66]*c[1]^2/(a^7*b^6) - 576*D[22]*c[1]^2/(a^5*b^8))*b^6)/6 + ((144*D__11*c[1]^2/(a^8*b^4) + 2888*D__12*c[1]^2/(a^6*b^6) + 10816*D[66]*c[1]^2/(a^6*b^6) + 144*D[22]*c[1]^2/(a^4*b^8) - 2*q*c[1]/(a^4*b^4))*b^5)/5 + ((-288*D__11*c[1]^2/(a^7*b^4) - 1216*D__12*c[1]^2/(a^5*b^6) - 4992*D[66]*c[1]^2/(a^5*b^6) + 4*q*c[1]/(a^3*b^4))*b^4)/4 + ((192*D__11*c[1]^2/(a^6*b^4) + 152*D__12*c[1]^2/(a^4*b^6) + 832*D[66]*c[1]^2/(a^4*b^6) - 2*q*c[1]/(a^2*b^4))*b^3)/3 - 24*D__11*c[1]^2/(a^5*b^2) + 4*D__11*c[1]^2/(a^4*b^3))*a^5)/10 + ((-32*D[22]*c[1]^2*b^2/a^8 + 144*D[22]*c[1]^2*b/a^7 + ((-384*D__12*c[1]^2/(a^8*b^5) - 1536*D[66]*c[1]^2/(a^8*b^5) - 1728*D[22]*c[1]^2/(a^6*b^7))*b^7)/7 + ((1152*D__12*c[1]^2/(a^7*b^5) + 4608*D[66]*c[1]^2/(a^7*b^5) + 1152*D[22]*c[1]^2/(a^5*b^7))*b^6)/6 + ((-1216*D__12*c[1]^2/(a^6*b^5) - 4992*D[66]*c[1]^2/(a^6*b^5) - 288*D[22]*c[1]^2/(a^4*b^7) + 4*q*c[1]/(a^4*b^3))*b^5)/5 + ((512*D__12*c[1]^2/(a^5*b^5) + 2304*D[66]*c[1]^2/(a^5*b^5) - 8*q*c[1]/(a^3*b^3))*b^4)/4 + ((-64*D__12*c[1]^2/(a^4*b^5) - 384*D[66]*c[1]^2/(a^4*b^5) + 4*q*c[1]/(a^2*b^3))*b^3)/3)*a^4)/8 + (((64*D[22]*c[1]^2*b^3)/(3*a^8) - 96*D[22]*c[1]^2*b^2/a^7 + ((48*D__12*c[1]^2/(a^8*b^4) + 256*D[66]*c[1]^2/(a^8*b^4) + 1152*D[22]*c[1]^2/(a^6*b^6))*b^7)/7 + ((-144*D__12*c[1]^2/(a^7*b^4) - 768*D[66]*c[1]^2/(a^7*b^4) - 768*D[22]*c[1]^2/(a^5*b^6))*b^6)/6 + ((152*D__12*c[1]^2/(a^6*b^4) + 832*D[66]*c[1]^2/(a^6*b^4) + 192*D[22]*c[1]^2/(a^4*b^6) - 2*q*c[1]/(a^4*b^2))*b^5)/5 + ((-64*D__12*c[1]^2/(a^5*b^4) - 384*D[66]*c[1]^2/(a^5*b^4) + 4*q*c[1]/(a^3*b^2))*b^4)/4 + ((8*D__12*c[1]^2/(a^4*b^4) + 64*D[66]*c[1]^2/(a^4*b^4) - 2*q*c[1]/(a^2*b^2))*b^3)/3)*a^3)/6 + ((-(16*D[22]*c[1]^2*b^4)/(3*a^8) + 24*D[22]*c[1]^2*b^3/a^7 - (288*D[22]*c[1]^2*b^2)/(7*a^6) + 32*D[22]*c[1]^2*b/a^5 - (48*D[22]*c[1]^2)/(5*a^4))*a^2)/4 + (2*D[22]*c[1]^2*b^5)/(9*a^7) - D[22]*c[1]^2*b^4/a^6 + (12*D[22]*c[1]^2*b^3)/(7*a^5) - (4*D[22]*c[1]^2*b^2)/(3*a^4) + (2*D[22]*c[1]^2*b)/(5*a^3)

 

This shows basically what is happening and why Maple gives answers you have. The are correct.

restart

 

A := sqrt(x^2-10*x+1) = sqrt(-8*x^2+9*x-1)

(x^2-10*x+1)^(1/2) = (-8*x^2+9*x-1)^(1/2)

plot([lhs(A), rhs(A)], x = 0 .. 2.5)

 

A^2

x^2-10*x+1 = -8*x^2+9*x-1

B := lhs(A^2)-rhs(A^2)

9*x^2-19*x+2

solve(B)

2, 1/9

eval(A, x = 2)

(-15)^(1/2) = (-15)^(1/2)

eval(A, x = 1/9)

(1/81)*(-8)^(1/2)*81^(1/2) = (1/81)*(-8)^(1/2)*81^(1/2)

NULL

Download A_23-2-23-how_maple_gets_answer.mw

You had set B= Omega. Needs to be B:=Omega

restart

A := Omega; assume(Omega > 0); B := Omega

Omega

B

Omega

 

Download assumetest-1.mw

Try setting q:=p^2. That will get rid of the fractional exponents.

Here are two potential ways around you issue.
 

restart

NULL

a := U(xi)

U(xi)

b := y(xi)

y(xi)

could use double delayed evaluation quotes   '' ...   '' but then can't use a^2*b^5

convert(''U(xi)^2*y(xi)^5'', list)

[U(xi)^2, y(xi)^5]

or  enclose computation an square brackets

c := [a^2*b^5]

[U(xi)^2*y(xi)^5]

c

[U(xi)^2*y(xi)^5]

NULL


 

Download 22-7-22_A_List.mw

I checked this in Maple 18 (not Maple 2018) and Maple 2022.  I don't have Maple 2020 installed anymore.

eq := solve(expand((20 + 20*T + 2*T*(T + 1))*exp(-T) - 10*exp(-2*T) - 2*T - 10.0))

answers from Maple2022 

eq := 1.411454823, 0.

answers from Maple 18

1.411454823, -0., 0.

If you use 10 instead of 10.0 the numerical answers need to be extracted using "allvalues(%)" In this case Maple 18 returns four root solutions but only evaluates two of the to numerical values. Maple 2022 returns two root solutions

 

Beyond that I have no explination.

 


Firstly you are better off using the modern LinearAlgebra package. I converted some of you code to suit.

I created a matrix Hnew is what you are looking for

restart;

kernelopts(version);

`Maple 2022.0, X86 64 WINDOWS, Mar 8 2022, Build ID 1599809`

(1)

with(LinearAlgebra);

[`&x`, Add, Adjoint, BackwardSubstitute, BandMatrix, Basis, BezoutMatrix, BidiagonalForm, BilinearForm, CARE, CharacteristicMatrix, CharacteristicPolynomial, Column, ColumnDimension, ColumnOperation, ColumnSpace, CompanionMatrix, CompressedSparseForm, ConditionNumber, ConstantMatrix, ConstantVector, Copy, CreatePermutation, CrossProduct, DARE, DeleteColumn, DeleteRow, Determinant, Diagonal, DiagonalMatrix, Dimension, Dimensions, DotProduct, EigenConditionNumbers, Eigenvalues, Eigenvectors, Equal, ForwardSubstitute, FrobeniusForm, FromCompressedSparseForm, FromSplitForm, GaussianElimination, GenerateEquations, GenerateMatrix, Generic, GetResultDataType, GetResultShape, GivensRotationMatrix, GramSchmidt, HankelMatrix, HermiteForm, HermitianTranspose, HessenbergForm, HilbertMatrix, HouseholderMatrix, IdentityMatrix, IntersectionBasis, IsDefinite, IsOrthogonal, IsSimilar, IsUnitary, JordanBlockMatrix, JordanForm, KroneckerProduct, LA_Main, LUDecomposition, LeastSquares, LinearSolve, LyapunovSolve, Map, Map2, MatrixAdd, MatrixExponential, MatrixFunction, MatrixInverse, MatrixMatrixMultiply, MatrixNorm, MatrixPower, MatrixScalarMultiply, MatrixVectorMultiply, MinimalPolynomial, Minor, Modular, Multiply, NoUserValue, Norm, Normalize, NullSpace, OuterProductMatrix, Permanent, Pivot, PopovForm, ProjectionMatrix, QRDecomposition, RandomMatrix, RandomVector, Rank, RationalCanonicalForm, ReducedRowEchelonForm, Row, RowDimension, RowOperation, RowSpace, ScalarMatrix, ScalarMultiply, ScalarVector, SchurForm, SingularValues, SmithForm, SplitForm, StronglyConnectedBlocks, SubMatrix, SubVector, SumBasis, SylvesterMatrix, SylvesterSolve, ToeplitzMatrix, Trace, Transpose, TridiagonalForm, UnitVector, VandermondeMatrix, VectorAdd, VectorAngle, VectorMatrixMultiply, VectorNorm, VectorScalarMultiply, ZeroMatrix, ZeroVector, Zip]

(2)

alias(phi = phi(x, t), chi = chi(x, t), psi = psi(x, t), rho = rho(x, t));

phi, chi, psi, rho

(3)

NULL

H[1]:=Matrix([[epsilon[1]*phi[1],conjugate(epsilon[2])*(phi[1]),conjugate(chi[1]),0],

           [epsilon[2]*psi[1],-conjugate(epsilon[1])*(psi[1]),0,conjugate(rho[1])],

           [-chi[1],0,conjugate(epsilon[1])*conjugate(phi[1]),conjugate(epsilon[2])*conjugate(phi[1])],

         [0,rho[1],-epsilon[2]*conjugate(psi[1]),epsilon[1]*conjugate(psi[1])]]);

 

 

Matrix(4, 4, {(1, 1) = `&epsilon;`[1]*phi(x, t)[1], (1, 2) = conjugate(`&epsilon;`[2])*phi(x, t)[1], (1, 3) = conjugate(chi(x, t)[1]), (1, 4) = 0, (2, 1) = `&epsilon;`[2]*psi(x, t)[1], (2, 2) = -conjugate(`&epsilon;`[1])*psi(x, t)[1], (2, 3) = 0, (2, 4) = conjugate(rho(x, t)[1]), (3, 1) = -chi(x, t)[1], (3, 2) = 0, (3, 3) = conjugate(`&epsilon;`[1])*conjugate(phi(x, t)[1]), (3, 4) = conjugate(`&epsilon;`[2])*conjugate(phi(x, t)[1]), (4, 1) = 0, (4, 2) = rho(x, t)[1], (4, 3) = -`&epsilon;`[2]*conjugate(psi(x, t)[1]), (4, 4) = `&epsilon;`[1]*conjugate(psi(x, t)[1])})

(4)

H[2]:=Matrix([[epsilon[1]*phi[2],conjugate(epsilon[2])*(phi[2]),conjugate(chi[2]),0],

           [epsilon[2]*psi[2],-conjugate(epsilon[1])*(psi[2]),0,conjugate(rho[2])],

           [-chi[2],0,conjugate(epsilon[1])*conjugate(phi[2]),conjugate(epsilon[2])*conjugate(phi[2])],

         [0,rho[2],-epsilon[2]*conjugate(psi[2]),epsilon[1]*conjugate(psi[2])]]);

Matrix(4, 4, {(1, 1) = `&epsilon;`[1]*phi(x, t)[2], (1, 2) = conjugate(`&epsilon;`[2])*phi(x, t)[2], (1, 3) = conjugate(chi(x, t)[2]), (1, 4) = 0, (2, 1) = `&epsilon;`[2]*psi(x, t)[2], (2, 2) = -conjugate(`&epsilon;`[1])*psi(x, t)[2], (2, 3) = 0, (2, 4) = conjugate(rho(x, t)[2]), (3, 1) = -chi(x, t)[2], (3, 2) = 0, (3, 3) = conjugate(`&epsilon;`[1])*conjugate(phi(x, t)[2]), (3, 4) = conjugate(`&epsilon;`[2])*conjugate(phi(x, t)[2]), (4, 1) = 0, (4, 2) = rho(x, t)[2], (4, 3) = -`&epsilon;`[2]*conjugate(psi(x, t)[2]), (4, 4) = `&epsilon;`[1]*conjugate(psi(x, t)[2])})

(5)

Lambda[1]:=Matrix([[lambda[1],0,0,0],[0,lambda[1],0,0],[0,0,conjugate(lambda[1]),0],[0,0,0,conjugate(lambda[1])]]);

Matrix(4, 4, {(1, 1) = lambda[1], (1, 2) = 0, (1, 3) = 0, (1, 4) = 0, (2, 1) = 0, (2, 2) = lambda[1], (2, 3) = 0, (2, 4) = 0, (3, 1) = 0, (3, 2) = 0, (3, 3) = conjugate(lambda[1]), (3, 4) = 0, (4, 1) = 0, (4, 2) = 0, (4, 3) = 0, (4, 4) = conjugate(lambda[1])})

(6)

Lambda[2]:=Matrix([[lambda[2],0,0,0],[0,lambda[2],0,0],[0,0,conjugate(lambda[2]),0],[0,0,0,conjugate(lambda[2])]]);

Matrix(4, 4, {(1, 1) = lambda[2], (1, 2) = 0, (1, 3) = 0, (1, 4) = 0, (2, 1) = 0, (2, 2) = lambda[2], (2, 3) = 0, (2, 4) = 0, (3, 1) = 0, (3, 2) = 0, (3, 3) = conjugate(lambda[2]), (3, 4) = 0, (4, 1) = 0, (4, 2) = 0, (4, 3) = 0, (4, 4) = conjugate(lambda[2])})

(7)

H11:=H[1].Lambda[1];

Matrix(4, 4, {(1, 1) = `&epsilon;`[1]*phi(x, t)[1]*lambda[1], (1, 2) = conjugate(`&epsilon;`[2])*phi(x, t)[1]*lambda[1], (1, 3) = conjugate(chi(x, t)[1])*conjugate(lambda[1]), (1, 4) = 0, (2, 1) = `&epsilon;`[2]*psi(x, t)[1]*lambda[1], (2, 2) = -conjugate(`&epsilon;`[1])*psi(x, t)[1]*lambda[1], (2, 3) = 0, (2, 4) = conjugate(rho(x, t)[1])*conjugate(lambda[1]), (3, 1) = -chi(x, t)[1]*lambda[1], (3, 2) = 0, (3, 3) = conjugate(`&epsilon;`[1])*conjugate(phi(x, t)[1])*conjugate(lambda[1]), (3, 4) = conjugate(`&epsilon;`[2])*conjugate(phi(x, t)[1])*conjugate(lambda[1]), (4, 1) = 0, (4, 2) = rho(x, t)[1]*lambda[1], (4, 3) = -`&epsilon;`[2]*conjugate(psi(x, t)[1])*conjugate(lambda[1]), (4, 4) = `&epsilon;`[1]*conjugate(psi(x, t)[1])*conjugate(lambda[1])})

(8)

H12:=H[2].Lambda[2];

Matrix(4, 4, {(1, 1) = `&epsilon;`[1]*phi(x, t)[2]*lambda[2], (1, 2) = conjugate(`&epsilon;`[2])*phi(x, t)[2]*lambda[2], (1, 3) = conjugate(chi(x, t)[2])*conjugate(lambda[2]), (1, 4) = 0, (2, 1) = `&epsilon;`[2]*psi(x, t)[2]*lambda[2], (2, 2) = -conjugate(`&epsilon;`[1])*psi(x, t)[2]*lambda[2], (2, 3) = 0, (2, 4) = conjugate(rho(x, t)[2])*conjugate(lambda[2]), (3, 1) = -chi(x, t)[2]*lambda[2], (3, 2) = 0, (3, 3) = conjugate(`&epsilon;`[1])*conjugate(phi(x, t)[2])*conjugate(lambda[2]), (3, 4) = conjugate(`&epsilon;`[2])*conjugate(phi(x, t)[2])*conjugate(lambda[2]), (4, 1) = 0, (4, 2) = rho(x, t)[2]*lambda[2], (4, 3) = -`&epsilon;`[2]*conjugate(psi(x, t)[2])*conjugate(lambda[2]), (4, 4) = `&epsilon;`[1]*conjugate(psi(x, t)[2])*conjugate(lambda[2])})

(9)

H13:=H[1].Lambda[1].Lambda[1];

Matrix(4, 4, {(1, 1) = `&epsilon;`[1]*phi(x, t)[1]*lambda[1]^2, (1, 2) = conjugate(`&epsilon;`[2])*phi(x, t)[1]*lambda[1]^2, (1, 3) = conjugate(chi(x, t)[1])*conjugate(lambda[1])^2, (1, 4) = 0, (2, 1) = `&epsilon;`[2]*psi(x, t)[1]*lambda[1]^2, (2, 2) = -conjugate(`&epsilon;`[1])*psi(x, t)[1]*lambda[1]^2, (2, 3) = 0, (2, 4) = conjugate(rho(x, t)[1])*conjugate(lambda[1])^2, (3, 1) = -chi(x, t)[1]*lambda[1]^2, (3, 2) = 0, (3, 3) = conjugate(`&epsilon;`[1])*conjugate(phi(x, t)[1])*conjugate(lambda[1])^2, (3, 4) = conjugate(`&epsilon;`[2])*conjugate(phi(x, t)[1])*conjugate(lambda[1])^2, (4, 1) = 0, (4, 2) = rho(x, t)[1]*lambda[1]^2, (4, 3) = -`&epsilon;`[2]*conjugate(psi(x, t)[1])*conjugate(lambda[1])^2, (4, 4) = `&epsilon;`[1]*conjugate(psi(x, t)[1])*conjugate(lambda[1])^2})

(10)

H14:=H[2].Lambda[2].Lambda[2];

Matrix(4, 4, {(1, 1) = `&epsilon;`[1]*phi(x, t)[2]*lambda[2]^2, (1, 2) = conjugate(`&epsilon;`[2])*phi(x, t)[2]*lambda[2]^2, (1, 3) = conjugate(chi(x, t)[2])*conjugate(lambda[2])^2, (1, 4) = 0, (2, 1) = `&epsilon;`[2]*psi(x, t)[2]*lambda[2]^2, (2, 2) = -conjugate(`&epsilon;`[1])*psi(x, t)[2]*lambda[2]^2, (2, 3) = 0, (2, 4) = conjugate(rho(x, t)[2])*conjugate(lambda[2])^2, (3, 1) = -chi(x, t)[2]*lambda[2]^2, (3, 2) = 0, (3, 3) = conjugate(`&epsilon;`[1])*conjugate(phi(x, t)[2])*conjugate(lambda[2])^2, (3, 4) = conjugate(`&epsilon;`[2])*conjugate(phi(x, t)[2])*conjugate(lambda[2])^2, (4, 1) = 0, (4, 2) = rho(x, t)[2]*lambda[2]^2, (4, 3) = -`&epsilon;`[2]*conjugate(psi(x, t)[2])*conjugate(lambda[2])^2, (4, 4) = `&epsilon;`[1]*conjugate(psi(x, t)[2])*conjugate(lambda[2])^2})

(11)

H115:=Matrix([H[1],H[2]]);

Matrix(4, 8, {(1, 1) = `&epsilon;`[1]*phi(x, t)[1], (1, 2) = conjugate(`&epsilon;`[2])*phi(x, t)[1], (1, 3) = conjugate(chi(x, t)[1]), (1, 4) = 0, (1, 5) = `&epsilon;`[1]*phi(x, t)[2], (1, 6) = conjugate(`&epsilon;`[2])*phi(x, t)[2], (1, 7) = conjugate(chi(x, t)[2]), (1, 8) = 0, (2, 1) = `&epsilon;`[2]*psi(x, t)[1], (2, 2) = -conjugate(`&epsilon;`[1])*psi(x, t)[1], (2, 3) = 0, (2, 4) = conjugate(rho(x, t)[1]), (2, 5) = `&epsilon;`[2]*psi(x, t)[2], (2, 6) = -conjugate(`&epsilon;`[1])*psi(x, t)[2], (2, 7) = 0, (2, 8) = conjugate(rho(x, t)[2]), (3, 1) = -chi(x, t)[1], (3, 2) = 0, (3, 3) = conjugate(`&epsilon;`[1])*conjugate(phi(x, t)[1]), (3, 4) = conjugate(`&epsilon;`[2])*conjugate(phi(x, t)[1]), (3, 5) = -chi(x, t)[2], (3, 6) = 0, (3, 7) = conjugate(`&epsilon;`[1])*conjugate(phi(x, t)[2]), (3, 8) = conjugate(`&epsilon;`[2])*conjugate(phi(x, t)[2]), (4, 1) = 0, (4, 2) = rho(x, t)[1], (4, 3) = -`&epsilon;`[2]*conjugate(psi(x, t)[1]), (4, 4) = `&epsilon;`[1]*conjugate(psi(x, t)[1]), (4, 5) = 0, (4, 6) = rho(x, t)[2], (4, 7) = -`&epsilon;`[2]*conjugate(psi(x, t)[2]), (4, 8) = `&epsilon;`[1]*conjugate(psi(x, t)[2])})

(12)

H15:=Matrix([H11,H12]);

Matrix(4, 8, {(1, 1) = `&epsilon;`[1]*phi(x, t)[1]*lambda[1], (1, 2) = conjugate(`&epsilon;`[2])*phi(x, t)[1]*lambda[1], (1, 3) = conjugate(chi(x, t)[1])*conjugate(lambda[1]), (1, 4) = 0, (1, 5) = `&epsilon;`[1]*phi(x, t)[2]*lambda[2], (1, 6) = conjugate(`&epsilon;`[2])*phi(x, t)[2]*lambda[2], (1, 7) = conjugate(chi(x, t)[2])*conjugate(lambda[2]), (1, 8) = 0, (2, 1) = `&epsilon;`[2]*psi(x, t)[1]*lambda[1], (2, 2) = -conjugate(`&epsilon;`[1])*psi(x, t)[1]*lambda[1], (2, 3) = 0, (2, 4) = conjugate(rho(x, t)[1])*conjugate(lambda[1]), (2, 5) = `&epsilon;`[2]*psi(x, t)[2]*lambda[2], (2, 6) = -conjugate(`&epsilon;`[1])*psi(x, t)[2]*lambda[2], (2, 7) = 0, (2, 8) = conjugate(rho(x, t)[2])*conjugate(lambda[2]), (3, 1) = -chi(x, t)[1]*lambda[1], (3, 2) = 0, (3, 3) = conjugate(`&epsilon;`[1])*conjugate(phi(x, t)[1])*conjugate(lambda[1]), (3, 4) = conjugate(`&epsilon;`[2])*conjugate(phi(x, t)[1])*conjugate(lambda[1]), (3, 5) = -chi(x, t)[2]*lambda[2], (3, 6) = 0, (3, 7) = conjugate(`&epsilon;`[1])*conjugate(phi(x, t)[2])*conjugate(lambda[2]), (3, 8) = conjugate(`&epsilon;`[2])*conjugate(phi(x, t)[2])*conjugate(lambda[2]), (4, 1) = 0, (4, 2) = rho(x, t)[1]*lambda[1], (4, 3) = -`&epsilon;`[2]*conjugate(psi(x, t)[1])*conjugate(lambda[1]), (4, 4) = `&epsilon;`[1]*conjugate(psi(x, t)[1])*conjugate(lambda[1]), (4, 5) = 0, (4, 6) = rho(x, t)[2]*lambda[2], (4, 7) = -`&epsilon;`[2]*conjugate(psi(x, t)[2])*conjugate(lambda[2]), (4, 8) = `&epsilon;`[1]*conjugate(psi(x, t)[2])*conjugate(lambda[2])})

(13)

H116:=Matrix([[H115],[H15]]);

Matrix(8, 8, {(1, 1) = `&epsilon;`[1]*phi(x, t)[1], (1, 2) = conjugate(`&epsilon;`[2])*phi(x, t)[1], (1, 3) = conjugate(chi(x, t)[1]), (1, 4) = 0, (1, 5) = `&epsilon;`[1]*phi(x, t)[2], (1, 6) = conjugate(`&epsilon;`[2])*phi(x, t)[2], (1, 7) = conjugate(chi(x, t)[2]), (1, 8) = 0, (2, 1) = `&epsilon;`[2]*psi(x, t)[1], (2, 2) = -conjugate(`&epsilon;`[1])*psi(x, t)[1], (2, 3) = 0, (2, 4) = conjugate(rho(x, t)[1]), (2, 5) = `&epsilon;`[2]*psi(x, t)[2], (2, 6) = -conjugate(`&epsilon;`[1])*psi(x, t)[2], (2, 7) = 0, (2, 8) = conjugate(rho(x, t)[2]), (3, 1) = -chi(x, t)[1], (3, 2) = 0, (3, 3) = conjugate(`&epsilon;`[1])*conjugate(phi(x, t)[1]), (3, 4) = conjugate(`&epsilon;`[2])*conjugate(phi(x, t)[1]), (3, 5) = -chi(x, t)[2], (3, 6) = 0, (3, 7) = conjugate(`&epsilon;`[1])*conjugate(phi(x, t)[2]), (3, 8) = conjugate(`&epsilon;`[2])*conjugate(phi(x, t)[2]), (4, 1) = 0, (4, 2) = rho(x, t)[1], (4, 3) = -`&epsilon;`[2]*conjugate(psi(x, t)[1]), (4, 4) = `&epsilon;`[1]*conjugate(psi(x, t)[1]), (4, 5) = 0, (4, 6) = rho(x, t)[2], (4, 7) = -`&epsilon;`[2]*conjugate(psi(x, t)[2]), (4, 8) = `&epsilon;`[1]*conjugate(psi(x, t)[2]), (5, 1) = `&epsilon;`[1]*phi(x, t)[1]*lambda[1], (5, 2) = conjugate(`&epsilon;`[2])*phi(x, t)[1]*lambda[1], (5, 3) = conjugate(chi(x, t)[1])*conjugate(lambda[1]), (5, 4) = 0, (5, 5) = `&epsilon;`[1]*phi(x, t)[2]*lambda[2], (5, 6) = conjugate(`&epsilon;`[2])*phi(x, t)[2]*lambda[2], (5, 7) = conjugate(chi(x, t)[2])*conjugate(lambda[2]), (5, 8) = 0, (6, 1) = `&epsilon;`[2]*psi(x, t)[1]*lambda[1], (6, 2) = -conjugate(`&epsilon;`[1])*psi(x, t)[1]*lambda[1], (6, 3) = 0, (6, 4) = conjugate(rho(x, t)[1])*conjugate(lambda[1]), (6, 5) = `&epsilon;`[2]*psi(x, t)[2]*lambda[2], (6, 6) = -conjugate(`&epsilon;`[1])*psi(x, t)[2]*lambda[2], (6, 7) = 0, (6, 8) = conjugate(rho(x, t)[2])*conjugate(lambda[2]), (7, 1) = -chi(x, t)[1]*lambda[1], (7, 2) = 0, (7, 3) = conjugate(`&epsilon;`[1])*conjugate(phi(x, t)[1])*conjugate(lambda[1]), (7, 4) = conjugate(`&epsilon;`[2])*conjugate(phi(x, t)[1])*conjugate(lambda[1]), (7, 5) = -chi(x, t)[2]*lambda[2], (7, 6) = 0, (7, 7) = conjugate(`&epsilon;`[1])*conjugate(phi(x, t)[2])*conjugate(lambda[2]), (7, 8) = conjugate(`&epsilon;`[2])*conjugate(phi(x, t)[2])*conjugate(lambda[2]), (8, 1) = 0, (8, 2) = rho(x, t)[1]*lambda[1], (8, 3) = -`&epsilon;`[2]*conjugate(psi(x, t)[1])*conjugate(lambda[1]), (8, 4) = `&epsilon;`[1]*conjugate(psi(x, t)[1])*conjugate(lambda[1]), (8, 5) = 0, (8, 6) = rho(x, t)[2]*lambda[2], (8, 7) = -`&epsilon;`[2]*conjugate(psi(x, t)[2])*conjugate(lambda[2]), (8, 8) = `&epsilon;`[1]*conjugate(psi(x, t)[2])*conjugate(lambda[2])})

(14)

NULLH16:=Matrix([H13,H14]);

Matrix(%id = 36893490284340821276)

(15)

Hnew := Matrix([[H116[1 .. 6, () .. ()]], [H16[1, () .. ()]], [H116[8, () .. ()]]])

Matrix(%id = 36893490284313909236)

(16)

``

NULL

 

NULL


 

Download matrixop-1.mw

A is the name of the vector.

A[1]:=5

 

In you other equation. use A[1]....  C[1]... not a[1]... c[1]...

There are two basic ways to do this. 1st extend a list. This is highly ineffecient when the list grows long as Maple creats copies of the list.

 The better way is to use a programmable Array( ) as opposed to Array[ ]

I have shown both is the attached.
 

restart

NULL

This is an example as I do not know how you achieved you results. There are two basic ways.

NULL

L := [1, 2]

[1, 2]

(1)

[op(L), 6]

[1, 2, 6]

(2)

L := []

[]

(3)

``

for i to 10 do L := [op(L), i^2] end do

[1, 4, 9, 16, 25, 36, 49, 64, 81, 100]

(4)

L

[1, 4, 9, 16, 25, 36, 49, 64, 81, 100]

(5)

A := Array()

Array(%id = 36893491269490332364)

(6)

"for i to 10 do  A(i):=i^(2);  end do"

Array(%id = 36893491269490332364)

(7)

 

A

Array(%id = 36893491269490332364)

(8)

NULL


 

Download 27-3-22_A_add_to_Array_or_List.mw

Edit:- @max125 correctly pointed out I missed the minus sign in front of the x^2. I posted the revised answer in the reply to him.

Look at this and see if that is what you want.

restart

with(RealDomain)

[Im, Re, `^`, arccos, arccosh, arccot, arccoth, arccsc, arccsch, arcsec, arcsech, arcsin, arcsinh, arctan, arctanh, cos, cosh, cot, coth, csc, csch, eval, exp, expand, limit, ln, log, sec, sech, signum, simplify, sin, sinh, solve, sqrt, surd, tan, tanh]

(1)

f := proc (x) options operator, arrow; 6-sqrt(x^2+8*x+9) end proc

proc (x) options operator, arrow; 6-RealDomain:-sqrt(RealDomain:-`^`(x, 2)+8*x+9) end proc

(2)

g := unapply(diff(f(x), x), x)

proc (x) options operator, arrow; -(1/2)*(2*x+8)/(x^2+8*x+9)^(1/2) end proc

(3)

plot([f(x), g(x)])

 

rts := solve(f(x))

-4+43^(1/2), -4-43^(1/2)

(4)

evalf(%)

2.557438524, -10.55743852

(5)

l1 := int(f(x), x = 0 .. rts[1])

-18-(7/2)*ln(7)+3*43^(1/2)+(7/2)*ln(43^(1/2)+6)

(6)

evalf(%)

3.717726254

(7)

L := l1-(int(f(x), x = rts[1] .. k)) = 10

-18-(7/2)*ln(7)+3*43^(1/2)+(7/2)*ln(43^(1/2)+6)-(int(6-(x^2+8*x+9)^(1/2), x = -4+43^(1/2) .. k)) = 10

(8)

l2 := `assuming`([int(f(x), x = rts[1] .. k)], [k > rts[1]])

24-3*43^(1/2)-(7/2)*ln(43^(1/2)+6)+6*k-(1/2)*(k^2+8*k+9)^(1/2)*k-2*(k^2+8*k+9)^(1/2)+(7/2)*ln(k+4+(k^2+8*k+9)^(1/2))

(9)

k := fsolve(l1-l2 = 10, k)

5.988384673

(10)

l2

22.24613803-3*43^(1/2)-(7/2)*ln(43^(1/2)+6)

(11)

evalf(%)

-6.282273744

(12)

evalf(l1-l2)

10.00000000

(13)

NULL

Download 23-3-22_A_integration.mw

 If you are using windows

Always with this programs like Maple I install them using the hidden administrator account in windows. i learn't this the hard way using the Solidworks CAD systtem. 

When I first used Maple in 2012 I forgot to do the above and had all sorts of problems until I reinstalled as above. 

Might help.

2 3 4 5 6 7 8 Page 4 of 9