Engineering and Applied Science Letters (EASL)

Prime numbers and their variations are extremely useful in applied research areas such as cryptography, feedback and control in engineering. In this paper we discuss about prime numbers, perfect numbers, even perfect and odd perfect numbers, amicable numbers, semiprimes, mersenne prime numbers, triangular numbers, distribution of primes, relation between \(\pi\) and prime numbers. In the process we also obtain interesting properties of some of them and raise a set of open problems for further exploration.

In this paper, a block linear multistep method (LMM) with step number 4 \((k = 4)\) through collocation and interpolation techniques using probabilists Hermite polynomial as basis function which produces a family of block scheme with maximum order five has been proposed for the numerical solution of stiff problems in ODEs. The method is found to be consistent, convergent, and zero stable.The accuracy of the method is tested with two stiff first order initial value problems. The results are compared with fourth order Runge Kutta (RK4) method and a block LMM developed by Berhan et al. [1]. All numerical examples are solved with the aid of MATLAB software after the schemes are developed using MAPLE software.

Researches were investigated from January to March, \(2020\), searching for empirical evidences and theoretical approaches at that time to determine a mathematical modeling for COVID-\(19\) transmission for individual/community infection. It was found that despite traditional forms of transmission of the virus SARS-COV-\(2\) through SIR model equations early detected on \(2020\), empirical evidences suggested the use of more dynamic mathematical modeling aspects for this equation in order to estimate the disease spreading patterns. The SIR equation modeling limitations were found as far as common epidemic preventive methods did not explain effectively the spreading patterns of disease transmission due to the virus association with the human emergent behavior in a complex network model.

In this paper we present an algorithm for finding a minimum dominator coloring of orientations of paths. To date this is the first algorithm for dominator colorings of digraphs in any capacity. We prove that the algorithm always provides a minimum dominator coloring of an oriented path and show that it runs in \(\mathcal{O}(n)\) time. The algorithm is available at https://github.com/cat-astrophic/MDC-orientations_of_paths/.

In this paper, Variation of Parameters Method (VPM) is used to find the analytical solutions of non-linear fractional order quadratic Riccati differential equation. The given method is applied to initial value problems of the fractional order Riccati differential equations. The proposed technique has no discretization, linearization, perturbation, transformation, preventive suspicions and it is also free from Adomian,s polynomials. The obtained results are compare with analytical solutions by graphical and tabular form.

The purpose of this paper is introduce the notion of intuitionistic fuzzy subgroups with respect to norms (\(t\)-norm \(T\) and \(s\)-norm \(S\)). Also we introduce intersection and normality of them and investigate some properties of them. Finally, we provide some results of them under group homomorphisms

In this paper, we establish several integral inequalities including Caputo fractional derivatives for exponential \((s,m)\)-convex functions. By using convexity for exponential \((s,m)\)-convex functions of any positive integer order differentiable function some novel results are obtained.

The main problems with several existing Information and Communication Technology (ICT) power footprint investigations are: too limited (geographical and temporal) system boundary, overestimation of power saving potential in the next decade, assume that historical power use can predict future global power use in the next decade despite unprecedented data traffic growth, assume that Moore´s law relation to digital circuitry can continue “forever” and that no problems with extra cooling power will occur for several decades. The highly variable outlooks for the future power consumptions depend on “starting values”, disruptions, regional differences and perceptual estimations of electricity intensity reductions and data traffic increase. A hugely optimistic scenario – which takes into account 20% annual improvement of the J/bit in data centers and networks until 2030 is presented. However, the electric power consumption of the present ICT scope will be significant unless great efforts are put into power saving features enabling such improvements of J/bit. Despite evident risks, it seems though that planned power saving measures and innovation will be able to keep the electricity consumption of ICT and the World under some kind of control. The major conclusion is based on several simulations in the present study – that future consumer ICT infrastructure cannot slow its overall electricity use until 2030 and it will use more than today. Data traffic may not be the best proxy metric for estimating computing electricity. Operations and J/operation seem more promising for forecasting and scaling of bottom-up models.

The aim of this paper is to establish some new fractional Hadamard and Fejér-Hadamard inequalities for exponentially \((h,m)\)-convex functions. These inequalities are produced by using the generalized fractional integral operators containing Mittag-Leffler function via a monotonically increasing function. The presented results hold for various kinds of convexities and well known fractional integral operators.

Topological indices are numerical parameters of a graph which characterize its topology. The second degree of a vertex in a graph is equal to the number of its second neighbors. In this paper, we will compute leap Zagreb indices and leap hyper-Zagreb indices of Jahangir graph and its line graph based on the 2-distance degree of the vertices. Moreover we will compute the same indices for the subdivision graph and the line graph of the subdivision of Jahangir graph.