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 168
- Downloads 0
Partial Orders in BCL+-Algebra
In this paper, we introduce a partially ordered BCL+-algebra, and we show that some of its fundamental properties.
An elastic plate with a curvilinear hole and flowing heat in S-plane
In the present paper, we apply complex variable method, Cauchy method, to derive exact expressions for Goursat functions for the boundary value problems of an infinite elastic plate weakened by a curvilinear hole....
For some boundary Value Problems in Distributions
In this paper we give a result concerning convergent sequences of functions that give convergent sequence of distributions in and find the analytic representation of the distribution obtained by their boundary valu...
Using Particle Swarm Optimization to Determine the Optimal Strata Boundaries
Stratified random sampling is a commonly used sampling methodology especially for heterogeneous populations with outliers. Stratified sampling is preferably employed due to its capability of improving statistical precisi...
Evaluation of Toyserkan City Water Contamination, due to the existence of Radon, and Estimation of the annual effective dose
The gas of 222 Rn is one of the natural radioactivesources which is the decay product of 226 Ra from 238U decay chain. Based on the latest information presented bythe United Nations Scientif...