Problem 299. vectorization in N

• Created by Julio
• Appears in 3 groups

×

By solving this problem, you will make progress in the following group(s)

Board Games I

• 16 Problems
• 21 Finishers

Classic Game Puzzles

• 11 Problems
• 14 Finishers

Chess

• 18 Problems
• 4 Finishers

Like (1)

Difficulty:

(49)

Rate

• Solve Later   
• Add To GroupÂ

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.

Solve

Solution Stats

64.39% Correct | 35.61% Incorrect

• 542 Solutions
• 276 Solvers

Last Solution submitted on Apr 21, 2025

Last 200 Solutions

Solution Comments

ANNOUNCEMENT ×

Registration Now Open for MathWorks AUTOMOTIVE CONFERENCE 2025

Hello Community, We're excited to announce that registration is now open for the...

Problem Recent Solvers276

Suggested Problems

• Which values occur exactly three times?

  5149 Solvers

• Find state names that start with the letter N

  1325 Solvers

• Which quadrant?

  344 Solvers

• Project Euler: Problem 2, Sum of even Fibonacci

  2522 Solvers

• find the maximum element of the matrix

  515 Solvers

More from this Author10

• Remove from a 2-D matrix all the rows that contain at least one element less than or equal to 4

  136 Solvers

• No Twins?

  261 Solvers

• Duplicate each element of a vector.

  618 Solvers

• Find the elements of a matrix according to a defined property.

  87 Solvers

• First non-zero element in each column

  878 Solvers