Abstract
We begin with a limited number of mathematical notions that a student should know before beginning with this text. This chapter is short because we assume some earlier study of data structures and discrete mathematics.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
As is customary, we write ab instead of writing a â‹…b.
- 2.
That is, we show for each integer a ∈ { 1, …, p − 1} that there exists an integer x such that ax ≡ 1​\kern 18mu ({\rm mod}\ p).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2011 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Homer, S., Selman, A.L. (2011). Preliminaries. In: Computability and Complexity Theory. Texts in Computer Science. Springer, Boston, MA. https://doi.org/10.1007/978-1-4614-0682-2_1
Download citation
DOI: https://doi.org/10.1007/978-1-4614-0682-2_1
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4614-0681-5
Online ISBN: 978-1-4614-0682-2
eBook Packages: Computer ScienceComputer Science (R0)