Search

A symbolic analysis of Archimedes's periodical number system is developed, from which a natural link emerges with the modern positional number systems with zero. After the publication of Fibonacci's Liber Abaci, the decimal Indo-Arabic positional system was the basis of the algorithmic and algebraic trend of modern mathematics, but even if zero plays a crucial role in algebra and mathematical analysis, zeroless positional systems show the same capability of producing efficient arithmetical algorithms based on operation tables over digits. The crucial role of digits is assessed, by considering a representation of numbers based on strings in lexicographic order. A new algorithm for the determination of decimal periods is presented by remarking on the cruciality of this topic in number theory. Periods of ordinal numbers and enumerations of recursive enumerability are shortly recalled. Concluding remarks are formulated about the deep relationship between numbers and information, which shed new light on a red line passing through the whole history of mathematics. [ABSTRACT FROM AUTHOR]

This paper provides another proof of Fermat's theorem. As in the previous work, a geometric approach is used, namely: instead of integers a, b, c, a triangle with side lengths a, b, c is considered. To preserve the completeness of the proof of the theorem in this work, the proof is repeated for the cases of right and obtuse triangles. In this case, the Fermat equation ap+bp = cp has no solutions for any natural number p > 2 and arbitrary numbers a, b, c. When considering the case when the numbers a, b, c are sides of an acute triangle, it is proven that Fermat's equation has no solutions for any natural number p > 2 and non-zero integer numbers a, b, c. Numbers a = k, b = k+m, c = k+n, where k, m, n are natural numbers that satisfy the inequalities n > m, n < k+m, exhaust all possible variants of natural numbers a, b, c, which are the sides of the triangle. In an acute triangle, the following condition is additionally satisfied: k > n -m + √2n(n - m). To study the Fermat equation, an auxiliary function f(k,p) = kp+(k+m)p-(k+n)p, is introduced, which is a polynomial of natural degree p in the variable k. The equation f(k, p) = 0 has a single positive root for any natural p = 2. A recurrent formula connecting the functions f(k,p+1) and f(k,p) has been proven: f(k,p+1) = kf(k, p)-[n(k+n)p-m(k+m)p]. The proof of the main proposition 2 is based on considering all possible relationships between the assumed integer solution of the equation f(k, p+1) = 0 and the number (ñ -m) corresponding to this solution k. The proof was carried out using the mathematical apparatus of number theory, elements of higher algebra and the foundations of mathematical analysis. These studies are a continuation of the author's works, in which some special cases of Fermat's theorem were proved. [ABSTRACT FROM AUTHOR]

K.T. Atanassov are Firstly established the Coupled Fibonacci Sequence in 1985. In 1987, The essence of Fibonacci Triple Sequences are examined. Fibonacci Sequence stand out as a kind of super sequence with amazing properties. This is the meteoric expansion in the province of Fibonacci Sequence. Leonardo de Pisa foremost Fibonacci's observation on the growth of the rabbit population as a result in 1202. Triple Fibonacci Sequence are hype in the last years, but Multiplicative Triple Sequence of Recurrence Relations are less known. Extravagant work has been done to course on Fibonacci Triple Sequence in Additive form. In 1995, Multiplicative Coupled Fibonacci Sequence are treated. Our wish of this paper to offer some results of Multiplicative Triple Fibonacci Sequence of fourth order under nine specific schemes. [ABSTRACT FROM AUTHOR]