Adam Ledger

Mr. Adam Ledger

335 Reputation

11 Badges

4 years, 246 days
unemployed
hobo
Perth, Australia

Social Networks and Content at Maplesoft.com

MaplePrimes Activity


These are questions asked by Adam Ledger

Ok the error message I originally recieved in requesting 'expression' rather than 'value' was telling me the input is ambigous, isn't exactly helpful.

With the uploaded worksheet as last attempted, it gives the error of something about an invalid sequence, but still and I honestly do not see how when MathML is an XML application, surely whatever is put into the math container is retrievable considering XML applications are based on just handling the rendering of symbols.

 

Anyway I can only post here seeings that following the link for error messages rarely opens an actual help page in the brower, it simply tells you there is no help page for that error.

 


 

MathML[ImportModified](DocumentTools[GetProperty]('IIRN_CONTENT15', 'value'))

Error, (in MathML:-ImportModified) Typesetting:-merror("invalid sequence")

 

MathML[ImportModified](DocumentTools[GetProperty]('IIRN15', 'value'));

808066846690

(1)

 

``


 

Download 26052018.mw

Ok so i have entered the code as follows for my input dialog, but I do not want to vary the size of the window, rather the size of the text window inside the dialog window that the student is prompted to enter a paragraph that is related to an algebraic expression in the adjacent container. I cannot see this option available in the help page for the maplet, so i was just wondering if there is a more appropriate choice of maplet i can use that will enable me to do this. 

> with(Maplets[Elements]); OpenCommentaryDialog := Maplet(InputDialog['ID1']("Enter comments relevant to the expression assigned for this IIRF", 'onapprove' = Shutdown(['ID1']), 'oncancel' = Shutdown(), resizable = true, width = 1000, height = 1000));
> Maplets[Display](OpenCommentaryDialog);
 

I also want the text content the student enters to be able to be passed to a data structure that stores all comments made for all expressions in the worksheet, again I was unable to find how to do this on the help page

Ok so as title says that is what i need, or the process of changing the document property listing that is generated when i start a new worksheet. 

 

The reason being is that of course the obvious solution is for me to have a personalized template for a worksheet with the desired attribute listing, which i have, but the trouble is i have already generated a large number of archive entries in a database or "library" of worksheets that i am building that have the standard attribute listing, and for the new functionality that i have chosen i rely on having the specific custom attribute listing for the new template, and i want to implement this functionality into use for the existing database entries as well as the future ones created, without having to copy and paste things for each of the existing entries for the obvious reason that this is boring and annoying

I figured out what the interpolation is, but can someone please give me a reference for the publication of the person that discovered that this works thankyou. 

 


 

PolyI1 := proc (N, n) options operator, arrow; (-1)^N*(sum(n*factorial(n-1)*(-1)^k*a[k]/(factorial(n-N-1)*(n-k)*factorial(k)*factorial(N-k)), k = 0 .. N)) end proc

proc (N, n) options operator, arrow; (-1)^N*(sum(n*factorial(n-1)*(-1)^k*a[k]/(factorial(n-N-1)*(n-k)*factorial(k)*factorial(N-k)), k = 0 .. N)) end proc

(1)

PolyI2 := proc (N, n) options operator, arrow; CurveFitting[PolynomialInterpolation]([seq([k, a[k]], k = 0 .. N)], n) end proc

proc (N, n) options operator, arrow; CurveFitting[PolynomialInterpolation]([seq([k, a[k]], k = 0 .. N)], n) end proc

(2)

collect(expand(PolyI1(2, n)), n); PolyI2(2, n)

((1/2)*a[2]-a[1]+(1/2)*a[0])*n^2+(-(1/2)*a[2]+2*a[1]-(3/2)*a[0])*n+a[0]

 

((1/2)*a[2]-a[1]+(1/2)*a[0])*n^2+(-(1/2)*a[2]+2*a[1]-(3/2)*a[0])*n+a[0]

(3)

collect(expand(PolyI1(3, n)), n); PolyI2(3, n)

((1/6)*a[3]-(1/2)*a[2]+(1/2)*a[1]-(1/6)*a[0])*n^3+(-(1/2)*a[3]+a[0]-(5/2)*a[1]+2*a[2])*n^2+(-(3/2)*a[2]+(1/3)*a[3]-(11/6)*a[0]+3*a[1])*n+a[0]

 

((1/6)*a[3]-(1/2)*a[2]+(1/2)*a[1]-(1/6)*a[0])*n^3+(-(1/2)*a[3]+a[0]-(5/2)*a[1]+2*a[2])*n^2+(-(3/2)*a[2]+(1/3)*a[3]-(11/6)*a[0]+3*a[1])*n+a[0]

(4)

collect(expand(PolyI1(4, n)), n); PolyI2(4, n)

(-(1/6)*a[1]+(1/4)*a[2]-(1/6)*a[3]+(1/24)*a[0]+(1/24)*a[4])*n^4+(-(5/12)*a[0]+(3/2)*a[1]-2*a[2]+(7/6)*a[3]-(1/4)*a[4])*n^3+((35/24)*a[0]-(13/3)*a[1]+(19/4)*a[2]-(7/3)*a[3]+(11/24)*a[4])*n^2+(-(25/12)*a[0]-(1/4)*a[4]+4*a[1]-3*a[2]+(4/3)*a[3])*n+a[0]

 

(-(1/6)*a[1]+(1/4)*a[2]-(1/6)*a[3]+(1/24)*a[0]+(1/24)*a[4])*n^4+(-(5/12)*a[0]+(3/2)*a[1]-2*a[2]+(7/6)*a[3]-(1/4)*a[4])*n^3+((35/24)*a[0]-(13/3)*a[1]+(19/4)*a[2]-(7/3)*a[3]+(11/24)*a[4])*n^2+(-(25/12)*a[0]-(1/4)*a[4]+4*a[1]-3*a[2]+(4/3)*a[3])*n+a[0]

(5)

collect(expand(PolyI1(5, n)), n); PolyI2(5, n)

((1/12)*a[3]-(1/120)*a[0]+(1/24)*a[1]-(1/12)*a[2]-(1/24)*a[4]+(1/120)*a[5])*n^5+(-a[3]+(11/24)*a[4]+(1/8)*a[0]-(7/12)*a[1]+(13/12)*a[2]-(1/12)*a[5])*n^4+((49/12)*a[3]-(41/24)*a[4]+(7/24)*a[5]-(17/24)*a[0]+(71/24)*a[1]-(59/12)*a[2])*n^3+((15/8)*a[0]-(13/2)*a[3]+(61/24)*a[4]-(5/12)*a[5]-(77/12)*a[1]+(107/12)*a[2])*n^2+(-(137/60)*a[0]+5*a[1]+(10/3)*a[3]-(5/4)*a[4]+(1/5)*a[5]-5*a[2])*n+a[0]

 

((1/12)*a[3]-(1/120)*a[0]+(1/24)*a[1]-(1/12)*a[2]-(1/24)*a[4]+(1/120)*a[5])*n^5+(-a[3]+(11/24)*a[4]+(1/8)*a[0]-(7/12)*a[1]+(13/12)*a[2]-(1/12)*a[5])*n^4+((49/12)*a[3]-(41/24)*a[4]+(7/24)*a[5]-(17/24)*a[0]+(71/24)*a[1]-(59/12)*a[2])*n^3+((15/8)*a[0]-(13/2)*a[3]+(61/24)*a[4]-(5/12)*a[5]-(77/12)*a[1]+(107/12)*a[2])*n^2+(-(137/60)*a[0]+5*a[1]+(10/3)*a[3]-(5/4)*a[4]+(1/5)*a[5]-5*a[2])*n+a[0]

(6)

NULL


 

Download 21052018002.mw

Tonight I came across something that OEIS had referenced as the maximum fermi dirac divisor of a number, so i decided it might be a good idea to study this concept by first figuring out how to enumerate the subset of these divisors.

But rather than specifically about this subject, i wanted to ask if my way of "enumeration of numbers meeting specific criteria" is inferior to other methods i have seen. For example this guy named Alois Heinz uses select in the following manner to obtain  the least divisor of a number that is greater than it's square root:

 

Where as I have always been constructing piecewise expressions as seen in the example of what i have been doing tonight:


 

with(numtheory):

`&Fscr;` := proc (n) options operator, arrow; {seq(seq(piecewise(frac(ln(ln(divisors(n)[k])/ln(ithprime(j)))/ln(2)) = 0 and divisors(n)[k] <> 1 and divisors(n)[k] <> 2, divisors(n)[k], NULL), j = 1 .. pi(divisors(n)[k])), k = 1 .. nops(divisors(n)))} end proc

`&Fscr;`(200000)

{4, 5, 16, 25, 625}

(1)

``


 

Download 21052018.mw

 

So basically, because it is very hard for me to break habits once i have formed them, my question is, is it going to be beneficial for me to switch to this persons method of enumeration, or am i ok just to continue my way?

 

 

First 13 14 15 16 17 18 19 Last Page 15 of 34