Problem 84. Longest Divisor Run

Created by Cody Team
Appears in Indexing II

Difficulty:Rate

Solve Later
Add To GroupÃ‚

Given the vector a, find the longest run of consecutive numbers that can be evenly divided by the same number d where d > 1.

Example:

 Input  a = [5 4 2 8 3 7 14]
 Output len is 3, d is 2

The last two numbers, 7 and 14, are divisible by 7, but the run of numbers [4 2 8] are all divisible by 2. So the longest run is 3. You can assume that d is unique.

Solve

Solution Stats

2403 Solutions
1334 Solvers

Last Solution submitted on Apr 25, 2025

Last 200 Solutions

Problem Comments

1 Comment

1 Comment

Brandon on 21 Jun 2023

A lot of the smaller answers use gcd, which fails for a=[2 4 6 9 18 21]. This is because the gcd of 9 and 18 is 9, but for 6 and 9 it's 3, which throws off the tally count because 3 is also common between 9 and 18.

Solution Comments

Show 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 Solvers1334

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Problem 84. Longest Divisor Run

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Registration Now Open for MathWorks AUTOMOTIVE CONFERENCE 2025

Problem Recent Solvers1334

Suggested Problems

More from this Author96

Problem Tags

Community Treasure Hunt

Problem 84. Longest Divisor Run

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Registration Now Open for MathWorks AUTOMOTIVE CONFERENCE 2025

Problem Recent Solvers1334

Suggested Problems

More from this Author96

Problem Tags

Community Treasure Hunt

Players