wp-plugin-hostgator domain was triggered too early. This is usually an indicator for some code in the plugin or theme running too early. Translations should be loaded at the init action or later. Please see Debugging in WordPress for more information. (This message was added in version 6.7.0.) in /home4/scienrds/scienceandnerds/wp-includes/functions.php on line 6114ol-scrapes domain was triggered too early. This is usually an indicator for some code in the plugin or theme running too early. Translations should be loaded at the init action or later. Please see Debugging in WordPress for more information. (This message was added in version 6.7.0.) in /home4/scienrds/scienceandnerds/wp-includes/functions.php on line 6114Source:https:\/\/www.quantamagazine.org\/the-astonishing-behavior-of-recursive-sequences-20231116\/#comments<\/a><\/br> In mathematics, simple rules can unlock universes of complexity and beauty. Take the famous Fibonacci sequence, which is defined as follows: It begins with 1 and 1, and each subsequent number is the sum of the previous two. The first few numbers are:<\/p>\n 1, 1, 2, 3, 5, 8, 13, 21, 34 \u2026<\/p>\n Simple, yes, but this unassuming recipe gives rise to a pattern of far-reaching significance, one that appears to be woven into the very fabric of the natural world. It\u2019s seen in the whorls of nautilus shells, the bones in our fingers, and the arrangement of leaves on tree branches. Its mathematical reach extends to geometry, algebra and probability, among other areas. Eight centuries since the sequence was introduced to the West \u2014 Indian mathematicians studied it long before Fibonacci \u2014 the numbers continue to attract the interest of researchers, a testament to how much mathematical depth can underlie even the most elementary number sequence.<\/p>\n In the Fibonacci sequence, every term builds on the ones that came before it. Such recursive sequences can exhibit a wide range of behaviors, some wonderfully counterintuitive. Take, for instance, a curious family of sequences first described in the 1980s by the American mathematician Michael Somos<\/a>.<\/p>\n Like the Fibonacci sequence, a Somos sequence starts with a series of ones. A Somos-k<\/em> sequence starts with k <\/em>of them. Each new term of a Somos-k<\/em> sequence is defined by pairing off previous terms, multiplying each pair together, adding up the pairs, and then dividing by the term k <\/em>positions back in the sequence.<\/p>\n The sequences aren\u2019t very interesting if k<\/em> equals 1, 2 or 3 \u2014\u00a0they are just a series of repeating ones. But for k<\/em> = 4, 5, 6 or 7 the sequences have a weird property. Even though there is a lot of division involved, fractions don\u2019t appear.<\/p>\n \u201cNormally we don\u2019t have this kind of phenomenon,\u201d Somos said. \u201cIt\u2019s a deceptively simple recurrence, similar to Fibonacci. But there\u2019s a lot behind that simplicity.\u201d<\/p>\n Other mathematicians continue to uncover startling connections between Somos sequences and seemingly unrelated areas of mathematics. One paper posted in July uses them to construct solutions<\/a> to a system of differential equations used to model everything from predator-prey interactions to waves traveling in high-energy plasmas. They are also used to study the structure of mathematical objects called cluster algebras<\/a> and are connected to elliptic curves<\/a> \u2014 which were the key to cracking Fermat\u2019s Last Theorem.<\/p>\n Janice Malouf<\/a>, a graduate student at the University of Illinois, published the first proof that Somos-4 and Somos-5 sequences are integral<\/a> (meaning all of their terms are integers) in 1992. Other proofs<\/a> of the same result by different mathematicians appeared around the same time, along with proofs that the Somos-6 and Somos-7 sequences are integral.<\/p>\n This strange property of Somos sequences astounded mathematicians. \u201cSomos sequences intrigued me as soon as I learned about them,\u201d said James Propp<\/a>, a professor of mathematics at the University of Massachusetts, Lowell. \u201cThe fact that Somos-4 through Somos-7 always give integers, no matter how far out you go, seemed like a miracle when you viewed things from a na\u00efve perspective. So a different perspective was required.\u201d<\/p>\n Propp found a fresh perspective in the early 2000s, when he and his colleagues discovered that the numbers in the Somos-4 sequence are actually counting something. The terms in the sequence correspond to structures found in certain graphs. For some graphs, it\u2019s possible to pair up vertices (dots) with edges (lines) so that every vertex is connected to exactly one other vertex \u2014 there are no unpaired vertices, and no vertex connected to more than one edge. The terms in the Somos-4 sequence count the number of different perfect matchings for a particular sequence of graphs\u200b.<\/p>\n The discovery not only offered a new perspective on Somos sequences, but also introduced new ways to think about and analyze graph transformations. Propp and his students celebrated by having the result put on a T-shirt<\/a>.<\/p>\n \u201cTo me a big part of the allure of math is when you arrive at the same destination by different paths and it seems like something miraculous or deep is going on,\u201d Propp said. \u201cThe cool thing about these sequences is there are various points of view that explain why you get integers. There are hidden depths there.\u201d<\/p>\n The story changes for higher-numbered Somos sequences. The first 18 terms of Somos-8 are integers, but the 19th term is a fraction. Every Somos sequence after that also contains fractional values.<\/p>\n Another type of sequence, developed by the German mathematician Fritz G\u00f6bel in the 1970s, is an interesting counterpoint to the Somos sequences. The n<\/em>th term of the G\u00f6bel sequence is defined as the sum of the squares of all the previous terms, plus 1, divided by n<\/em>. Like the Somos sequences, the G\u00f6bel sequence involves division, so we might expect that terms won\u2019t remain integers. But for a while \u2014 as the sequence grows enormous \u2014 they seem to be.<\/p>\n The 10th term in the G\u00f6bel sequence is about 1.5 million, the 11th 267-some billion. The 43rd term is far too large to calculate \u2014 it has some 178 billion digits. But in 1975, the Dutch mathematician Hendrik Lenstra<\/a> showed that unlike the first 42 terms, this 43rd term is not an integer.<\/p>\n G\u00f6bel sequences can be generalized by replacing the squares in the sum with cubes, fourth powers, or even higher exponents. (Under this convention, his original sequence is called a 2-G\u00f6bel sequence.) These sequences also display a surprising trend of starting with an extended stretch of integer terms. In 1988, Henry Ibstedt showed<\/a> that the first 89 terms of the 3-G\u00f6bel sequence (which uses cubes instead of squares) are integers, but the 90th isn\u2019t. Subsequent research on other G\u00f6bel sequences found even longer stretches. The 31-G\u00f6bel sequence, for instance, kicks off with a whopping 1,077 integer terms.<\/p>\n In July, the Kyushu University mathematicians Rinnosuke Matsuhira, Toshiki Matsusaka<\/a> and Koki Tsuchida shared a paper<\/a> showing that for a k<\/em>-G\u00f6bel sequence, no matter the choice of k<\/em>, the first 19 terms of the sequence are always integers. They were inspired to look into the question by a Japanese manga called Seis\u016b-tan<\/em><\/a>, which translates to \u201cThe Tale of Integers.\u201d A frame in the comic book<\/a> asked readers to figure out the minimum possible value of Nk<\/sub><\/em>, the point at which a k<\/em>-G\u00f6bel sequence ceases to produce integer terms. The three mathematicians set out to answer the question. \u201cThe unexpected persistence of integers for such an extended duration contradicts our intuition,\u201d Matsusaka said.\u201cWhen phenomena occur contrary to intuition, I believe there is always beauty present.\u201d<\/p>\n They found a pattern of repeating behavior as k<\/em> increases. By focusing on a finite number of repeating cases, they made the calculation tractable, and they were able to complete the proof.<\/p>\n A closer look at the sequence Nk<\/sub><\/em> reveals another surprise: Nk<\/sub><\/em> is prime far more often than you would expect if it were purely random. \u201cWith the k<\/em>-G\u00f6bel sequence it\u2019s not just remarkable that they\u2019re integers,\u201d said Richard Green<\/a>, a mathematician at the University of Colorado. \u201cWhat\u2019s remarkable is that the prime numbers show up so often. That makes it look like something deeper might be going on.\u201d<\/p>\n Though the new paper presents a proof that Nk<\/sub><\/em> is always at least 19, it\u2019s not known if \u00a0is always finite, or if there exists a k<\/em> for which the sequence contains integers indefinitely. \u201cNk<\/sub><\/em>\u00a0behaves mysteriously. \u2026 There is a fundamental desire to comprehend its underlying pattern,\u201d Matsusaka said. \u201cIt might be akin to the joy I felt as a child when solving puzzles given by teachers. Even now, those sentiments from that time linger within me.\u201d<\/p>\n Quanta\u00a0is conducting a series of surveys to better serve our audience. Take our\u00a0<\/i>mathematics reader survey<\/i><\/a>\u00a0and you will be entered to win free\u00a0<\/i>Quanta\u00a0merch.<\/i><\/p>\n<\/div>\n <\/br><\/br><\/br><\/p>\n
\nThe Astonishing Behavior of Recursive Sequences<\/br>
\n2023-11-20 21:58:52<\/br><\/p>\n