In this research first, a sequence of properties called delta is assigned to each prime number and then examined. Deltas are only dependent on the distribution of prime numbers, so the results obtained for the delta distribution can be considered as a proxy for the distribution of prime numbers. The first observation was that these properties are not unique and different prime numbers may have the same value of delta of a given order. It was found that a small number of deltas cover a large portion of prime numbers, so by recognizing repetitive deltas, the next prime numbers can be predicted with a certain probability, but the most important observation of this study is the normal distribution of deltas. This research has not tried to justify the obtained observations and instead of answering the questions, it seeks to ask the right question.

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.

We talk about random when it is not possible to determine a pattern on the observed outcomes. A computer follows a sequence of fixed instructions to give any of its output, hence the difficulty of choosing numbers randomly from algorithmic approaches. However, some algorithms based on mathematical formulas like the Linear Congruential algorithm and the Lagged Fibonacci generator appear to produce "true" random sequences to anyone who does not know the secret initial input [1]. Up to now, we cannot rigorously answer the question on the randomness of prime numbers [2, page 1] and this highlights a connection between random number generator and the distribution of primes. From [3] and [4] one sees that it is quite naive to expect good random reproduction with prime numbers. We are, however, interested in the properties underlying the distribution of prime numbers, which emerge as sufficient or insufficient arguments to conclude a proof by contradiction which tends to show that prime numbers are not randomly distributed. To achieve this end, we use prime gap sequence variation. The algorithm that we produce makes possible to deduce, in the case of a binary choice, a uniform behavior in the individual consecutive occurrence of primes, and no uniformity trait when the occurrences are taken collectively.

In this paper, we study the symmetry between the supersingular prime number according to smallest sphenic number. With this symmetry, we show that the elements of sporadic group generates all prime numbers with the order by a simple application.

This work is divided into two parts. In the first one the combinatorics of a new class of randomly generated objects, exhibiting the same properties as the distribution of prime numbers, is solved and the probability distribution of the combinatorial counterpart of the n-th prime number is derived, together with an estimate of the prime-counting function π(x). A proposition equivalent to the Prime Number Theorem (PNT) is proved to hold, while the equivalent of the Riemann Hypothesis (RH) is proved to be false with probability 1 (w.p. 1) for this model. Many identities involving Stirling numbers of the second kind and harmonic numbers are found, some of which appear to be new. The second part is dedicated to generalizing the model to investigate the conditions enabling both PNT and RH. A model representing a general class of random integer sequences is found, for which RH holds w.p. 1. The prediction of the number of consecutive prime pairs, as a function of the gap d, is derived from this class of models and the results are in agreement with empirical data for large gaps. A heuristic version of the model, directly related to the sequence of primes, is discussed and new integral lower and upper bounds of π(x) are found.

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.

For each non-prime odd number as F=pq , if we consider m/n as an approximation for q/p and choose k=mn , then by proving some lemmas and theorems, we can compute the values of m and n. Finally, by using Fermat’s factorization method for F and 4kF as difference of two non-consecutive natural numbers, we should be able to find the values of p and q. Then we introduce two new and powerful sieves for separating composite numbers from prime numbers.

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

Let R be a commutative graded ring with unity, S be a multiplicative subset of homogeneous elements of R and P be a graded ideal of R such that P\bigcap S=\emptyset In this article, we introduce several results concerning graded S-prime ideals. Then we introduce the concept of graded weakly S-prime ideals which is a generalization of graded weakly prime ideals. We say that P is a graded weakly S-prime ideal of R if there exists s\in S such that for all x, y\in h(R), if 0\neq xy\in P, then sx\in P or sy\in P. We show that graded weakly S-prime ideals have many acquaintance properties to these of graded weakly prime ideals.

One of the rare diseases throughout the world is Glycogen Storage Disease, which appears due to problems in glycogen metabolism. Among various subtypes of GSD, GSD Type 1a is the most abundant one of GSD Type 1, seen in approximately 80% and caused by different kinds of mutations in the Glucose-6-Phosphatase Catalytic Subunit (G6PC) gene in human chromosome 17q21. G6PC gene encodes for glucose-6-phosphatase (G6Pase) protein, which cleaves glucose-6-phosphate into glucose and inorganic phosphate (Pi), and GSD Type 1a patients fail to breakdown glucose-6-phosphate due to several mutations in the G6PC gene. In our study, we aim to create new therapeutic approaches for GSD 1a. We collected mutation data of 57 GSD Type 1a patients from Turkey. According to the data, 16 types of mutations were observed in the G6PC gene. Allele frequencies of these mutations are calculated as 59% for R83C/H, 11% for W160*, 7% for G270V, and 28% for others which have less frequency. Up to now, the tertiary protein structure of G6Pase has not been structured yet. To understand the possible impacts of these mutations, we statistically obtained possible tertiary structure predictions of G6Pase by running 5 different tools. At the end of the study, we suggest two effective and promising gene therapy methods for GSD Type 1a, Prime Editing for R83C/H mutations, and mRNA delivery for other mutations, in addition to a promising, commercially available drug suggestion for patients with W160*, W86*, and S15* mutations, although the drug belongs to another disease.

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.

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 Ramanujan primes are the least positive integers Rn having the property that if m ≥ Rn, then π_m − π_(m/2) ≥ n. This document develops several bounds related to the Ramanujan primes, sharpening the currently known results. The theory presented is by no means exhaustive, however it provides insights for future research work. Alternatively, we may say that it is a road map which may be followed to make further discoveries.

Twin prime numbers are two prime numbers which have the difference of 2 exactly. In other words, twin primes is a pair of prime that has a prime gap of two. Sometimes the part “twin prime” is used for a pair of twin primes; an alternative name for this is prime twin or prime pair. Up to date there is no any valid proof/disproof for twin prime conjecture. Through this research paper, my attempt is to provide a valid proof for twin prime conjecture.

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.

Since 1742, the year in which the Prussian Christian Goldbach wrote a letter to Leonhard Euler with his Conjecture in the weak version, mathematicians have been working on the problem. The tools in number theory become the most sophisticated thanks to the resolution solutions. Euler himself said he was unable to prove it. The weak guess in the modern version states the following: any odd number greater than 5 can be written as the sum of 3 primes. In response to Goldbach's letter, Euler reminded him of a conversation in which he proposed what is now known as Goldbach's strong conjecture: any even number greater than 2 can be written as a sum of 2 prime numbers. The most interesting result came in 2013, with proof of weak version by the Peruvian Mathematician Harald Helfgott, however the strong version remained without a definitive proof. The weak version can be demonstrated without major difficulties and will not be described in this article, as it becomes a corollary of the strong version. Despite the enormous intellectual baggage that great mathematicians have had over the centuries, the Conjecture in question has not been validated or refuted until today.

A twin prime numbers are two prime numbers which have the difference of 2 exactly. In other words, twin primes is a pair of prime that has a prime gap of two. Sometimes the term twin prime is used for a pair of twin primes; an alternative name for this is prime twin or prime pair. Up to date there is no any valid proof/disproof for twin prime conjecture. Through this research paper, my attempt is to provide a valid disproof for twin prime conjecture.

The maximal prime gaps upper bound problem is one of the major mathematical problems to date. The objective of the current research is to develop a standard which will aid in the understanding of the distribution of prime numbers. This paper presents theoretical results which originated with a researchin the subject of the maximal prime gaps. the document presents the sharpest upper bound for the maximal prime gaps ever developed. The result becomes the Supremum bound on the maximal prime gaps and subsequently culminates with the conclusive proof of the Firoozbakht's Hypothesis No 30. Firoozbakht's Hypothesis implies quite a bold conjecture concerning the maximal prime gaps. In fact it imposes one of the strongest maximal prime gaps bounds ever conjectured. Its truth implies the truth of a greater number of known prime gaps conjectures, simultaneously, the Firoozbakht's Hypothesis disproves a known heuristic argument of Granville and Maier. This paper is dedicated to a fellow mathematician, the late Farideh Firoozbakht.

In this study, we define the concept of pseudo-prime subhypermodules of hypermodules as a generalization of the prime hyperideal of commutative hyperrings in [17]. Firstly we examine the spectrum of the Zariski topology, which we built on the element of the pseudo-prime subhypermodules of a class of hyper-modules, then we give some relevant properties of the hypermodule in this topological hyperspace.

Let G be a finite group. The prime graph Γ(G) of G is defined as follows: The set of vertices of Γ(G) is the set of prime divisors of |G| and two distinct vertices p and p' are connected in Γ(G), whenever G has an element of order pp'. A non-abelian simple group P is called recognizable by prime graph if for any finite group G with Γ(G)=Γ(P), G has a composition factor isomorphic to P. In [4] proved finite simple groups ²D_n(q), where n ≠ 4k are quasirecognizable by prime graph. Now in this paper we discuss the quasirecognizability by prime graph of the simple groups ²D_2k(q), where k ≥ 9 and q is a prime power less than 10⁵.

This research paper aims to explicate the complex issue of the Riemann's Hypothesis and ultimately presents its elementary proof. The method implements one of the binomial coefficients, to demonstrate the maximal prime gaps bound. Maximal prime gaps bound constitutes a comprehensive improvement over the Bertrand's result, and becomes one of the key elements of the theory. Subsequently, implementing the theory of the primorial function and its error bounds, an improved version of the Gauss' offset logarithmic integral is developed. This integral serves as a Supremum bound of the prime counting function Pi(n). Due to its very high precision, it permits to verify the relationship between the prime counting function Pi(n) and the offset logarithmic integral of Carl Gauss. The collective mathematical theory, via the Niels F. Helge von Koch equation, enables to prove the RIemann's Hypothesis conclusively.

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

Robin criterion states that the Riemann Hypothesis is true if and only if the inequality $\sigma(n) < e^{\gamma } \times n \times \log \log n$ holds for all natural numbers $n > 5040$, where $\sigma(n)$ is the sum-of-divisors function and $\gamma \approx 0.57721$ is the Euler-Mascheroni constant. Let $q_{1} = 2, q_{2} = 3, \ldots, q_{m}$ denote the first $m$ consecutive primes, then an integer of the form $\prod_{i=1}^{m} q_{i}^{a_{i}}$ with $a_{1} \geq a_{2} \geq \cdots \geq a_{m} \geq 0$ is called an Hardy-Ramanujan integer. If the Riemann Hypothesis is false, then there are infinitely many Hardy-Ramanujan integers $n > 5040$ such that Robin inequality does not hold and $n < (4.48311)^{m} \times N_{m}$, where $N_{m} = \prod_{i = 1}^{m} q_{i}$ is the primorial number of order $m$.

Let {$\Gamma(k)$} denote {$(k-1)!$}, and let {$\Gamma_{n}(k)$} denote {$(k-1)!$}, where {$n \in \{3,\ldots,16\}$} and {$k \in \{2\} \cup [2^{\textstyle 2^{n-3}}+1,\infty) \cap \mathbb N$}. For an integer {$n \in \{3,\ldots,16\}$}, let $\Sigma_n$ denote the following statement: if a system of equations {${\mathcal S} \subseteq \{\Gamma_{n}(x_i)=x_k:~i,k \in \{1,\ldots,n\}\} \cup \{x_i \cdot x_j=x_k:~i,j,k \in \{1,\ldots,n\}\}$} with $\Gamma$ instead of $\Gamma_{n}$ has only finitely many solutions in positive integers {$x_1,\ldots,x_n$}, then every tuple {$(x_1,\ldots,x_n) \in (\mathbb N \setminus \{0\})^n$} that solves the original system ${\mathcal S}$ satisfies {$x_1,\ldots,x_n \leqslant 2^{\textstyle 2^{n-2}}$}. Our hypothesis claims that the statements {$\Sigma_{3},\ldots,\Sigma_{16}$} are true. The statement {$\Sigma_6$} proves the following implication: if the equation {$x(x+1)=y!$} has only finitely many solutions in positive integers $x$ and $y$, then each such solution {$(x,y)$} belongs to the set {$\{(1,2),(2,3)\}$}. The statement {$\Sigma_6$} proves the following implication: if the equation {$x!+1=y^2$} has only 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)\}$}. The statement {$\Sigma_9$} implies the infinitude of primes of the form {$n^2+1$}. The statement {$\Sigma_9$} implies that any prime of the form {$n!+1$} with {$n \geqslant 2^{\textstyle 2^{9-3}}$} proves the infinitude of primes of the form {$n!+1$}. The statement {$\Sigma_{14}$} implies the infinitude of twin primes. The statement {$\Sigma_{16}$} implies the infinitude of Sophie Germain primes.

Let R be a commutative ring with identity and S be a multiplicatively closed subset of R. The purpose of this paper is to introduce the concept of weakly S-primary ideals as a new generalization of weakly primary ideals. An ideal I of R disjoint with S is called a weakly S-primary ideal if there exists s∈S such that whenever 0≠ab∈I for a,b∈R, then sa∈√I or sb∈I. The relationships among S-prime, S-primary, weakly S-primary and S-n-ideals are investigated. For an element r in any general ZPI-ring, the (weakly) S_{r}-primary ideals are charctarized where S={1,r,r²,⋯}. Several properties, characterizations and examples concerning weakly S-primary ideals are presented. The stability of this new concept with respect to various ring-theoretic constructions such as the trivial ring extension and the amalgamation of rings along an ideal are studied. Furthermore, weakly S-decomposable ideals and S-weakly Laskerian rings which are generalizations of S-decomposable ideals and S-Laskerian rings are introduced.

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.

Based on recent popular money priming research results, which conclude that money 4 makes self-sufficient (e.g. less interest in other people), we assumed that people are less interested 5 in finding out whether others are lying or telling the truth. In a laboratory experiment, 163 students 6 (85 women, 78 men, MAge = 23.08, ranging from 18 to 36 years) were primed by actively handling 7 money (versus paper sheets). Afterwards, they classified 24 video statements as true or deceptive 8 (senders describing their most/least favorite movie), rated their classification confidence for each 9 decision and then answered control questions. Results revealed no influence of priming condition 10 on judgmental bias, classification accuracy, and classification confidence. Also the level of self-re-11 ported motivation to find out who lied or told the truth did not differ between conditions. Higher 12 motivation was correlated to higher classification confidence. Additionally, and in line with Rein-13 hard (2010) and Reinhard et al. (2011), higher classification accuracy correlated to a higher use of 14 verbal content cues for classification decisions. So, while we were able to replicate these findings, 15 our results contradict the assumption of a money prime influence on lie detection ability. Conclud-16 ing, our results make self-sufficiency in this context questionable and offer next steps for research.

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.

Abiotic stresses, including drought, salinity, cold, heat, and heavy metals, extensively reduce global agricultural production. Approaches such as conventional breeding and transgenic breeding have been widely used to cope with these environmental stresses. The clustered regularly interspaced short palindromic repeat- Cas (CRISPR/Cas) based gene-editing tool has revolutionized due to its simplicity, accessibility, adaptability, flexibility, and wide applicability. This system has a great potential to build up crop varieties with enhanced tolerance against abiotic stresses. In this review, we summarize the most recent findings on understanding the mechanism of abiotic stress response in plants and the application of CRISPR/Cas mediated gene-editing system towards enhanced tolerance to drought, salinity, cold, heat, and heavy metals stresses. Furthermore, in this review, we highlighted the recent advancements in prime editing and base editing tools for crop improvement.

Therapeutic vaccine studies should be designed to elicit durable, high magnitude, and efficacious T cell responses, all of which can be impacted by the choice of vaccination schedule. Here, we compare different prime-boost intervals (PBI) in a human papillomavirus (HPV) model using HPV16E6E7 Venezuelan equine encephalitis virus replicon particle (VRP) vaccination to address the optimal boosting schedule, quality of immune response, and overall in vivo efficacy. Six different vaccine regimens were tested with each group receiving booster vaccinations at different time intervals. Analysis of T-cell responses demonstrated a significant HPV16 E7 specific CD8+T cell response with minimally a one-week PBI between antigen re-exposure. Significant E7-specific in vivo cytotoxicity was also observed with longer PBIs. Additionally, longer PBIs led to an enhanced memory recall response to tumor challenge, which correlated with differential expansion of T cell memory subsets. Our findings imply that when using alphavirus vector platforms as a vaccination strategy, a one-week PBI is sufficient to induce high magnitude effector T cells with potent anti-tumor activity. However, longer PBIs lead to enhanced long-term protective anti-tumor immunity. These findings have implications for therapeutic vaccine clinical trials in which shorter intervals of prime-boost regimens may lead to suboptimal durable immune responses.

We have found an infinite dimensional manifold of exact solutions of the Navier-Stokes loop equation for the Wilson loop in decaying Turbulence in arbitrary dimension $d >2$. This solution family is equivalent to a fractal curve in complex space $\mathbb C^d$ with random steps parametrized by $N$ Ising variables $\sigma_i=\pm 1$, in addition to a rational number $\frac{p}{q}$ and an integer winding number $r$, related by $\sum \sigma_i = q r$. This equivalence provides a \textbf{dual} theory describing a strong turbulent phase of the Navier-Stokes flow in $\mathbb R_d$ space as a random geometry in a different space, like ADS/CFT correspondence in gauge theory. From a mathematical point of view, this theory implements a stochastic solution of the unforced Navier-Stokes equations. For a theoretical physicist, this is a \textbf{quantum} statistical system with integer-valued parameters, satisfying some number theory constraints. Its long-range interaction leads to critical phenomena when its size $N \rightarrow \infty$ or its chemical potential $\mu \rightarrow 0$. The system with fixed $N$ has different asymptotics at odd and even $N\rightarrow \infty$, but the limit $\mu \rightarrow 0$ is well defined. The energy dissipation rate is analytically calculated as a function of $\mu$ using methods of number theory. It grows as $\nu/\mu^2$ in the continuum limit $\mu \rightarrow 0$, leading to anomalous dissipation at $\mu \propto \sqrt{\nu} \to 0$. The same method is used to compute all the local vorticity distribution, which has no continuum limit but is renormalizable in the sense that infinities can be absorbed into the redefinition of the parameters. The small perturbation of the fixed manifold satisfies the linear equation we solved in a general form. This perturbation decays as $t^{-\lambda}$, where the anomalous dimensions $\lambda$ satisfy the spectral equation \eqref{spectralEq}. The spectrum becomes a continuum in the statistical limit $N \to \infty$, presumably leading to multifractal phenomena.

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.

Sickle cell disease is characterized by stiff, “sickled” red blood cells that have difficulty moving through the bloodstream and do not efficiently carry oxygen. It is an inherited disease with severely limited treatment options, and is caused by a point mutation. Its prevalence in black and brown communities makes the already limited treatment options even less accessible. Base editing and prime editing are two relatively recent discoveries in the field of genome editing and were developed after the groundbreaking discovery of the CRISPR Cas9 system. While not fully tested, they hold a lot of promise in providing alternative treatment options for sickle cell disease. Both editing systems are able to install individual point mutations in the beta globin gene, which is where the sickle cell mutation occurs, and can thus cure sickle cell disease (in theory). In this paper we outline the mechanisms of CRISPR-Cas9 systems and base and prime editing, and provide insight into how to apply them to treat SCD. Further investigation should be done on specific editing systems and designs to use to ensure optimal treatment of SCD.

Conventional plant breeding methods exploit already existing genomic variation in plants to develop a variety in 8 to 10 years, which can decrease the genetic variability of the plant’s genome. The ever-increasing food demand for cereals crops cannot be met by traditional breeding methods. In order to increase food production in less time, there is a dire need to improve breeding methods. Several conventional and molecular breeding methods are being used to improve the crops traits. Molecular researchers have developed new genome editing tools like CRISPR/Cas9, CRISPR/Cpf1, prime editing, base editing, dcas9 epigenetic modification, and several other transgene-free genomes editing approaches. These genome editing tools can improve the desired traits precisely and efficiently. Moreover, a newly developed breeding method “Speed Breeding” has revolutionized the agriculture by shortening the crop cycle. It can produce 5-6 generations of cereals in a year. In this review, we have summarized all these conventional and molecular breeding approaches to improve cereal crops.

This study investigated live animal performance and carcass characteristics of Australian prime lambs fed oil based polyunsaturated fatty acid (PUFA) enriched pellets in a feedlot system. The tested hypothesis was that supplementation of lambs with a variety of dietary oil based PUFA enriched pellets would enhance growth and carcass characteristics compared with the control lambs on lucerne only. Seventy-two, 6 months old White Suffolk x Corriedale first-cross prime lambs with an average liveweight (LWT) of 35.7 ± 0.9 kg were allocated to six treatment groups in a completely randomised experimental design. The treatments were: (1) control: lucerne hay only; or lucerne hay plus wheat-based pellets infused with 50 ml/kg DM of oils from (2) rice bran (RBO); (3) canola (CO); (4) rumen protected (RPO); (5) flaxseed (FO) and (6) safflower (SO) dietary sources. All lambs had ad libitum access to lucerne hay and clean fresh water. Supplemented lambs were fed 1kg of pellet/head/day for 10 weeks. Feed intake, final LWT, average daily gain (ADG), body conformation and carcass characteristics of lambs in the supplemented groups were all greater than for the control group. SO lambs had the lowest ADG of 190.3 g/day. RBO and CO treatments had the lowest feed cost per unit gain of AU$ 3.0/kg. Supplemented lambs had similar over the hooks (OTH) incomes that were all higher than that of the control group. This empirical evidence-based data demonstrated that supplementation of lambs with RBO and CO had comparatively lower feed costs without compromising ADG, carcass characteristics and OTH income.

This Paper intends to introduce the notion of prime ideals of Intuitionistic fuzzy normed Rings and to establish basic properties related to it. It investigates these notions and shown anew Result using intuinistic fuzzy points and non membership function incorparating with t-norm and s-norm to show aome results of fuzzy prime ideal.

The RNA-guided endonuclease system CRISPR-Cas9 has been extensively modified since its discovery, allowing its capabilities to be extending far beyond double-stranded cleavage to high fidelity insertions, deletions, and single base edits. Such innovations have been possible due to the modular architecture of CRISPR-Cas9 and the robustness of its component parts to modifications and the fusion of new functional elements. Here, we review the broad toolkit of CRISPR-Cas9-based systems now available for diverse genome editing tasks. We provide an overview of their core molecular structure and mechanism and distil the design principles used to engineer their diverse functionalities. We end by looking beyond the biochemistry and towards the societal and ethical challenges that these CRISPR-Cas9 systems face if their transformative capabilities are to be deployed in a safe and acceptable manner.

Euler’s product formula over the primes and Euler’s zeta function equate to enshrine the Fundamental Theorem of Arithmetic that every integer > 1 is the product of a unique set of primes. The product formula has no zero, and with a domain ≤1 Euler’s zeta diverges. Dirichlet’s eta function η(s), negates alternate terms of zeta, permitting convergence when s∈C and Re(s) < 1, and its non-trivial zeros {ρ}, have a deep relationship with the distribution of the primes. The Riemann Hypothesis is that all the non-trivial zeros have Re(ρ) = 1/2. This work examines the symmetries in a partial Euler’s zeta series with a complex domain equating it to the difference between two finite vector series whose matched terms have mirror-image arguments, but whose magnitudes differ when Re(s) ≠ 1/2. Analytical continuation generates a modified eta series η_l(s), in which every l^th term is multiplied by (1-l). If the integer l is appropriately determined by the Im(s), similar paired finite vector series have a difference that closely follows η_l (s) and their terminal vectors intersect in a unique way permitting zeros only when Re(s) = 1/2. Furthermore, those vectors tracking the derivatives of the series, have a special relationship permitting zeros of the differential only when Re(s) > 1/2.

Statistical modeling of lifetime data plays an essential role in a wide range of practical fields, such as health and engineering. There have been a lot of studies done to develop statistical models that can better describe health data than traditional models. For the first time, we pioneer a novel family of continuous probability distributions called the generalized odd beta prime generalized (GOBP-G) family of distributions. The cumulative distribution and probability density functions of the new family are presented. A new generalization of the Weibull distribution called "generalized odd beta prime-Weibull" (GOBPW) is proposed using the pioneered GOBP-G family. The mixture representations of the new distribution are defined and derived. Some formal statistical properties of the GOBPW distribution, such as the moments, moment generating function, incomplete moments, information generating function, entropies, stress-strength function, quantile function, and order statistics, are derived. The estimation of the parameters of the proposed distribution is evaluated using the maximum likelihood estimation approach. Different cancer disease data sets, such as the bladder, head and neck, acute bone, and blood cancers, are used to illustrate the applicability and usefulness of the new model and were compared using several statistical accuracy measures with that of well-established extended Weibull distributions, which are the beta modified Weibull distribution, Kumaraswamy modified Weibull distribution, gamma generalized modified Weibull distribution, gamma log-logistic Weibull distribution, and beta log-logistic Weibull distribution. The results show that the proposed model gives better results than the competitive models. This study could guide the relevant stakeholders in choosing a suitable statistical model for the health data instead of relying on traditional models to enhance decision-making.