Problem 57730. Easy Sequences 97: One-line Code Challenge - Sequence with Constant Difference

• Created by Ramon Villamangca

×

Like (0)

Difficulty:

(1)

Rate

• Solve Later   
• Add To GroupÂ

While answering Problem #57725, I noticed a pattern that immediately led me to a solution, namely: the 4-th difference of the sequence is constant. In that problem's case the constant is 6:

diff(A,4) == [6 6 6 6 ...]

where A is the sequence.

Given an integer n and a vector V that enumerates the first k elements of A, write a function that outputs the n-th element of A, such that the -th difference is a constant:

diff(A,k-1) == [c c c c ...]

-------------

NOTE: The following restrictions apply:

• The function should only have one (1) line of code, excluding the function start line.
• Semicolons (;) are considered end-of-line characters.
• To encourage vectorization, for and while loops are not allowed
• Regular expressions, string manipulation and curve fitting are not allowed.

Solve

Solution Stats

50.0% Correct | 50.0% Incorrect

• 2 Solutions
• 1 Solvers

Last Solution submitted on Apr 29, 2023

Last 200 Solutions

Solution Comments

Problem Recent Solvers1

Suggested Problems

• Pangrams!

  3910 Solvers

• Doubling elements in a vector

  9368 Solvers

• Sum of series VII

  1373 Solvers

• geometric progression

  117 Solvers

• Fibonacci Decomposition

  774 Solvers

More from this Author116

• Easy Sequences 66: Fractional Part of Sum of Consecutive Powers over a Prime

  4 Solvers

• Easy Sequences 90: Triple Summation of a Combinatorial Function

  2 Solvers

• Easy Sequences 104: One-line Code Challenge - GCDs of Sum of Consecutive Cubes

  5 Solvers

• Easy Sequences 39: Perfect Squares in Pascal's Triangle

  6 Solvers

• Easy Sequences 47: Boxes with Prime Edges

  5 Solvers