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 170
- Downloads 0
Leibnizs rule and Fubinis theorem associated with Hahn difference operators
In $1945$, Wolfgang Hahn introduced his difference operator $D_{q,\omega}$, which is defined by where $\displaystyle{\omega_0=\frac {\omega}{1-q}}$ with $0<q<1, \omega>0.$ In this paper, we establish Leibniz's r...
New Oscillation Criteria for Second Order Neutral Type Dierence Equations
In this paper, we present some new oscillation criteria for second order neutral type dierence equation of the form (an(zn)) + qnf(xn) = en; n n0 > 0; where zn = xn ô€€€pnxnô€€€l and is ratio of odd positive integer...
The q-Exponential Operator and Generalized Rogers-Szego Polynomials
This paper is mainly concerned with using q-exponential operator T(bDq) in proving the identities that involve the generalized Rogers-Szego polynomials rn(x,b) . We introduce some new roles of the q -exponenti...
Direct Rotation b - Numbers
For any partition u = (u1, u2, . . ., un) of a non - negative integer number r there exist a diagram (A) of b- numbers for each e where e is a a positive integer number greater than or equal to two...
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...