This study delves into a unique binary pattern found within the wellknown 3n+1 problem, or Collatz conjecture. Through careful analysis of the steps in the 3n+1 sequence, we have discovered a special binary representation that captures the behavior of all positive integers undergoing this transformation. With this new understanding, we have provided a solid proof confirming the validity of the 3n+1 problem for all positive integers. Our method goes beyond the need for extensive computational confirmation, providing a simple and elegant resolution to a long-standing mathematical mystery.

In this article, we discuss the concept of infinity (∞), infinitesimals □ , and a new mathematical operation that expands calculations into the realm of the infinite. This breakthrough allows for the computation of infinite numbers, leading to new possibilities for mathematical research and practical applications. By introducing infinite numbers, numerous advantages arise, such as accurately representing limits, divergences in integrals and infinite series, and extending calculations to infinity. This mathematical advancement opens doors to exploring uncharted territories, offering valuable insights and breakthroughs.

A proof is given showing the Collatz Conjecture is true for all positive integers. The proof was possible once the perspective of the proof was changed from looking at the pattern of the positive integers to looking at the conjecture rules. The conjecture rule for even numbers organizes all positive integers into unique sets and the rule for odd numbers interconnects the unique sets into dendritic pathways to “1.” Infinite loops, other than the minor 4-2-1 loop after reaching “1,” and pathways to infinity are shown to be mathematically impossible. The proof predicted a general equation that shows all positive integers ultimately reach a final value of “1," and calculates the values and locations of the odd positive integers during the iterations for each tested positive integer.

Let $n \geq 2$ be a fixed integer and $\mathcal{A}$ be a $C^*$-algebra. A permuting $ n $-linear map $ \mathcal{G} : \mathcal{A} ^{n} \rightarrow \mathcal{A} $ is known to be symmetric generalized $n$-derivation if there exists a symmetric $n$-derivation $ \mathfrak{D} : \mathcal{A} ^{n} \rightarrow \mathcal{A} $ such that $ \mathcal{G} \left(x_{1}, x_{2}, \ldots, x_{i} x_{i}^{\prime}, \ldots, x_{n}\right)= \mathcal{G} \left(x_{1}, x_{2}, \ldots, x_{i}, \ldots, x_{n}\right) x_{i}^{\prime}+x_{i} \mathfrak{D} (x_{1}, x_{2},\ldots, x_{i}^{\prime}, \ldots, x_{n})$ holds for all $x_{i}, x_{i}^{\prime} \in \mathcal{A} $. In this paper, we investigate the structure of $C^*$-algebras involving generalized linear $n$-derivations. Moreover, we describe the forms of traces of linear $n$-derivations satisfying certain functional identity.

We demonstrate a new quantitative method to the sieve of Eratosthenes, which is an alternative to the sieve of Legendre. In this method, every element of a given set is sifted out once only, and therefore, this method is free of the Mobius function and of the parity barrier. Using this method, we prove that every sufficiently large even number is the sum of two primes, and that every even number is the difference of two primes in infinitely many ways.

In (Semigroup Forum 77: 325-338, 2008) Mahmoudi M. and Renshaw J. solved a study that covers of cyclic $S$-acts over monoids. This article is an attempt to initiate the covers of finitely generated $S$-acts. We give a necessary and sufficient condition for a monoid to have the properties that $n$-generated $S$-acts have strongly flat covers, Condition $(P)$ covers and projective covers. The main conclusions extend some known results. We show also that Condition $(P)$ covers of finitely generated $S$-acts are not unique, unlike the situation for strongly flat covers. Additionally, we demonstrate that the property of Enochs' $\mathcal{X}$-precover of $S$-act $A$, where $\mathcal{X}$ denotes a class of $S$-acts that are closed under isomorphisms.

When discussing the Diophantine quintic equation $p(a^5 + b^5) = q(c^5 + d^5)$ where p is a prime and q is an integer, there is a clear gap between the mathematical literature and online forums. Because of the intrinsic complexity of parameterizing fifth-degree equations, this equation re- mains largely unexplored. In this work, we approach this quintic problem through algebraic methods with the goal of providing numerical solutions that illuminate its properties and behaviors.Our research uncovers in- triguing patterns and connections that shed light on the enigmatic nature of Diophantine quintic equations in this particular form.

Transformation formula under the action of a general linear fractional transformation for generalized Dedekind eta-function has been a subject of intensive study, Rademacher, Dieter, Meyer et al. However, the (Hecke) modular relation structure has not been recognized until the work of Goldstein-de la Torre, and streamlining the classical proofs in the modular relation will reveal the meaning hidden in those works. Our main aim is to elucidate the works of these researchers in the context of modular relations.

In this paper we present two ways to solve the Jacobian conjecture. The first way is an equivalent statement to the Jacobian conjecture using idempotent ideals. The second way is to use an equivalent thesis to the thesis of the Jacobian conjecture. In both cases we will show that the Jacobian conjecture is true.

The basic idea is to expand the completed zeta function $\xi(s)$ in MacLaurin series (infinite polynomial), which can be further expressed as infinite product (Hadamard product) by conjugate complex roots. Finally, the functional equation $\xi(s)=\xi(1-s)$ leads to $(s-\alpha_i)^2 = (1-s-\alpha_i)^2, i \in \mathbb{N}$ with solution $\alpha_i= \frac{1}{2}, i \in \mathbb{N}$, where $\alpha_i$ are the real parts of the zeros of $\xi(s)$, i.e., $s_i =\alpha_i\pm j\beta_i, i\in \mathbb{N}$. Therefore, a proof of the Riemann Hypothesis is achieved.

The Diophantine equation for which p is prime 2^n = p^2 + 7 and n is integers with p > 0, is examined in this work. It is demonstrated by examining the characteristics of the equation that the only solutions meeting these requirements are p = 3 with n = 5 and p = 5 with n = 7. In order to analyze the above equation, it is necessary to look at the properties of primes and how they relate to powers of two. These results advance our knowledge of prime numbers and how they behave in certain mathematical problems.

Let R be a commutative ring and m, n be positive integers. We define a proper submodule N of an R-module M to be (m,n)-closed if for r∈R and b∈M, r^{m}b∈N implies rⁿ∈(N:_{R}M) or b∈N. This class of submodules lies properly between the classes of prime and primary submodules. Many characterizations, properties and supporting examples concerning this class of submodules are provided. The notion of (m,n)-modules is introduced and characterized. Furhermore, the (m,n)-closed avoidance theorem is proved. Finally, the (m,n)-closed submodules in amalgamated modules are studied.

Euler sums are alternating (or level two) extension of multiple zeta values (MZVs). Kaneko and Tsumura initiated the study of multiple T-values (MTVs), another level two generalization, by restricting the summation indices in the definition of MZVs to a fixed parity pattern. In this paper, we shall study finite MTVs and their alternating versions which are level two and level four variations of finite MZVs, respectively. We conjecture that all finite MZVs are in the Q-span of finite MTVs which in turn apparently lie in the span of finite Euler sums, and the inclusions are both proper. We shall first provide some structural results for Euler sums of small weights, guided by the author's previous conjecture that the finite Euler sum space of weight w is isomorphic to a quotient Euler sum space of weight w. Then, by utilizing some well-known properties of the classical alternating MTVs, we shall derive a few important Q-linear relations among the finite alternating MTVs, including the reversal, linear shuffle and sum relations. We then compute the upper bound for the dimension of the Q-span of weight w finite (alternating) MTVs for w<9, both rigorously using the newly discovered relations and numerically aided by computers.

One of the most important unresolved mysteries in mathematics is the Riemann Hypothesis, which suggests a fundamental connection between the non-trivial zeros of the Riemann zeta function and the distribution of prime numbers. Here, we explore the fascinating union of trigonometric functions, prime numbers, and the Riemann zeta function through an examination of the zeros in the statement ln(sec(π·n log(n))). We demonstrate a strong mathematical connection between these components, providing information on the mysterious properties of prime numbers and their complex relationships to basic mathematical operations. Our thorough investigation adds to the current discussion of the Riemann Hypothesis by offering possible solutions and deepening our comprehension of the intricate relationship between number theory and analytic functions.

In this paper we investigate some properties of square-free numbers. In particular, we study a function that counts the number of square-free numbers no larger than the given number n. We show that this function has asymptotics consistent with the predictions of the Riemann hypothesis and use this to obtain new and better estimates of the density of square-free numbers. Finally, we present a well-known generalization of the concept of a square-free number to monoids and research on square-free factorizations.

In this paper, we introduce and investigate a new family of sequences called the generalized Fibospinomials (or the generalized Fibonacci polynomial spinors or Horadam polynomial spinors). Being particular cases, we handle with $(r,s)$-Fibonacci and $(r,s)$-Lucas polynomial spinors. After a short history on spinors and quaternions, we present Binet's formulas, generating functions and the summation formulas for these polynomials. In addition, we obtain some identities of generalized Fibonacci polynomial spinors, $(r,s)$-Fibonacci polynomial spinors and $(r,s)$-Lucas polynomial spinors. Moreover, we give some special identities such as Catalan's and Cassini's identities and we present matrices related with these polynomials.

The Collatz conjecture is a well-known number theory puzzle that states that every positive integer would eventually converge to the trivial cycle of 1, 2, 1, 2,... when repeatedly exposed to a particular transformation. In this transformation, even numbers are divided in half, odd numbers are tripled, and one is added. In this study, we present a new method for creating a directed graph and using it to display and analyze Collatz sequences. Our technique creates what we call a Collatz directed graph by joining an endless number of simple directed graphs, each of which corresponds to a natural number. We show by careful mathematical analysis that all positive integers are included in this Collatz directed graph. Moreover, we give an evidence that verifies the Collatz conjecture by showing that the sole cycle in this graph is the trivial cycle of 1, 2, 1, 2,... We also prove that there is no sequence that diverges to infinity in this graph. Our results provide insights into the fundamental structure of Collatz sequences and further our knowledge of the Collatz conjecture .

The Collatz conjecture, a longstanding mathematical puzzle, posits that, regardless of the starting integer, iteratively applying a specific formula will eventually lead to the value 1. This paper introduces a novel approach to validate the Collatz conjecture by leveraging the binary representation of generated numbers. Each transition in the sequence is predetermined using the Collatz conjecture formula, yet the path of transitions is revealed to be intricate, involving alternating increases and decreases for each initial value. The study delves into the global flow of the sequence, investigating the behavior of the generated numbers as they progress toward the termination value of 1. The analysis utilizes the concept of probability to shed light on the complex dynamics of the Collatz conjecture. By incorporating probabilistic methods, this research aims to unravel the underlying patterns and tendencies that govern the convergence of the sequence. The findings contribute to a deeper understanding of the Collatz conjecture, offering insights into the inherent complexities of its trajectories. This work not only validates the conjecture through binary representation but also provides a probabilistic framework to elucidate the global flow of the sequence, enriching our comprehension of this enduring mathematical mystery.

The Cohen-Macaulay vertex splittable ideals are characterized. As a consequence, we recover several Cohen-Macaulay classifications of families of monomial ideals known in the literature by new simpler combinatorial proofs.

I had previously developed an approach called Gocgen approach, which claimed to prove twin prime conjecture. In this paper, I processed the previously developed Gocgen approach with the zeta function and explained the relationship between the zeta function with some formulas to offer another perspective on the zeta function, and also created a new function that explains the Gocgen approach using the zeta function. Understanding the new function created will provide insight into the frequency of prime numbers.

A new generalized definition of Mersenne numbers is proposed of the form (a^n - (a-1)^n), called Global Generalized Mersenne numbers, or simply Generalized Mersenne numbers and noted GM_{a,n} where a is the base and n is the exponent, both being positive integers. The properties are investigated for prime exponents n and several theorems on Mersenne numbers regarding their congruence properties are generalized and demonstrated. In particular, it is found that, for any base a, Generalized Mersenne numbers are in general such that (GM_{a,n} - 1) are even and divisible by n, a and (a-1) for any odd prime exponent n and by (a(a-1)+1) for any prime exponent n > 5. The remaining factor is a function of triangular numbers of (a-1), specific to each prime exponent n. Four theorems on Mersenne numbers are generalized and four new theorems are demonstrated, allowing to show first, that (GM_{a,n} - 1) are divisible by 6, and more precisely GM_{a,n} are congruent to 1(mod 12) or 7(mod 12) depending on the congruence of the base a(mod 4); second, that (GM_{a,n} - 1) are divisible by 10 if n == 1(mod 4) and, if n == 3(mod 4), GM_{a,n} == 1(mod 10), or 7(mod 10) or 9(mod 10) depending on the congruence of the base a(mod 5); third, that all factors c_{i} of GM_{a,n} are of the form (2nf_{i}+1) with f_{i} natural integers such that c_{i} is prime itself or the product of primes of the form (2nj+1) with j natural integer; fourth, that for odd prime exponents n, all GM_{a,n} are periodically congruent to either +/-1\(mod 8) or +/-3(mod 8) depending on the congruence of the base a(mod 8); and fifth, that the factors of a composite GM_{a,n} is of the form (2nf_{i}+1) with f_{i} == u(mod 4) and u being either 0, 1, 2 or 3 depending on the congruence of the exponent n(mod 4) and on the congruence of the base a(mod 8). The potential use of Generalized Mersenne primes in cryptography is shortly addressed.

In this study, I examined the Beals conjecture on the basis of formulas that produce composite numbers, and I developed some other conjectures that, if answered, would be an answer to the Beals conjecture. Apart from this, I have examined the Beals conjecture from another perspective and posed The Germany Problem.

In my paper, a divisibility rule named the Queen function is de- scribed, which has been generalized for every integer and encompasses all pre- viously established divisibility rules. Subsequently, the paper discusses other areas where this function is instrumental. These include simplifying ratios, generating prime numbers, and more. Towards the end of the paper, a set of hypotheses is also presented. Among these, the most significant is the novel approach involving the application of the Queen function for prime number generation.

This paper provides a first-time ever unification of information theory, semi-group theory with the theory of uncertain reasoning, through functional perspective. Fundamentally, the threshold theorems for the inference functional were devised. Furthermore, numerical experiments are illustrated. The complex proofs in our paper are original results which emphasizes the credibility of the class of Rényi Generalized Entropies as measures of information, and that the field is open to extend an enhanced methodology regarding queuing networks with heavy tails.

We developed some questions regarding twin prime conjecture by examining the bounded gaps between composite numbers and explained the relations between the formulas regarding composite numbers. Then we proved the twin prime conjecture to answer the new questions raised by proving the expression: \[ \liminf_{n\to\infty} (c_n_+_1 - c_n) \ge 10. \] In addition, we prove many different approaches have been and it has been proved that there must be a twin prime in the range $(p_k_2\cdot p_k_1, p^2_k_1)$, where $p \neq 2$.

Let R be a commutative ring with identity and m, n be positive integers. In this paper, we introduce the class of (m,n)-prime ideals which lies properly between the classes of prime and (m,n)-closed ideals. A proper ideal I of R is called (m,n)-prime if for a,b∈R, a^{m}b∈I implies either aⁿ∈I or b∈I. Several characterizations of this new class with many examples are given. Analougus to primary decomposition, we define the (m,n)-decomposition of ideals and show that every ideal in an n-Noetherian ring has an (m,n)-decomposition. Furthermore, the (m,n)-prime avoidance theorem is proved.

Uchino first initiated the study of generalized Reynolds operators on associative algebras. Recently, related research has become a hot topic. In this paper, we first introduce the notion of generalized Reynolds operators on Hom-Lie triple systems associated to a representation and a 3-cocycle. Then, we develop cohomology of generalized Reynolds operators on Hom-Lie triple systems with coefficients in a suitable representation. As applications, we use the first cohomology group to classify linear deformations and we study the obstruction class of an extendable order $n$ deformation. Finally, we introduce and investigate Hom-NS-Lie triple system as the underlying structure of generalized Reynolds operators on Hom-Lie triple systems.

Recently, we have applied the generalized Littlewood theorem concerning contour integrals of the logarithm of analytical function to find the sums over inverse powers of zeroes for the incomplete Gamma- and Riemann zeta- functions, polygamma functions, and elliptical functions. Here, the same theorem is applied to study such sums for the zeroes of the Hurwitz zeta-function , including the sum over the inverse first power of its appropriately defined non-trivial zeroes. We also study some related properties of the Hurwitz zeta-function zeroes. In particular, we show that for any natural N and small real epsilon, when z tends to n=0, -1, -2… we can find at least N zeroes of zeta in the - vicinity of 0 for sufficiently small epsilon, as well as one simple zero tending to 1, etc.

Sums of M consecutive squared integers (a+i)^2 equaling squared integers (for a<=1, 0<= i<= M-1) yield remarkable regular linear features when plotting values of M in function of a. These features correspond to groupings of pairs of a values for successive same values of M around straight lines of equation mu*M = 2a and are characterized in this paper for rational values of mu.

Symmetry, as a key concept in geometry and the foundational principle of mathematical concepts, is a fundamental part of geometry and nature, creating patterns that help us conceptually organize our world. It is often linked with aesthetic beauty and can be observed in both natural phenomena and human-made objects, such as artworks and manufactured products, across the globe. The automorphism group of a graph is a mathematical structure that captures all the symmetries of the graph. symmetry refers to the property of a graph, indicating that it can be transformed without changing its structure, while the automorphism group is the collection of all permutations of the vertices that preserve the graph's adjacency relationships. In graph theory, the concepts of symmetry group and automorphism group play fundamental roles in understanding the symmetries and structural properties of graphs. This paper aims to explore the relationship between symmetry groups and automorphism groups, shedding light on their interconnected nature and their significance in graph theory. We delve into the definitions and properties of both symmetry groups and automorphism groups, highlighting their similarities and distinctions. Furthermore, we discuss their applications in various fields, including computer science, chemistry, and network analysis. Through this exploration, we aim to provide a comprehensive understanding of the relationship between symmetry groups and automorphism groups, deepening our comprehension of the symmetries and structures inherent in graphs.

Prime numbers are the atoms of mathematics and mathematics is needed to make sense of the real world. Finding the Prime number structure and eventually being able to crack their code is the ultimate goal in what is called Number Theory. From the evolution of species to cryptography, Nature finds help in Prime numbers. One of the most important advances in the study of Prime numbers was the paper by Bernhard Riemann in November 1859 called “Ueber die Anzahl der Primzahlen unter einer gegebenen Grösse” (On the number of primes less than a given quantity). In that paper, Riemann gave a formula for the number of primes less than x in terms the integral of 1/log(x) and the roots (zeros) of the zeta function defined by: Where ζ(z) is a function of a complex variable z that analytically continues the Dirichlet series. Riemann also formulated a conjecture about the location of the zeros of RZF, which fall into two classes: the "trivial zeros" -2, -4, -6, etc., and those whose real part lies between 0 and 1. Riemann's conjecture Riemann hypothesis [RH] was formulated as this: [RH] The real part of every nontrivial zero z* of the RZF is 1/2. Proving the RH is, as of today, one of the most important problems in mathematics. In this paper we will provide a proof of the RH. The proof of the RH will be built following these five parts: PART 1: Description of the RZF PART 2: The C-transformation PART 3: Application of the C-transformation to in Re(z) 0 to obtain ζ(z)=X(z)-Y(z) PART 4: Analysis of the values of z such that X(z)=Y(z), and |X(z)|=|Y(z)|, that equates to ζ(z)=0 Proof that |X(z)|=|Y(z)| only if Re(z)=1/2 Conclude that ζ(z)=0 only if Re(z)=1/2 for Re(z) 0 PART 5: We will also prove that all non-trivial zeros of ζ(z) in the critical line of the form are not distributed randomly. There is a relationship between the values of those zeros and the Harmonic function that leads to an algebraic relationship between any two zeros.

In this paper, we present a new concept of the generalized core orthogonality (called the C-S orthogonality) for two generalized core invertible matrices $A$ and $B$. $A$ is said to be C-S orthogonal to $B$ if $A^{\tiny\textcircled{S}}B=0$ and $BA^{\tiny\textcircled{S}}=0$, where $A^{\tiny\textcircled{S}}$ is the generalized core inverse of $A$. The characterizations of C-S orthogonal matries and the C-S additivity are also provided. And the connection between the C-S orthogonality and C-S partial order has been given using their canonical form. Moreover, the concept of the strongly C-S orthogonality is defined and characterized.

This short technical note proves some observed novel corollaries of the Collatz Conjecture. For this, a unique ‘Collatz Representation’ of Hailstone numbers has been employed. After that, an extension of this corollary is explained using the fact that only certain differences in the last digit of the ‘Collatz Representation’ gives a whole number difference between numbers. A more general result is obtained. The final proof is for a corollary that some numbers the same number of steps to reach 1 if the Collatz Conjecture is true and all variables are whole numbers.

This paper will explore analogs of groups formed by the transformations of two ropes as presented by Minh-Tam Quang Trinh.1 The two operations acting on these ropes are T and S, defined as twists and clockwise turns, respectively. These actions intertwine the ropes, creating tangles. T and S also have the ability to untangle the rope when used in certain combinations. In the two-rope case, these actions expressed as a group presentation were shown to be isomorphic to SL₂(Z). We explored the analog of these opera- tions, T and S, and conjectured the corresponding group to which they are isomorphic. Partial proofs for this conjecture are included and future work would include proving our conjecture as well as generalizing results to k ropes.

In this research a neccessary and sufficient condition for the proof of the Binary Goldbach conjecture is established. It is established that the square of all natural numbers greater or equal to 2 have an additive partition equal to the sum of the square of a natural number greater or equal to zero and a Goldbach partition semiprime. All Goldbach partition semiprimes are odd except 4. This finding is in itself proof all composite even numbers have at least Goldbach partition. The result of the proof of the Binary Goldbach conjecture is used to prove the Andrica and Legendre conjectures. The Riemann hypothesis is examined and sources of non trivial zeroes outside the critical strip are discussed. An example example of a non-trivial zero outside the critical strip is given

Here we analyze three well-known conjectures: (i) the existence of infinitely-many twin primes, (ii) Goldbach’s strong conjecture, and (iii) Polignac’s conjecture. We show that the three conjectures are related to each other. In particular, we see that in analysing the validity of the Goldbach’s strong conjecture, one must consider also the existence of an infinite number of twin primes. As a consequence of how we approach this analysis, we also observe that if this conjecture is true, then so is Polignac’s conjecture. Our first step is an analysis of the existence of infinitely-many twin primes numbers. For this, using the formula 4((n−1)!+1) ≡ −n (mod n(n + 2)) – satisfied if and only if (n, n + 2) are twin primes –, together with Wilson’s theorem, we obtain conditions that must be met for two numbers to be twin primes. Our results, obtained from an analytic and functional study, lead us to conclude that there may exist infinitely-many twin primes. Next, we consider the validity of the Goldbach’s strong conjecture. After showing that the conjecture is true for the first even numbers, we notice a pattern that we analyze for any even number, reducing it to three cases: (i) when the even number 2n is two times a prime number n; (ii) when the even number 2n is such that n = 2m, with 2m − 1 and 2m + 1 twin primes; (iii) all other cases, i.e., for any 2n even number ∀n ∈ N with n > 1, n prime or not, with independence of n = 2m being 2m−1 and 2m+1 twin primes or not. In this last case we show that one can always find a certain r ∈ N such that 1 < r < n satisfying that n−r and n+r are primes, so that their sum is 2n. In this case we use the reduction to absurd method, and our results lead us to conclude that Goldbach’s strong conjecture is true to the best of our calculations, as well as the Polignac’s conjecture.

In this paper we provide some important and significant observations on invo-regular rings appeared in Ann. Univ. Mariae Curie-Sklodowska Sect. A Mathematica (2018). In addition we exhibit that strongly invo-regular rings, invo-regular rings and quasi invo-regular rings all coincide with the well known and well characterized tripotent rings and all these rings further coincide with the well known unit regular rings.

In this note we consolidate and give a brief description of several recently published results in ring theory having disproof. These results have been published during 2016 to 2021 in the so called non-predatory reputed mathematical journals indexed in the well known database like Scopus. We have considered results on rings in which each element is a sum of two idempotents appeared in Canad. Math. Bull. (2016), weakly tripotent rings appeared in Bull. Korean Math. Soc. (2018) and Rendiconti Sem. Mat. Univ. Pol. Torino (2021), involution t-clean rings appeared in Eur. J. Pure Appl. Math (2022) and strongly 2-nil clean rings with units of order two appeared in Eur. J. Pure Appl. Math (2023).

We present a differential-calculus-based method which allows one to derive more identities from {\it any} given Fibonacci-Lucas identity containing a finite number of terms and having at least one free index. The strength of our method is that no additional information is required about the given original identity. The method readily extends to a generalized Fibonacci sequence.

This article shows how to establish expansion formulas for calculating the mixed operations $(A^{\dag})^{\#}$, $(A^{\#})^{\dag}$, $((A^{\dag})^{\#})^{\dag}$, $((A^{\#})^{\dag})^{\#}$, $\ldots$ of generalized inverses, where $(\cdot)^{\dag}$ denotes the Moore--Penrose inverse of a matrix and $(\cdot)^{\#}$ denotes the group inverse of a square matrix. As applications of the formulas obtained, the author constructs and classifies some groups of matrix equalities involving the above mixed operations, and derives necessary and sufficient conditions for them to hold.

In this article some important observations have been reported on recent works related to weakly tripotent rings and locally invo-regular rings. Our findings give additional results as well as correct some recent results on weakly tripotent rings and locally invo-regular rings appeared in Rendiconti Sem. Mat. Univ. Pol. Torino (2021) and Azerbaijan Journal of Mathematics (2021) respectively. In addition we exhibit that if the Jacobson radical J(A) of a ring is strongly involution t-clean then the characteristic of J(A) need not be four. This finding improves an important result appeared in Eur. J. Pure Appl. Math (2022).

In this paper, we give all non splitting bi-unitary superperfect polynomials divisible by one or two irreducible polynomials over the prime field of two elements. We prove the nonexistence of odd bi-unitary superperfect polynomials over F2.

In this study, a simple approach to solving the Riemann Hypothesis, one of the most prominent unsolved problems in the field of Number Theory in mathematics and one of the “Millenium Prize Problems”, is presented. The Riemann Hypothesis, a conjecture about distribution of prime numbers, has remained unsolved since it was first proposed by German mathematician, Bernhard Riemann in 1859. This paper introduces an analytic continuation of the Zeta Function as well as symmetric approach through integration by parts to address this hypothesis. The proposed solution is obtained through analytical continuation in the critical strip 0<Re(s)<1 to establish that Re(s)=1/2.

We introduce a new generalized inverse (i.e., generalized EP element) which is a natural generalization of EP and *-DMP elements in a Banach *-algebra. We present polar-like characterizations of generalized EP elements. The necessary and sufficient conditions under which the sum of two generalized EP elements is a generalized EP element are investigated. Finally, the generalized core-EP orders for generalized EP elements are characterized.

In this paper, we introduce the notion of weighted generalized group inverse in a Banach algebra with proper involution. This is a natural generalization of weighted weak group inverse for a complex matrix and Hilbert space operator. We present several characterizations and representations of this generalized inverse. In addition, a new partial order on elements in a Banach *-algebra is investigated by using the weighted generalized group inverse and some known results are thus generalized.

In 1937,German mathematician L.Collatz proposed the following conjeture:for any positive integer,if it is even,divide it by 2,if it is odd,multiply it by 3 and add 1 to get an even number.Continuing with the above rule, the final result will be 1.This paper gives a proof of this conjecture.

The two main strategies used in this study are the binary representation and the decomposition of a natural number into many compound functions of odd function and even function. The Collatz conjecture regarding odd even numbers in number theory can be examined and discussed using them in this way: The sequence created by the finite iterations of the Collatz function becomes the ultimately periodic sequence if any natural number is the beginning value, proving the conjecture that has been held for 85 years.

The primary purpose of this article is to deduce specific order estimates for the \textit{Mertens Function} $M(n)$, which facilitates us to analyze the location of zeros of the \textit{Riemann Zeta function} $\zeta(s)$. The paper also provides a brief overview about the notion of the \textit{Mertens Function} $M(n)$ and \textit{Redheffer Matrices} $\mathbb{A}_{n}$. In addition to learning about various \textit{spectral properties} of $ \mathbb{A}_{n}$, we shall also deduce the relation between these two, which, eventually would lead us to establish a necessary and sufficient condition for the \textit{Riemann Hypothesis} to hold true, as justified by \textit{Redheffer} himself. We shall also observe several numerical evidence as well as theoretical justification behind the falsity of the famous \textit{Mertens Hypothesis}, along with how researchers over the years have approached towards deriving an estimate of the smallest possible natural number $n$ for which the first such violation of the theorem occurs, utilizing numerous conjectures annotating about the order of $M(n)$. Readers who are highly motivated in pursuing research in any of the topics relevent to the contents of this paper will surely find the \texttt{References} section to be extremely resourceful.

In this paper for every number field K generated by a root α of a trinomial x⁷ + ax + b ∈ Z[x] and for every prime integer p, we calculate ν_p(i(K)), the highest power of p dividing the index i(K) of the field K. In particular, we calculate the index i(K). As application, when the index of K is not trivial, then K is not monogenic.

The Collatz conjecture (or 3n+1 problem) has been explored for about 86 years. In this article, we prove the Collatz conjecture. We will show that this conjecture holds for all positive integers by applying the Collatz inverse operation to the numbers that satisfy the rules of the Collatz conjecture. Finally, we will prove that there are no positive integers that do not satisfy this conjecture.

In this paper, we study semiconic idempotent commutative residuated lattices. After giving some properties of such residuated lattices, we obtain a structure theorem for semiconic idempotent com- mutative residuated lattices. As an application, we make use of the structure theorem to prove that the variety of strongly semiconic idempotent commutative residuated lattices has the amalgamation property.

Using the local bijectivity of Keller maps, we give a proof of two-dimensional Jacobian conjecture.

Throughout this paper, we will establish a comprehensive theoretical foundation and rigorously develop the methodology to investigate the structure of quotient ring S/P under the influence of symmetric generalized n-derivations, where S represents an arbitrary ring, and P signifies a prime ideal of S satisfying certain algebraic identities acting on prime ideal P without relying on the assumption of primeness or semi-primeness of the ring.

Starting with a positive odd integer $n$, apply a function $f(n)$ repetitively such that $f(n) = 3n + 1$ if $n \not\equiv 0 (\text{mod}\:2)$ or $f(n) = n/2$ if $n \equiv 0 (\text{mod}\:2)$. Let the sequence of all the odd integers obtained form an orbit $n, f^1(n) , f^2(n), \ldots, f^k(n), f^{k + 1}(n)$. The $k^{th}$ odd integer is written as $f^k(n) = (3^k + \mathbf{B(k)})/2^{\mathbf{z(k)}}$ where $\mathbf{B(k)}$ is the collection of terms without the coefficient $n$. We show that when $1 - \mathbf{B(k)}/(2^{\mathbf{z(k)}} n) \approx 1$, the condition for unbounded orbit is given by OEIS A022921. Further, if there exists at least one orbit for which $f^{k + 1}(n) = n$ when $(k + 1) < 3$, we show that there exists no orbit with $k + 1 > 3$ for which $f^{k + 1}(n) = n$. The final result is that the odd integers that can violate the Collatz conjecture are smaller than 5.

In this paper, a short survey of the existed results concerning the Jacobian Conjecture is first given. Then the 3-fold linear type polynomial map will be analyzed in detail. The expansion of the Jacobian condition is deduced to obtain its equivalent algebraic equations, and the Jacobian condition will be analyzed to derive two coordinate transformations that can maintain the invariance of the Jacobian condition. Finally, it is proved by mathematical induction method that one general chain expression presented in this paper is just the inverse polynomial map of 3-fold linear type polynomial map, i.e. LJC(n,[3]) holds such that the Jacobian Conjecture holds.

Jacobian theta function identities are related to the Addition formula for the Weierstrass 1 Sigma function. In this paper, from the Addition formula for Weierstrass Sigma function, new and 2 simple proofs of four square sums theorem are given. Using the addition formula of the theta func- 3 tions, we also give simple proofs of two square sums and eight square sums theorem.

We establish certain modular equations of degree three based on some results of Ramanujan's theta functions.

We study the divisibility properties of the constant terms of certain meromorphic modular forms for Hecke groups. We relate those properties to those of some sequences that have already appeared in the literature. For possible use in later drafts, we show how to invert the map taking a Laurent series $f(x) = 1/x + \sum_{n=0}^{\infty}a_{n+1} x^n$ to the sequence of constant terms of its positive powers. At the end of the article, we construct from elementary arithmetic functions some meromorphic but not necessarily modular functions and study their constant terms.

A well-known result of Posner’s second theorem states that if the commutator of each element in a prime ring and its image under a nonzero derivation is central, then the ring is commutative. In the present paper, we extend this bluestocking theorem to an arbitrary ring with involution involving prime ideals. Further, apart from proving several other interesting and exciting results, we establish *-version of Vukman’s theorem [48, Theorem 1]. Precisely, we describe the structure of quotient ring A/L, where A is an arbitrary ring and L is a prime ideal of A. Further, by taking advantage of the *-version of Vukman’s theorem, we show that if a 2-trosion free semiprime ring A with involution admits a nonzero *-centralizing derivation, then A contains a nonzero central ideal. This result is in a spirit of the classical result due to Bell and Martindale [19, Theorem 3]. As the applications, we extends and unify several classical theorems proved in [6],[25,[42], and [48] . Finally, we conclude our paper with a direction for further research.

The following is the Collatz Conjecture: Suppose we begin with a positive number, multiply it by 3 and add 1 if it is odd, and divide it by 2 if it is even. Then continue doing this as long as you can. Will it matter where you start, whether you end up at the number 1? The Collatz conjecture has been studied for around 85 years. We transform the Collatz function from decimal to binary, then use the binary string's character to prove the Collatz conjecture. In addition, we use mathematics to give another interpretation to chaos, which is the ultimately periodic positive integer sequence.

The following system of equations {x_1 \cdot x_1=x_2, x_2 \cdot x_2=x_3, 2^{2^{x_1}}=x_3, x_4 \cdot x_5=x_2, x_6 \cdot x_7=x_2} has exactly one solution in ({\mathbb N}\{0,1})^7, namely (2,4,16,2,2,2,2). Hypothesis 1 states that if a system of equations S \subseteq {x_i \cdot x_j=x_k: i,j,k \in {1,...,7}} \cup {2^{2^{x_j}}=x_k: j,k \in {1,...,7}} has at most five equations and at most finitely many solutions in ({\mathbb N}\{0,1})^7, then each such solution (x_1,...,x_7) satisfies x_1,...,x_7 \leq 16. Hypothesis 1 implies that there are infinitely many composite numbers of the form 2^{2^{n}}+1. Hypotheses 2 and 3 are of similar kind. Hypothesis 2 implies that if the equation x!+1=y^2 has at most finitely many solutions in positive integers x and y, then each such solution (x,y) belongs to the set {(4,5),(5,11),(7,71)}. Hypothesis 3 implies that if the equation x(x+1)=y! has at most finitely many solutions in positive integers x and y, then each such solution (x,y) belongs to the set {(1,2),(2,3)}. We describe semi-algorithms sem_j (j=1,2,3) that never terminate. For every j \in {1,2,3}, if Hypothesis j is true, then sem_j endlessly prints consecutive positive integers starting from 1. For every j \in {1,2,3}, if Hypothesis j is false, then sem_j prints a finite number (including zero) of consecutive positive integers starting from 1.

Firstly, we present a more explicit formulation of the complete system $D(N)$ of representatives of Manin's symbols over $\mathbb{Q}$, which was initially given by Shimura. Then we establish a bijection between $D(M)\times D(N)$ and $D(MN)$ for $(M,N)=1$, which reveals a recursive structure between Manin's symbols of different levels. Based on Manin's complete system $\Pi (N)$ of representatives of cusps on $X_0(N)$ and Cremona's characterization of the equivalence between cusps, we establish a bijection between a subset $C(N)$ of $D(N)$ and $\Pi (N)$, and then establish a bijection between $C(M)\times C(N)$ and $C(MN)$ for $(M,N)=1$. We also provide a recursive structure for elliptical points on $X_0(N)$. Based on these recursive structures, we obtain recursive algorithms for constructing Manin symbols over $\mathbb{Q}$, cusps and elliptical points on $X_0(N)$. This gives rise to a more efficient algorithms for modular elliptic curve. As direct corollaries of these recursive structures, we present a recursive version of the genus formula and an elementary proof of formulas of the numbers of $D(N)$, cusps and elliptical points on $X_0(N)$.

In this paper we propose the notion of a transposed Poisson superalgebra. We prove that a transposed Poisson superalgebra can be constructed by means of a commutative associative superalgebra and an even degree derivation of this algebra. Making use of this we construct two examples of transposed Poisson superalgebra. One of them is the graded differential algebra of differential forms on a smooth finite dimensional manifold, where we use the Lie derivative as an even degree derivation. The second example is the commutative superalgebra of basic fields of the quantum Yang-Mills theory, where we use the BRST-supersymmetry as an even degree derivation to define a graded Lie bracket. We prove several identities, which hold in a transposed Poisson superalgebra.

This article derives the closed form solution to finding the roots of a quadratic equation in SU3.

Collatz conjecture states that an integer $n$ reduces to $1$ when certain simple operations are applied to it. Mathematically, the Collatz function is written as $f^k(n) = \frac{3^kn + C}{2^{z}}$, where $z, k, C \geq 1$. Suppose the integer $n$ violates Collatz conjecture by reappearing as $2^in$, where $i \geq 1$, then the equation modifies to $n \left(1 - \frac{3^k}{2^{z}2^i}\right) = \frac{C}{2^{z}2^i}$. The article takes an elementary approach to this problem by calculating the bounds on the values of $\frac{C}{2^{z}2^i}$ and $1 - \frac{3^k}{2^{z}2^i}$. Correspondingly, an upper limit on the integer $n$ is placed that can re-appear in the sequence. The integer $n$ lies in the $(-\infty, 5)$ range, and the limit on the number of odd steps is $k < 3$. Finally, it is shown that no integer chain exists that does not lead to 1.

This study focuses on one of the most famous open problems in mathematics, namely the Collatz conjecture. The Collatz conjecture or 3x + 1 Problem is perhaps today's most enigmatic unsolved mathematical problem. It is named after Lothar Collatz, who rst proposed it in 1937. It may be stated as as follow: Take any positive integer n. If n is even then divide it by 2, else do \triple plus one" and get 3n + 1. The conjecture is that this process will eventually reach the number 1, regardless of which positive integer is chosen initially. In this paper, we present a simple proof for the Collatz conjecture.

Given a square matrix $A$, we are able to construct numerous equalities that involve reasonable mixed operations of $A$ and its conjugate transpose $A^{\ast}$, Moore--Penrose inverse $A^{\dag}$, and group inverse $A^{\#}$. Such kind of equalities can be generally represented in the equation form $f(A, \, A^{\ast}, A^{\dag}, A^{\#}) =0$. In this article, the author constructs a series of simple or complicated matrix equalities, as well as matrix rank equalities involving the mixed operations of the four matrices. As applications, we give a sequence of necessary and sufficient conditions for a square matrix to be range-Hermitian.

Build a special identical equation, use its calculation characters to prove and search for solution of any odd converging to 1 equation through (*3+1)/2^k operation, and get a solution for this equation, which is exactly same with that got from calculating directly. Then give a specific example to verify. Thus prove the Collatz Conjecture is true. Furthermore, analysis the even and odd sequences produced by iteration calculation during the procedure of searching for solution, build a weight function model, prove it decrease progressively to 0, build another complement weight function model, prove it increase to its convergence state. Indicate that this kind of iteration calculation has determined direction, and gradually regularly converges.

We approximate the trigonometric function sine and cosine on the interval . This analysis provides two formulas to approximate sine and cosine. At first, we try to derive the formula which involves a square root, and then we derive another formula that does not require any use of a square root. Nevertheless, after deriving the procedure which requires no square root, we further try to increase its accuracy and then derive another formula that approximates trigonometric functions more accurately on the interval [0, pi/2]. So, this analysis provides mainly two types of procedures. One uses square roots, whereas the other does not. We also focus on ensuring the accuracy of these trigonometric functions in the interval [0,pi/2]. This accuracy analysis is portrayed using the graph. This graph shows the difference between the values generated by the functions defined here and the actual value of these functions. So, these graphs also indicate the error of these functions on that interval. Finally, we compare our approximation with the approximation formula of the 7th-century Indian Mathematician Bhaskara I.

Prime number-related issues can be viewed from drastically different perspectives by examining the close connections between prime numbers and composite numbers. We think that multiple perspectives are the pillars on the path to solutions so we have created this study. As a result of the study, we proposed two new formulas by presenting three theorems and one proof for each theorem, a total of three proofs. We proved that the formula p · n + p returns a composite number in the first of the theorems, which is the preliminary theorem. Our first theorem except the preliminary theorem is that the formula p · n + p returns all composite numbers, and we proved that too. Finally, we created Theorem II using Theorem I to use in our other work and proved that the formula 2 · n · p + p returns all odd composite numbers, which is Theorem II. Afterward, we presented the similarities of the 2 · n · p + p formula we put forth with another known formula.

Let $S=\left(s_1, \ldots, s_n\right)$ be a finite sequence of integers. Then $S$ is a Gilbreath sequence of length $n$, $S\in\mathbb{G}_n$, iff $s_1$ is even or odd and $s_2, \ldots, s_n$ are respectively odd or even and $\min\mathbb{K}_{\left(s_1, \ldots, s_m\right)}\leq s_{m+1}\leq\max\mathbb{K}_{\left(s_1, \ldots, s_m\right)}\forall m\in\left[\left.1, n\right)\right.$. This, applied to the order sequence of prime number $P$, defines Gilbreath polynomials and two integer sequences A347924 \cite{oeisA347924} and A347925 \cite{oeisA347925} which are used to prove that Gilbreath conjecture $GC$ is implied by $p_n-2^{n-1}\leqslant\mathcal{P}_{n-1}\left(1\right)$ where $\mathcal{P}_{n-1}\left(1\right)$ is the $n-1$-th Gilbreath polynomial at 1.

The 3x+1 problem asks the following: Suppose we start with a positive integer, and if it is odd then multiply it by 3 and add 1, and if it is even, divide it by 2. Then repeat this process as long as you can. Do you eventually reach the integer 1, no matter what you started with? Collatz conjecture (or 3n+1 problem) has been explored for about 85 years. In this paper, we convert an integer number from decimal to binary number, and convert the Collatz function to binary function, which is multiplication and division of two binary numbers. Finally the iternation of the Collatz function, eventually reach the integer 1, thus we solve the 3x+1 problem completely.

It is a classic topic in algebras to construct and verify equalities that are composed of various algebraic operations of elements and their inverses or generalized inverses. In this note, the author constructs a matrix equality $(AB)^{\dag} = B^{\ast}(A^{\ast}ABB^{\ast})^{\#}A^{\ast}$ (called a mixed reverse-order law), where $A$ and $B$ are two matrices of appropriate sizes, $(\cdot)^{\ast}$, $(\cdot)^{\dag}$, and $(\cdot)^{\#}$ denote the conjugate transpose, the Moore--Penrose inverse, and the group inverse of a matrix, respectively, and shows that the mixed reverse-order law always holds. A list of variation forms of this matrix equality are also given, and necessary and sufficient conditions are obtained for them to hold. Especially, we show a remarkable fact that the two reverse-order laws $(AB)^{\dag} = B^{\dag}A^{\dag}$ and $(A^{\ast}ABB^{\ast})^{\#} = (BB^{\ast})^{\#}(A^{\ast}A)^{\#}$ are equivalent.

Proof of the Riemann hypothesis is obtained using the properties of the Gamma function, the Bernoulli function, and limitations imposed by the rational relations of the complex roots of the Riemann zeta function, and the rational relations of the complex Gamma functions.

In this article, we introduce the concept of soft intervals, soft ordering and sequences of soft real numbers, and some of their structural properties are studied. The notion of soft Lebesgue measure on the soft real numbers has been introduced. Also, a correspondence relationship has been established between the soft Lebesgue measure and the classical Lebesgue measure. Furthermore, we have studied some exciting results and relations between the soft Lebesgue measure and the Lebesgue measure of soft real sets.

The calculation of the exact value of the square root of 2 is requested. In order to obtain its infinite value, A new concept is proposed where the accumulations of the infinitely many of finity is indicated by the change in direction which means that there is a jump from finity to infinity .The meaningless for an infinite number with a decimal point is indicated by this jump because any decimal number only have meanings within a finite range values and there is only an infinite integer quantity that can not be operated by algorithms like operations of multiplication，division,addition, and subtraction . The final result of the change in direction is two quantity where the second quantity and the first quantity extend in parallel line and never intersect and the second quantity represent the size of the first quantity. The first quantity is the infinitely great that can't be talked about anything outside of it and can compress any quantities outside of it to nothing and it is the exact value of the square root of 2 .

In this note we, first, recall that the sets of all representatives of some special ordinary residue classes become $\left( m,n\right) $-rings. Second, we introduce a possible $p$-adic analog of the residue class modulo a $p$-adic integer. Then, we find the relations which determine, when the representatives form a $\left( m,n\right) $-ring. At the very short spacetime scales such rings could lead to new symmetries of modern particle models.

In this paper, we define and investigate modified p-Leonardo, p-Leonardo-Lucas and p-Leonardo sequences as special cases of the generalized Leonardo sequence. We present Binet's formulas, generating functions, Simson formulas, and the summation formulas for these sequences. Moreover, we give some identities and matrices related with these sequences. Furthermore, we show that there are close relations between modified p-Leonardo, p-Leonardo-Lucas, p-Leonardo numbers and Fibonacci, Lucas numbers.

The Goldbach Conjecture, which is frequently termed as “1 + 1”, has been a fascinating goal for many mathematicians over centuries. A Chinese mathematician, Dr. Jingrun Chen, proved 1 + 2, which is a great success and the best result so far achieved. Although there were several attempts proving the conjecture, these attempts are either tediously long, complicated, or logically imperfect, thus not widely accepted. Taking advantage of the periodicity of primes, here the author provides a straight forward rigorous proof for the Conjecture.

This paper asserts that the falsity of Goldbach Conjecture results in the breakdown of Trichotomy Law. Assuming that Goldbach Conjecture breaks down at an even integer 2n, where n ≥ 3, we note that the differences of 2n with the odd primes in the interval (1, n) are composite integers. We form a product δ of the collection of the least prime factors of these composite integers. We show that for a base case this product breaks Trichotomy Law. With the inductive hypothesis that such is the case with 2n, we prove that for all even integers the breakdown of Goldbach Conjecture entails the breakdown of Trichotomy Law.

Dilation of contractions on Hilbert space and Banach space is classical. Recently, dilations theory has been put in the setting of sets, vector spaces, p-adic Hilbert spaces and modules. In this paper, we derive important dilation results for self-adjoint morphisms on indefinite inner product modules over *-rings of characteristic 2. More precisely, we prove indefinite inner product versions of Halmos dilation, Egervary N-dilation and Sz.-Nagy dilation.

It is well established the complex exponential and logarithm are multivalued functions, both failing to maintain most identities originally valid over the positive integers domain. Moreover the general case of complex logarithm, with a complex base, is hardly mentionned in mathematic litterature. We study the exponentiation and logarithm as binary operations where all operands are complex. In a redefined complex number system using an extension of the C field, hereafter named E, we prove both operations always produce single value results and maintain the validity of identities such as log_u (w v) = log_u (w) + log_u (v) where u, v, w in E. There is a cost as some algebraic properties of the addition and subtraction will be diminished, though remaining valid to a certain extent. In order to handle formulas in a C and E dual number system, we introduce the notion of set precision and set truncation. We show complex numbers as defined in C are insufficiently precise to grasp all subtleties of some complex operations, as a result multivaluation, identity failures and, in specific cases, wrong results are obtained when computing exclusively in C. A geometric representation of the new complex number system is proposed, in which the complex plane appears as an orthogonal projection, and where the complex logarithm and exponentiation can be simply represented. Finally we attempt an algebraic formalization of E.

We propose Reduced Collatz Conjecture that is equivalent to Collatz Conjecture, which states that every positive integer can return to an integer less than it, instead of 1. Reduced Collatz Conjecture should be easier because some properties are presented in reduced dynamics, rather than in original dynamics (e.g., ratio and period). Reduced dynamics is a computation sequence from starting integer to the first integer less than it, and original dynamics is a computation sequence from starting integer to 1. Reduced dynamics is a component of original dynamics. We denote dynamics of x as a sequence of either computations in terms of ``I'' that represents (3*x+1)/2 and ``O'' that represents x/2. Here 3*x+1 and x/2 are combined together, because 3*x+1 is always even and followed by x/2. We formally prove that all positive integers are partitioned into two halves and either presents ``I'' or ``O'' in next ongoing computation. More specifically, (1) if any positive integer x that is i module $2^t$ (i is an odd integer) is given, then the first t computations (each one is either ``I'' or ``O'' corresponding to whether current integer is odd or even) will be identical with that of i. (2) If current integer after t computations (in terms of ``I'' or ``O'') is less than x, then reduced dynamics of x is available. Otherwise, the residue class of x (namely, i module $2^t$) can be partitioned into two halves (namely, i module $2^{t+1}$ and $i+2^t$ module $2^{t+1}$), and either half presents ``I'' or ``O'' in intermediately forthcoming (t+1)-th computation.

We evaluate the nested sum $\sum_{a_{n - 1} = c}^{a_n } {\sum_{a_{n - 2} = c}^{a_{n - 1} } { \cdots \sum_{a_0 = c}^{a_1 } {x^{a_0 } } } }$ where $a_n$ and $c$ are any integers and $x$ is a real or complex variable. Consequently, we evaluate multiple sums involving the terms of a general second order sequence, the Horadam sequence (W_j (a, b; p, q)), defined for all non-negative integers j by the recurrence relation W₀ = a, W₁ = b; W_j = pW_j−1 − qW_j−2 (j≥2); where a, b, p and q are arbitrary complex numbers, with p ≠ 0, q ≠ 0.

The previous two parts of the paper (correspondingly, https://philpapers.org/rec/PENFLT-2 and https://philpapers.org/rec/PENFLT-3) demonstrate that the interpretation of Fermat’s last theorem (FLT) in Hilbert arithmetic meant both in a narrow sense and in a wide sense can suggest a proof by induction in Part I and by means of the Kochen - Specker theorem in Part II. The same interpretation can serve also for a proof FLT based on Gleason’s theorem and partly similar to that in Part II. The concept of (probabilistic) measure of a subspace of Hilbert space and especially its uniqueness can be unambiguously linked to that of partial algebra or incommensurability, or interpreted as a relation of the two dual branches of Hilbert arithmetic in a wide sense. The investigation of the last relation allows for FLT and Gleason’s theorem to be equated in a sense, as two dual counterparts, and the former to be inferred from the latter, as well as vice versa under an additional condition relevant to the Gödel incompleteness of arithmetic to set theory. The qubit Hilbert space itself in turn can be interpreted by the unity of FLT and Gleason’s theorem. The proof of such a fundamental result in number theory as FLT by means of Hilbert arithmetic in a wide sense can be generalized to an idea about “quantum number theory”. It is able to research mathematically the origin of Peano arithmetic from Hilbert arithmetic by mediation of the “nonstandard bijection” and its two dual branches inherently linking it to information theory. Then, infinitesimal analysis and its revolutionary application to physics can be also re-realized in that wider context, for example, as an exploration of the way for physical quantity of time (respectively, for time derivative in any temporal process considered in physics) to appear at all. Finally, the result admits a philosophical reflection of how any hierarchy arises or changes itself only thanks to its dual and idempotent counterpart.

One of matrix equalities composed of multiple products of matrices and their generalized inverses is given by $A_1B_1^{-}A_2B_2^{-} \cdots A_kB_k^{-}A_{k+1}= A$ where $A_1$, $B_1$, $A_2$, $B_2$, $\ldots$, $A_k$, $B_k$, $A_{k+1}$, and $A$ are given matrices of appropriate sizes, and $B_1^{-}$, $B_2^{-}$, $\cdots$, $B_k^{-}$ are generalized inverses of matrices. The cases for $k = 1, 2$ and their special forms were properly approached in the theory of generalized inverses of matrices. In this note, the author presents an algebraic procedure to derive explicit necessary and sufficient conditions for the equality with $k = 3$ to always hold using certain rank equalities for the block matrices constructed by the given matrices, and then mention a key step of extending the previous work to a general situation.

In this paper, the sequential prime numbers are used as variables for the galactic spiral equations which were developed from the ROTASE model. Special spiral patterns are produced when prime numbers are treated with the unit of radian. The special spiral patterns produced with the first 1000 prime numbers have 20 spirals arranged in two groups. The two groups have perfect central symmetry with each other and are separated with two spiral gaps. The special spiral pattern produced with natural numbers from 1 to 7919 shows 6 spirals in the central area and 44 spirals in the outer area. The whole 7919 spiral points can be plotted with either 6-spiral pattern or 44-spiral pattern. For the spirals only produced by the prime numbers in the 6-spiral pattern plotting, the spiral 2 and spiral 3 each has only one spiral point produced by prime number 2 and 3, respectively, all other spiral points produced by other prime numbers are located on the spiral 1 and spiral 5. The special spiral pattern is well explained with careful analysis, it is concluded that all prime numbers greater than 3 must meet one of the equations: P₁ = 1 + 6 * n (n > 0) P₅ = 5 + 6 * n (n ≥ 0) In other words, every prime number greater than 3 is either a P₁ prime number or a P₅ prime number, no exception. Matching one of the equations is a necessary condition for a number to be a prime number, not a sufficient condition. Hope such sufficient condition can be found in the future. The number of P₁ prime numbers roughly equal the number of P₅ prime number in the first 2 billion prime numbers. The galactic spiral equations with golden angle can duplicate Vogel’s result for the simulation of sunflower seed head pattern, and a pinwheel pattern can be produced also with galactic spiral equations and 1 degree more than golden angle.

In this paper, we examine the weak abc conjecture and the strong abc conjecture using some functions. we attempt to discuss the possibilty that the negative consequence of the weak abc conjecture. Namely, we derive that the weak abc conjecture is not true. Additionally, we show that the strong abc conjecture is not true.

The paper is a continuation of another paper (https://philpapers.org/rec/PENFLT-2) published as Part I. Now, the case of “n=3” is inferred as a corollary from the Kochen and Specker theorem (1967): the eventual solutions of Fermat’s equation for “n=3” would correspond to an admissible disjunctive division of qubit into two absolutely independent parts therefore versus the contextuality of any qubit, implied by the Kochen – Specker theorem. Incommensurability (implied by the absence of hidden variables) is considered as dual to quantum contextuality. The relevant mathematical structure is Hilbert arithmetic in a wide sense (https://dx.doi.org/10.2139/ssrn.3656179), in the framework of which Hilbert arithmetic in a narrow sense and the qubit Hilbert space are dual to each other. A few cases involving set theory are possible: (1) only within the case “n=3” and implicitly, within any next level of “n” in Fermat’s equation; (2) the identification of the case “n=3” and the general case utilizing the axiom of choice rather than the axiom of induction. If the former is the case, the application of set theory and arithmetic can remain disjunctively divided: set theory, “locally”, within any level; and arithmetic, “globally”, to all levels. If the latter is the case, the proof is thoroughly within set theory. Thus, the relevance of Yablo’s paradox to the statement of Fermat’s last theorem is avoided in both cases. The idea of “arithmetic mechanics” is sketched: it might deduce the basic physical dimensions of mechanics (mass, time, distance) from the axioms of arithmetic after a relevant generalization, Furthermore, a future Part III of the paper is suggested: FLT by mediation of Hilbert arithmetic in a wide sense can be considered as another expression of Gleason’s theorem in quantum mechanics: the exclusions about (n = 1, 2) in both theorems as well as the validity for all the rest values of “n” can be unified after the theory of quantum information. The availability (respectively, non-availability) of solutions of Fermat’s equation can be proved as equivalent to the non-availability (respectively, availability) of a single probabilistic measure as to Gleason’s theorem.

In this paper, we derive Von Koch's inequality without using the Riemann Hypothesis. As well known, Von Koch's inequality is equivalent to the Riemann Hypothesis. Namely, we show that the Riemann Hypothesis is true. Furthermore, we show that the upper limit of its can be lowered.

In this part of the series of two papers, we extend the theorems discussed in part I for infinite series. We then use these theorems to develop distinct novel results involving the Hurwitz zeta function, Riemann zeta function, Polylogarithm and Fibonacci numbers. In continuation, we obtain some zeros of the newly developed zeta functions and explain their behaviour using plots in complex plane. Furthermore, we provide particular cases for the theorems and corollaries which show that our results generalise the currently available functions and series such as the Riemann zeta function and the geometric series. Finally, we provide four miscellaneous examples to showcase the vast scope of the developed theorems.

In gravitational theory and astrophysical dynamics, singular initial value problems (IVPs) are frequently encountered. Finding the solutions to this class of IVPs can be challenging due to their complex nature. This study strives to circumvent the complexity by proposing a numerical method for solving such problems. The approach proposed in the current research seeks solutions to the IVP by partitioning the domain [0,L] of the problem into two intervals and solving the problem on each domain. The study seeks a closed-form solution to the IVP in the interval containing the singular point. A linearization technique and piecewise partitioning of the domain not containing the singularity are applied to the nonlinear IVP. The resulting linearized differential equation is solved using the Chebyshev spectral collocation method. Some examples are presented to illustrate the efficiency of the proposed method. Numerical analysis of the solution and residual errors are shown to ascertain convergence and accuracy. The results suggest that the technique gives accurate convergent solutions using a few collocation points.

A generalization of the sum of divisors function involves a recursive definition. This leads to variants of superabundant numbers, colossally abundant numbers, and Gronwall's theorem (relevant to the Riemann hypothesis).

In a previous paper (https://dx.doi.org/10.2139/ssrn.3648127 ), an elementary and thoroughly arithmetical proof of Fermat’s last theorem by induction has been demonstrated if the case for “n = 3” is granted as proved only arithmetically (which is a fact a long time ago), furthermore in a way accessible to Fermat himself though without being absolutely and precisely correct. The present paper elucidates the contemporary mathematical background, from which an inductive proof of FLT can be inferred since its proof for the case for “n = 3” has been known for a long time. It needs “Hilbert mathematics”, which is inherently complete unlike the usual “Gödel mathematics”, and based on “Hilbert arithmetic” to generalize Peano arithmetic in a way to unify it with the qubit Hilbert space of quantum information. An “epoché to infinity” (similar to Husserl’s “epoché to reality”) is necessary to map Hilbert arithmetic into Peano arithmetic in order to be relevant to Fermat’s age. Furthermore, the two linked semigroups originating from addition and multiplication and from the Peano axioms in the final analysis can be postulated algebraically as independent of each other in a “Hamilton” modification of arithmetic supposedly equivalent to Peano arithmetic. The inductive proof of FLT can be deduced absolutely precisely in that Hamilton arithmetic and the pransfered as a corollary in the standard Peano arithmetic furthermore in a way accessible in Fermat’s epoch and thus, to himself in principle. A future, second part of the paper is outlined, getting directed to an eventual proof of the case “n=3” based on the qubit Hilbert space and the Kochen-Specker theorem inferable from it.

The 3x+1 problem is a problem of continuous iteration for integers. According to the basic theorem of arithmetic and the way of iteration, we derive a general formula for continuous iteration for odd integers. Through this formula, we can construct a loop iteration equation and obtain the result of the equation: the equation has only one positive integer solution. In addition, this general formula can be converted into a linear indeterminate equation. The process of solving this equation shows that the relationship between the iteration result and the odd number being iterated is linear. Extending this result to all positive even numbers, we get the answer to the 3x + 1 question.

Multi-objective optimization (MOO) is an optimization involving minimization or maximization of several objective functions more than the conventional one objective optimization, which is useful in many fields. Many of the current methodologies addresses challenges and solutions that attempt to solve simultaneously several Objectives with multiple constraints subjoined to each. Often MOO are generally subjected to linear inequality, equality and or bounded constraint that prevent all objectives from being optimized at once. This paper reviews some recent articles in area of MOO and presents deep analysis of Random and Uniform Entry-Exit time of objectives. It further break down process into sub-process and then provide some new concepts for solving problems in MOO, which comes due to periodical objectives that do not stay for the entire duration of process lifetime, unlike permanent objectives which are optimized once for the entire process duration. A methodology based on partial optimization that optimizes each objective iteratively and weight convergence method that optimizes sub-group of objectives are given. Furthermore, another method is introduced which involve objective classification, ranking, estimation and prediction where objectives are classified based on their properties, and ranked using a given criteria and in addition estimated for an optimal weight point (pareto optimal point) if it certifies a coveted optimal weight point. Then finally predicted to find how far it deviates from the estimated optimal weight point. A Sample Mathematical Tri-Objectives and Real world Optimization was analyzed using partial method, ranking and classification method, the result showed that an objective can be added or removed without affecting previous or existing optimal solutions. Therefore suitable for handling time governed MOO. Although this paper presents concepts work only, it’s practical application are beyond the scope of this paper, however base on analysis and examples presented, the concept is worthy of igniting further research and application.

In this paper, we present sums and partial sums of Horadam sequences via generating functions which extends a recent result of Prodinger.

In this paper, we give explicit asymptotic formulas for some sums over primes involving generalized alternating hyperharmonic numbers of types I, II and III. Analogous results for numbers with $k$-prime factors will also be considered.

Integer is either a composite number or a prime number. Therefore, detecting composite numbers is important for solving prime numbers. The study of prime numbers, apart from satisfying human curiosity, can be very important. In this article, the order of composite numbers has been detected. And explained with a simple method and a simple function. And, a method has been developed in which all composite numbers and therefore prime numbers can be determined by using the specified methods, functions and formulas.

Applying a procedure similar to that of E.S. Bring, by using a 4^th degree Tschirnhaus transformation, it was possible to transform the Bring-Jerrard normal quintic (BJQ) equation into a De Moivre form (DMQ), so that it could be solved by radicals. The general solution by radicals of the De Moivre equations of any degree is presented. By the same procedure the BJSx (normal sextic) equation was taken to another one without the 2^nd, 4^th and 6^th terms which was transformed into a cubic (solvable) equation. By applying a 6^th degree Tschirnhaus transformation to the BJSp (normal septic) equation its binormal (without the 2^nd, 3^rd, 4^th and 5^th terms) form was obtained.