Crosspost from Ti Bank. (I know DJ just translated so this isn't as important.)

Sorry I don't speak French. So you'll get the google translate version of this.

On the Err:Bad Address, the file gets saved, but it just cannot be unarchived.

Also, the groups are deleted as part of the Press to Test. When you disable the programs, that is when the groups are deleted, not when you do test mode. And error version makes the group span three pages, not two.

But other than that, great job compiling all of the patches.

1 byte makes all the difference.

Critor, I know exactly why those are crashing. It's because they attempt to write to the boot page and the calculator says no. It's an easy fix and I'll do it later, but that's what the problem is.

And the reason why I never caught these bugs is because wabbitEmu runs them perfectly.

Now, I know I'm not the only one that has ever heard this sound, so someone has to back me up. Sometimes, a speaker will make this certain sound for no apparent reason. It is a a semi-low buzzing type noise that plays a very specific pattern. The pattern is this -..-..-..-... It is a repeating pattern of ..- that plays anywhere from 3 to 5 times. I used to hear this sound come from my friends computer speakers when I was in 3rd-5th grade. Just now, I heard it from a radio in a hotel room. I know I've heard it other places, I just don't remember where.

So, can anyone explain this. I have always wondered what this is, and I figured I would finally ask the question.

Or, if you have ever even hear what I am talking about, some support would be nice.

Well. I can tell no one actually ran my patcher because it doesn't work on real hardware. Evidently, sending flash commands at the boot page makes the calculator angry.

But, after roughly 8 OS reinstalls, the patcher is complete. (I just said if it's trying to write to the boot page, don't do that). I even added in a counter that shows you the progress of the patch. But that was purely a byproduct of debugging on a real calculator.

Also, I got zStart working. Which is the whole reason that I tested it on my calculator because I could now enjoy my settings the way I like them. Here is the new patcher (I updated the other post) and the newest zStart which will appear on ticalc.org shortly. I also added in the option to turn off the stat wizards.

Edit:
    This version of zStart is way safer than all the old ones. You'll be perfectly fine just sending it to your calc without making any changes.

Still no developer response. But here's that patch I talked about earlier. It does everything from before, and now it puts your ram cleared screen back to normal. (I don't like that big box at the bottom.)

I fixed this in a really cool way. First, I nop'd a jr so that execution falls through to the place where it sets the "ROM cleared"'s coordinates. Then, I changed the page 0 call address so that it just flat out skips the box drawing.

Also, I forgot to mention this earlier, but the OS considers all of the $70 sector to be OS code. I noticed this when I was trying to re-checksum the OS. What this really means is that if you make any permanent changes to $70-72, the OS will be invalid and will "ROM fail" in the self test.

Edit:
    The zStart patch is on the way, but I'll be gone for about a week so it might be a while. (Why zStart? You never have to worry about MATHPRINT ever again)

Edit2:
    Fixed the patcher. Look on page 8 for details.

I just solved this so it is possible. I couldn't do the final collision step by hand because it had both an X in a power as well as an X, so I just did an intersect. But good luck to all.

Remember: 1 + x^1 + x^2 ... x^n == (1-x^(n+1))/(1-x)

Here is a tough one. I once attempted this and failed, but when I went online, I found out that I went about it wrong. But I still believe I did it the right way. The problem comes from http://xkcd.com/135/, problem 1. All I am saying is solve it.

Here's what you have to assume:
1. The person's speed is always 6 m/s.
2. The raptor's top speed is a mathematical limit, not just a point at which it stops accelerating. Meaning that its recursive forumula is V[n] = V[n-1] + 4 - (4V[n-1]/25).
3. Even if this isn't the proper way to solve it, this is the way I say to do it.

At this point, I don't know the answer, but if you show some meaningful work, I'll have to believe it.