   Chapter 8.4, Problem 43ES ### Discrete Mathematics With Applicat...

5th Edition
EPP + 1 other
ISBN: 9781337694193

#### Solutions

Chapter
Section ### Discrete Mathematics With Applicat...

5th Edition
EPP + 1 other
ISBN: 9781337694193
Textbook Problem
1 views

# Fermat’s little theorem can be used to show that a number is not prime by finding a number a relatively prime to p with the property that show that a number is prime. Find an example to illustrate this fact. That is, find integers a and p such that a and pare relatively prime and a p − 1 = 1 ( mod   p ) but p is not prime.

To determine

To find:

The integers a and p such that a and p are relatively prime and ap11(modp) but p is not prime.

Explanation

Given information:

a and p are relatively prime and ap11(modp).

Concept used:

Fermat’s little theorem can be used to show that a number is not prime by finding a number a relatively prime to p with the property that ap11(modp).

Calculation:

Let a=5andp=4

Now, 5=1×4+1

4=1×4+0

The GCD of (5,4)=1

Since the last remainder in division is 1

### Still sussing out bartleby?

Check out a sample textbook solution.

See a sample solution

#### The Solution to Your Study Problems

Bartleby provides explanations to thousands of textbook problems written by our experts, many with advanced degrees!

Get Started 