Write, assemble, and test a program that calculates the sum of all "divisible by the number that is a result of the last 4 digits of your students ID module 15" numbers from the range [n,m].

For this exercise you are required to use subroutine/procedure.

Calculate sum/product in the main procedure;

Check if the number is "divisible by x" in the subroutine/procedure.

YOU CAN NOT USE multiplication or division instructions!!!

This material may consist of step-by-step explanations on how to solve a problem or examples of proper writing, including the use of citations, references, bibliographies, and formatting. This material is made available for the sole purpose of studying and learning - misuse is strictly forbidden.

include irvine32.inc ; from Irvine CDROM

.stack 4096

.data

greeting byte "enter the last 4 digits of your students ID : ", 0 ; message to write

getN byte "enter n : ", 0 ;

getM byte "enter m : ", 0 ;

printSum byte "sum : ", 0 ;

newline byte " ", 10,0 ;

intVal DWORD ?

mVal DWORD ?

candidate DWORD ? ; numbers from n to m

n DWORD ?

m DWORD ?

sum DWORD ?...

This is only a preview of the solution. Please use the purchase button to see the entire solution