Mjordan2nd

Sorry for all these questions in a row, but I want to get some practice on assembly. I was thinking about writing a program that would calculate prime numbers up to a certain number, but couldn't think of any way to find the remiander of a number. Anyone want to point me in a direction I could learn?

__________________
"Every gun that is made, every warship launched, every rocket signifies, in the final sense, a theft from those who hunger and are not fed, from those who are cold and are not clothed. The world in arms is not spending money alone. It is spending the sweat of its laborers, the genius of its scientists, the hopes of its children." - Dwight D. Eisenhower

Eggbert

Your assembler doesn't have a MOD operator or something similar? It's a fairly common arithmetic operation.

Mjordan2nd

Doesn't seem to recognize the mod instruction. I'm using NASM if that helps.

__________________
"Every gun that is made, every warship launched, every rocket signifies, in the final sense, a theft from those who hunger and are not fed, from those who are cold and are not clothed. The world in arms is not spending money alone. It is spending the sweat of its laborers, the genius of its scientists, the hopes of its children." - Dwight D. Eisenhower

lostcauz

I've had a few cocktails but I'll do my best. Using a div instruction, load (e)ax with the number being tested then load cx with the divisor. Then use the instruction - div cx. The quotient will be in ax while the remainder, if any, will be left in dx.
You could try this code in debug and watch the registers to see whats going on.
At command line type 'debug'
type 'a'
enter the code above
when done click enter twice then type 'r'
type 't' to execute the next instruction and see the registers change.
In the end ax should be 10 while dx contains the remainder of 1.
Forgive if this makes no sense.

__________________
-- lostcauz

Stepped in what?...
Behind whose barn?...
I didn't even know they had a cow!