Problem 52669. Count the primes in Collatz sequences

• Created by ChrisR

×

Like (1)

Difficulty:

(2)

Rate

• Solve Later   
• Add To GroupÂ

Several Cody problems (21, 69, 42937, 44448, 44784, 52422) involve Collatz sequences. These start with a seed n. If n is odd, the next element is , and if n is even, the next element is . For example, if the seed is 3, then the sequence is 3, 10, 5, 16, 8, 4, 2, 1. The Collatz conjecture is that all of these sequences terminate at the value 1; that is, all seeds lead to terminating sequences.

This problem deals with the number of primes in the sequence. With a seed of 3, the number of primes is 3 (2, 3, 5).

Write a function to determine the numbers of primes in the sequences with seeds of 1 to the input number. See the test suite for banned terms and commands.

Solve

Solution Stats

80.0% Correct | 20.0% Incorrect

• 20 Solutions
• 16 Solvers

Last Solution submitted on Feb 16, 2025

Last 200 Solutions

Solution Comments

Problem Recent Solvers16

Suggested Problems

• Remove any row in which a NaN appears

  8670 Solvers

• Check if sorted

  4432 Solvers

• First non-zero element in each column

  887 Solvers

• Make a diamond

  91 Solvers

• Determine the number of odd integers in a vector

  763 Solvers

More from this Author298

• Evaluate the Kelvin functions

  4 Solvers

• Design a capture zone

  3 Solvers

• List the nth term of Rozhenko’s inventory sequence

  9 Solvers

• Sum the unitary divisors of a number

  9 Solvers

• Explore the twin prime Goldbach conjecture

  5 Solvers