Adam Ledger

Mr. Adam Ledger

360 Reputation

11 Badges

9 years, 129 days
unemployed
hobo
Perth, Australia

Social Networks and Content at Maplesoft.com

MaplePrimes Activity


These are replies submitted by Adam Ledger

@Math Pi Euler you dont need a substitution at all it really serves no purpose there. 

And remember that by typing EquationX=something you are actually saying LHS(EquationX)=RHS(EquationX)=0, so yes remember that the equality is a binary relation, meaning you can never have more than one equals symbol for a given equation, otherwise it will not be a logically sound statement and cannot be used in a system of algebraic equations.

 

You can list LHS(EquationX)=0 and RHS(EquationX)=0 as separate equations in you system to be solved, but this renders having declared EquationX in the first place a  completely pointless statement.

                           

Come on ... unknown uses an argument "x"?

Then showstat says it isnt even a procedure? 

Are you telling me maple doesnt know the name of a procedure it just called? 

Can i please have an opportunity look at all neccessary code before being accused of not entering all required arguments for thaw?  

And why that sneaky little pair of empty brackets like is necessary to implement rand() into procedures that use eval?


 

restart

X := proc (A, B) options operator, arrow; (`mod`((`mod`(A, n))*(`mod`(B, n)), n))((`mod`(A, n))*(`mod`(B, n))) end proc

Y := proc (A, B) options operator, arrow; (`mod`((`mod`(A, n))*(`mod`(B, n)), n))*(`mod`(A, n))*(`mod`(B, n)) end proc

is(X(A, B) <> Y(A, B))

is((`mod`((`mod`(A, n))*(`mod`(B, n)), n))((`mod`(A, n))*(`mod`(B, n))) <> (`mod`((`mod`(A, n))*(`mod`(B, n)), n))*(`mod`(A, n))*(`mod`(B, n)))

A := (rand(1 .. 100))(); B := (rand(1 .. 100))(); n := (rand(1 .. 100))()

is((`mod`((`mod`(A, n))*(`mod`(B, n)), n))((`mod`(A, n))*(`mod`(B, n))) <> (`mod`((`mod`(A, n))*(`mod`(B, n)), n))*(`mod`(A, n))*(`mod`(B, n)))

is(X(A, B) <> Y(A, B))

restart

X := proc (A, B) options operator, arrow; (eval(`mod`((`mod`(A, n))*(`mod`(B, n)), n)))*%((`mod`(A, n))*(`mod`(B, n))) end proc:

Y := proc (A, B) options operator, arrow; (`mod`((`mod`(A, n))*(`mod`(B, n)), n))*(`mod`(A, n))*(`mod`(B, n)) end proc:

is((`mod`((`mod`(A, n))*(`mod`(B, n)), n))*%((`mod`(A, n))*(`mod`(B, n))) <> (`mod`((`mod`(A, n))*(`mod`(B, n)), n))*(`mod`(A, n))*(`mod`(B, n)))

FAIL

(1)

A := (rand(1 .. 100))():

is(eval((`mod`((`mod`(A, n))*(`mod`(B, n)), n))*%((`mod`(A, n))*(`mod`(B, n)))) <> (`mod`((`mod`(A, n))*(`mod`(B, n)), n))*(`mod`(A, n))*(`mod`(B, n)))

true

(2)

is(X(A, B) <> Y(A, B))

Error, (in type/realcons) invalid input: unknown uses a 1st argument, x, which is missing

 

showstat(type)

Error, (in showstat) cannot debug built-in functions

 

showstat(unknown)

Error, (in showstat) procedure name expected

 

``


 

Download helpPlz2.mw

@Preben Alsholm 

 

Its more that i cannot understand why they are different values when evaluated like i would like to see someone perform the step by step computation

@Christopher2222 

I am more confused as to why these lines give different values when their only difference is a product operator being present in the second line but not the first, any other X*Y=XY in this circumstance where as here it does not, its an interesting property of the operator modulo n


 

restart

X := proc (A, B) options operator, arrow; (`mod`((`mod`(A, n))*(`mod`(B, n)), n))((`mod`(A, n))*(`mod`(B, n))) end proc:

Y := proc (A, B) options operator, arrow; (`mod`((`mod`(A, n))*(`mod`(B, n)), n))*(`mod`(A, n))*(`mod`(B, n)) end proc:

is(X(A, B) <> Y(A, B))

false

(1)

is((`mod`((`mod`(A, n))*(`mod`(B, n)), n))((`mod`(A, n))*(`mod`(B, n))) <> (`mod`((`mod`(A, n))*(`mod`(B, n)), n))*(`mod`(A, n))*(`mod`(B, n)))

false

(2)

A := (rand(1 .. 100))():

is((`mod`((`mod`(A, n))*(`mod`(B, n)), n))((`mod`(A, n))*(`mod`(B, n))) <> (`mod`((`mod`(A, n))*(`mod`(B, n)), n))*(`mod`(A, n))*(`mod`(B, n)))

true

(3)

is(X(A, B) <> Y(A, B))

true

(4)

``


 

Download helpPlz.mw

@Mac Dude Sorry i havent been clear here with what i want to do. 

suppose i am about to execute a command line that contains a series of procedures proc1();proc2();proc3();..etc

I want to try and write code that, as far as what i am aware of would be done simply by inserting it as the first call of the commandline :

CheckMemoryLoad(proc1,proc2,proc3);proc1();proc2();proc3();

ie it performs a "pre execution" assessment on the processor utilization that will be required in executing the code for that line, but because i would want it for every line that would get pretty tiresome, and it is only beneficial  as i am writing a worksheet, since it would serve no purpose if the code had already been executed and my interface has crashed.(mine always  crashes for some reason when i have the auto save feature on, so i have it off, and losing work is the concern for me here)

 

so yes i know i dont know what im doing etc but anyway humour me here a little.

@acer

 

My goals are:

- To data mine CPU performance data for a sample of worksheet executions of a reasonably similair size and expected length of time for computation

 

- From above, identify a patterns in code structure that can be attributed to poor performance and good performance of CPU processor

- Use data collected to write a "pre execution" procedure that estimates a current line/s of code i have written's probability of a certain level of performance on the scale of immeadiate execution to me having to press alt ctrl delete, and return a warning message prompting me to cancel the execution if a bad outcome is predicted

As i said before, ideally i wanted it to be "inbuilt" into the "execute command line where cursor is placed" procedure, and the output would be the warning message as described in the previous point, i would assume just a maplet  question dialog box 

 

 

@acer  i will try to find the original question i wrote about this as that was more specific to the goals.

 

And no offense taken what so ever, I realise sometimes i get quite ridiculous, that's just how i think, i will set myself a task too difficult for myself by a long shot, and although i rarely achieve things precisely i am always satisfied with the things i have learnt in the attempt, i am going to die before i understand most things i try to understand in number theory and this is just as much true for computer science.

especially as you mentioned there are things about the way maple operates that are quite literally impossible for me to know, unless i was already so well verse in computer science that i was able to find a way to debug inbuilt code for starters.

 

@acer ok so how can you match the user with the various handles? i mean sure i get the basics, should be no problem for a web site administrator,but as far as i know you are not, even still i would have thought a VPN would make it difficult

 

Edit* Ah i see you are a moderator my mistake

@tomleslie If my intuition serves me well, this is another joke from someone in the facebook group ">implying we can discuss mathematics" that i used to be a moderator for. They will keep going endlessly trust me. We had one that had a new theory that infinity is a conspiracy, and that there is a finite upper bound for the natural numbers. This is very much the same satirical humour and they know that i am a maple user so, i know it sounds a little egotistical but i wouldnt be suprised if its an attempt to make me lose my temper and respond abusively, but understandable, i come up with my best work as far as comedy is concerned when im annoyed.

@vv Anyway I got what i wanted tonight which is always nice but it would have been another day or so without your assistance so, yes, deepest graditude for that.

Of Course, this is not the only thing that i wanted to determine! But the basis for the set of functions enumerated in this manner for a user defined arbitary function is the the central core of what is needed to then write the code for further analysis of that enumerated set, i just started with the cardinality

 

INTEGER_PARAMETERIZED_ENUMERATION_OF_A_SET_OF_FUNCTIONS_FROM_A_USER_DEFINED_FUNCTION2.mw

@vv 

Yes i have noticed that from time to time. Still though there are fundamental things in that code that i did not know would work, so thanks this is quite an important one for me.

@Kitonum hi thanks yes it is in relation to an assignment question that has specified that i can only establish convergence based on the epsilon definition of a limit, so i can really only work with inequalities

@Preben Alsholm 

 

No no offense taken what so ever i just didnt want to be misconstrued as a "troll" of sorts which has happened before when i ran into problems with code like RootOf. 

 

The thing with these kinds of procedures, they are what i consider to be the absolute "expert level" in terms of programming, and as a result, they are in some ways shown to be "working progresses".

 

Take Solve for example, the range of different types of functional equations which return solutions when using Solve has broadened so dramatically with each new version of maple of the past 10 or so years, the usuability of the command has improved so much that i would feel guilty about reporting the odd occasion that erroraneous results are returned, I guess that's just the nature of the beast really with these high level procedures.

@Preben Alsholm  no its not that i want to mess with anything but you know how it is, once you have used code a certain number of times you need to know the importance of why each and every bit of it was written the way it was. I just ask questions i dont seek to be a critic or messer of designs as you put it i wouldnt use maple everyday for most of my day if i didnt have positive reviews of its intrinsic design

@Carl Love  sure the divisors can be readily obtained a number of ways efficienty, but you cannot avoid a binary method of computation involving the p-adic expansion of the number if the user wishes to know particular digit values in the numbers decimal representation specifically (which i am assuming they do in reference to them specifying the last "few" digits, ie singular digits. 

 

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