Re: Modulus problem


Pubkeybreaker skrev:
zacariaz@xxxxxxxxx wrote:
I am very gratefull for all your help, but i think maybe i havent
discribed my problem well enough.

Lets take a couple og examples.

<mumble jumble deleted>

You still have not given a cogent explanation of what you are trying to
do. However, from what I could discern, the only reasonable answer
to your problem is : table lookup. Construct some 16 bit division
tables and combine the 16 bit results together with shifts/adds.

The question of what i am trying to do is easy to answer, i need
primes, as many as possible. I now that there is other ways of
determing primes, but i dont know of these way and even if i did, i
probably wouldnt understand them.

then thees the question of what im gonna use the primes for, that is a
bit more complicated though. i have a formula some time ago, and want
to do some testing on it. the formula can be found here:
http://zacariaz.urbanblog.dk/files/2006/11/eqn7407.jpg
And yes, i have made it my self, and i havent succeeded in finding
anyone you have done anything like it, but i gues there is.

The last question must be why i wanna do this and that is hard to
answer, there is really no purpose other that the challence. Im trying
to learn assembly programming, and the best way for me to learn usually
is having a project to work on.

If people is interested in the fomula the link refers to, ill be happy
to star a new treath and answer any question about, but again, it isnt
really that complicated.

.

Relevant Pages