Not so much a bug, as slow!

[einar]

ZX Basic already does that.

Great!

But does it also mean that INT(RND * n) is optimized such that it doesn't really use FP or even integer multiplication?

My concern is that, although RND implementation in ZX BASIC is really fast now (I believe it's now using Patrik Rak's implementation, right?), if it can only be accessed using FP calculations, it would be quite inefficient.