Recent content by buchi

Thanks for that plato, but I get what you mean there but i am just curious if there is a systematic way to make sure i haven't missed any circutes or is there a general formula to work out how many Eulerian circuits are in K_n?? could you do say K_4 as an example and list the different circuits...

how would one possibly draw all the possible Eulerian circuits? the way I am thinking of it is if we start say at vertex 1 and go through each vertex and edge and come back to vertex 1 then we can do the same for each vertex up to 5 but then we can also start at vertex one and head a different...

i got this from my notws and i just can't seem to figure out how the second step is obtained? can someone explain to me where the where r's in the numerator came from on the second line when dividing by the volume of the shell?

could you comment on this for me for the machine epsilon in the above scenario 1=.1000000*4^1 therefore the closest number we can write to one is .1000001*4^1 which equals 1.000001 therefore the machine epsilon is 4^-6? is that right? i sense that the three spaces for the exponent value make...

thank you so much i think i got it now.

+.9999999×10+999 doesn't this have 16 digits though? i am assuming for mine it would be +.33333*4^+333 does that look right the whole thing has 12 entry's and 3 being the largest number in that base system? and would the smallest one be +.00001*4^+001 ?

no i don't really know how to do that either i am just reading about it now but it seems like i am stuck on the concept may be if you can tell me how to do it in another base i might be able to get some direction

Consider a new computer system which stores data in “quads”, i.e. it has four states 0, 1, 2 and 3 (as opposed to binary which has only two, 0 and 1). Now imagine that numbers are stored in a 12 quad format where there is one quad for the sign of the number, three quads for the exponent...