A universal algorithm to generate pseudo-random numbers based on uniform mapping as homeomorphism

A specific uniform map is constructed as a homeomorphism mapping chaotic time series into [0,1] to obtain sequences of standard uniform distribution. With the uniform map, a chaotic orbit and a sequence orbit obtained are topologically equivalent to each other so the map can preserve the most dynamic properties of chaotic systems such as permutation entropy. Based on the uniform map, a universal algorithm to generate pseudo random numbers is proposed and the pseudo random series is tested to follow the standard 0-1 random distribution both theoretically and experimentally. The algorithm is not complex, which does not impose high requirement on computer hard ware and thus computation speed is fast. The method not only extends the parameter spaces but also avoids the drawback of small function space caused by constraints on chaotic maps used to generate pseudo random numbers. The algorithm can be applied to any chaotic system and can produce pseudo random sequence of high quality, thus can be a good universal pseudo random number generator.

Analysis of pseudo-random number generators in QMC-SSE method

In the quantum Monte Carlo(QMC)method,the pseudo-random number generator(PRNG)plays a crucial role in determining the computation time.However,the hidden structure of the PRNG may lead to serious issues such as the breakdown of the Markov process.Here,we systematically analyze the performance of different PRNGs on the widely used QMC method known as the stochastic series expansion(SSE)algorithm.To quantitatively compare them,we introduce a quantity called QMC efficiency that can effectively reflect the efficiency of the algorithms.After testing several representative observables of the Heisenberg model in one and two dimensions,we recommend the linear congruential generator as the best choice of PRNG.Our work not only helps improve the performance of the SSE method but also sheds light on the other Markov-chain-based numerical algorithms.

Origin of Sexy Prime Numbers, Origin of Cousin Prime Numbers, Equations from Supposedly Prime Numbers, Origin of the Mersenne Number, Origin of the Fermat Number

We have found through calculations that the differences between the closest supposed prime numbers other than 2 and 3 defined in the articles are: 2;4: and 6. For those whose difference is equal to 6, we showed their origin then we classified them into two categories according to their classes, we showed in which context two prime numbers which differ from 6 are called sexy and in what context they are said real sexy prime. For those whose difference is equal to 4, we showed their origin then we showed that two prime numbers which differ from 4, that is to say two cousin prime numbers, are successive. We made an observation on the supposed prime numbers then we established two pairs of equations from this observation and deduced the origin of the Mersenne number and that of the Fermat number.

Preliminary Identification of a Prime Number Other Than 2 and 3, the Origin of Twin Prime Numbers, the Structure of the Chain of Prime Numbers and the Set of Prime Numbers Less Than a Given Integer

The application of the Euclidean division theorem for the positive integers allowed us to establish a set which contains all the prime numbers and this set we called it set of supposedly prime numbers and we noted it Esp. We subsequently established from the previous set the set of non-prime numbers (the set of numbers belonging to this set and which are not prime) denoted Enp. We then extracted from the set of supposedly prime numbers the numbers which are not prime and the set of remaining number constitutes the set of prime numbers denoted Ep. We have deduced from the previous set, the set of prime numbers between two natural numbers. We have explained during our demonstrations the origin of the twin prime numbers and the structure of the chain of prime numbers.

How Prime Numbers Are Interconnected and Built with Two Equations: Addition and Subtraction Rules the Function (6µ)

Are all prime numbers linked by four simple functions? Can we predict when a prime will appear in a sequence of primes? If we classify primes into two groups, Group 1 for all primes that appear before ζ (such that , for instance 5, ), an even number divisible by 3 and 2, and Group 2 for all primes that are after ζ (such that , for instance 7), then we find a simple function: for each prime in each group, , where n is any natural number. If we start a sequence of primes with 5 for Group 1 and 7 for Group 2, we can attribute a μ value for each prime. The μ value can be attributed to every prime greater than 7. Thus for Group 1, and . Using this formula, all the primes appear for , where μ is any natural number.

On Perron’s Formula and the Prime Numbers

The Riemann hypothesis is intimately connected to the counting functions for the primes. In particular, Perron’s explicit formula relates the prime counting function to fixed points of iterations of the explicit formula with particular relations involving the trivial and non-trivial roots of the Riemann Zeta function and the Primes. The aim of the paper is to demonstrate this relation at the fixed points of iterations of explicit formula, defined by functions of the form limT∈Ν→∞fT(zw)=zw,where, zwis a real number.

Complex Decision Modeling Framework with Fairly Operators and Quaternion Numbers under Intuitionistic Fuzzy Rough Context

The main goal of informal computing is to overcome the limitations of hypersensitivity to defects and uncertainty while maintaining a balance between high accuracy,accessibility,and cost-effectiveness.This paper investigates the potential applications of intuitionistic fuzzy sets(IFS)with rough sets in the context of sparse data.When it comes to capture uncertain information emanating fromboth upper and lower approximations,these intuitionistic fuzzy rough numbers(IFRNs)are superior to intuitionistic fuzzy sets and pythagorean fuzzy sets,respectively.We use rough sets in conjunction with IFSs to develop several fairly aggregation operators and analyze their underlying properties.We present numerous impartial laws that incorporate the idea of proportionate dispersion in order to ensure that the membership and non-membership activities of IFRNs are treated equally within these principles.These operations lead to the development of the intuitionistic fuzzy rough weighted fairly aggregation operator(IFRWFA)and intuitionistic fuzzy rough ordered weighted fairly aggregation operator(IFRFOWA).These operators successfully adjust to membership and non-membership categories with fairness and subtlety.We highlight the unique qualities of these suggested aggregation operators and investigate their use in the multiattribute decision-making field.We use the intuitionistic fuzzy rough environment’s architecture to create a novel strategy in situation involving several decision-makers and non-weighted data.Additionally,we developed a novel technique by combining the IFSs with quaternion numbers.We establish a unique connection between alternatives and qualities by using intuitionistic fuzzy quaternion numbers(IFQNs).With the help of this framework,we can simulate uncertainty in real-world situations and address a number of decision-making problems.Using the examples we have released,we offer a sophisticated and systematically constructed illustrative scenario that is intricately woven with the complexity ofmedical evaluation in order to thoroughly assess the relevance and efficacy of the suggested methodology.

Three- and Four-Dimensional Generalized Pythagorean Numbers

The Pythagorean triples (a, b | c) of planar geometry which satisfy the equation a2+b2=c2 with integers (a, b, c) are generalized to 3D-Pythagorean quadruples (a, b, c | d) of spatial geometry which satisfy the equation a2+b2+c2=d2 with integers (a, b, c, d). Rules for a parametrization of the numbers (a, b, c, d) are derived and a list of all possible nonequivalent cases without common divisors up to d2 is established. The 3D-Pythagorean quadruples are then generalized to 4D-Pythagorean quintuples (a, b, c, d | e) which satisfy the equation a2+b2+c2+d2=e2 and a parametrization is derived. Relations to the 4-square identity are discussed which leads also to the N-dimensional case. The initial 3D- and 4D-Pythagorean numbers are explicitly calculated up to d2, respectively, e2.

Distribution and Relation of Primes with Tesla Numbers 3, 6, and 9

This work presents a different approach to twin primes, an approach from the perspective of the Tesla numbers and gives a refresh and new observation of twin primes that could lead us to an answer to the Twin Prime Conjecture problem. We expose a peculiar relation between twin primes and the generation of prime numbers with Tesla numbers. Tesla numbers seem to be present in so many domains like time, vibration and frequency [1], and the space between twin primes is not the exception. Let us say that twin primes are more than just prime numbers plus 2 or minus 2, and Tesla numbers are more involved with twin primes than we think, and hopefully, this approach give us a better understanding of the distribution of the twin pairs.

Identities on q-Harmonic Numbers

With the help of the classical Abel’s lemma on summation by parts and algorithm of q-hypergeometric summations, we deal with the summation, which can be written as multiplication of a q-hypergeometric term and q-harmonic numbers. This enables us to construct and prove identities on q-harmonic numbers. Several examples are also given.

On the Expression of Composite Natural Numbers as Tensorial Products of Prime Natural Powers Vectors

This study describes how one can construct sets of composite natural numbers as tensorial products of the vectors created with the natural powers of prime numbers.

Collatz Conjecture Redefinition on Prime Numbers

The definition of Collatz Operator, the mathematical avatar of the Collatz Algorithm, permits the transformation of the Collatz conjecture, which is delineated over the whole natural number set, into an equivalent inference restricted to the odd prime number set only. Based on this redefinition, one can describe an empirical-heuristic proof of the Collatz conjecture.

On Prime Numbers between kn and (k + 1) n

In this paper along with the previous studies on analyzing the binomial coefficients, we will complete the proof of a theorem. The theorem states that for two positive integers n and k, when n ≥ k - 1, there always exists at least a prime number p such that kn p ≤ (k +1)n. The Bertrand-Chebyshev’s theorem is a special case of this theorem when k = 1. In the field of prime number distribution, just as the prime number theorem provides the approximate number of prime numbers relative to natural numbers, while the new theory indicates that prime numbers exist in the specific intervals between natural numbers, that is, the new theorem provides the approximate positions of prime numbers among natural numbers.

Genome-wide association study for numbers of vertebrae in Dezhou donkey population reveals new candidate genes

Numbers of vertebrae is an important economic trait associated with body size and meat productivity in animals.However,the genetic basis of vertebrae number in donkey remains to be well understood.The aim of this study was to identify candidate genes affecting the number of thoracic(TVn)and the number of lumbar vertebrae(LVn)in Dezhou donkey.A genome-wide association study was conducted using whole genome sequence data imputed from low-coverage genome sequencing.For TVn,we identified 38 genome-wide significant and 64 suggestive SNPs,which relate to 7 genes(NLGN1,DCC,SLC26A7,TOX,WNT7A,LOC123286078,and LOC123280142).For LVn,we identified 9 genome-wide significant and 38 suggestive SNPs,which relate to 8 genes(GABBR2,FBXO4,LOC123277146,LOC123277359,BMP7,B3GAT1,EML2,and LRP5).The genes involve in the Wnt and TGF-βsignaling pathways and may play an important role in embryonic development or bone formation and could be good candidate genes for TVn and LVn.

Numerical Analysis of Cavity-Based Control of Base Pressure Variations at Supersonic Mach Numbers

In the present study,the base pressure variations induced by the presence of a cavity,known to have a strong influence of the behaviour of supersonic projectiles,are investigated through numerical solution of the balance equations for mass,momentum,and energy.An area ratio of four is considered and numerical simulations are carried out at Mach M=1.2,1.4,1.6,and 1.8 assuming no cavity or cavity locations 0.5D,1D,1.5D,and 2D.The inlet pressure of the nozzle is considered as a flow variable.The Taguchi method is also used,and the considered cases are then analyzed using a full factorial experimental design.The results show that the cavity is effective in increasing the base pressure for the conditions examined.For other nozzle pressure ratios,cavities do not lead to passive control due the change in the reattachment length.The distribution of wall pressure reveals that,in general,a cavity used to implement passive control of the base pressure does not adversely influence the flow pattern in the domain.

Products of Odd Numbers or Prime Number Can Generate the Three Members’ Families of Fermat Last Theorem and the Theorem Is Valid for Summation of Squares of More Than Two Natural Numbers

Fermat’s last theorem, had the statement that there are no natural numbers A, B, and C such that An + Bn = Cn, in which n is a natural number greater than 2. We have shown that any product of two odd numbers can generate Fermat or Pythagoras triple (A, B, C) following n = 2 and also it is applicable A2 + B2 + C2 + D2 + so on =An2 where all are natural numbers.

OPTIMAL BIRKHOFF INTERPOLATION AND BIRKHOFF NUMBERS IN SOME FUNCTION SPACES

This paper investigates the optimal Birkhoff interpolation and Birkhoff numbers of some function spaces in space L∞[-1,1]and weighted spaces Lp,ω[-1,1],1≤p<∞,with w being a continuous integrable weight function in(-1,1).We proved that the Lagrange interpolation algorithms based on the zeros of some polynomials are optimal.We also show that the Lagrange interpolation algorithms based on the zeros of some polynomials are optimal when the function values of the two endpoints are included in the interpolation systems.

The Infinity Tree: Representing Infinities of Real Numbers with Countably Infinite Tree Structures

This paper discusses how the infinite set of real numbers between 0 and 1 could be represented by a countably infinite tree structure which would avoid Cantor’s diagonalization argument that the set of real numbers is not countably infinite. Likewise, countably infinite tree structures could represent all real numbers, and all points in any number of dimensions in multi-dimensional spaces. The objective of this paper is not to overturn previous research based on Cantor’s argument, but to suggest that this situation may be treated as a definitional or axiomatic choice. This paper proposes a “non-Cantorian” branch of cardinality theory, representing all these infinities with countably infinite tree structures. This approach would be consistent with the Continuum Hypothesis.

Collatz Iterative Trajectories of All Odd Numbers Attain Bounded Values

The aim of this paper is to study the 3x + 1 problem based on the Collatz iterative formula. It can be seen from the iterative formula that the necessary condition for the Collatz iteration convergence is that its slope being less than 1. An odd number N that satisfies the condition of a slope less than 1 after nth Collatz iterations is defined as an n-step odd number. Through statistical analysis, it is found that after nth Collatz iterations, the iterative value of any n-step odd number N that is greater than 1 is less than N, which proves that the slope less than 1 is a sufficient and necessary condition for Collatz iteration convergence.

Failure Mode and Effects Analysis Based on Z-Numbers and the Graded Mean Integration Representation

Failuremode and effects analysis(FMEA)is a widely used safety assessmentmethod inmany fields.Z-number was previously applied in FMEA since it can take both possibility and reliability of information into consideration.However,the use of fuzzy weighted mean to integrate Z-valuations may have some drawbacks and is not suitable for some situations.In this paper,an improved method is proposed based on Z-numbers and the graded mean integration representation(GMIR)to deal with the uncertain information in FMEA.First,Z-numbers are constructed based on the evaluations of risk factors O,S,D for each failure mode by different experts.Second,weights of the three risk factors and experts are determined.Third,the integration representations of Z-numbers are obtained by a newmethod based on the GMIRmethod.Finally,risk priorities of the failure modes are derived considering the weights of experts and risk factors.Two examples and a case study are given to show the use of the proposed method and comparison with other methods.The results show that the proposed method is more reasonable,universal and simple in calculation.