The Collatz conjecture says that you will always eventually reach the number 1. This conjecture has been tested to hold true for all starting numbers up to 87 x 260 but currently, no one has been able to mathematically prove that it holds true for any starting integer! For example, starting with the number 6, we get the numbers 6, 3, 10, 5, 16, 8, 4, 2, 1. These sequences are known as hailstone sequences. Write a program hailstones.py that prints all hailstone sequences with starting numbers from 1 to N and prints the number that has the longest hailstone sequence. The value of N is must be a positive integer obtain from standard input. Sample Program Input/Output The user inputs are appended by # and not part of the specification.

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

Can you help find the answer?

Example 2
$ рython3 hailstones.pу
N: #6
Hailstone sequences for 1 to 6:
1
2, 1
3, 10, 5, 16, 8, 4, 2, 1
4, 2, 1
5, 16, 8, 4, 2, 1
6, 3, 10, 5, 16, 8, 4, 2, 1
First longest sequence found in n = 6
Example 3
$ python3 hailstones.py
N: #20
Hailstone sequences for 1 to 20:
1
2, 1
3, 10, 5, 16, 8, 4, 2, 1
4, 2, 1
5, 16, 8, 4, 2, 1
6, 3, 10, 5, 16, 8, 4, 2, 1
7, 22, 11, 34, 17, 52, 26, 13, 40, 20, 10, 5, 16, 8, 4, 2, 1
8, 4, 2, 1
9, 28, 14, 7, 22, 11, 34, 17, 52, 26, 13, 40, 20, 10, 5, 16, 8, 4, 2, 1
10, 5, 16, 8, 4, 2, 1
11, 34, 17, 52, 26, 13, 40, 20, 10, 5, 16, 8, 4, 2, 1
12, 6, 3, 10, 5, 16, 8, 4, 2, 1
13, 40, 20, 10, 5, 16, 8, 4, 2, 1
14, 7, 22, 11, 34, 17, 52, 26, 13, 40, 20, 10, 5, 16, 8, 4, 2, 1
15, 46, 23, 70, 35, 106, 53, 160, 80, 40, 20, 10, 5, 16, 8, 4, 2, 1
16, 8, 4, 2, 1
17, 52, 26, 13, 40, 20, 10, 5, 16, 8, 4,
, 2, 1
18, 9, 28, 14, 7, 22, 11, 34, 17, 52, 26, 13, 40, 20, 10, 5, 16, 8, 4, 2,
19, 58, 29, 88, 44, 22, 11, 34, 17, 52, 26, l3, 40, 20, 10, 5, 16, 8, 4,
20, 10, 5, 16, 8, 4, 2, 1
First longest sequence found in n = 18
Transcribed Image Text:Example 2 $ рython3 hailstones.pу N: #6 Hailstone sequences for 1 to 6: 1 2, 1 3, 10, 5, 16, 8, 4, 2, 1 4, 2, 1 5, 16, 8, 4, 2, 1 6, 3, 10, 5, 16, 8, 4, 2, 1 First longest sequence found in n = 6 Example 3 $ python3 hailstones.py N: #20 Hailstone sequences for 1 to 20: 1 2, 1 3, 10, 5, 16, 8, 4, 2, 1 4, 2, 1 5, 16, 8, 4, 2, 1 6, 3, 10, 5, 16, 8, 4, 2, 1 7, 22, 11, 34, 17, 52, 26, 13, 40, 20, 10, 5, 16, 8, 4, 2, 1 8, 4, 2, 1 9, 28, 14, 7, 22, 11, 34, 17, 52, 26, 13, 40, 20, 10, 5, 16, 8, 4, 2, 1 10, 5, 16, 8, 4, 2, 1 11, 34, 17, 52, 26, 13, 40, 20, 10, 5, 16, 8, 4, 2, 1 12, 6, 3, 10, 5, 16, 8, 4, 2, 1 13, 40, 20, 10, 5, 16, 8, 4, 2, 1 14, 7, 22, 11, 34, 17, 52, 26, 13, 40, 20, 10, 5, 16, 8, 4, 2, 1 15, 46, 23, 70, 35, 106, 53, 160, 80, 40, 20, 10, 5, 16, 8, 4, 2, 1 16, 8, 4, 2, 1 17, 52, 26, 13, 40, 20, 10, 5, 16, 8, 4, , 2, 1 18, 9, 28, 14, 7, 22, 11, 34, 17, 52, 26, 13, 40, 20, 10, 5, 16, 8, 4, 2, 19, 58, 29, 88, 44, 22, 11, 34, 17, 52, 26, l3, 40, 20, 10, 5, 16, 8, 4, 20, 10, 5, 16, 8, 4, 2, 1 First longest sequence found in n = 18
Q6 - PIAT: Collatz Conjecture
The Collatz conjecture says that you will always eventually reach
the number 1. This conjecture has been tested to hold true for all
starting numbers up to 87 x 260 but currently, no one has been
able to mathematically prove that it holds true for any starting
integer!
For example, starting with the number 6, we get the numbers 6,
3, 10, 5, 16, 8, 4, 2, 1.These sequences are known as
hailstone sequences.
Write a program hailstones.py that prints all hailstone
sequences with starting numbers from 1 to N and prints the
number that has the longest hailstone sequence.
The value of N is must be a positive integer obtain from standard
input.
Sample Program Input/Output
The user inputs are appended by # and not part of the
specification.
Example 1
$ python3 hailstones.py
N: #0
N must be positive!
Transcribed Image Text:Q6 - PIAT: Collatz Conjecture The Collatz conjecture says that you will always eventually reach the number 1. This conjecture has been tested to hold true for all starting numbers up to 87 x 260 but currently, no one has been able to mathematically prove that it holds true for any starting integer! For example, starting with the number 6, we get the numbers 6, 3, 10, 5, 16, 8, 4, 2, 1.These sequences are known as hailstone sequences. Write a program hailstones.py that prints all hailstone sequences with starting numbers from 1 to N and prints the number that has the longest hailstone sequence. The value of N is must be a positive integer obtain from standard input. Sample Program Input/Output The user inputs are appended by # and not part of the specification. Example 1 $ python3 hailstones.py N: #0 N must be positive!
Expert Solution
steps

Step by step

Solved in 2 steps with 2 images

Blurred answer
Knowledge Booster
Binary numbers
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education