Relatively Prime

Kaliski, Burt

doi:10.1007/978-1-4419-5906-5_430

Burt Kaliski Dr.³

73 Accesses

Synonyms

Coprime

Related Concepts

Greatest Common Divisor; Prime Number

Definition

Two integers n and x are relatively prime if they have no common integer factors other than +1 and −1, i.e., their greatest common divisor is 1.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Chapter: USD 29.95; Price excludes VAT (USA)

eBook: USD 799.99; Price excludes VAT (USA)

Hardcover Book: USD 949.99; Price excludes VAT (USA)

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Author information

Authors and Affiliations

Office of the CTO, EMC Corporation, 176 South Street, 01748, Hopkinton, MA, USA
Burt Kaliski Dr. (Jr.)

Authors

Burt Kaliski Dr.
View author publications
You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

Department of Mathematics and Computing Science, Eindhoven University of Technology, 5600 MB, Eindhoven, The Netherlands
Henk C. A. van Tilborg
Center for Secure Information Systems, George Mason University, Fairfax, VA, 22030-4422, USA
Sushil Jajodia

Rights and permissions

Reprints and permissions

Copyright information

About this entry

Cite this entry

Kaliski, B. (2011). Relatively Prime. In: van Tilborg, H.C.A., Jajodia, S. (eds) Encyclopedia of Cryptography and Security. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-5906-5_430

Download citation

DOI: https://doi.org/10.1007/978-1-4419-5906-5_430
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-5905-8
Online ISBN: 978-1-4419-5906-5
eBook Packages: Computer ScienceReference Module Computer Science and Engineering

Publish with us

Policies and ethics