Problem #2: A number is divisible by 11 if the difference of the sum of its digits at odd places and the sum of its digits at even places is either 0 or divisible by 11. For example, for 2547039: (Sum of digits at odd places) - (Sum of digits at even places) = (9 + 0 +4+2) - (3 +7+ 5) = 0 So 2547039 is divisible by 11. But for 13165648: (Sum of digits at odd places) - (Sum of digits at even places) = (8+ 6+ 6 + 3) - (4 +5+1+ 1) = 12 12 is not divisible by 11 so 13165648 is also not divisible by 11. Sample run: Give your number: 13165648 Total is: 12 13165648 is not divisible by 11.

Problem #2: A number is divisible by 11 if the difference of the sum of its digits at odd places and the sum of its digits at even places is either 0 or divisible by 11. For example, for 2547039: (Sum of digits at odd places) - (Sum of digits at even places) = (9 + 0 +4+2) - (3 +7+ 5) = 0 So 2547039 is divisible by 11. But for 13165648: (Sum of digits at odd places) - (Sum of digits at even places) = (8+ 6+ 6 + 3) - (4 +5+1+ 1) = 12 12 is not divisible by 11 so 13165648 is also not divisible by 11. Sample run: Give your number: 13165648 Total is: 12 13165648 is not divisible by 11.

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter2: Problem Solving Using C++using

Section: Chapter Questions

Problem 10PP: (Civil eng.) Modify the program written for Exercise 9 to determine the maximum load that can be...

See similar textbooks

Similar questions

(Electrical eng.) You’ve been asked to write a C++ program to calculate the total resistance of a series circuit. In this circuit, the total resistance is the sum of all individual resistance values. The circuit consists of a number of 56-ohm, 33-ohm, and 15-ohm resistors. a. For this programming problem, how many outputs are required? b. How many inputs does this problem have? c. Determine a formula for converting input items into output items. The number of 56-ohm resistors is m, the number of 33-ohm resistors is n, and the number of 15-ohm resistors is p. d. Test the formula written for Exercise 1c using the following sample data: m=17,n=24,andp=12.
Problem #2: [35 pts] Parity Bit CheckerThe parity bit of a sequence of bits is 0 if the number of 1’s in the sequence is even and 1otherwise.Example: if the sequence of bits is 1 1 0 1, the parity bit should be 1 (total number of 1-bits is 3 whichis odd) if the sequence of bits is 1 0 1 0, the parity bit should be 0 (total number of 1-bits is 2 whichis even)Write a Java program that asks the user to enter the number of bits he has. The program thenreads the bits as separate integers. In the end, the program prints the parity bit on the screen. Ifthe use enters a bit value that is neither 0 nor 1, the entry should be discarded and a messagedisplayed as shown in the sample run.Sample run 1:How many bits do you have? 6Enter 6 bits: 1 1 0 0 1 0The parity bit is 1Sample run 2:How many bits do you have? 8Enter 8 bits: 1 1 1 0 0 0 0 1The parity bit is 0Sample run 3:How many bits do you have? 5Enter 5 bits: 1 1 3 0 1Incorrect bit value 3 is discarded.The parity bit is 1 java brogram
it is often said 1 human-year is equivalent to 7 dog-years. however, this simple conversion fails to recognize that dogs reach adulthood in their end year of life. as a result the american kennel club suggests the following to calculate a dog's age in human-years. 15 human years are equivalent to the 1st year of a dog's life. a dog's 2nd year is equivalent to 9 human years. after a dog's 2nd year each human year is approximately 5 dogs years. please answer in python coding
Problem 1. Evaluate the following expressions: (a) 8 (mod 3) = (b) 17 (mod 8) = (c) 7 (mod 12) =
Simplify the following formula. 1. F = XY’Z’ + X’Y’Z’ + X’Y’Z + X’YZ 2. F = X’YZ’ + XYZ’ + XYZ + XY’Z
Problem 1. Evaluate the following expressions: (d) 22 (mod 11) = (e) −17 (mod 8) = (f)0(mod9)=
Sole the following C++ problem
PROBLEM 17. [TIME ALLOWED = 5 MINUTES] State whether “n is divisible by 9” is (a) necessary, (b) sufficient, or (c) neither necessary nor sufficient for “n is divisible by 6”, where n is a natural number.
(Practice) State whether the following are valid function names and if so, whether they’re mnemonic names that convey some idea of the function’s purpose. If they are invalid names, state why. powerdensity m1234 newamp 1234 abcd total tangent absval computed b34a 34ab volts$ a2B3 while minVal sine $sine cosine speed netdistance sum return stack
x^4+2(x^3)-7(x^2)+3 a) One of the root of the equation lies in the range (1.0, 2.0). Find this root in 100 iterations using the bisection method.b) Draw the graph of the function between points (0, 2).=> Your code should include the following steps:• Write the steps of the bisection function (if, else…) and explain each step. (Explain each step in English)• Your code should calculate the root.• Graphic;Variables of x and y axes should be written,x and y axis names should be written,Series should be written to calculate x axis. Use the linspace() for the x series of the graph and section the range 0-2 into 100 pieces.=>The output of your code should include:• The root of the function• Graph of the function
x^4+2(x^3)-7(x^2)+3=0 a) One of the root of the equation lies in the range (1.0, 2.0). Find this root in 100 iterations using the bisection method. b) Draw the graph of the function between points (0, 2). Your code should include the following steps: • Write the steps of the bisection function (if, else…) and explain each step. (Explain each step in English)• Your code should calculate the root.• Graphic; Variables of x and y axes should be written, x and y axis names should be written, Series should be written to calculate x axis. Use the linspace() for the x series of the graph and section the range 0-2 into 100 pieces. Solve with phyton.
use C programming stdio.h enter a number:5 output : 5,10,15,20,25,20,15,10,5 enter a number :3 output : 3,6,9,6,3 * TERMINATION ______________________________________________________________________ second PROBLEM C PROGRAMMING STDIO.H N1 N2 OUTPUT 0 0 GOT7 POSITIVE EVEN POSTIVE EVEN N1+N2 POSITIVE ODD POSITIVE ODD N1 x N2 NEGATIVE EVEN NEGATIVE EVEN MARK TUAN NEGATIVE EVEN NEGATIVE ODD JACKSON WANG WITH TERMINATION ___________________________________________________________________________ 3RD PROBLEM USING C PROGRAMMING STDIO.H the 1ST INPUT is 5 2ND input 13 output : 5, 8 ,13 *TERMINATION ---------------------------------------------------------------------- last question c programming stdio.h I think the problem starts before the nested if switch because at the end of the code it should output the result of sales = quantity * price and change = payment - total amount and asking quantity and Payment #include<stdio.h> main() { int…