Results 1  10
of
12
The Carmichael Numbers up to 10^15
, 1992
"... There are 105212 Carmichael numbers up to 10 : we describe the calculations. ..."
Abstract

Cited by 18 (7 self)
 Add to MetaCart
There are 105212 Carmichael numbers up to 10 : we describe the calculations.
On the integrality of nth roots of generating functions
 J. COMBINATORIAL
, 2006
"... Motivated by the discovery that the eighth root of the theta series of the E8 lattice and the 24th root of the theta series of the Leech lattice both have integer coefficients, we investigate the question of when an arbitrary element f ∈ R (where R = 1 + xZ[[x]]) can be written as f = g n for g ∈ R, ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Motivated by the discovery that the eighth root of the theta series of the E8 lattice and the 24th root of the theta series of the Leech lattice both have integer coefficients, we investigate the question of when an arbitrary element f ∈ R (where R = 1 + xZ[[x]]) can be written as f = g n for g ∈ R, n ≥ 2. Let Pn: = {g n  g ∈ R} and let µn: = n ∏ pn p. We show among other things that (i) for f ∈ R, f ∈ Pn ⇔ f (mod µn) ∈ Pn, and (ii) if f ∈ Pn, there is a unique g ∈ Pn with coefficients mod µn/n such that f ≡ gn (mod µn). In particular, if f ≡ 1 (mod µn) then f ∈ Pn. The latter assertion implies that the theta series of any extremal even unimodular lattice in Rn (e.g. E8 in R8) is in Pn if n is of the form 2i3j5k (i ≥ 3). There do not seem to be any exact analogues for codes, although we show that the weight enumerator of the rth order ReedMuller code of length 2m is in P2r (and similarly that the theta series of the BarnesWall lattice BW2m is in P2m). We give a number of other results and conjectures, and establish a conjecture of Paul D. Hanna that there is a unique element f ∈ Pn (n ≥ 2) with coefficients restricted to the set {1, 2,..., n}.
Building Pseudoprimes With A Large Number Of Prime Factors
, 1995
"... We extend the method due originally to Loh and Niebuhr for the generation of Carmichael numbers with a large number of prime factors to other classes of pseudoprimes, such as Williams's pseudoprimes and elliptic pseudoprimes. We exhibit also some new Dickson pseudoprimes as well as superstrong Dicks ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We extend the method due originally to Loh and Niebuhr for the generation of Carmichael numbers with a large number of prime factors to other classes of pseudoprimes, such as Williams's pseudoprimes and elliptic pseudoprimes. We exhibit also some new Dickson pseudoprimes as well as superstrong Dickson pseudoprimes.
Notes on Primitive LambdaRoots
"... Euler's totient function f has the property that f(n) is the order of the group U(n) of units in Z n (the integers mod n). In the early years of the twentieth century, Carmichael defined a similar function l, where l(n) is the exponent of U(n). He called an element of U(n) with order l(n) a primi ..."
Abstract
 Add to MetaCart
Euler's totient function f has the property that f(n) is the order of the group U(n) of units in Z n (the integers mod n). In the early years of the twentieth century, Carmichael defined a similar function l, where l(n) is the exponent of U(n). He called an element of U(n) with order l(n) a primitive lroot of n.
ITERATED EXPONENTS IN NUMBER THEORY DANIEL B.
"... Dedicated to the memory of Prof. Arnold Ross ..."
1 The DiffieHellman Problem 1.1 The DiffieHellman Protocol
, 2009
"... This paper studies the mapping g x → g x2 (mod p) by showing that it inherits its structure from the mapping x → x 2 (mod ordp(g)). We first explore the context in which this mapping is important; specifically, we consider the DiffieHellman protocol, DiffieHellman problem, and the various problems ..."
Abstract
 Add to MetaCart
This paper studies the mapping g x → g x2 (mod p) by showing that it inherits its structure from the mapping x → x 2 (mod ordp(g)). We first explore the context in which this mapping is important; specifically, we consider the DiffieHellman protocol, DiffieHellman problem, and the various problems that have spawned from these including the discrete logarithm and square exponent problems. We then demonstrate that we may infer the structure of g x → g x2 (mod p) from x → x 2 (mod ordp(g)) and translate some results proved by Somer and Kroger about the latter to the former case.
Compositions with the Euler and Carmichael Functions
"... Abstract. Let ϕ and λ be the Euler and Carmichael functions, respectively. In this paper, we establish lower and upper bounds for the number of positive integers n ≤ x such that ϕ(λ(n)) = λ(ϕ(n)). We also study the normal order of the function ϕ(λ(n))/λ(ϕ(n)). 1 ..."
Abstract
 Add to MetaCart
Abstract. Let ϕ and λ be the Euler and Carmichael functions, respectively. In this paper, we establish lower and upper bounds for the number of positive integers n ≤ x such that ϕ(λ(n)) = λ(ϕ(n)). We also study the normal order of the function ϕ(λ(n))/λ(ϕ(n)). 1
unknown title
, 711
"... Abstract. Bounds and other relations involving variables connected with Carmichael numbers are reviewed and extended. Families of numbers or individual numbers attaining or approaching these bounds are given. A new algorithm for finding threeprime Carmichael numbers is described, with its implement ..."
Abstract
 Add to MetaCart
Abstract. Bounds and other relations involving variables connected with Carmichael numbers are reviewed and extended. Families of numbers or individual numbers attaining or approaching these bounds are given. A new algorithm for finding threeprime Carmichael numbers is described, with its implementation up to 10 24. Statistics relevant to the distribution of threeprime Carmichael numbers are given, with particular reference to the conjecture of Granville and Pomerance in [10]. 1.
unknown title
, 711
"... Abstract. Bounds and other relations involving variables connected with Carmichael numbers are reviewed and extended. Families of numbers or individual numbers attaining or approaching these bounds are given. A new algorithm for finding threeprime Carmichael numbers is described, with its implement ..."
Abstract
 Add to MetaCart
Abstract. Bounds and other relations involving variables connected with Carmichael numbers are reviewed and extended. Families of numbers or individual numbers attaining or approaching these bounds are given. A new algorithm for finding threeprime Carmichael numbers is described, with its implementation up to 10 24. Statistics relevant to the distribution of threeprime Carmichael numbers are given, with particular reference to the conjecture of Granville and Pomerance in [10]. 1.