Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
3. Write a function called hwd_problem3 that takes k, a positive integer scalar as an input (you do not need to check this). The function returns p, the smallest prime number smaller than 1000 such that p+k is also prime. If no such prime exists, the function returns 0. You may use the built-in functions primes and/or isprime.

3. Write a function called hwd_problem3 that takes k, a positive integer scalar as an input (you do not need to check this). The function returns p, the smallest prime number smaller than 1000 such that p+k is also prime. If no such prime exists, the function returns 0. You may use the built-in functions primes and/or isprime.

Database System Concepts
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
See similar textbooks
icon
Related questions
Question

How do I do number 3

3. Problems Write a function called hw4 problem1 that takes two inputs: a vector v and a positive integer scalar n. You do NOT need to check these assumptions. The function needs to find the n consecutive elements in v whose sum is the maximum. It needs to return the sum and the index of the first of these elements. If there are multiple such n consecutive elements in v, it returns the first one, i.e., the one with the smallest index. Here is an example run: 1. > [total ind] = hw4_problem1([1 2 3 4 5 4 3 2 1],3) total = 1 13 ind = 4 Write a function called hw4_problem2 that takes a vector v as input. The function checks whether the elements of v are monotonically non-decreasing or not. In other words, any element of v must not be smaller than the previous element. The function returns a logical true if the condition holds and false otherwise. The function also returns a logical false if the input is not a vector (or scalar). 2. Write a function called hw4_problem3 that takes k, a positive integer scalar as an input (you do not need to check this). The function returns p, the smallest prime number smaller than 1000 such that p+k is also prime. If no such prime exists, the function returns 0. You may use the built-in functions primes and/or isprime. 3. 2 4. Write a function called hw4 problem4 that computes a sum as defined below. The function returns the smallest n such that the sum is greater than the single input argument called limit. As a second output, the function also returns the corresponding sum. 1 1 1 1 = 1+=+ =+ 2 S = + k 4 k=1 You are not allowed to use for loops. Here are a few examples: >> [n s] = hw4_problem4 (1) 2 S = 1.500000000000000 » [n s] = hw4_problem4 (2) n = 4 S = 2.083333333333333 >> [n s] = hw4_problem4 (8) n = 1674
Transcribed Image Text:3. Problems Write a function called hw4 problem1 that takes two inputs: a vector v and a positive integer scalar n. You do NOT need to check these assumptions. The function needs to find the n consecutive elements in v whose sum is the maximum. It needs to return the sum and the index of the first of these elements. If there are multiple such n consecutive elements in v, it returns the first one, i.e., the one with the smallest index. Here is an example run: 1. > [total ind] = hw4_problem1([1 2 3 4 5 4 3 2 1],3) total = 1 13 ind = 4 Write a function called hw4_problem2 that takes a vector v as input. The function checks whether the elements of v are monotonically non-decreasing or not. In other words, any element of v must not be smaller than the previous element. The function returns a logical true if the condition holds and false otherwise. The function also returns a logical false if the input is not a vector (or scalar). 2. Write a function called hw4_problem3 that takes k, a positive integer scalar as an input (you do not need to check this). The function returns p, the smallest prime number smaller than 1000 such that p+k is also prime. If no such prime exists, the function returns 0. You may use the built-in functions primes and/or isprime. 3. 2 4. Write a function called hw4 problem4 that computes a sum as defined below. The function returns the smallest n such that the sum is greater than the single input argument called limit. As a second output, the function also returns the corresponding sum. 1 1 1 1 = 1+=+ =+ 2 S = + k 4 k=1 You are not allowed to use for loops. Here are a few examples: >> [n s] = hw4_problem4 (1) 2 S = 1.500000000000000 » [n s] = hw4_problem4 (2) n = 4 S = 2.083333333333333 >> [n s] = hw4_problem4 (8) n = 1674
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 2 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Types of Function
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS