I am trying to implement a program for finding the remainder on division of 2 numbers n2/n1 such that n1 is of the order of 2^32(having a few digits) and n2 is the order of 2^65536(having about 20000 digits) So far I have stored them in an array digit by digit. How to find the remainder? Could someone suggest any quick/fast /efficient algorithm or iplementation for the same. Thanks

Member Avatar
Member Avatar
+0 forum 1

Hello! I'm kind of new in assembly programming and I've been struggling with the following problem today: How to print an integer, using BIOS interrupt [B]10h[/B], with its [B]0Eh[/B] in AH register, as its function to print a character to the screen... For example, how to print the last digit of 2005. here's what I've tried, using division by 10: [CODE] mov ax, 2005 mov cx, 10 div cx ; now, AH should contain the remainder (5) and AL = 200 mov al, ah ; because AL should contain the character to print add al, 48 ; because ASCII code …

Member Avatar
Member Avatar
-1 forum 2

The End.