Speaking of ways around symbol errors, if you have a lot of symbols as sprites you can reference them through Pic1+16*sprite number instead of using a diff. symbol for each. It can save a lot if you're making anything using a tilemap.
I'm not saying you do it for all prime numbers, just a few. Then, you can simply take the remaining rows and add by the matrix width (x2 if you use an odd number)
It's only a gain of roughly 2% over simply adding by 4,2,then 4, then 2, then 4 through two columns arranged by 3 on Trial factoring, though
We have an 86 basic dev still around? Sweet! I used to have an 86, before I found any sort of online resources except ticalc itself. Nothing had been updated for several years Now we have new stuff there
Oh, except I was looking in asm
There should be an 86 emu for nspire and maybe a KnightOS port too J/K
If we do set up a massive attempt to find a factor for the nspire's RSA, we should do the Boot2 one. Why? because that one is the same for both calcs.
once (if ) it is cracked, instead of installing an OS as the boot2, we write another boot2 that has no RSA protection for the OS. Then, you could install the TI-OS or a Custom OS, whichever you prefer. It would boot much faster either way (Skip half the loading bar, after it flashes)
This would be the equivalent of RunOS. Plus, any OS would work on any nspire.
On a side note, did you know the nspire has a memory location mapped for an SD card host?
One of the coolest "Cheating" things I've heard of is bumpmapping. It makes objects look much more detailed than they are by having the lighting be different for different parts of the shape, making it look farther in or sticking out.
Arrange your numbers in a matrix. The width determines the numbers you can eliminate. Here's the basic concept. The width is a multiple of several prime numbers. If you multiply 3,5,and 7 together you get 105. In the 105 columns, you can eliminate every 3rd starting at 3, every 5th starting at 5, and every 7th starting at 7. You don't need to put in two, since you can simply eliminate every other going down each column (-210 instead of -105)
The more primes you multiply in (nonprimes are useless, eliminate no more rows) the more you can eliminate! yay! Now for checkerboarding for multiples of 2:
1 7 11 13 17 19 23 29 31 37 41 43 47 49 53 59
True, you eliminate two, but who cares? You don't lose any primes.
By the way, doing this exactly this way with 105 (0-104) give you 31.428% remaining, whereas 3 gives 33.333% It's exponentially less effective, but still waaay better than just -2.
Edited for better readability
Edit: Also, I find it worth noting that since the math involved in this is fairly simple, and not based on the size of the number, it is practical for use on RSA cracking
Does anybody have recommendations for a good setup to use for C development for the nspire under linux? I can manage an IDE, and all that sort of stuff, but devkitPro, among others, is sort of a pain. Right now I'm downloading gcc v3.4 for ARM, just a straight compiler (I hope) and if that works, Maybe I could set up a linux tutorial. otherwise, I'm open to suggestions.
Lucky. I wish I was ambidextrous. Good luck with USB!
Also, I was wondering, If someone made a ROM that contained KnightOS instead of TIOS, would it be completely rid of TI's code? if so, z80 emus could include it.
Show Posts
Now we have new stuff there 
