STOP in 34s

[ggauny@live.fr]

Hi,

It is because I search a routine that give me the primes factors divisors of an integer, so if my test is false I ask the routine return at LBL'x', in others words :
if the test is true : pause, if false go up to the first line to redo the search, but not go to the first line of program.

This is what I don't understand, because to know what is primes divisors of an integer I divide by 2, after i divise by 2 one again, if not divisible I up to line one and I try with 3, and so on.

As an example : 28 is 2^2, 7, but me I have not this in routine because no go to line one.

It is difficult because I don't understand your english and you don't understand mine.

A friend said to me that if I am stranggled I speak french, but in french nobody is going to understand, in english too it seems !

Don't care of this because it is no important, I will find.