!Help for !Primes

A prime number finder using the Eratosthenes sieve.
Up to 2^80 or so, the time it takes to calculate a group of primes is bearble, above 2^84 it gets impossibly long
'Base number for group of primes' lets you choose from where to begin.
You can als clik on it, to divide the number in this writable icon at the right into its divisors.
'Progress..' tells you which number the program is at to fill the workarea; click on it and you gat a guess how long
it will take to complete the calculation.
Picture displays a picture of the uneven numbers designated as primes.
The list of primes can be saved as a textfile or as a datafile.
'Go!' starts the calculation, 'Stop' stops it. Simple. It's a simple program.

The program 'Priemgetallen_14instrs' counts how many prime numbers there are between zero and a number that you get asked for.
It's highly ineffficient, but the objective was not efficiency but a minimal number of instructions. It demonstrates how 
efficient the ARM32 instruction set can be. Don't worry, it's almost unreadable code despite being short.