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 169
- Downloads 0
Incompressibility and Existence of Navier- Stokes Equations
In this paper, we represents incompressible Navier-Stokes equations, i.e. fluid is incompressible in the domain . Navier-Stokes equations have wide applications in fluid mechanics, air and sea navigation. Mathematicians...
Ideal and some applications of simply open sets
Recently there has been some interest in the notion of a locally closed subset of a topo- logical space. In this paper, we introduce a useful characterizations of simply open sets in terms of the ideal of nowhere dense s...
ALGEBRAIC PROOFS FERMAT'S LAST THEOREM, BEAL'S CONJECTURE
In this paper, the following statememt of Fermat's Last Theorem is proved. If x; y; z are positive integers, _ is an odd prime and z_ = x_ + y_; then x; y; z are all even. Also, in this paper, is proved Beal's conjecture...
The Asymptotic Behavior of Solutions of Second order Difference Equations With Damping Term
The author presents some sufficient conditions for second order difference equation with damping term of the form  ...
A multinomial logistic regression model for text in Albanian language
In this paper we present a multinomial logistic regression model for authorship identification in the Albanian language texts. In the model fitted the dependent variable is categorical which takes different values from 1...