Problem 52669. Count the primes in Collatz sequences
Solution Stats
Problem Comments
-
4 Comments
I notice that p=isprime(x) can be a lot slower than p=ismember(x,primes(max(x))); for x=1:1e7, the former takes about 100 seconds and the latter takes about 0.1 seconds.
Nice observation. I'll keep that one in mind.
Actually for the first case (seed n = 1), the answer should be 1 and not 0, since the corresponding Collatz sequence is the loop (1, 4, 2), should'nt it be ?
Ok I suppose we don't count the special case of this infinite loop since we do have to stop the sequence at a point ! (1)
Solution Comments
Show commentsProblem Recent Solvers19
Suggested Problems
-
2398 Solvers
-
Removing rows from a matrix is easy - but what about inserting rows?
253 Solvers
-
651 Solvers
-
Volume of a sphere given its surface area
152 Solvers
-
Integer Sequence - II : New Fibonacci
664 Solvers
More from this Author315
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!