Mathematical approach

Iterative Approach using a List

The Fibonacci series has a repeating pattern. We can use this pattern to quickly figure out where the nth multiple of a number k is in the series by using a specific math method to recognize when a Fibonacci number is a multiple of k.

Example: The Position of nth Multiple of a Number in the Fibonacci Series using an Iterative Approach in JavaScript.

Javascript

// JavaScript function to find the position of 
// nth multiple of a number k in the Fibonacci Series
 
function findPosition(k, n) {
  let f1 = 0;
  let f2 = 1;
  let i = 2;
 
  while (true) {
    let f3 = f1 + f2;
    f1 = f2;
    f2 = f3;
 
    if (f2 % k === 0) {
      return n * i;
    }
 
    i++;
  }
}
 
let n = 5;
let k = 4;
 
console.log(
  "Position of nth multiple of k in Fibonacci Series is",
  findPosition(k, n)
);

Output

Position of nth multiple of k in Fibonacci Series is 30

Time Complexity: O(N)

Space Complexity: O(1)

nth Multiple of a Number in Fibonacci Series in JavaScript

The Fibonacci series is a sequence of numbers where each number is the sum of the two previous ones, usually starting with 0 and 1. Given two integers n and k, the task is to find the position of the nth multiple of k in the Fibonacci series. For instance, if k = 2 and n = 3, the output would be 9 since the third multiple of 2 in the Fibonacci series is 34, which appears at position 9. There are multiple ways to find the nth multiple of a number in the Fibonacci series in Javascript which is as follows:

Table of Content

Mathematical approach
Iterative Approach using a List
Recursive Fibonacci Series with Memoization

Tags:

#JavaScript-Methods #JavaScript #Web Technologies

Iterative Approach using a List

Mathematical approach

Javascript

nth Multiple of a Number in Fibonacci Series in JavaScript

Similar Reads

Contact Us