MHB What rule is used to receive number 1

  • Thread starter Thread starter anre
  • Start date Start date
Click For Summary
The discussion revolves around a mathematical process applied to a positive integer "n" where if n is even, it is halved, and if odd, either 3n + 1 or 3n - 1 is chosen. Participants question whether this process will always lead to the number 1 after multiple iterations. The conversation references the Collatz conjecture, which posits that all positive integers will eventually reach 1 through this method. Examples illustrate the steps taken from various starting points. The consensus is that while the conjecture remains unproven, it has been observed to hold true for many integers.
anre
Messages
3
Reaction score
0
On the board is written the number of positive integer "n". In next step we write a new number. If n is even, then we write the number n / 2. If n is odd, then select the 3n + 1 or 3n-1 and write on the blackboard. Can we get the number 1 (always) after many steps ? and why? What rule is used ?
For example:
20 (n / 2)
10 (n / 2)
5 (3n + 1)
16 (n / 2)
8 (n / 2)
4 (n / 2)
2 (n / 2)
1
 
Mathematics news on Phys.org
Not sure. but I know I have to find LCD
 
This problem has been discussed recently in https://driven2services.com/staging/mh/index.php?threads/16219/.
 

Thread 'Significant figures for inherently bound values'

I have been insisting to my statistics students that for probabilities, the rule is the number of significant figures is the number of digits past the leading zeros or leading nines. For example to give 4 significant figures for a probability: 0.000001234 and 0.99999991234 are the correct number of decimal places. That way the complementary probability can also be given to the same significant figures ( 0.999998766 and 0.00000008766 respectively). More generally if you have a value that...
View full post »

Similar threads

I Is this a proof of the Collatz Conjecture?
  • · Replies 8 ·
Replies
8
Views
3K
MHB Find Half a Number's Reciprocal Increased by Half its Reciprocal
  • · Replies 2 ·
Replies
2
Views
1K
A Proving Goldbach's conjecture by induction (or why it doesn't seem to work)
  • · Replies 10 ·
Replies
10
Views
2K
B Popularizing a property for n-bonacci numbers without publishing it?
  • · Replies 12 ·
Replies
12
Views
2K
A Is this Recursive Pattern in the Collatz Sequence Known?
  • · Replies 3 ·
Replies
3
Views
570
MHB [ASK] Probability with Factors
  • · Replies 2 ·
Replies
2
Views
1K
I Billard balls on table
  • · Replies 10 ·
Replies
10
Views
2K
I Union of Prime Numbers & Non-Powers of Integers: Usage & Contexts
  • · Replies 1 ·
Replies
1
Views
2K
I Modulo and Modulus in math and computer programming
  • · Replies 5 ·
Replies
5
Views
3K
Insights Reduction of Order For Recursions
  • · Replies 4 ·
Replies
4
Views
3K