Hi,
I once wrote an assembler program on an 2 MHz 8080A processor when it
was state of the art. And then sticked to highlevel programming. I tried
to grasp a little of the factoring assemblycode. I got the impression
that the code is like:
table:1,7,17,23,31,41,47,49,71,73,79,89,97,103,113,119
MR DENNIS S KLUK wrote:
> The table should be :
>
> table:2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,
> 83,89,97,101, 103,107,109,113,127
Eueuhh, different tables I guess, the table contains the sixteen numbers
of the different passes, not primes. I simplified the code a littl
Henk Stokhorst writes:
table:1,7,17,23,31,41,47,49,71,73,79,89,97,103,113,119
In case it still isn't clear to someone out there, this is the list of
numbers less than 120 that are relatively prime (no common factors
greater than 1) to 120.
for number := first to last number in table do
Henk Stokhorst writes:
I simplified the code a little bit, it says divide, whereas in the
real code fourier transformations seem to be used. But I assumed
more people would be familiar with dividing than fourier
transformatios.
The factoring code does not use fourier transformations
I wrote:
Henk Stokhorst writes:
table:1,7,17,23,31,41,47,49,71,73,79,89,97,103,113,119
In case it still isn't clear to someone out there, this is the list
of numbers less than 120 that are relatively prime (no common
factors greater than 1) to 120.
Oops! I should have thoug
