Problems

Next Factor

Input a $32-$bit unsigned integer i$.$ Return the smallest unsigned integer that is equal to or greater than i and that is a multiple of $7,11,$ and $13.$ The input and the correct output will always be representable by $32-$bit unsigned integers.

Filename: nextfactor.asm

Function name: nextfactor

Input register: x$10$

Output register: x$10$

Examples:

@ nextfactor $(1)=1001$

@ nextfactor $(1001)=1001$

@ nextfactor $(88087)=88088$

Smallest Byte

Input a $32-$bit word made of $48-$bit unsigned bytes. Choose the smallest byte value from those $4$ bytes. Return a $32-$bit word with all $4$ bytes set to that smallest byte value.

Filename: smallestbyte.asm

Function name: smallestbyte

Input register: x$10$

Output register: x$10$

Examples:

$-$ smallestbyte $(0xff01ee13)=001010101$

$$ smallestbyte $(0x$ xeeeeeee $)=0$ xeeeeeeee

Interleave

Input $232-$bit unsigned integers, $i0$ and $i1.$ Bits are counted from least significant to most significant $($bit $0,$ the rightmost bit, is the least significant bit$).$ The output should have its even bits set to the least significant $16$ bits of input $0$ and its odd bits set to the least significant $16$ bits of input i$1.$ Note the most significant bits of both inputs are ignored.

To illustrate, consider a smaller example $(16-$bit inputs and outputs$)$:

$,i0$ has bits abcdefghijklmnop, a is most significant, $p$ is least significant

$,$ i$1$ has bits ABCDEFGHIJKLMNOP, $A$ is most significant, $P$ is least

significant