Ti84: prime number program

I've been working on this program to find prime numbers for awhile, at the moment it hits a memory error at #743 and I am at a loss to improve it further. any suggestions would be much appreciated...


3->L1(1
1->A
3->X
Lbl D
x+2->X
for(B,1,A)
X/L1(B)->E
if E=int(E):GoTo D
end
A+1->A
X->L1(A
Disp X
GoTo D

This seems a lot like homework to me. Check our forum rules.

it isn't homework. I wish I was in a class where this sort of thing would be assigned. I really do.
also, there is no rule that I could find about homewrok. (this is still not homework)

like it stops at the 734th prime number? maybe it just can't handle numbers that big.

There is indeed a homework rule.



How large is the 734th prime, and how large is the 735th?

I don't know how much memory TI-84's have, that's a valid concern. You might get farther on an 89, and then you could even program in something other than TI-Basic and be much faster too.

We recently edited the forum rules. It could have been edited out by mistake. In any case, I gave you the benefit of the doubt, that's why this thread wasn't closed.

The forum rules have been fixed. Thank you for taking the time to look.

that was really badly phrased on my part, it stops on the number 734

734th prime number is 5563.

734th prime number is 5563.
735th prime number is 5569.


It doesn't sounds big to me.

you made a mistake in the program itself
it's dumb to use if var then goto because it will keep using more ram unless you put an end statement at the beginning of the new label.
try out this:
3->L1(1
1->A
3->X
Goto D
Lbl A
End
Lbl D
x+2->X
for(B,1,A)
X/L1(B)->E
if E=int(E)
Then
GoTo A
end
A+1->A
X->L1(A
end
Disp X
GoTo D

edited it again, this should work even longer. i didn't try it, but i found a 'unclosed' for statement in my previous edit, try this.