@Carl Love  ok I think i understand but I just would have thought i would have encountered this this error so much more frequenty than  i have, i think this is the first time i have

@vv  ok that is fine maybe it isnt as significant as i first thought it to be but i still get an uneasy feeling i do know i had completely forgotten how to find characteristic equations and all of that it's has just been a tough week that way 

@vv so do we need to define S(1):=4 rather than the convention i used defining S(0)=4? If you can explain this to me it should be quite fundamental to my i understanding i would imagine

@vv in as much as i am happy this point has been raised in regard to my understanding of how this particular circumstance is handled by maple, it is not a relevant answer to my post.. i did specify that i want the student to be able to focus only on the mathematics in the tools that i am trying to build and have the code excluded from view

@vv ok sweet! so i just assumed that s(n-1)^2 would be taken there as raising n-1 to the exponent 2, seeing you had not yet assigned a definition to s in a prior line for s(x) to be handled as the evaluation of a procedure

@acer Thanks again very concise information much appreciated

@acer They are both the totient function though yes? i thought the only difference is that the num theory package phi can compute for much larger integers?

@acer ok so if i specify numtheory[phi] in Ftest GetProperty will pick that up ok easy thanks

@tomleslie  I should to save face delete this entire post but im not going to ill leave it up, maybe next time ill check my basic arithmetic before i announce the sky is falling

@tomleslie yeah its ok for a moment there i think almost had a nervous breakdown i need to remind myself i actually make the choice to worry about this kind of stuff.

But fixed signs? i can see you have put a 1 in front of the p's. you must be talking about a different meaning of sign to what i am used to.

i am fixing it up so that i can try an class or arithmetic function tests on a range N for any identity. Sorry i was actually meant to only post things once i had everything in with buttons and user entry fields etc but i kinda had a panic attack with this.

Download KRONECKER_delta_RECIPROCITY3.mw

@vv 

Yes i agree that indeed there is only q dependance here, but the concern i have is that the results should be the same in the context of the code i have used.

q is congruent to 0 or 1 mod 4 will give D(q)=1/2 and M(p,q)= 1/2 

q is congruent to 2 or 3 mod 4 will give D(q) = 0 and M(p,q)= 0

Either way,  is(1/2=1/2) and is(0=0) should be returning true here, this is an issue with the programming of the "is" function not a problem with the identity itself

@Preben Alsholm  ok ill have a read thanks

@tomleslie 

fine i guess i need to remember it is still just a proc anyway  but how is the do loop infinite that part escapes me i typed end do: that usually indicates to maple that it should end do not repreat do infinitely 

@tomlesliesure i mean this example shows a case where the arrow is far superior (first one using proc will go forever, could be improved )

Download ARROW_IS_AWESOME.mw

@tomleslie thats fine i think i see the reason for the efficiency now. kinda feel like thats cheating. also did the garbage collector go on strike when i started to post here? :-P