Adam Ledger

Ask a Question

Create a Post

Name: Mr. Adam Ledger

11 Badges

Member for: 9 years, 127 days

Company/Institution: unemployed

Title: hobo

Location: Perth, Australia

Social Networks and Content at Maplesoft.com

Contact Adam Ledger

MaplePrimes Activity

These are questions asked by Adam Ledger

iteration question again...

Asked: Adam Ledger 360 Product: Maple

September 24 2017

2 3

As can be seen in the example i have shown below, i have iterated the "collect" function a number of times as required for the number of distinct terms. Can someone please show me how i would specify that i would like to iterate a particular function 'N' times in the same manner i have done only 3 times in the example, ie suppose instead of the 3 variables i wish to collect for here (a[0],a[1],a[2]) i now must do so for another definition of F that has 'N' variables (a[0],a[1],a[2],....a[N])

(1)

[factor(op(1, collect(collect(collect(F, a[0]), a[1]), a[2]))/a[2]), factor(op(2, collect(collect(collect(F, a[0]), a[1]), a[2]))/a[1]), factor(op(3, collect(collect(collect(F, a[0]), a[1]), a[2]))/a[0])]

(2)

Download Asking_Again_About_iterations.mw

iterated try-catch code...

Asked: Adam Ledger 360 Product: Maple

September 22 2017

1 1

What i am trying to achieve is to evaluate the sequence as, shown, but from within a try-catch statement that handles and keeps a tally on the number and arguements for which the sequence encounters a division by zero error. ie, instead of haulting evaluation when each error is encountered, i want my code to record the index values at which the error occured, then continue on to the next term.

F := (-2*n[1]*n[3]-4*n[2]*n[1]*n[3]+4*n[2]*n[3]+4*n[3]*n[4]*n[1]+n[1])/(-n[1]-2*n[2]*n[1]+2*n[2]+2*n[4]*n[1]):

S := proc (N, M, G, L) options operator, arrow; [seq(seq(seq(seq(F, n[1] = N .. N), n[2] = M .. M), n[3] = G .. G), n[4] = L .. L)] end proc

proc (N, M, G, L) options operator, arrow; [seq(seq(seq(seq(F, n[1] = N .. N), n[2] = M .. M), n[3] = G .. G), n[4] = L .. L)] end proc

(1)

(2)

(3)

try S(K[1], K[2], K[3], K[4]) catch "numeric exception: division by zero": E := E+1; `union`({[K[1], K[2], K[3], K[4]]}, A) end try

(4)

(5)

try S(K[1], K[2], K[3], K[4]) catch "numeric exception: division by zero": E := E+1; `union`({[K[1], K[2], K[3], K[4]]}, A) end try

(6)

(7)

try S(K[1], K[2], K[3], K[4]) catch "numeric exception: division by zero": E := E+1; `union`({[K[1], K[2], K[3], K[4]]}, A) end try

(8)

(9)

try S(K[1], K[2], K[3], K[4]) catch "numeric exception: division by zero": E := E+1; `union`({[K[1], K[2], K[3], K[4]]}, A) end try

(10)

Download PLEASE_HELP_MAPLE.mw

mod function help needed...

Asked: Adam Ledger 360 Product: Maple

September 11 2017

2 6

please see attachment and explain why the output of the 2nd line is not 0

Download mod_maple_help.mw

Project Assistance needed...

Asked: Adam Ledger 360 Product: Maple

September 09 2017

0 3

I have a few "regular practices" on the interface that i want to implement into conjecturing automata, and i would really really be super appreciative if i can interface it with simon's/maplsoft's inverse symbollic calculator, the only problem really is the HTTP aspect is going to ( im assuming) need certain information only known to the people who brought the symbolliic calc online. So thats my question / request for help

number type place holders for Solve...

Asked: Adam Ledger 360 Product: Maple

September 07 2017

1 2

_z i believe is the placeholder when Solve is intending to indicate a restriction to any integer value only, for one of my recent projects im getting the placholder "_L" in my solutions, and would like to know where the reference table is for the full list of these global in built variable types if possible, have not been able to find it in the help interface and did sincerely look

First