The factorial of 0 is defined to be 1. The factorial of a positive integer is defined to be the product of that integer times the factorial of the next smaller nonnegative integer. We use the notation n! to express the factorial of the integer n. Thus the factorial of 3 (written 3!) is 3 × (2!) = 3 × (2 × (1!)) = 3 × (2 × (1 × (0!))) = 3 × (2 × (1 × (1))) = 6. Design a recursive
Want to see the full answer?
Check out a sample textbook solutionChapter 5 Solutions
Computer Science: An Overview (13th Edition) (What's New in Computer Science)
Additional Engineering Textbook Solutions
Starting Out with C++: Early Objects
Absolute Java (6th Edition)
Differential Equations: Computing and Modeling (5th Edition), Edwards, Penney & Calvis
Java How to Program, Early Objects (11th Edition) (Deitel: How to Program)
Starting out with Visual C# (4th Edition)
Starting Out with C++: Early Objects (9th Edition)
- In mathematics, a prime number is a natural number greater than 1 that is not a product of two smaller natural numbers, i.e. is it has only two factors 1 and itself. A natural number greater than 1 that is not prime is called a composite number. For example, 5 is prime because the only ways of writing it as a product, 1 × 5 or 5 x 1, involve 5 itself. Note that the prime number series is: 2, 3, 4, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, .. a. Write a Java method named isPrime that takes a natural number as a parameter and returns the if the given number is prime or not using the following header: Public static boolean isPrime (int num) b. Write a Java class called PrimeNumbers that: Reads from the user a natural value n (should be less than or equal 200). Prints a list of the prime numbers from 2 to n and their number and values. The program has to work EXACTLY as given in the following sample run. Hints: You should create a single dimension array to store the prime…arrow_forwardFor each of the following program fragments: Give an analysis of the running time (Big-Oh). Justify your answer? A. public class GFG { // Linearly search x in att[]. if x is present then //return the index, otherwise return -1 static int search (int arr[], int n, intx) { int i; for (i = 0: iarrow_forwardA number in base 2 (binary) is a number such that each of its digits is 0 or 1. To convert frombinary to decimal (base 10), the digits starting from the right are multiplied by powers of 2(starting at 0) and added. For example, the value in decimal of 10011 is calculated as follows:arrow_forwardA decreasing sequence of numbers is a sequence of integers where every integer in the sequence is smaller than all other previous integers in that sequence. For example, •35, 16, 7, 2, 0, -3, -9 is a decreasing sequence of numbers. The length of this sequence is 7 (total numbers in the sequence) and the difference of this sequence is 35 - (-9) -44. • 5 is a decreasing sequence of numbers with length 1 and difference 5-5 = 0 •99,-99 is a decreasing sequence of numbers with length 2 and difference 99-(-99) = 198 •17, 23, 11, 8, -5, -3 is not a decreasing sequence of %3D numbers. Write a program that contains a main() function. The main function repeatedly asks the user to enter an integer if the previously entered integers form a decreasing sequence of numbers. This process stops as soon as the latest user input breaks the decreasing sequence. Then your function should print the length and difference of the decreasing sequence. Finally, call the main() function such that the call will be…arrow_forwardThe Fibonacci sequence is listed below: The first and second numbers both start at 1. After that, each number in the series is the sum of the two preceding numbers. Here is an example: 1, 1, 2, 3, 5, 8, 13, 21, ... If F(n) is the nth value in the sequence, then this definition can be expressed as F(1) = 1 F(2) = 1 F(3) = 2 F(4) = 3 F(5) = 5 F(6) = 8 F(7) = 13 F(8) = 21 F(n) = F(n - 1) + F(n - 2) for n > 2 Example: Given n with a value of 4F(4) = F(4-1) + F(4-2)F(4) = F(3) + F(2)F(4) = 2 + 1F(4) = 3 The value of F at position n is defined using the value of F at two smaller positions. Using the definition of the Fibonacci sequence, determine the value of F(10) by using the formula and the sequence. Show the terms in the Fibonacci sequence and show your work for the formula.arrow_forward= = 2×2 and 6 = (a) A composite number is a positive integer that has at least one divisor other than 1 and itself. For example, 2 1×2 is not a composite number but 4 2 × 3 are composite numbers. A logic circuit has four binary input variables, A, B, C and D. The output Z of the logic circuit is 1 if the unsigned integer represented by the binary number ABCD is a composite number. Using variables A and B for the select inputs S1 and S0 of a 4-to-1 multiplexer, implement the logic function Z(A, B, C, D) using this multiplexor and other logic gates.arrow_forwardRahul is a maths genius so he came up with a game and as raj is Rahul's best friend so Rahul decided to play the game with raj. Rahul gives raj two numbers LL and RR and asks raj to find the count of numbers in the range from LL to RR (LL and RR inclusive) which are a digit palindromic. A number is a digit palindromic if its first digit is the same as its last digit. As raj is not very good at maths so your task is to help Raj find out how many numbers are a digit palindromic in the range LL to RR. For example if LL = 88 and RR = 2525 .The following numbers are a digit palindromic in the range of LL to RR: 8, 9, 11, and 22. If LL = 12511251 and RR = 12661266. The digit palindromic numbers are 1251 and 1261. Input format The first line contains an integer denoting the number of test cases. Each test case is described by a single line that contains two integers LL and RR. Output format For each test case output, an integer denoting how many a digit palindromic numbers are there in the…arrow_forwardLet A = {a, b, c} and B = {u, v}. Write a. A × B b. B × Aarrow_forwardMaclaurin series are a type of Mathematic series expansion in which all terms are nonnegative real powers of the variable. The Maclaurin series expansion for sin(x) is given by the following formula that is valid for all real values of x such that x is in radians (Note that: radians(x) = x X 1/180): sin(x) = x - 3! 5! Implement a Java program to compute the value of Maclaurin series expansion for sin(x) where x is a nonnegative real value according to the following: a. Write a java method named Factorial that takes as an argument an integer value n and returns the mathematical factorial n! of n as a long value such that: n! = n x (n – 1) x (n – 2) ... × 2 x 1 b. In the main method: i. Ask the user to enter the value of the angle x to be calculate in the Maclaurin series expansion for sin(x) as given above. x Should be entered in degrees, i.e., 0° < x< 360° and then converted into radians using the formula: (radians(x) = x × 1/180). ii. Ask the user to enter the number of terms to be…arrow_forwardWe usually write numbers in decimal form (or base 10), meaning numbers are composed using 10 different “digits" {0,1, ...,9}. Sometimes though it is useful to write numbers hexadecimal or base 16. Now there are 16 distinct digits that can be used to form numbers: {0, 1,...,9, A, B, C, D, E, F}. So for example, a 3 digit hexadecimal number might be 2B8. Assume that digits and letter can be repeated. a. How many 4-digit hexadecimals are there in which the first digit is E or F? b. How many 5-digit hexadecimals start with a letter (A-F) and end with a numeral (0-9)?arrow_forwardWe usually write numbers in decimal form (or base 10), meaning numbers are composed using 10 different “digits" {0, 1,...,9}. Sometimes though it is useful to write numbers hexadecimal or base 16. Now there are 16 distinct digits that can be used to form numbers: {0, 1, ...,9, A, B, C, D, E, F}. So for example, a 3 digit hexadecimal number might be 2B8. a. How many 4-digit hexadecimals are there in which the first digit is E or F? 8192 b. How many 5-digit hexadecimals start with a letter (A-F) and end with a numeral (0-9)? c. How many 3-digit hexadecimals start with a letter (A-F) or end with a numeral (0-9) (or both)?arrow_forward(a) The following is an infinite product expression: π 4 = 3 Aco 4 5 7 11 13 17 19 23 29 X X X X X X X X 4 8 12 12 16 20 24 28 | In this formula, the numerators are the primes > 2, while each denominator is the multiple of 4 closest to the numerator. Write a function pi_euler1(n) which computes the value of the first n terms in the product. For example, pi_euler1 (3) should return 3.28125. (b) The next formula is an infinite sum: 1 1 1 1 1 1 1 1 π = 1+ + + + + + + 2 3 4 5 6 7 8 9 31 32 1 1 1 + + 10 11 12 1 13 +... In this formula, each fraction 1/m has a sign (1) determined by: the first two terms have positive signs; after that, if the denominator is a prime of the form 4m - 1 (for example, n = 3, 7, 11, ...), the sign is positive; if the denominator is a prime of the form 4m + 1 (for example, n = 5, 13, 17,...), the sign is negative; if the denominator is a composite number, then the sign is equal to the product of the signs corresponding to its factors (for example, n = 9 = 3 × 3,…arrow_forwardarrow_back_iosSEE MORE QUESTIONSarrow_forward_ios
- C++ for Engineers and ScientistsComputer ScienceISBN:9781133187844Author:Bronson, Gary J.Publisher:Course Technology Ptr