Problem 83. Prime factor digits

• Created by Cody Team
• Appears in 2 groups

×

By solving this problem, you will make progress in the following group(s)

Basics - Factorization

• 10 Problems
• 227 Finishers

The Prime Directive

• 14 Problems
• 37 Finishers

Like (26)

Difficulty:

(1224)

Rate

• Solve Later   
• Add To GroupÂ

Consider the following number system. Calculate the prime factorization for each number n, then represent the prime factors in a vector like so:

13 11 7 5 3 2

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

2: 1

3: 1 0

4: 2

5: 1 0 0

6: 1 1

12: 1 2

14: 1 0 0 1

18: 2 1

26: 1 0 0 0 0 1

60: 1 1 2

Each "place" in the number system represents a prime number. Given n, return the vector p.

As shown above, if n = 26, then p = [1 0 0 0 0 1].

The input n is always an integer greater than 1. Suppress any leading zeros. The length of the vector is determined by the largest prime factor.

Solve

Solution Stats

49.95% Correct | 50.05% Incorrect

• 5265 Solutions
• 2401 Solvers

Last Solution submitted on May 09, 2025

Last 200 Solutions

Solution Comments

Problem Recent Solvers2401

Suggested Problems

• Which values occur exactly three times?

  5159 Solvers

• Rotate a Matrix by 90 degrees

  956 Solvers

• Matrix with different incremental runs

  535 Solvers

• 01 - Scalar variables

  725 Solvers

• (Linear) Recurrence Equations - Generalised Fibonacci-like sequences

  357 Solvers

More from this Author96

• Given two arrays, find the maximum overlap

  1627 Solvers

• Return the 3n+1 sequence for n

  8372 Solvers

• Return the largest number that is adjacent to a zero

  5427 Solvers

• Get the area codes from a list of phone numbers

  1065 Solvers

• Finding Perfect Squares

  19742 Solvers