Efficient Simple Tests For Primality
Journal Title: JOURNAL OF ADVANCES IN MATHEMATICS - Year 2014, Vol 9, Issue 5
Abstract
The tests form a general method to decide whether a given positive odd integer is composite or prime. The tests are based on the divisibility properties of the sum of two squared positive integers. The algorithms comprising the tests are polynomial- time algorithms.
Authors and Affiliations
Fayez Fok Al Adeh
Keywords
Related Articles
- EP ID EP651336
- DOI 10.24297/jam.v9i5.2337
- Views 178
- Downloads 0
Single-Layer Raster CNN simulator using RK-Gill
An efficient numerical integration algorithm for single layer Raster Cellular Neural Networks (CNN) simulator is presented in this paper. The simulator is capable of performing CNN simulations for any size of input image...
Splitting Decomposition Homotopy Perturbation Method To Solve One -Dimensional Navier -Stokes Equation
We have proposed in this research a new scheme to find analytical approximating solutions for Navier-Stokes equation of one dimension. The new methodology depends on combining &n...
Schwarschild metric in six dimensions - a topological study
In this article we introduce some types of the deformtion retracts of the 6D Schwarzchild making use of Lagrangian equations. The retraction of this space into itself and into geodesics has been presented. The relation b...
On the Calculation of Eigenvalues and Eigenvectors of Matrix Polynomials and Orthogonality Relations between their Eigenvectors
In the paper, the computation of the eigenvalues and eigenvectors of polynomial eigenvalue problem via standard eigenvalue problems is presented. We also establish orthogonality relations between the eigenvectors of matr...
Stability of Fibonacci Functional Equation
In this paper, we solve the Fibonacci functional equation, f(x)=f(x-1)+f(x-2) and discuss its generalized Hyers-Ulam-Rassias stability in Banach spaces and stability in Fuzzy normed space.