There are no doubt many "elegant" solutions, but a normal "Long Division" as you'd do on paper (I hope) is quite easy in binary. This enables you to keep heat in when it’s cold and when it’s hot it will stay cooler inside of the canvas.

Also, there appears to be a bug in the Program Editor which doesn't generate any value higher than 2,147,483,647 (31 bits). I'm intrigued that womai's routine achieves a 32 bit result with 16-17 iterations and have considered attempting to create a "hybrid" routine, but am concerned by the additional resources required. But perhaps the point is that PICaxe basic is intended to "hide" the underlying micro structure, and also hardly supports bit/flag operations at all.

I can't test the X-series shift commands, but the w2 = w2 + w2 format (to shift left) appears to be about 10% faster than w2 = w2 * 2 and twice the speed of w2 = w2 / 2 (shift right).

Although the fast, sporty, tread-less slick weighs just 230g it still has a RaceGuard protection belt and reflective labels. I've tested it with several different combinations, but you should check it out further before you fully trust it. The Noble Quran has many names including Al-Quran Al-Kareem, Al-Ketab, Al-Furqan, Al-Maw'itha, Al-Thikr, and Al-Noor. ALLAN, I tried your code in my run time environment hoping it would just work , but got some unpredictable results which I have no time to look at just now. All other numerators should gnererate an out-of-range value and as I said earlier my code has no range testing.To calculate the greatest common factor (GCF) of 16 and 32, we need to factor each number (factors of 16 = 1, 2, 4, 8, 16; factors of 32 = 1, 2, 4, 8, 16, 32) and choose the greatest factor that exactly divides both 16 and 32, i. There are 3 commonly used methods to find the GCF of 16 and 32 - long division, Euclidean algorithm, and prime factorization. Your suggestiom to move from bit bashing (base2) to bytes ( base256) and maybe even words ( base 65535) to do the long division might have some merit ( given that we would constrain the values so that the answer always fits into a word to prevent overflow) I tried to think how to do this starting by dividing the high word by the divisor (/) which should almost always give a result of zero and maybe a remainder (//) which if not zero will always be less than the divisor.

If so, it would be great if this subroutine function was included in the Variable - Mathmatic section of the manual please with a couple of of good application examples as it takes a lot of time to get your head around maths with what is there now.

If the programmer chooses to use both * and ** then he can concatenate the results to a "32-bit" result, but that is his responsibility. When this is sorted perhaps Rev Ed might like to consider putting the logic of this fuction into native code for the future to improve PICAXE maths ability and range and simplify life for people like me?