Compute the N-point DFT of the following finite-length sequences considered to be of length N (N is even): (a) x[n] = ( 1, n odd 0, n even
(b) x[n] = 1 2 1 − cos 2πn N
(c) x[n] = ( 1, 0 ≤ n ≤ N 2 − 1 0, N 2 ≤ n ≤ N − 1

i believe it is c.y = 9x

rise over run. 9 units up over 1 unit right or 9/1

b: |12 – x| ≤ 0.25

step-by-step explanation:      

let x be the possible lengths in inches, of the ribbons jaime cut.

we have been given that jaime is cutting strips of ribbon for a project. he tries to cut each piece to be 12 inches long, but sometimes he cuts it too long or too short by as much as 0.25 inch.  

we can represent this information in an inequality as:

by the definition of absolute value function we will get,

upon combining our inequalities we will get,

therefore, the inequality   describes all the possible lengths (x), in inches, of the ribbons jaime cut.

step-by-step explanation:

answer: 0,6

step-by-step explanation:

this would make it the y intercept.

circumference divided by 3.141592654 then timesthe radius twice

step-by-step explanation:

circumference divided by 3.141592654 then timesthe radius twice