Write a program to enter a natural number n and find all sphenic numbers from 1 to n using Recursion (combined with iteration if necessary). Note: A sphenic number is a product of p*q*r where p, q, and r are three distinct prime numbers. Example: 30 = 2 * 3* 5; 42 = 2*3*7; 66 = 2*3*11. 30, 42, 66, 70, 78, 102, 105, 110, 114, 130, 138, 154, 165, … are sphenic numbers.

Write a program to enter a natural number n and find all sphenic numbers from 1 to n using Recursion (combined with iteration if necessary). Note: A sphenic number is a product of pqr where p, q, and r are three distinct prime numbers. Example: 30 = 2 * 3* 5; 42 = 237; 66 = 2311. 30, 42, 66, 70, 78, 102, 105, 110, 114, 130, 138, 154, 165, … are sphenic numbers.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter8: Arrays And Strings

Section: Chapter Questions

Problem 21PE

See similar textbooks

Similar questions

Given a string str and number n, write a program that recursively appends a copy of string str n times and returns the resulting string. For example: RecuriveCopy("a", 10) // -> "aaaaaaaaaaa" RecursiveCopy("blah", 5) // -> "blahblahblahblahblahblah" For this exercise, complete the following function. n is the number of copies to add to str: function RecursiveCopy(str, n) { // your code here } Part 2: Call RecursiveCopy Write another function that calls RecursiveCopy() and returns the following string output: "The resulting string [x] has [y] characters". [x] should be replaced by the result from RecursiveCopy) and [y] should be replaced by the number of characters in the resulting string. You may pick the arguments to RecursiveCopy in CountChars or have the user provide input. I will leave this up to you. function CountChars() { } // your code here // call RecursiveCopy(..) // returns a formatted string For example: console.log(CountChars()) // -> "The resulting string blahblahblahblah…
PHP A factorial of any given integer, n , is the product of all positive integers between 1 and n inclusive. So the factorial of 4 is 1 × 2 × 3 × 4 = 24, and the factorial of 5 is 1 × 2 × 3 × 4 × 5 = 120. This can be expressed recursively as follows: ❑ If n == 0, return 1. (This is the base case) ❑ If n > 0, multiply numbers from n down to 1. Write a PHP function to display the factorials of the integers up to the given value(argument). Any format could be used for displaying. Write the recursive version of the same function to display the factorials of the integers up to the given value(argument). Any format could be used for displaying.
Complete the following recursive method for computing the factorial of an integer. Assume that n is greater than or equal to 0. a. result = n * factorial(n - 1)b. result = n * factorial(n)c. result = factorial(n - 1)d. result = (n - 1) * factorial(n)e. result = (n - 1) * factorial(n - 1)
The Fibonacci algorithm is a famous mathematical function that allows us to create a sequence of numbers by adding together the two previous values. For example, we have the sequence:1, 1, 2, 3, 5, 8, 13, 21…Write your own recursive code to calculate the nth term in the sequence. You should accept a positive integer as an input, and output the nth term of the sequence.Once you have created your code, add comments describing how the code works, and the complexity of any code you have created.
The word ladder game was invented by Lewis Carroll in 1877. The idea is to begin with a start word and then change one letter at a time until you arrive at an end word. Each word along the way must be an English word. For example, starting from FISH, you can arrive at MAST through the following word ladder:FISH, WISH, WASH, MASH, MAST Write a program that uses recursion to find the word ladder given a start word and an end word, or that determines no word ladder exists. Use the file words.txt that is available online with the source code for the book as your dictionary of valid words. This file contains 87,314 words. Your program does not need to find the shortest word ladder between words; any word ladder will do if one exists. list aalii aardvark aardvarks aardwolf aba abaca abaci abacist aback abacus abacuses abaft abalone abalones abamp abampere abandon abandoned abandonee abandoner abandoners
please code in python Write a recursive function to add a positive integer b to another number a, add(a, b), where only the unit 1 can be added, For example add(5, 9) will return 14. The pseudocode is: # Base case: if b is 1, you can just return a + 1 # General case: otherwise, return the sum of 1 and what is returned by adding a and b - 1.
write program that uses recursion to calculate triangular numbers. Enter a value for the term number, n, and the program will display the value of the corresponding triangular number.shows the triangle.cpp program.
1. Write a recursive method expFive(n) to compute y=5^n. For instance, if n is 0, y is 1. If n is 3, then y is 125. If n is 4, then y is 625. The recursive method cannot have loops. Then write a testing program to call the recursive method. If you run your program, the results should look like this: > run RecExpTest Enter a number: 3 125 >run RecExpTest Enter a number: 3125 2. For two integers m and n, their GCD(Greatest Common Divisor) can be computed by a recursive function. Write a recursive method gcd(m,n) to find their Greatest Common Divisor. Once m is 0, the function returns n. Once n is 0, the function returns m. If neither is 0, the function can recursively calculate the Greatest Common Divisor with two smaller parameters: One is n, the second one is m mod n. Although there are other approaches to calculate Greatest Common Divisor, please follow the instructions in this question, otherwise you will not get the credit. Meaning your code needs to follow the given algorithm. Then…
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 × 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: o Reads from the user a natural value n (should be less than or equal 200). o Prints a list of the prime numbers from 2 to n and their number and values. o The program has to work EXACTLY as given in the following sample run.
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…
Using recursion, write a Java program that takes an input ‘n’ (a number) ( user should gives the n value if user asks fibonacci series of 20 then it should display 20 numbers of fibonacci)from a user to calculate and print out the Fibonacci using the following modified definition: F(N) = 1 if n = 1 or n = 2 = F((n+1)/2)2 + F((n-1/2)2 if n is odd = F(n/2 + 1)2 – F(n/2 – 1)2 if n is even
If your first name starts with a letter from A-J inclusively: Create a recursive algorithm to compute the product of two positive integers, m and n, using only addition and subtraction. Implement the Java or Python code. Hint: You need subtraction to count down from m or n and addition to do the arithmetic needed to get the right answer. Check linearSum method from Week 5 examples. If your first name starts with a letter from K-Z inclusively: Write a recursive method to produce the following pattern: * ** *** **** *** ** * Test the method by asking the user to enter the number of asterisks of the maximum line (for example, the user should enter 4 in this case).