In this paper, the distribution of prime numbers is expressed based on proving the Riemann hypothesis. The modality to the distribution of prime numbers is one of the most important results of proving the Riemann hypothesis. The relationship between three numbers, three, six, and nine, and the modality to the distribution of prime numbers, is one of the results of Riemann's zeta function. Prime numbers are classified into six groups of single-digit numbers. There are no prime numbers in groups of three, six, and nine. The groups are made based on the sum of the internal digits. And for each set, there is an angle in the complex plane. The distance between the prime numbers in each group has a regular pattern. This pattern is a multiple of the numbers three, six, and nine. According to Euler's number, for an angle of 60 degrees, the real part of the cosine is 0.5. Accordingly, all prime numbers are related to angles greater than 60 degrees to 90 degrees. As a result, based on the relationship between the golden spiral and the complex conjugate of the zeta function, the function in The 1/2 point becomes zero.

In this paper, a structural property of prime numbers will be introduced and analyzed. Our analysis is based on the application of the sequence of even integers 2,10,16,22,26,28… which is defined as follows: F(0) = 2, for i > 0, F(i) = F(i − 1)+ l, where l is the smallest even integer that is valid for: F(i − 1)+ 2k − 1 ∈ P, for k = 1, 2, . . . l/2-1, F(i − 1)+ 2k − 1 ∉ P, for k = 2l and P is the set of prime numbers. The sequence F answers the question, which are the natural numbers that cannot be expressed as a sum of two primes. We prove that numbers expressed as j = F(i)+ 1 cannot be written as the sum of two primes, for i = 1, 2, ··· .

The Riemann zeta function plays a crucial role in number theory and its applications. The Riemann Hypothesis (RH) posits that zeros of other than the trivial ones are located on the line defined by the equation Re(s) =1/2. This paper introduces a novel and straightforward proof of the Riemann Hypothesis. The proof employs a standard method, utilizing the eta function in place of the zeta function, under the assumption that the real part is greater than zero. The equation for the real and imaginary parts of the Riemann zeta function (eta function) is completely separated. Initially, let with s= . The value of the real part is determined by solving the equation, and the process is repeated for identifying the potential roots shared by the two functions, a common value is obtained, leading to a =1/2, which represents the real part of the main root of the function ζ(s). By plotting the zeta function for the obtained a, it is determined that the function has a root only at a =1/2. In another analysis, by identifying the roots of the common potential between the two functions ζ(s) and ζ(1-s), a common value is obtained, which leads to a =1/2. This value represents the real part of the main root of the function ζ(s). Additionally, using a standard method and with the help of two functions ζ(s) and ζ(1-s), the real part of the root of the zeta function is obtained. To create a generator function for prime numbers in terms of b, one can solve the root of the zeta function where it equals one (i.e., and obtain a relationship between b’ and prime numbers. Giving the value of zeta equal to one and s' = a' + ib’, similar to zeta equal to zero, the roots are again placed on the line. Then, by using the zeta function defined by multiplying prime numbers, we arrive at a new meaningful relation between b’ and its corresponding prime number is obtained.

For a left module RM over non-commutative ring R, the notion for the class of nilpotent elements (nilR(M)) was first introduced and studied by SSevviiri and Groenewald . Moreover, Armendariz and semicommutative modules are generalizations of reduced modules and nilR(M)=0 in the case of reduced modules. Thus, the nilpotent class plays a vital role in these modules. Motivated by this, we present the concept of nil-Armendariz modules as a generalization of reduced modules and a refinement of Armendariz modules, focusing on the class of nilpotent elements. Further, we demonstrate that the quotient module M/N is nil-Armendariz if and only if N is within the nilpotent class of RM. Additionally, we establish that the matrix module Mn(M) is nil-Armendariz over Mn(R) and explore conditions under which nilpotent classes form submodules. Finally, we prove that nil-Armendariz modules remain closed under localization.

The primary purpose of this research article is to study the famous K$\ddot{o}$the's Conjecture for the special cases - when a ring $\mathfrak{R}$ is commutative, and when $\mathfrak{R}$ is an Algebra over a field. Furthermore, some open problems involving tensor product of Algebras over a field has also been discussed extensively along with their proofs. Subsequently, an equivelent statement of K$\ddot{o}$the's problem in terms of algebra of matrices has been established.

We provide representations for the generalized Drazin inverse of an anti-triangular matrix of the form $\left( \begin{array}{cc} a&b\\ 1&0 \end{array} \right)$ in a Banach algebra $\mathcal{A}$, under the condition that $ab=ba$. Specifically, we present the representation of Drazin inverse for these types of anti-triangular matrices in Banach algebras.

We propose a new approach to extending the notion of commutator and Lie algebra to algebras with ternary multiplication laws. Our approach is based on ternary associativity of the first and second kind. We propose a ternary commutator, which is a linear combination of six (all permutations of three elements) triple products. The coefficients of this linear combination are the cube roots of unity. We find an identity for the ternary commutator that holds due to ternary associativity of the first or second kind. The form of the found identity is determined by the permutations of the general affine group GA(1,5)⊂S5. We consider the found identity as an analogue of the Jacobi identity in the ternary case. We introduce the concept of a ternary Lie algebra at the cubic root of unity and give examples of such an algebra constructed using ternary multiplications of rectangular and three-dimensional matrices. We point out the connection between the structure constants of a ternary Lie algebra with three generators and an irreducible representation of the rotation group.

A prime gap is the difference between consecutive prime numbers. The $n^{\text{th}}$ prime gap, denoted $g_{n}$, is calculated by subtracting the $n^{\text{th}}$ prime from the $(n+1)^{\text{th}}$ prime: $g_{n}=p_{n+1}-p_{n}$. Oppermann's conjecture is a prominent unsolved problem in pure mathematics concerning prime gaps. Despite verification for numerous primes, a general proof remains elusive. If true, the conjecture implies that prime gaps grow at a rate bounded by $g_{n}<{\sqrt {p_{n}}}$. We examine the ratio of Chebyshev functions for consecutive primes, $\frac{\theta(p_{n+1})}{\theta(p_{n})}$, and compare it to the square root of their ratio, $\sqrt {\frac{p_{n+1}}{p_{n}}}$. Assuming this inequality holds for primes larger than $10^{8}$, we demonstrate the truth of Oppermann's conjecture. For sufficiently large $n$, this inequality guarantees that $g_{n}<{\sqrt {p_{n}}}$ for all primes beyond a certain point. Our proof also validates Andrica's, Legendre's, and Brocard's conjectures for primes exceeding a specific threshold.

This article provides a proof that the Ramanujan's Inequality given by, \begin{align*} \pi(x)^2 < \frac{e x}{\log x} \pi\left(\frac{x}{e}\right) \end{align*} holds unconditionally for every $x\geq \exp(43.5102146)$. In case for an alternate proof of the result stated above, we shall exploit certain estimates involving the Chebyshev Theta Function, $\vartheta(x)$ in order to derive appropriate bounds for $\pi(x)$, which'll lead us to a much improved condition for the inequality proposed by Ramanujan to satisfy unconditionally.

This research article provides an unconditional proof of an inequality proposed by \textit{Srinivasa Ramanujan} involving the Prime Counting Function $\pi(x)$, \begin{align*} (\pi(x))^{2}<\frac{ex}{\log x}\pi\left(\frac{x}{e}\right) \end{align*} for every real $x\geq \exp(547)$, using specific order estimates of the \textit{Mertens Function}, $M(x)$. The proof primarily hinges upon investigating the underlying relation between $M(x)$ and the \textit{Second Chebyshev Function}, $\psi(x)$, in addition to applying the meromorphic properties of the \textit{Riemann Zeta Function}, $\zeta(s)$ with an intention of deriving an improved approximation for $\pi(x)$.

The primary purpose of this article is to study the asymptotic and numerical estimates in detail for higher degree polynomials in $\pi(x)$ having a general expression of the form, \begin{align*} P(\pi(x)) - \frac{e x}{\log x} Q(\pi(x/e)) + R(x) \end{align*} $P$, $Q$ and $R$ are arbitrarily chosen polynomials and $\pi(x)$ denotes the \textit{Prime Counting Function}. The proofs require specific order estimates involving $\pi(x)$ and the \textit{Second Chebyshev Function} $\psi(x)$, as well as the famous \textit{Prime Number Theorem} in addition to certain meromorphic properties of the \textit{Riemann Zeta Function} $\zeta(s)$ and results regarding its non-trivial zeros. A few generalizations of these concepts have also been discussed in detail towards the later stages of the paper, along with citing some important applications.

Let's define $\delta(x) = (\sum_{{q\leq x}}{\frac{1}{q}}-\log \log x-B)$, where $B \approx 0.2614972128$ is the Meissel-Mertens constant. The Robin theorem states that $\delta(x)$ changes sign infinitely often. Let's also define $S(x) = \theta(x) - x$, where $\theta(x)$ is the Chebyshev function. It is known that $S(x)$ changes sign infinitely often. We define the another function $\varpi(x) = \left(\sum_{{q\leq x}}{\frac{1}{q}}-\log \log \theta(x)-B \right)$. We prove that when the inequality $\varpi(x) \leq 0$ is satisfied for some number $x \geq 3$, then the Riemann hypothesis should be false. The Riemann hypothesis is also false when the inequalities $\delta(x) \leq 0$ and $S(x)\geq 0$ are satisfied for some number $x \geq 3$ or when $\frac{3 \times \log x + 5}{8 \times \pi \times \sqrt{x} + 1.2 \times \log x + 2} + \frac{\log x}{\log \theta(x)} \leq 1$ is satisfied for some number $x \geq 13.1$.

Around $1637$, Pierre de Fermat famously scribbled, and claimed to have a proof for, his statement that equation $a^{n} + b^{n} = c^{n}$ has no positive integer solutions for exponents $n>2$. The theorem stood unproven for centuries until Andrew Wiles' groundbreaking work in $1994$, with a notable caveat: Wiles' proof, while successful, relied on modern tools far beyond Fermat's claimed approach in terms of complexity. The present work potentially offers a solution which is closer in spirit to Fermat's original idea.

Let $R$ be a commutative ring with identity. A proper ideal $I$ of a ring $R$ is called a square-difference factor absorbing primary ideal of $R$ if for $a,b\in R$, whenever $a^{2}-b^{2}\in I$, then $a+b\in\sqrt{I}$ or $a-b\in I$. Several characterizations and properties of this class of ideals are presented.Various examples are provided to illustrate the obtained results and demonstrate the applicability of our findings. Furthermore, the properties of this class of ideals are investigated in extensions of rings.

The Polynomial coefficient function, from the complex hyperspace Cⁿ in itself, is the function Fⁿ that provides the coefficients of the polynomial (x - a₁)(x - a₂)... (x-a_n). A proof of the fundamental theorem of algebra is given where the surjectivity of this function is obtained from a Recurrent Coefficient Equation.

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 Riemann hypothesis is the assertion that all non-trivial zeros are complex numbers with real part $\frac{1}{2}$. It is considered by many to be the most important unsolved problem in pure mathematics. There are several statements equivalent to the famous Riemann hypothesis. Robin's criterion states that the Riemann hypothesis is true if and only if the inequality $\sigma(n) < e^{\gamma} \cdot n \cdot \log \log n$ holds for all natural numbers $n > 5040$, where $\sigma(n)$ is the sum-of-divisors function of $n$, $\gamma \approx 0.57721$ is the Euler-Mascheroni constant and $\log$ is the natural logarithm. We require the properties of superabundant numbers, that is to say left to right maxima of $n \mapsto \frac{\sigma(n)}{n}$. In this note, using Robin's criterion on superabundant numbers, we prove that the Riemann hypothesis is true.

We investigate the existence and representation of the generalized core-EP inverse of some triangular matrices over a Banach algebra. Further, the general representations of the generalized core-EP inverse of a triangular matrix over a $C^*$-algebra are presented. As applications, the generalized core-EP inverses of some block operator matrices over Hilbert spaces are given.

The primary motivation for this work is to develop the concept of Marshall's quotient (\cite{ribeiro2016functorial}) applicable to non-commutative multirings endowed with involution, expanding the main ideas of the classical (= commutative, without involution) case presented in Marshall's seminal paper \cite{marshall2006real}. We define two multiplicative properties to deal with the involutive case and characterize their Marshall quotient. Besides, this article presents various cases showing that the ''multi'' version of rings with involution offers many examples, applications, and relatives in (multi) algebraic structures.

Game-based learning assessments lean on educational data mining approaches such as stealth assessments and quasi mixed-methods that help gather student learning proficiency. Rarely do we see approaches where student proficiency in learning is woven into the game's design. Educational Burst Games (EBGs) is a new approach to improving learning proficiency by designing fast-paced, short, repetitive, and skill-based games. They have the potential to be effective learning interventions both during instruction in the classroom and during after-school activities such as assignments and homework. Over five years we have developed two EBGs aimed at improving linear algebra concepts of undergraduate students. In this study, we provide results of an in-depth evaluation of the two EBGs developed with 45 participants that represent our target population. We discuss the role of EBGs and their design constructs such as pace and repetition, the effect of the format (2D vs. 3D), the complexity of the levels and the influence of prior knowledge on the learning outcomes.

A prime number is a natural number with no divisors other than itself and the number 1. There are many unsolved problems related to prime numbers. One such problem is finding a general method for identifying prime numbers. Although it is known that all prime numbers fall under the categories of 2, 3, or 6n±1 (where n≥1), a formalized method for eliminating composite numbers (non-prime numbers) from these categories has yet to be developed. This paper aims to explore a possible method for such elimination, which involves checking whether there exists an n that satisfies n = 6km+k+m or n = 6km+k-m (where k and m are non-zero integers). This method is expected to be a major step forward in the derivation of prime numbers.

The primary purpose of this article is to provide a brief overview about the notion of the \textit{Mertens Function} $M(n)$ and \textit{Redheffer Matrices} $\mathbb{A}_{n}$ and, to derive specific order estimates for $M(n)$, in order to analyze the location of the non-trivial zeros of the \textit{Riemann Zeta function} $\zeta(s)$. A priori using the above concepts, the article aims at establishing a necessary and sufficient condition for the \textit{Riemann Hypothesis} to hold true.

It has been discovered that representing odd integers as modified binary expressions of the form $\sum \limits_{n > m}2^n + 2^m - 1$ for $m \geq 1$ helps in understanding the dynamics of Collatz-type sequences. Starting with the original Collatz sequence $3x + 1$, it is found that when the odd step is applied to an odd integer $\sum \limits_{n > m}2^n + 2^m - 1$, an even integer $3\left(\sum \limits_{n > m}2^{n}\right) + 2^{m + 1} + 2^m - 2$ is obtained, which is exactly once divisible by 2, unless the lowest index reduces to zero. This implies that the sequence alternates between odd and even steps $m$ times. This governs the dynamics of the Collatz-type sequences because the value of $m$ determines the number of times the integer can be divided by 2 in each even step. A shortcut method is developed based on this dynamics that states that the even integer after $m$ odd-even steps are completed is $\left(\left(\frac{3}{2}\right)^m \sum \limits_{n > m}2^n\right) + 3^m - 1$. A shortcut method of this magnitude has never been utilized anywhere. The shortcut method for the modified Collatz sequence $5x + 1$ is also presented.

In this paper, we derive a formula for sum of powers of integers from Abel’s Summation Formula. This formula enables us to generate the formula for the sum of k-th power of integers, denoted by Sk(n), given the formulas of S1(n), S2(n), ..., Sk−1(n). Furthermore, we shall extend this formula to compute the sum of powers of an arithmetic progression. Moreover, we can combine the formula with the result of Bernoulli to derive another result which enables us to find Bernoulli Numbers recursively.

In this article we have constructed a basic methodology from which important perspectives for both the Collatz conjecture and Beal's conjecture can be derived. We falsified the conjecture we previously developed on Beal's conjecture and made the falsified conjecture usable for Collatz conjecture. In this regard, we have clearly expressed the numbers that can reach 1 in the Collatz conjecture. Then, using this, we created a limit for the numbers that should be considered for the Collatz conjecture. Thanks to the analysis of this limit, we have clearly expressed the recursive Collatz function in an equation. Using this structure, we wrote a function that indicates how many times the Collatz function repeats certain numbers to reach 1.

This paper presents an explicit method for constructing tangential and anisotropic bases in quadratic spaces. We will also provide three theorems that allow us to explicitly calculate vectors that are orthogonal or tangent to given vectors or that provide necessary and sufficient conditions for the existence of such vectors. A classical theorem on quadratic space states that every finite-dimensional quadratic space has an orthogonal basis. A result that seems to be unanswered is under what conditions a finite-dimensional quadratic space has a basis consisting of isotropic vectors. A second problem is whether or not every finite-dimensional quadratic space has a basis consisting of mutually tangent vectors, where two vectors v,w are tangent if (u·v)2=(u·u)(v·v). In this paper, we attack these two problems.

We explored an extension of the Cauchy-Riemann equations to the algebra of treons, recently described by Alejandro Bermejo, whose elements are ordered 3-tuples. We leveraged the isomorphism between the algebra of treons and algebra B, and deduced the Cauchy-Riemann equations for the algebra of treons, establishing the necessary conditions for analyticity in this algebraic structure. This work significantly broadened our horizons in complex analysis and introduced new possibilities for applications across various fields of advanced mathematics.

In this paper, we introduce the notion of the generalized $w$-group inverse in a Banach algebra with proper involution. This is a natural generalization of generalized (weak) group inverse in Banach *-algebras. Many elementary properties of such new weighted generalized inverse are presented. We further establish the equivalent relations between generalized weighted group inverse and weighted generalized Drazin inverse. Related properties of generalized (weak) group inverse are extended to the wider cases.

This article introduces the Theory of Inverse Discrete Dynamical Systems (TIDDS), a novel methodology for modeling and analyzing discrete dynamical systems via inverse algebraic models. Key concepts such as inverse modeling, structural analysis of inverse algebraic trees, and the establishment of topological equivalences for property transfer between a system and its inverse are elucidated. Central theorems on homeomorphic invariance and topological transport validate the transfer of cardinal attributes between dynamic representations, offering a fresh perspective on complex system analysis. A significant application presented is an alternative proof of the Collatz Conjecture, achieved by constructing an associated inverse model and leveraging analytical property transfers within the inverted tree structure. This work not only demonstrates the theory's capability to address and solve open problems in discrete dynamics but also suggests vast implications for expanding our understanding of such systems.

We present an exploration of algebra B, a recently published unital and non-associative algebra. Unique complex entities emerged from this algebra, distinct from both quaternion and complex number systems, which we termed treons. We defined the treonic number system and established an isomorphism between this system and the real vector space. Our findings revealed that the treonic representation maintained structural integrity under the defined operations. Based on this foundation, we proceed to determine Euler identity for algebra B within the treonic system. By presenting the fundamental definitions and properties of algebra B, we derived a generalized version of Euler identity applicable within this algebra. This formula revealed the emergence of hyperbolic trigonometric entities, extending the applicability of Euler identity beyond traditional complex numbers. Our results provide a theoretical foundation for a deeper understanding of the properties and behaviors of complex entities within this expanded algebraic framework, thus enabling new theoretical developments and practical applications in the realms of advanced mathematics and theoretical physics.

This paper presents a new proof of the infinite nature of prime numbers. Grounded in fundamental Set theory and Analysis, the proof uses the method of contradiction to demonstrate the absurdity of assuming the set of all prime numbers to be finite.

We introduce a new generalized inverse which is a natural generalization of (pseudo) right core inverse in a Banach *-algebra. We characterize this generalized inverse by using right core and quasi-nilpotent decomposition. We then present its polar-like characterization and investigate related algebraic properties. Finally, the right core-EP inverse is characterized by certain new ways.

We introduce a novel algebraic structure, termed algebra B, which generalizes Lie algebras through the definition of a non-associative and unital algebra. We demonstrate that algebra B retains essential properties such as bilinearity and antisymmetry, and satisfies both the Jacobi and Malcev identities; this occurs when the product operations of Lie and Malcev algebras are derived from the product operation defined in our algebra. By examining the connections between algebra B, Malcev algebras, and Lie algebras, we establish that algebra B effectively generalizes these structures. Furthermore, we show that algebra B can generate complex entities with a novel structure distinct from those currently known. Our findings lay the groundwork for future investigations into the practical applications and further theoretical development of this new algebraic framework.

In this work, we consider the properties of the two-term Machin-like formula and develop an algorithm for computing digits of π by using its rational approximation. In this approximation, both terms are constructed by using a representation of 1/π in the binary form. This approach provides the squared convergence in computing digits of π without any trigonometric functions and surd numbers. The Mathematica codes showing some examples are presented.

We introduce a full binary directed tree structure to represent the set of natural numbers, further categorizing them into three distinct subsets: pure odd numbers, pure even numbers, and mixed numbers. We adopt a binary string representation for natural numbers and elaborate on the composite methodology encompassing odd- and even-number functions. Our analysis focuses on examining the iteration sequence (or composition) of the Collatz function and its reduced variant, which serves as an analog to the inverse function, to scrutinize the validity of the Collatz conjecture. To substantiate this conjecture, we incorporate binary strings into an algebraic formula that captures the essence of the Collatz sequence. By this means, we transform discrete powers of 2 into continuous counterparts, ultimately culminating in the smallest natural number, 1. Consequently, the sequence generated through infinite iterations of the Collatz function emerges as an eventually periodic sequence, thereby validating an enduring 87-year-old conjecture.

In the paper, we prove a joint limit theorem in terms of weak convergence of probability measures on $\mathbb{C}^2$ defined by means of the Epstein ζ(s;Q) and Hurwitz ζ(s,α) zeta-functions. The limit measure in the theorem is explicitly given. For this, some restrictions on the matrix Q and parameter α are required. The theorem obtained extends and generalizes Bohr-Jessen’s results characterising asymptotic behaviour of the Riemann zeta-function.

Monogenity is a classical area of algebraic number theory that is very actively researched even today. This paper is a collection of the results obtained during the last few years in this area. Several of these results were presented at the series of online conferences "Monogenity and power integral bases".

We develop a primality test for Mersenne numbers and investigate the primality of the sequence of Catalan-Mersenne numbers. We use induction as a proof to show that the 5th Catalan-Mersenne number is a prime number, thus demonstrating the infinitude of Mersenne primes.

In this article, we present solutions for one of the oldest mathematical problems, the Collatz Conjecture, and provide a proof for the Riemann Hypothesis, utilizing a new number theory based on newly discovered number properties, which will also be presented in this paper. This is made possible through the Sophy-Peter mathematical framework, built upon this new number theory. The Collatz Conjecture will be disproven, but as an alternative, the Oscillating Theorem will be introduced, with its correctness proven within this article. Furthermore, we present the general version of the Riemann zeta function, developed based on the new number theory. The correctness of this function is verified by comparing it with existing results of the zeta function. Using this approach and the Sophy-Peter framework, we have successfully proven the Riemann Hypothesis, long considered a millennium problem. Moreover, since the general zeta function is proven, this implies the correctness of the new number theory and the Sophy-Peter framework.

We use binary string to represent a natural number and show the composite procedure of odd-number and even-number functions, thus we propose full binary directed tree to represent the set of natural numbers and give another partition the natural number set to three sets: pure odd, pure even and mixed number. For the Collatz conjecture we make use of the parity of a natural number to analyse the sequence of iteration (or composite) of Collatz function and reduced Collatz function analog to the inverse function. We give tabular and binary strings to the algebra expression to state the sequence of Collatz, this is the key topic to proof the conjecture: the discrete powers of 2 can be changed to ultimately continuous powers of 2, finally get to pure even number and to the smallest number 1. The sequence created by the infinite 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 87 years.

In this paper, we define the cohomology of a modified $\lambda$-differential left-symmetric algebra with coefficients in a suitable representation. We also introduce the notion of modified $\lambda$-differential left-symmetric 2-algebra. We classify linear deformations and abelian extensions of modified $\lambda$-differential left-symmetric algebras using the second cohomology group and classify skeletal modified $\lambda$-differential left-symmetric 2-algebra using the third cohomology group as our propose cohomology applications. Moreover, we prove that strict modified $\lambda$-differential left-symmetric 2-algebras are equivalent to crossed modules of modified $\lambda$-differential left-symmetric algebras.

Let a,b,c be positive integers such that a²+b²=c², 2|b,gcd(a,b)=1. In 1956, Jesmanowicz conjectured that for any positive integer w, the only solution of (aw)^x+(bw)^y=(cw)^z in positive integers is (x, y, z) = (2, 2, 2). In this paper, based on Gaussian integer ring, we show that Je$\acute{s}$manowicz' conjecture is true for any positive integer

Semenov-Tian-Shansky has introduced the modified classical Yang-Baxter equation, which is called the modified $r$-matrix. Relevant studies have been extensive in recent times. This paper is devoted to study cohomology theory of modified Rota-Baxter pre-Lie algebras and its applications. First we introduce the concept and representations of modified Rota-Baxter pre-Lie algebras. We then develop the cohomology of modified Rota-Baxter pre-Lie algebras with coefficients in a suitable representation. As applications, we consider the infinitesimal deformations, abelian extensions and skeletal modified Rota-Baxter pre-Lie 2-algebra in terms of lower degree cohomology groups.

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 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.

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.