Adam Ledger

Mr. Adam Ledger

360 Reputation

11 Badges

9 years, 126 days
unemployed
hobo
Perth, Australia

Social Networks and Content at Maplesoft.com

MaplePrimes Activity


These are replies submitted by Adam Ledger

@vv  Can I please have references to study material relevant to the mapping of the function to the set of  data points  that is plotted for this semilog plot

@Preben Alsholm 

yes this output looks correct thankyou.

@Preben Alsholm 

 

Yes i am using maple 16. Yes my thought of it being a bug was entirely based on the fact that the output was non-sensical.How can the summation index being present without the summation be correct?

@brian bovril  ok i did try it but it generally says "invalid input" for everything so if you can ask tom what the issue might be that would be greatly appreciated. I'm sure if you name drop me he will immediately make it his top priority

@Markiyan Hirnyk  ok well thank you for that also

@Markiyan Hirnyk ok much appreciated thank you.

@Kitonum well im glad everyone else calls them nested sequences too! but yes thanks for that, would have taken me forever to get there i would never have thought of using subs, i just had seq inside foldl.

i would probably learn alot by figuring out why this works and every thing else i tried doesn't. But anyway much appreciated.

 

I havent used other software to make a comparison, but in my personal experience one of the most powerful aspects of maple lies in the user's ability to analytically explore integer conjectures and patterns of complexity that are, for the honest, beyond comprehension without that assistance that software provides.

 

Anyway attached is the introduction for one such projects that im occupied with, feel free to tell me when i have been unclear or have said something stupid.

 

Thanks again, Adam.presentation_format_fermat_3_Tri_lagrange_four_square.mw

 

Edit:

Regarding that link, i used to collect my train tickets too! but i had my own set of rules, things like that are not common place in Australia. And those explicit integral formulas are actually very clever and insightful indeed, on many more levels than just a game with tickets, in my opinion i mean.

@Daniel Skoog  great thanks i should be able to figure out how to get them back from here

@Carl Love  a procedural algorithm that ideally uses https://oeis.org/ and https://isc.carma.newcastle.edu.au/advancedCalc but that calc throws a 404 if you open the link from any other domain other than google home page search listings btw. ie when my bot observes a sequence it doesnt know it stores it with a unique id, calls neil Sloane's bot up and reads what it  has stored for an algebraically identically formed database entry found upon posting a query to in his encyclopedia ,and  for irrational and trancendental or other real constants are evaluated to a float approximation, and the inverse symbollic calculator is queried and the recieved data consolidated in my data base. data theft basically .

@Kitonum great yep this is exactly what i needed thankyou

@Kitonum ok this looks close to what i am trying to do, ill give it a try.

@John Fredsted thanks yes i guess i am looking for a way to do this in a generic sense because my style of code in maple very often involves the need for a procedure that iterates a function "Y" (in this case collect) "N" times (here N=3) and so i wanted to develop a proc(Y,N) as such.

@tomleslie  ok thanks yep ive got it running again it was really frustrating because i had it running using rand(A..B) to generate the initial sets but in the back of my mind i kept thinking you really want to be systematically sifting thru every parameterization possible, why are you using rand but it was the only way it worked until now
 

restart

with(Statistics):

``

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

R := 0

A := {}; -1; U := 0; -1; K := 0; -1; E := 0

J := R

H := J+1

K[1] := J+H:

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

J := R

H := J+1

K[1] := J:

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

J := R

H := J+1

K[1] := J:

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

J := R

H := J+1

K[1] := J:

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

``

``

R := 0

A := {}; U := 0; K := 0; E := 0

J := R

H := J+1

K[1] := J+H; K[2] := J; K[3] := J; K[4] := J

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

J := R

H := J+1

K[1] := J; K[2] := J+H; K[3] := J; K[4] := J

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

J := R

H := J+1

K[1] := J; K[2] := J; K[3] := J+H; K[4] := J

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

J := R

H := J+1

K[1] := J; K[2] := J; K[3] := J; K[4] := J+H

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

R := 0

A := {}; U := 0; K := 0; E := 0

J := R

H := J+1

K[1] := J+H; K[2] := J; K[3] := J; K[4] := J

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

J := R

H := J+1

K[1] := J; K[2] := J+H; K[3] := J; K[4] := J

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

J := R

H := J+1

K[1] := J; K[2] := J; K[3] := J+H; K[4] := J

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

J := R

H := J+1

K[1] := J; K[2] := J; K[3] := J; K[4] := J+H

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

NULL

NULL

R := 0

A := {}; U := 0; K := 0; E := 0

J := R

H := J+1

K[1] := J+H; K[2] := J; K[3] := J; K[4] := J

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

J := R

H := J+1

K[1] := J; K[2] := J+H; K[3] := J; K[4] := J

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

J := R

H := J+1

K[1] := J; K[2] := J; K[3] := J+H; K[4] := J

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

J := R

H := J+1

K[1] := J; K[2] := J; K[3] := J; K[4] := J+H

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

``

R := 0

A := {}; U := 0; K := 0; E := 0

J := R

H := J+1

K[1] := J+H; K[2] := J; K[3] := J; K[4] := J

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

J := R

H := J+1

K[1] := J; K[2] := J+H; K[3] := J; K[4] := J

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

J := R

H := J+1

K[1] := J; K[2] := J; K[3] := J+H; K[4] := J

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

J := R

H := J+1

K[1] := J; K[2] := J; K[3] := J; K[4] := J+H

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

NULL

NULL

R := 0

A := {}; U := 0; K := 0; E := 0

J := R

H := J+1

K[1] := J+H; K[2] := J; K[3] := J; K[4] := J

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

J := R

H := J+1

K[1] := J; K[2] := J+H; K[3] := J; K[4] := J

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

J := R

H := J+1

K[1] := J; K[2] := J; K[3] := J+H; K[4] := J

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

J := R

H := J+1

K[1] := J; K[2] := J; K[3] := J; K[4] := J+H

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

``


 

Download PLEASE_HELP_MAPLE.mw

@Carl Love is there any chance of you being able to provide me with brief example in a .mw?

@Carl Love . Yes. a process in the automata schematics ideally will require a step that posts queries and recieves data from the calculator at  https://isc.carma.newcastle.edu.au/ i mean yes in turn, it will be generating its own database of float evaluations and performing that step in a self sufficient manner, but it would probably take a very long time to accumulate to the quantity of data they  must have built up in a database for that calculator, so, its of course going to make things much easier and more effective if i can interact with that one.

First 16 17 18 19 20 21 22 Last Page 18 of 30