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 153
- Downloads 0
Regional Boundary Strategic Sensors Characterizations
This paper, deals with the linear infinite dimensional distributed parameter systems in a Hilbert space where the dynamics of system is governed by strongly continuous semi-groups. More precisely, for parabolic distribut...
Exact Solution of a Linear Difference Equation in a Finite Number of Steps
An exact solution of a linear difference equation in a finite number of steps has been obtained. This refutes the conventional wisdom that a simple iterative method for solving a system of linear algebraic equations is a...
Dynamics of certain anti-competitive systems of rational difference equations in the plane
In this paper, we consider a system of rational difference equations and we will prove that the unique positive equilibrium point of this system is globally asymptotically stable. We also determine the rate of convergenc...
On the Mixed Dirichlet--Farwig biharmonic problem in exterior domains
We study the properties of generalized solutions in unbounded domains and the asymptotic behavior of solutions of elliptic boundary value problems at infinity. Moreover, we study the unique solvability of the mixed Diric...
On Rough Covexsity Sets
In this paper, we introduced new concepts for surely and possibly , start shaped (convex ) set. Also for rough start shaped ( rough convex) set .We established the neccessary and sufficient conditions for a set to be sta...