Lucas's criterion for the primality of numbers of the form N = h2n−1
✍ Scribed by S. B. Stechkin
- Publisher
- SP MAIK Nauka/Interperiodica
- Year
- 1971
- Tongue
- English
- Weight
- 294 KB
- Volume
- 10
- Category
- Article
- ISSN
- 0001-4346
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Zeilberger, D., A proof of Julian West's conjecture that the number of two-stack-sortable permutations of length n is 2(3n)!/((n + 1)!(2n + l)!), Discrete Mathematics 102 (1992) 85-93. The Polya-Schutzenberger-Tutte methodology of weight enumeration, combined with about 10 hours of CPU time (of Map
In this paper we prove that the set of positive odd integers k such that k&2 n has at least three distinct prime factors for all positive integers n contains an infinite arithmetic progression. The same result corresponding to k2 n +1 is also true.
The complexes [Ag(g 2 -N 6 S) 2 ](PF 6 ), N 6 S = 1methyl-2-(methylthiomethyl)-1H-benzimidazole, mmb (complex 1) or 1-methyl-2-(tert-butylthiomethyl)-1H-benzimidazole, mtb (complex 2), and [Ag(l,g 2 -mmb)(l,g 2 -O 2 PF 2 )] (complex 3) were synthesized and characterized by X-ray crystallography. Lon
In this article, we will determine the crossing number of the complete tripartite graphs K,.3.n and K2,3.n. Our proof depends on Kleitman's results for the complete bipartite graphs [D. J. Kleitman, The crossing number of K5,n. J. Combhatorial Theory 9 (1970) 375-3231. a graph G is the minimum numbe