How do I do number 3 3. ProblemsWrite a function called hw4 problem1 that takes two inputs: a vector v and a positive integer scalar n. You do NOT need to checkthese assumptions. The function needs to find the n consecutive elements in v whose sum is the maximum. It needs to return thesum 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 =113ind =4Write a function called hw4_problem2 that takes a vector v as input. The function checks whether the elements of v aremonotonically 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 falseif 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 primeexists, the function returns 0. You may use the built-in functions primes and/or isprime.3.24. Write a function called hw4 problem4 that computes a sum as defined below. The function returns the smallest n such that thesum is greater than the single input argument called limit. As a second output, the function also returns the corresponding sum.1111= 1+=+ =+2S =+k4k=1You are not allowed to use for loops. Here are a few examples:>> [n s] = hw4_problem4 (1)2S =1.500000000000000» [n s] = hw4_problem4 (2)n =4S =2.083333333333333>> [n s] = hw4_problem4 (8)n =1674

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

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

Similar questions

Output: are you using random numbers? can any sequence of numbers be used?
Write a java statement to coompute square root of 36
None
10.
step 2 is wrong
What is the result of 25 / 4? How would you rewrite the expression if you wished the result to be an integer number?
?(Is the word xxxy not exist in L(G Yes No
Q2: Write FORTRAN90 computer program to ORDER four different integer numbers in decreasing order.
Give me answer fast. Is urgent
Write a VERILOG code to compute the factorial of a number. You may need to make certainassumptions during the design of this system. State the assumptions used.
C++
Q2/ find the result of this operation with draw its : V(T)= 6u (t-2) - 6u (t-6)