collatz_max_climb.c-- Given any positive integer n, display the number of steps required to reach 1 along with the highest number reach while iterating through the sequencecollatz_longest_progression.c-- Given any positive integer n, display the positive integer k, where 1 <= k <= n, that has the most number of steps. Display the number of steps for k along with the number milliseconds needed to determine the answer
-
Notifications
You must be signed in to change notification settings - Fork 0
yousafk/collatz-conjecture-fun
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Investigation of the collatz conjecture to determine for a positive integer n the number of steps and the highest number reached
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published