For a given integer n (n>1), compute the sum f (i) (1 <= i <= n) where f (i) = 1 if n is odd and 2 otherwise.
could you give an example? it's kind of hard to figure out what you're asking for.
sorry, f(i) = 2 if i = even
Not sure where the 'vectorization' is coming from for this problem.
Find best domino orientation
Is it an Armstrong number?
frame of the matrix
Length of the hypotenuse
Sum of the Matrix Elements
A quadrant matrix
Create a matrix X, where each column is a shifted copy of the vector v
Matrix with different incremental runs
Matrix which contains the values of an other matrix A at the given locations.
Duplicate each element of a vector.
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
You can also select a web site from the following list:
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.
Contact your local office