. Find Relatively Prime Write a function to return a number that is relatively prime with the given number. /* return an integer that is relatively prime with n, and greater than 1 i.e., the gcd of the returned int and n is 1 Note: Although gcd(n,n-1)=1, we don't want to return n-1*/ int RelativelyPrime (int n)   4. Find Inverse Then implement the following function, which returns the inverse modulo, and test it. Note that you need to check whether a and n are relative prime before calling this function. Recall that a and n are relatively prime means that gcd(a,n)=1, i.e., their greatest common divisor is 1. Also recall that the extended Euclidean Algorithm can find the integer s and t for a and n such that as+nt=gcd(a,n), where s is the inverse of a modulo n. /* n>1, a is nonnegative */ /* a<=n */ /* a and n are relative prime to each other */ /* return s such that a*s mod n is 1 */ int inverse (int a, int n) { int s, t; int d = ExtednedEuclidAlgGCD (n, a, s, t); if (d==1) { return (mod (t, n)); // t might be negative, use mod() to reduce to // an integer between 0 and n-1 } else { cout <<"a and n are not relatively prime!\n"; } }   -Please write in

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

3. Find Relatively Prime

Write a function to return a number that is relatively prime with the given number.

/* return an integer that is relatively prime with n, and greater than 1
i.e., the gcd of the returned int and n is 1

Note: Although gcd(n,n-1)=1, we don't want to return n-1*/
int RelativelyPrime (int n)

 

4. Find Inverse

Then implement the following function, which returns the inverse modulo, and test it.
Note that you need to check whether a and n are relative prime before calling this
function. Recall that a and n are relatively prime means that gcd(a,n)=1, i.e., their
greatest common divisor is 1. Also recall that the extended Euclidean Algorithm can
find the integer s and t for a and n such that as+nt=gcd(a,n), where s is the inverse
of a modulo n.

/* n>1, a is nonnegative */
/* a<=n */
/* a and n are relative prime to each other */
/* return s such that a*s mod n is 1 */
int inverse (int a, int n)
{
int s, t;
int d = ExtednedEuclidAlgGCD (n, a, s, t);
if (d==1)
{
return (mod (t, n)); // t might be negative, use mod() to reduce to
// an integer between 0 and n-1
}
else
{
cout <<"a and n are not relatively prime!\n";
}
}

 

-Please write in c++

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Function Arguments
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education