Problem 52669. Count the primes in Collatz sequences

• Created by ChrisR

×

Like (1)

Difficulty:

(23)

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

• Make the vector [1 2 3 4 5 6 7 8 9 10]

  50765 Solvers

• Reverse Run-Length Encoder

  2649 Solvers

• Generate pi using logarithm

  245 Solvers

• Return 'on' or 'off'

  490 Solvers

• Back to basics - mean of corner elements of a matrix

  435 Solvers

More from this Author298

• Find pairs of primes with the same digit sum

  10 Solvers

• List ways to make a sum in Killer Sudoku

  3 Solvers

• Count the square-full divisors of a number

  7 Solvers

• Play PRIMEGAME

  14 Solvers

• Integrate a product of gamma functions

  5 Solvers