P1: Write a function called FindPrimes that takes 2 scalars, lowerRange and upperRange, and produces a 1D array called o
Posted: Thu May 05, 2022 12:43 pm
P1: Write a function called FindPrimes that takes 2 scalars, lowerRange and upperRange, and produces a 1D array called outPrimes1. The function finds all the prime numbers within the range defined by lower Range and upperRange. The output outPrimes1 is a 1D array with all the primes within the specified range. Remember that a prime number is a whole number greater than 1 whose only factors are 1 and itself. The input arguments (lowerRange, upperRange) are two (numeric) scalars. The output argument (outPrimes1) is a 1xm (numeric) array. Restrictions: Do not use the primes() function. Hint: use a for loop to go through the entire range and check if the number is prime or not using the isprime() function. For example: For the given inputs: lowerRange = 2; upperRange= 20; On calling FindPrimes: outPrimes1 Find Primes (lower Range, upperRange) produces, outPrimes1 = 1x8 2 3 5 7 11 13 17 19 In outPrimes1 all the prime numbers contained within the range of lowerRange=2 and upperRange=20 are shown.
P2 Complete the function FindPrimes to produce a 1D array called outPrimes2. outPrimes2 is a copy of outPrimes1 but contains only the prime numbers that summed together are less than the highest element of outPrimes 1. The input arguments (lowerRange, totalNumbers) are two (numeric) scalars. The output argument (outPrimes2) is a 1 x n (numeric) array. Restrictions: Do not use the primes() function. Hint: use a while loop to go through the outPrimes1 array and and check if the total sum is lower than the highest primer number in outPrimes1. For example: For the given inputs: lower Range = 2; upperRange=20; On calling FindPrimes: outPrimes2= Find Primes (lower Range, upperRange) produces, outPrimes2 = 1x4 2 3 5 7 The output outPrimes2 only contains the prime numbers 2 3 5 7. The sum of all the prime numbers in outPrimes2 is 17, less than 19, which is the highest prime number in outPrimes1.
Function > 1 function [outPrimes1, outPrimes2] = FindPrimes (lower Range, upper Range) %Enter your name and section here 2 3 4 endl Code to call your function > 1 lower Range = 2; 2 upperRange=20; 3 [out Primes1, outPrimes2]=FindPrimes (lower Range, upper Range) Save C Reset MATLAB Documentation C Reset
P2 Complete the function FindPrimes to produce a 1D array called outPrimes2. outPrimes2 is a copy of outPrimes1 but contains only the prime numbers that summed together are less than the highest element of outPrimes 1. The input arguments (lowerRange, totalNumbers) are two (numeric) scalars. The output argument (outPrimes2) is a 1 x n (numeric) array. Restrictions: Do not use the primes() function. Hint: use a while loop to go through the outPrimes1 array and and check if the total sum is lower than the highest primer number in outPrimes1. For example: For the given inputs: lower Range = 2; upperRange=20; On calling FindPrimes: outPrimes2= Find Primes (lower Range, upperRange) produces, outPrimes2 = 1x4 2 3 5 7 The output outPrimes2 only contains the prime numbers 2 3 5 7. The sum of all the prime numbers in outPrimes2 is 17, less than 19, which is the highest prime number in outPrimes1.
Function > 1 function [outPrimes1, outPrimes2] = FindPrimes (lower Range, upper Range) %Enter your name and section here 2 3 4 endl Code to call your function > 1 lower Range = 2; 2 upperRange=20; 3 [out Primes1, outPrimes2]=FindPrimes (lower Range, upper Range) Save C Reset MATLAB Documentation C Reset