I need a 32 bit by 16 bit division routine but I have absolutely no idea how to do this. I specifically need to check if the modulus is non zero. Can you give me some tips ? Asm in 28 days has 32/8 which is not enough for me.

Same for a 32 bit square root routine. I need the result as a 16 bit integer.

Note that I'm not asking for code but some help to create them myself and then optimization because I'm not Runer/ThePenguin/Calc84maniac and I want to learn.

I don't really know how to do that, but I think it's the same way as a 16 by 16 division. I know that in the process you loop as much times as bits that are in the first operand (idk if that's English ), so you would do 32 loops I think. But I can't really help.

I think Z80 Bits is where everybody learned how bitwise math routines worked. It has code for multiplication, division, and square root routines of varying bit-width inputs, and pretty good explanations of the algorithms behind them. Unfortunately none of the routines go up to bit widths quite as high as you're looking for, probably because at that point you start running out of registers. I figure you can get 32-bit/16-bit by just using one of the existing routines and throwing in the use of ix to fit all the necessary bits. As for the restoring square root algorithm... that algorithm is a little mind-boggling. But I figure you'd need 16 bits to store the result instead of 8, the comparison step would have to compare 24 bits instead of 16, and you'd need to find a way to feed in 24 bits of the input (I think 8 bits always start in the "accumulator"). By the looks of it, you might be short one register, even if you use ix. Perhaps make sure interrupts are turned off and use shadow registers?

But as Hayleia said, since I'm pretty sure this is for the TI-Planet contest, I don't think anybody should really write your routines for you. But hopefully I've given you some good guidance to being able to take a stab at it yourself.

I did? I don't remember that Or were you talking about the BASIC code/trial division stuff?

I can't get the 24/16 routine from z80 bits to work. :s
Here's what I'm running :
    di
    ld a, 244      ;dividend high byte
    ld bc, 9216   ;dividend low word (244*2^16+9216=16000000)
    ld de, 47288 ;divisor
    ld hl, 0
    exx
    ld b, 24
LOOP:
    exx
    slia c ; unroll 24 times
    rl b ; ...
    rla ; ...
    adc hl,hl ; ...
    sbc hl,de ; ...
    jr nc,$+4 ; ...
    add hl,de ; ...
    dec c ; ...
    exx
    djnz LOOP
    exx
    ;load the values of a, bc and hl to the first five bytes of appBackupScreen
    eiWhat am I doing wrong ? I tried it several times and I always get wrong results.

You only have one exx in the loop, so every time through the loop uses different registers.  It should work if you add an exx at the beginning of the loop.

I forgot to copy it but I actually have it.

Should I leave the extra sbc hl,de ?

Edit : It doesn't fix anything...
Edit 2 : My code actually worked I was just displaying without the small r in axe.

Thanks! I am on mobile, so not much help, but a few quick optimizations I see are changing those Inc/dec ix to use ixl instead (the bottom bit is 0 and 1 at those points, so no worry of overflow) and you don't need the `or a` before the sbc since the add before it is always pushing out a 0 bit (so leaving carry reset).

Do you prefer speed optimizations or size optimizations, btw?

Thanks for the work, I actually visit this thread semi-frequently!