𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A necessary and sufficient condition for primality, and its source

✍ Scribed by Henry B Mann; Daniel Shanks

Publisher
Elsevier Science
Year
1972
Tongue
English
Weight
151 KB
Volume
13
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A necessary and sufficient condition for
A necessary and sufficient condition for a Bedrosian identity
✍ P. Cerejeiras; Q. Chen; U. KΓ€hler πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 127 KB πŸ‘ 1 views

## Abstract We present a sufficient and necessary condition for the Bedrosian identity to hold for a large class of mono‐components based on a generalized Sinc‐function. Copyright Β© 2009 John Wiley & Sons, Ltd.

A necessary and sufficient condition for
A necessary and sufficient condition for the nirenberg problem
✍ Wenxiong Chen; Congming Li πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 493 KB πŸ‘ 1 views

We seek metrics conformal to the standard ones on S" having prescribed Gaussian curvature in case n = 2 (the Nirenberg Problem), or prescribed scalar curvature for n t 3 (the Kazdan-Warner problem). There are well-known Kazdan-Warner and Bourguignon-Ezin necessary conditions for a function R(x) to b

A Necessary and Sufficient Condition for
A Necessary and Sufficient Condition for Deadlock-Free Wormhole Routing
✍ Loren Schwiebert; D.N. Jayasimha πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 341 KB

An important open problem in wormhole routing has been to find a necessary and sufficient condition for deadlock-free adaptive routing. Recently, Duato has solved this problem for a restricted class of adaptive routing algorithms. In this paper, a necessary and sufficient condition is proposed that

Sufficient and Necessary Condition for t
Sufficient and Necessary Condition for the Completeness of a Calculus
✍ H. AndrΓ©ka; T. Gergely; I. NΓ©meti πŸ“‚ Article πŸ“… 1974 πŸ› John Wiley and Sons 🌐 English βš– 140 KB πŸ‘ 1 views

I n this study we reformulate GODEL'S completeness theorem such that any firstorder calculus can be tested for completeness. The theorem in this form gives simple sufficient and necessary algebraic conditions for the calculus to be complete.