I see.  So basically, it randomly tries to find the factor with a slightly better success rate than just random numbers.

From what I read they sound like they don't like programming at all.  Also, since the DMCA has allowed jailbreaking of the iphone, I am thinking that cracking the Nspire key would not be illegal.  For more information about the RSA key, please read this topic.  Basically, if Omnimga were to be the site that were to crack the RSA keys, that would be awesome.

As for the google group, I'm sure TI would agree with them.  There's nothing we can do though.  I saw Lionel over on the forums trying to correct some of the misconceptions.

I have a question though, for the entire community.  If we were to here TI's reason behind not wanting the keys to be factored, would we change our minds?  Personally, I think that I wouldn't, but that's just me.  (Simply because I don't think that they would give us more programming capabilities, and they blocked downgrading specifically for Ndless)

yeah, clearing can be done by setting the buffer to 0, and inverting can be done by xor'ing all the bytes with 0xFF.  I don't really see the point, but I guess it could be useful.  So I'm guessing buff->DispGraph is for displaying?

TI-BASIC - Intermediate/Advanced
TI-Z80 - I can somewhat understand it, but not really write it.
C - Basic.  Enough to learn from examples and do what I need to code.
Java - Intermediate/Advanced  (Primary coding language)
HTML/Javascript - I used to know it, but would have to look it up to understand it now, since I haven't used it in forever.
Python - Basic.  I've used it before, and it's easy to understand.
CSS - Basic.  I can use it fairly well, although it doesn't always turn out well.
Axe - Almost Advanced.

I don't think I missed any.  wow, way too many programming languages...

Glad it does.  So, any ideas for an algorithm?  I'm working on one using a reduced row echelon form of a matrix with the last column being each digit of the number.

Also, are there any recursive or cyclical algorithms for factoring a number?  If so, I would be interested in seeing them. (Note: I do not mean like a simple for loop, or go until a condition is met.)

65 In binary is 01000001, or 63+2.  The first and sixth bit are set. Your code looks good, so I'm thinking it's probably axe itself.  Try pausing until a key is pressed in the loop, and clear the screen after that.

according to rule 5:
5: You are not allowed to enter a project that was started prior the start of the contest. You can use code, images and ideas from it, though.

So since you can use code from a previous project, I'm sure you can start completely new as well.  The TAO program that I am doing was an idea before, but I knew I would have to do it in ASM or something similar.