Question $4.$ Given a positive integer $N,$ find the lowest multiple of $N$ made up of only $9\text{'}$s and

$0\text{'}$s$!$

Program Inputs

Enter a positive whole number N:

The user will always follow instructions, no error checking needed!

Program Outputs ${?}_{(})$

Lowest multiple with only $9$ s and $0$s: XXX$.$

Replace XXX with the lowest multiple found.

Solution Process ${?}_{(})$

Ask the user for N

Repeatedly create a multiple of N and test if all digits are $9$ or $0$ :

Create the next multiple of N$,$ called M

Repeatedly divide M by $10$ to check each digit:

Check the remainder when dividing M by $10$

If the remainder is $9$ or $0,$ reduce M by a factor of $10($ignore any decimals$)$

If the remainder was another number, try the next multiple of N

Test Case $1$:

Enter a positive whole number N: $5$

Lowest multiple with only $9$s and $0$s: $90$

Test Case $2$:

Enter a positive whole number N: $6$

Lowest multiple with only $9$ s and $0$s: $90$