Yes, even your picture seems to be smiling more these days.

]]>It's been quite a learning experience. Modern day drugs are unbelievable. Just a tiny 10%

change and I'm still not used all of the changes that I have seen. I guess whatever you are

ready to see, life will throw it at you!!]]>

I am okay, glad to hear you are fine.

]]>How are you and how do you feel?]]>

How are you and how do you feel?

]]>It looks easy now that i see it.

Take 25, so 24/25 times 25 is 24, so then (25 - "one")/25 times 25 = 24, so that's where the "one" comes into play.

So now if 25 is 4 times less than 100, then (4/4)(25 - "one")/25 is still the same thing, 24.

So (4x25 - 4x"one")/(4x25) times 25 = 24, so then (100 - 4)/100 times 25 = 24.

So it is a matter of "applying" or "multiplying" the same ratio, but in a form where 100 is the denominator, like in percents,

where you just "drop" the 100 in the denominator, because % means that.

Wow, I am so happy!!!!

]]>...Yeah, national forest spring water, mm..mm..good.

I noticed something neat today on my calculator.

I'll explain by example since it is easier for me.

Take a number and compare it to 100. Then do

something and multiply and get the next number below (one less).

Here's an example: Take 87.5, now 87.5 is 700/8 and hence

8/7 times 87.5 is 100. So now do (100-8/7) and get 98 and 6/7.

Multiply 87.5 by 98 and 6/7 percent and you get 86.5, one less.

This works for any number. Take 25, 25 times 4 is 100, so

100 - 4 is 96 and 25 times 96% is 24, one less than 25.

It also works for numbers over 100. Take 200. 200 times 1/2 is 100.

So 100 - 1/2 = 99.5 and 200 times 99.5% is 199, again 1 less than 200.

So I don't know why it works and probably won't understand anyones

formulas, but just thought i'd share that with you...]]>

stack-like structure in memory that tells me where to jump back to. I could do that i suppose.

I have some 55 or so bytes of memory in the first 200 bytes of the program that i jumped over,

that i can use, but i won't do the stack growing and shinking method. That is dangerous. I

will just have certain memory spots for certain return locations, and i could just be careful not

to program any recursion that would mess it up, just hardcode where to jump back and then

have the subroutine grab that memory jump back offset and learn extensively how the jump

command can be used, and i probably will be able to do that in a more stable fashion than

using the stack anyway with "call" commands.]]>

But we used to have a log at the top of each file, that explained the changes we made to it and programmer initials and a date.

But some files had like 15 procedures in them, so it might be wise to have a "log" of all the comments

at the beginning of each routine, and never erase the old ones, just put them in cronological order, or backward order.

But i already have a readme.txt file that briefly describes the program, the kbd interrupt handler, the screen mode,

and what my intentions are, so that was a start.

Putting the unassembled mneumonics in a text file is a good idea i suppose, i'll keep it in mind.

But for now, I'm enjoying coding straight into memory and "w" (writing) the file back out as a *.com file of 61222 bytes

in length with the stack pointer SP pointed near the very end of the file. I don't do the "call" command because whenever

i do it crashes, so obviously i am missing something about ss:sp, and don't understand something.]]>