Testwiki:Reference desk/Archives/Mathematics/2018 May 21

From testwiki
Jump to navigation Jump to search

Template:Error:not substituted

{| width = "100%"

|- ! colspan="3" align="center" | Mathematics desk |- ! width="20%" align="left" | < May 20 ! width="25%" align="center"|<< Apr | May | Jun >> ! width="20%" align="right" |Current desk > |}

Welcome to the Wikipedia Mathematics Reference Desk Archives
The page you are currently viewing is a transcluded archive page. While you can leave answers for any questions shown below, please ask new questions on one of the current reference desk pages.


May 21

Collatz conjecture is almost done!

Following is a method for solving Collatz conjecture: regarding to this algorithm we can make below group on natural numbers: this group is in accordance with Collatz graph,

let m,n, {m1=m(4m)(4m2)=1=(4m+1)(4m1)(4m2)(4n2)=4m+4n5(4m2)(4n1)=4m+4n2(4m2)(4n)={4m4n14m2>4n4n4m+14n>4m23m=n+1(4m2)(4n+1)={4m4n24m2>4n+14n4m+44n+1>4m2(4m1)(4n1)=4m+4n1(4m1)(4n)={4m4n+24m1>4n4n4m4n>4m12m=n(4m1)(4n+1)={4m4n14m1>4n+14n4m+14n+1>4m13m=n+1(4m)(4n)=4m+4n3(4m)(4n+1)=4m+4n(4m+1)(4n+1)=4m+4n+1=2=4


now I am making a group in accordance with Collatz conjecture, let C1:={(m,2m)m} is a group with: {eC1=(1,2)m,n,(m,2m)C1(n,2n)=(mn,2(mn))(m,2m)1=(m1,2×m1)thatmm1=1C1=(2,4)=(4,8)

and C2:={(3m1,2m1)m} is a group with: {eC2=(2,1)m,n,(3m1,2m1)C2(3n1,2n1)=(3(mn)1,2(mn)1)(3m1,2m1)1=(3×m11,2×m11)thatmm1=1C2=(5,3)=(11,7).

and let C:=C1C2 be external direct sum of the groups C1 & C2.


Question: What are maximal subgroups of C?


Thanks in advance! (I really have insufficient time, hence I need your help!) — Preceding unsigned comment added by 89.45.54.114 (talk) 06:22, 21 May 2018 (UTC)