Your question is Prime Divisors and Fibonacci. Start with the requirements on the right.
Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.
Bloomberg Industry Group services may need compact numeric summaries for validation and analysis. Given an integer n and a nonnegative integer k, return its distinct prime divisors in ascending order and the first k values of the Fibonacci sequence.
Use the Fibonacci definition F(0) = 0, F(1) = 1, and F(i) = F(i - 1) + F(i - 2). The prime-divisor list must contain each divisor once, even when a prime divides n multiple times.
Implement generate_number_summary(n, k).
n, an integer at least 2, and k, an integer at least 0.prime_divisors, containing an ascending list of distinct prime divisors of n, and fibonacci, containing the first k Fibonacci numbers.def generate_number_summary(n, k):