scientific article
From MaRDI portal
Publication:3100152
zbMath1278.11003MaRDI QIDQ3100152
François G. Dorais, Dominic Klyve
Publication date: 22 November 2011
Full work available at URL: http://www.emis.de/journals/JIS/VOL14/Klyve/klyve3.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wieferich primewheel sieveFibonacci-Wieferich primemagic sieveMontgomery arithmeticWall-Sun-Sun prime
Number-theoretic algorithms; complexity (11Y16) Software, source code, etc. for problems pertaining to number theory (11-04) Primes (11A41) Primality (11Y11)
Related Items (22)
The estimate of the linear complexity of generalized cyclotomic binary and quaternary sequences with periods \(p^n\) and \(2p^n\) ⋮ Lucas sequences and quadratic orders ⋮ Optimal equi-difference conflict-avoiding codes of odd length and weight three ⋮ New generalized cyclotomic binary sequences of period \(p^2\) ⋮ Strong pseudoprimes to the first eight prime bases ⋮ A search for primes 𝑝 such that the Euler number 𝐸_{𝑝-3} is divisible by 𝑝 ⋮ Nonexistence of two classes of generalized bent functions ⋮ The linear complexity of generalized cyclotomic binary sequences of period \(p^n\) ⋮ Strong pseudoprimes to twelve prime bases ⋮ Unnamed Item ⋮ On Wieferich and non-Wieferich primes with prime bases ⋮ Extremal values for the sum \(\sum^\tau_{r=1} e(a2^r/q)\) ⋮ Fibonacci numbers and real quadratic \(p\)-rational fields ⋮ A new series of optimal tight conflict-avoiding codes of weight 3 ⋮ Optimal conflict-avoiding codes of odd length and weight three ⋮ Divisibility and Arithmetic Properties of a Class of Sparse Polynomials ⋮ A further study of the linear complexity of new binary cyclotomic sequence of length \(p^r\) ⋮ Unnamed Item ⋮ Irregular primes with respect to Genocchi numbers and Artin's primitive root conjecture ⋮ Complexities of self-dual normal bases ⋮ Indices of subfields of cyclotomic Zp-extensions and higher degree Fermat quotients ⋮ Infinitely Many Twin Prime Polynomials of Odd Degree
Uses Software
This page was built for publication:
