Question: Use CodeWarrior to solve the question An integer n is divisible by 9 if the sum of its digits is divisible by 9. Develop a

Use CodeWarrior to solve the question  Use CodeWarrior to solve the question An integer n is divisible

An integer n is divisible by 9 if the sum of its digits is divisible by 9. Develop a program that uses this method to determine whether or not a number is divisible by 9. Test it on the following numbers: n = 154368 n = 621594 n = 123456 Use the % operator to get each digit; then use/to remove that digit. So, 154368 % 10 gives 8 and 154368/10 gives 15436. The next digit extracted should be 6, then 3 and so on. On the next page is a screen shot of a working solution with the loops missing. After you write your loops and get the program running, you can test it by hitting run, then hitting the halt button. Examine memory at PORT B to see if it worked. PORT B is at address 01 in the memory window. Starter code for Program 3a://your name//Programming Assignment 3a #include /* common defines and macros * #include "derivative. h"/* derivative-specific definitions * void main(void) {long number = 153368; unsigned char i. sum = 0; unsigned char digits [6]; DDRB = 0xFF;//make PORTB an output//write a for loop to store the digits in the array//write a while loop to add up all the digits//ver. could have done this in the first loop, but we're practicing//check if divisible by 9 if (sum % 9 = = 0) PORTB = 1; else PORTB = 0. while(1);}

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!