整块格式解决了科拉茨猜想

Khaled Moftah
{"title":"整块格式解决了科拉茨猜想","authors":"Khaled Moftah","doi":"10.9734/jamcs/2024/v39i41880","DOIUrl":null,"url":null,"abstract":"Blocks are unit convergence between two consecutive odd numbers formed according to the three x plus one conjecture rules. The left odd number is the left hook, L, and the right odd number is the right hook, R. They include even numbers between their boundaries. They are divided into families (F1 = 5, 11, 17, … & F2 = 1, 7, 11, … & F3 = 3, 9, 15, …) and groups based on their group length (The number of the middle-even numbers between the two hooks). Blocks are taken individually and placed beside each other, similar to the domino tiles play, which, by their formulation, satisfies the conjecture rules. Formed chains reach number one in the convergence mode or continue generating odd positive numbers infinitely according to the generation mode. The final convergence to number one is reached because these blocks have all the positive integers included as left hooks (L1, L2, L3), and all the F1 and F2 odd positive numbers are included as right hooks (R1 and R2). Block rules mandate that a single left hook produces only one right hook. Accordingly, no looping or entanglement (Joining and consequent splitting) between chain branches would occur. Statistics show that R cannot increase infinitely. Repeated oscillation up and down without reaching number one would also violate the statistics. Statistics reveal that blocks of various lengths have a strict occurrence and repetition sequence along the positive integer series. Block lengths can extend infinitely, and each block length repeats its occurrence infinitely. In the generation mode, blocks are attached in reverse order to the conjecture/convergence rules. According to the rules, all positive integers can be generated starting from number one. Multiple sequences and clusters of specific block lengths occur according to specific rules and cannot continue infinitely.","PeriodicalId":503149,"journal":{"name":"Journal of Advances in Mathematics and Computer Science","volume":" 32","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Block Format Solves the Collatz Conjecture\",\"authors\":\"Khaled Moftah\",\"doi\":\"10.9734/jamcs/2024/v39i41880\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Blocks are unit convergence between two consecutive odd numbers formed according to the three x plus one conjecture rules. The left odd number is the left hook, L, and the right odd number is the right hook, R. They include even numbers between their boundaries. They are divided into families (F1 = 5, 11, 17, … & F2 = 1, 7, 11, … & F3 = 3, 9, 15, …) and groups based on their group length (The number of the middle-even numbers between the two hooks). Blocks are taken individually and placed beside each other, similar to the domino tiles play, which, by their formulation, satisfies the conjecture rules. Formed chains reach number one in the convergence mode or continue generating odd positive numbers infinitely according to the generation mode. The final convergence to number one is reached because these blocks have all the positive integers included as left hooks (L1, L2, L3), and all the F1 and F2 odd positive numbers are included as right hooks (R1 and R2). Block rules mandate that a single left hook produces only one right hook. Accordingly, no looping or entanglement (Joining and consequent splitting) between chain branches would occur. Statistics show that R cannot increase infinitely. Repeated oscillation up and down without reaching number one would also violate the statistics. Statistics reveal that blocks of various lengths have a strict occurrence and repetition sequence along the positive integer series. Block lengths can extend infinitely, and each block length repeats its occurrence infinitely. In the generation mode, blocks are attached in reverse order to the conjecture/convergence rules. According to the rules, all positive integers can be generated starting from number one. Multiple sequences and clusters of specific block lengths occur according to specific rules and cannot continue infinitely.\",\"PeriodicalId\":503149,\"journal\":{\"name\":\"Journal of Advances in Mathematics and Computer Science\",\"volume\":\" 32\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-03-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Advances in Mathematics and Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.9734/jamcs/2024/v39i41880\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Advances in Mathematics and Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.9734/jamcs/2024/v39i41880","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

数块是根据三 x 加一猜想规则形成的两个连续奇数之间的单位收敛。左边的奇数是左钩 L,右边的奇数是右钩 R。根据它们的组长(两个钩子之间中间偶数的个数),它们被分为族(F1 = 5、11、17......和 F2 = 1、7、11......和 F3 = 3、9、15......)和组。积木被单独取出并放在彼此旁边,类似于多米诺牌游戏,其玩法符合猜想规则。形成的链在收敛模式下达到数字 1,或根据生成模式无限生成奇数正数。最终收敛到数字 1 的原因是,这些区块将所有正整数作为左钩(L1、L2、L3),将所有 F1 和 F2 奇正数作为右钩(R1 和 R2)。程序块规则规定,一个左钩只能产生一个右钩。因此,链条分支之间不会出现循环或纠缠(连接和随之分裂)。统计表明,R 不可能无限增大。反复上下摆动而不达到数字 1 也会违反统计规律。统计显示,不同长度的区块在正整数序列上有严格的出现和重复序列。区块长度可以无限延长,每个区块长度都会无限重复出现。在生成模式中,图块按猜想/收敛规则的相反顺序附加。根据规则,所有正整数都可以从数字 1 开始生成。根据特定的规则,特定区块长度的多个序列和簇会出现,并且不能无限延续。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Block Format Solves the Collatz Conjecture
Blocks are unit convergence between two consecutive odd numbers formed according to the three x plus one conjecture rules. The left odd number is the left hook, L, and the right odd number is the right hook, R. They include even numbers between their boundaries. They are divided into families (F1 = 5, 11, 17, … & F2 = 1, 7, 11, … & F3 = 3, 9, 15, …) and groups based on their group length (The number of the middle-even numbers between the two hooks). Blocks are taken individually and placed beside each other, similar to the domino tiles play, which, by their formulation, satisfies the conjecture rules. Formed chains reach number one in the convergence mode or continue generating odd positive numbers infinitely according to the generation mode. The final convergence to number one is reached because these blocks have all the positive integers included as left hooks (L1, L2, L3), and all the F1 and F2 odd positive numbers are included as right hooks (R1 and R2). Block rules mandate that a single left hook produces only one right hook. Accordingly, no looping or entanglement (Joining and consequent splitting) between chain branches would occur. Statistics show that R cannot increase infinitely. Repeated oscillation up and down without reaching number one would also violate the statistics. Statistics reveal that blocks of various lengths have a strict occurrence and repetition sequence along the positive integer series. Block lengths can extend infinitely, and each block length repeats its occurrence infinitely. In the generation mode, blocks are attached in reverse order to the conjecture/convergence rules. According to the rules, all positive integers can be generated starting from number one. Multiple sequences and clusters of specific block lengths occur according to specific rules and cannot continue infinitely.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Comparative Study of Elementary School Mathematics Textbooks in China, Japan, South Korea, Singapore, America, Germany: A Case Study on "Fraction Division" Mathematical Modeling of Diarrhea with Vaccination and Treatment Factors Analysis of Turing Instability of the Fitzhugh-Nagumo Model in Diffusive Network Uniform Estimates on Length of Programs and Computing Algorithmic Complexities for Quantitative Information Measures Common Fixed Points of Dass-Gupta Rational Contraction and E-Contraction
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1