Problem 43684. 0, 2, 0, -2, 0, 2, 0, -2, ...

f(x) = 0, 2, 0, -2, 0, 2, 0, -2, ..., for x = 1, 2, 3, 4, 5, 6, 7, 8, ...

Solution Comments

Problem Recent Solvers81

Suggested Problems

• Project Euler: Problem 10, Sum of Primes

  2093 Solvers

• "mirror" matrix

  691 Solvers

• How many jokers?

  292 Solvers

• Largest Prime Number

  151 Solvers

• Back to Basics - Find no. of elements in a matrix?

  328 Solvers

More from this Author28

• Words Count: A Cell Array Approach

  68 Solvers

• Cody meets Xiangqi: foresee the unseen (Part 1)

  9 Solvers

• Fast 1-D Convolution (valid shape)

  17 Solvers

• Block average

  46 Solvers

• Fast 1-D Convolution (full shape)

  34 Solvers