2. Vrite a function int number_of_divisibles (int a, int b, int* c) where *c will store the first number divisible by 5 between a and b (a and b included), and the return value is the count of the numbers, between a and b, which are divisible by 5. Use this function in the main to produce the sample output below: Between a 12 and b = 70 the first number divisible by 5 is 15 the count of the numbers, between a and b, which are divisible by 5 is 12

2. Vrite a function int number_of_divisibles (int a, int b, int* c) where *c will store the first number divisible by 5 between a and b (a and b included), and the return value is the count of the numbers, between a and b, which are divisible by 5. Use this function in the main to produce the sample output below: Between a 12 and b = 70 the first number divisible by 5 is 15 the count of the numbers, between a and b, which are divisible by 5 is 12

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter7: Arrays

Section: Chapter Questions

Problem 7PP: (Numerical) Using the srand() and rand() C++ library functions, fill an array of 1000 floating-point...

See similar textbooks

Similar questions

Write and test the “digit” function: Function Prototype: int digit(int n,int k)This function returns the kth digit of the positive integer n. For example, if n is the integer 29,415 that is entered by user , then the call digit(n,0) would return the digit 2, and the call digit(n,2) would returnthe digit 4. do this only by using functions and loops. arrays are not allowed. example :Input: n = 29415 , k = 1 output: 9 Input: n = 2 , k = 1 output: index out of bound (return -1)
: Write a function that adds two numbers. You should not use+ or any arithmeticoperators.
integer) Write a function that computes the sum of the digits in an integer. Use the following function header:def sumDigits(n):For example, sumDigits(234) returns 9 (Hint: Use the % operator to extract digits, and the // operator to remove the extracted digit. For instance, toextract 4 from 234, use 234 % 10 To remove 4 from 234, use 234 // 10 (=23) Use a loop to repeatedly extract and remove the digits until all the digits are extracted.) Write a test program that prompts the user to enter an integer and displays the sum of all its digits.
*You need to use at least one user define function Write a program to find the first n numbers of the Fibonacci series. You have to take a positive number from input and show all the Fibonacci numbers belongs to that range. If the number is not valid then notify the user and ask to input positive number again. If valid, then print the series. Input: Key in a number: 10 Output: Fibonacci Series: 0 1 1 2 3 5 8 13 21 34 Do you want to continue (y/n)? n Good bye!! Language:(C programming)
Assignment Write a program to calculate n! for a given number n and perform the simple calculator operations. The valid operations of the calculator are: + add - sub * mul I div The program must contain a function fact with one input parameter that returns the factorial of a number, a function add that performs the addition of two numbers, a function sub that performs the subtraction of two numbers, a function mul that performs the multiplication of two numbers, a function div that performs the division of two numbers. The program must also check for bad input data. Make sure when you pass parameters you pass the addresses (not the value). • All function return type must be of type void. • Take inputs in main function. • Pass the addresses of the operands and the address of the result to each function. Output must be displayed as follows: 1: Addition 2: Subtraction 3: Multiplication 4: Division 5: Factorial 6: Quit Enter the choice => 1 Enter two numbers => 2, 3 Sum => 5
A triangular number is defined as m(m + 1)/2 for m = 1, 2, c , and so on. Therefore, the first few numbers are 1, 5, 12, 22, . . . . Write a function with the following header that returns a triangular number: int getTriangularNumber(int n) Write a test program that uses this function to display the first 75 triangular numbers with 5 numbers on each line.
#5.Incorrect gurantee downvote. Euler's totient function, also known as phi-function ϕ(n),counts the number of integers between 1 and n inclusive,which are coprime to n.(Two numbers are coprime if their greatest common divisor (GCD) equals 1)."""def euler_totient(n): """Euler's totient function or Phi function. Time Complexity: O(sqrt(n)).""" result = n for i in range(2, int(n ** 0.5) + 1): if n % i == 0: while n % i == 0: n //= i.
6.Coding-----""Euler's totient function, also known as phi-function ϕ(n),counts the number of integers between 1 and n inclusive,which are coprime to n.(Two numbers are coprime if their greatest common divisor (GCD) equals 1)."""def euler_totient(n): """Euler's totient function or Phi function. Time Complexity: O(sqrt(n)).""" result = n for i in range(2, int(n ** 0.5) + 1): if n % i == 0: while n % i == 0: n //= i.
Question 4: sequence Write a function sequence that accepts an number ( int ) and that prints a sequence of numbers that starts at the given number and obeys the following rules: the number 1 is the last number in the sequence (e.g stop ) if the number if even, the next number is half of it if the number is odd, the next number is one more Specifications: use a while loop print each number in the sequence one per line
-Write a function: int calculate(int x); * function returns
Write a function that parses a decimal number into an octal number. The function header is as follows: int dec2Octal(const int& decimal) Write a test program that prompts the user to enter a decimal number, uses the dec2Octal function to parse it into an equivalent octal number and displays the octal number.
Add a Call/Return function to the program below