ven if a problem does not directly tell you to use a function, you should aim to do so regardless. 2520 is the smallest number that can be divided by each of the numbers from 1 to 10 without any remainder. What is the smallest positive number that is evenly divisible by all of the numbers from 1 to 20?

In C++: Write a function which will find the average of all elements of the sequence: {2, 4, 6, 8, 10, 12}.  Use call by reference, and return the average as the function's return value.

in c++

in the C++ version please suppose to have a score corresponding with probabilities at the end and do not use the count[] function. Please explain the detail when coding. DO NOT USE ARRAY. The game of Pig The game of Pig is a dice game with simple rules: Two players race to reach 100 points. Each turn, a player repeatedly rolls a die until either a 1 ("pig") is rolled or the player holds and scores the sum of the rolls (i.e. the turn total). At any time during a player's turn, the player is faced with two decisions: roll - if the player rolls 1: the player scores nothing and it becomes the opponents turn. 2 - 6: the number is added to the player's turn total and the player's turn continues. hold - The turn total is added to the player's score and it becomes the opponent's turn. This game is a game of probability. Players can use their knowledge of probabilities to make an educated game decision.   Assignment specifications Hold-at-20 means that the player will choose to roll…

Please solve this in C programming language as early as possible. .Write a recursive function that can use to add all the numbers from 5 to n, where n>5. n will be given by the user. Prototype: int add_num(int n);

In Haskell: Code a function "rangeProduct" that takes two arguments. The function should return 0 if the second argument is smaller than the first, otherwise it should return the product of the range between two numbers, ex: rangeProduct 3 5 --> 60 (because 3*4*5 = 60) What to do for negative numbers to do (if anything) is up to you. Write the program without recursion first and then write it with recursion.

Write a function that asks the user for their birthday month and day and then the function should call a nested function to find out the person’s zodiac sign. Test your program with some user input. Aries: March 21 - April 19 Taurus: April 20 – May 20 Gemini: May 21- June 21 Cancer: June 22- July 22 Leo: July 23 – August 22 Virgo: August 23 – September 22 Libra: September 23 – October 23 Scorpio: October 24 – November 21  Sagittarius: November 22 – December 21 Capricorn: December 22 – January 19 Aquarius: January 20 – February 18 Pisces: February 19 – March 20

Write a function named product that takes two int parameters and returns the product of those two integers. Here is an example: int n = product(7, 5); // n is 35 We are providing a test framework that, if you wish, you may use with a compiler to test your function. What you will submit as your answer to this problem is only the product function. Do not submit things like the #include lines or a main routine. If we take the code you write in the space below and insert it into the program, the resulting program must build without compilation errors (mere warnings are allowed). You do not need to write comments in the code; we will not look at any comments. Here is the test framework that you may copy and paste into a C++ source file. For your own testing purposes, you might add additional tests in the main routine, although you won't be turning them in, of course. #include <iostream> #include <cassert> using namespace std; // SUBMIT AS YOUR ANSWER ONLY THE CODE BETWEEN THIS…