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.
