Digits Sums of Squares and Cubes Program Plan: Include the required header files to the program. Define the function prototype. Define the “main ()” function. Inside this function, Set the field width to print the string “Number”. Set the field width to print the string “Square”. Set the field width to print the string “Cube”. Set the field width to print the string “Sum”. Loop 1000 times using “for” loop. Find the square of a number and store it in a variable “square_Num”. Find the cube of a number and store it in a variable “cube_Num”. Call the function “sum_Of_Digits ()” by passing “num” as an argument. Store the returned value in a variable “sum”. Check if the sum of digits of “square_Num” and sum of digits of “cube_Num” are equal. Print the value of “num”, “square_Num”, “cube_Num” and “sum”. Give function definition for “sum_Of_Digits ()”. Inside this function, Declare required variables “numberString”, and “digitSum”. Print the value of “number”. Find the sum of digits using “for” loop. Find the sum and store it in a variable “digitSum”. Return the value.

Question

Want to see the full answer?

Answer 1

Question

Chapter 12, Problem 13PC

Program Plan Intro

Digits Sums of Squares and Cubes

Program Plan:

Include the required header files to the program.

Define the function prototype.

Define the “main ()” function. Inside this function,

Set the field width to print the string “Number”.

Set the field width to print the string “Square”.

Set the field width to print the string “Cube”.

Set the field width to print the string “Sum”.

Loop 1000 times using “for” loop.

Find the square of a number and store it in a variable “square_Num”.

Find the cube of a number and store it in a variable “cube_Num”.

Call the function “sum_Of_Digits ()” by passing “num” as an argument. Store the returned value in a variable “sum”.

Check if the sum of digits of “square_Num” and sum of digits of “cube_Num” are equal.

Print the value of “num”, “square_Num”, “cube_Num” and “sum”.

Give function definition for “sum_Of_Digits ()”. Inside this function,

Declare required variables “numberString”, and “digitSum”.

Print the value of “number”.

Find the sum of digits using “for” loop.

Find the sum and store it in a variable “digitSum”.

Return the value.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

P1 P2 P3 P4 A pentagonal number is one that corresponds to dots arranged into a pentagon. Above are the first four pentagonal numbers and their pentagons. The pentagonal number PN has sides made of N dots. When you count the dots for a pentagonal number, include the dots for the inner pentagons. So to figure out how many dots PN has, find out how many P(N-1) has and add the dots for the new sides of size N. P1 = 1, P2 = 5, P3 = 12, P4 = 22 Figure out a recursive formula for PN and then write a function that implements it. That is, implement pentagonal() using recursion. pentagonal(1) -> 1 pentagonal(2) -> 5 pentagonal(3) -> 12

Q1: Write a program that reads a set of N integers. Then, the program finds and outputs the sum of the even values and the sum of the odd values of them. For example: if the value entered for N=5, and the five integers are 3, 6, 2, 9, 7. Then the sum of even values (6+2 = 8), and the sum of odd values (3+9+7 = 19) Q2: Write a program that reads some numbers until it reaches a specific value (assume -1 is a stop value in this case). The program should find and outputs the average of all of the numbers (between 10...40) except the stop value (-1). For example: If the numbers look like: 12 5 30 48 -1. Then, the average of the numbers: (12+30)/2 = 21.

A prime number is called a Mersenne prime if it can be writtenin the form 2p - 1 for some positive integer p. Write a program that findsall Mersenne primes with p ≤100 and displays the output as shown below.(Hint: You have to use BigInteger to store the number because it is too big tobe stored in long. Your program may take several hours to run.) p 2^p – 1---------------------2 33 75 31...