mersenneforum.org this thread is for a Collatz conjecture again
 Register FAQ Search Today's Posts Mark Forums Read

 2017-05-01, 00:47 #1 MattcAnderson     "Matthew Anderson" Dec 2010 Oregon, USA 22·3·5·19 Posts this thread is for a Collatz conjecture again Hi Mersenneforum.org, Please consider this. It is some Maple code. Maple is a computer algebra system. Regards, Matt
2017-05-01, 01:57   #2
science_man_88

"Forget I exist"
Jul 2009
Dumbassville

26·131 Posts

Quote:
 Originally Posted by MattcAnderson Hi Mersenneforum.org, Please consider this. It is some Maple code. Maple is a computer algebra system. Regards, Matt
no attached code ...

 2017-05-03, 21:58 #3 science_man_88     "Forget I exist" Jul 2009 Dumbassville 26·131 Posts best I can think of is maybe reducing it to a statement about the natural numbers ( other than the original one). Last fiddled with by science_man_88 on 2017-05-03 at 21:59
2017-05-10, 02:45   #4
MattcAnderson

"Matthew Anderson"
Dec 2010
Oregon, USA

22·3·5·19 Posts

Hi Mersenneforum,

This is a simple procedure for the Collatz conjecture. It has also been called the hailstone problem.

That is all I have to say about that.

Regards,
Matt
Attached Files
 20170311090423.pdf (22.3 KB, 259 views)

 2017-05-14, 04:34 #5 SarK0Y     Jan 2010 2·43 Posts it falls down to 1 because 3n+1=2^m for some n's. Just a trick :)
2017-05-14, 10:44   #6
science_man_88

"Forget I exist"
Jul 2009
Dumbassville

26·131 Posts

Quote:
 Originally Posted by SarK0Y it falls down to 1 because 3n+1=2^m for some n's. Just a trick :)
and what makes you certain that all odd numbers are connected ?

2017-05-14, 14:37   #7
SarK0Y

Jan 2010

2·43 Posts

Quote:
 Originally Posted by science_man_88 and what makes you certain that all odd numbers are connected ?
all numbers have formula: odd*2^t, so for odd ones t==0. 3n+1 can be odd only if n is even. in short, this sequence could be steadily increasing iff t ain't greater than 1 for each step. could that condition be possible? Obviously, No. to not fall down to 1 needs to not have 1*2^m at any step.

2017-05-14, 22:05   #8
science_man_88

"Forget I exist"
Jul 2009
Dumbassville

26·131 Posts

Quote:
 Originally Posted by SarK0Y all numbers have formula: odd*2^t, so for odd ones t==0. 3n+1 can be odd only if n is even. in short, this sequence could be steadily increasing iff t ain't greater than 1 for each step. could that condition be possible? Obviously, No. to not fall down to 1 needs to not have 1*2^m at any step.
and how many steps do you expect for a given n ?

2017-05-15, 19:16   #9
SarK0Y

Jan 2010

2×43 Posts

Quote:
 Originally Posted by science_man_88 and how many steps do you expect for a given n ?
quite good approx is about lg2(n).

Last fiddled with by SarK0Y on 2017-05-15 at 19:24

2017-05-15, 20:50   #10
science_man_88

"Forget I exist"
Jul 2009
Dumbassville

20C016 Posts

Quote:
 Originally Posted by SarK0Y quite good approx is about lg2(n). add: it's max bar.
log2(7) < 3 there are not three steps for 7 it goes:

7->22->11->34->17->52->26->13->40->20->10->5->16->8->4->2->1 of course you probably meant for large n.

Last fiddled with by science_man_88 on 2017-05-15 at 21:09

2017-05-15, 21:33   #11
SarK0Y

Jan 2010

8610 Posts

Quote:
 Originally Posted by science_man_88 log2(7) < 3 there are not three steps for 7 it goes: 7->22->11->34->17->52->26->13->40->20->10->5->16->8->4->2->1 of course you probably meant for large n.
hmm.. here is disputable moment how to count steps: you can count each one or packs.

7 > 11 > 17 > 13 > 5 > 1. in short, packs count only odds. such scheme is quite reasonable because N/2 == N >>1, it's very cheap op for hardware.

 Similar Threads Thread Thread Starter Forum Replies Last Post Steve One Miscellaneous Math 21 2018-03-08 08:18 JM Montolio A Miscellaneous Math 10 2018-02-28 20:06 MattcAnderson MattcAnderson 4 2017-03-12 07:39 nibble4bits Math 1 2007-08-04 07:09 TauCeti NFSNET Discussion 0 2003-12-11 22:12

All times are UTC. The time now is 22:24.

Thu Jun 30 22:24:33 UTC 2022 up 77 days, 20:25, 0 users, load averages: 1.41, 1.23, 1.21

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.

≠ ± ∓ ÷ × · − √ ‰ ⊗ ⊕ ⊖ ⊘ ⊙ ≤ ≥ ≦ ≧ ≨ ≩ ≺ ≻ ≼ ≽ ⊏ ⊐ ⊑ ⊒ ² ³ °
∠ ∟ ° ≅ ~ ‖ ⟂ ⫛
≡ ≜ ≈ ∝ ∞ ≪ ≫ ⌊⌋ ⌈⌉ ∘ ∏ ∐ ∑ ∧ ∨ ∩ ∪ ⨀ ⊕ ⊗ 𝖕 𝖖 𝖗 ⊲ ⊳
∅ ∖ ∁ ↦ ↣ ∩ ∪ ⊆ ⊂ ⊄ ⊊ ⊇ ⊃ ⊅ ⊋ ⊖ ∈ ∉ ∋ ∌ ℕ ℤ ℚ ℝ ℂ ℵ ℶ ℷ ℸ 𝓟
¬ ∨ ∧ ⊕ → ← ⇒ ⇐ ⇔ ∀ ∃ ∄ ∴ ∵ ⊤ ⊥ ⊢ ⊨ ⫤ ⊣ … ⋯ ⋮ ⋰ ⋱
∫ ∬ ∭ ∮ ∯ ∰ ∇ ∆ δ ∂ ℱ ℒ ℓ
𝛢𝛼 𝛣𝛽 𝛤𝛾 𝛥𝛿 𝛦𝜀𝜖 𝛧𝜁 𝛨𝜂 𝛩𝜃𝜗 𝛪𝜄 𝛫𝜅 𝛬𝜆 𝛭𝜇 𝛮𝜈 𝛯𝜉 𝛰𝜊 𝛱𝜋 𝛲𝜌 𝛴𝜎𝜍 𝛵𝜏 𝛶𝜐 𝛷𝜙𝜑 𝛸𝜒 𝛹𝜓 𝛺𝜔