Skip to main content

LUP Student Papers

LUND UNIVERSITY LIBRARIES

Comparing characterizations of Carmichael numbers for computation

Johansson, Simon LU (2022) In Bachelor's Theses in Mathematical Sciences FMAL01 20221
Mathematics (Faculty of Engineering)
Abstract
This paper examines the properties of Carmichael numbers with the aim of constructing an algorithm for computation. This includes a recently published characterization, whose applications in computing are studied. The resulting algorithm is then described and a run time comparison with an older algorithm is presented.
Popular Abstract
Carmichael numbers are composite numbers that appear as "false positives" in certain primality tests. My work examines the modern understanding of these numbers to construct an efficient computation algorithm.
Please use this url to cite or link to this publication:
author
Johansson, Simon LU
supervisor
organization
course
FMAL01 20221
year
type
M2 - Bachelor Degree
subject
keywords
Carmichael numbers, algorithm, characterization, primality testing
publication/series
Bachelor's Theses in Mathematical Sciences
report number
LUTFMA-4009-2022
ISSN
1654-6229
other publication id
2022:K11
language
English
id
9095315
date added to LUP
2022-09-29 15:57:20
date last changed
2022-09-29 15:57:20
@misc{9095315,
  abstract     = {{This paper examines the properties of Carmichael numbers with the aim of constructing an algorithm for computation. This includes a recently published characterization, whose applications in computing are studied. The resulting algorithm is then described and a run time comparison with an older algorithm is presented.}},
  author       = {{Johansson, Simon}},
  issn         = {{1654-6229}},
  language     = {{eng}},
  note         = {{Student Paper}},
  series       = {{Bachelor's Theses in Mathematical Sciences}},
  title        = {{Comparing characterizations of Carmichael numbers for computation}},
  year         = {{2022}},
}