Claim. Among any 4 integers, there are two, a and b, such that a² – 6² is divisible by 5. Proof. We create three boxes labeled B₁, B₁, and B4, so that integer n is placed in B; if n² mod 5 = i. Now given any 4 integers, when they are placed among these 3 boxes, some box (say B;) will contain at least two integers (call them a and b) by the Pigeonhole Principle. Since a and b are both in box B₂, we know that a² mod 5 i and 6² mod 5 = i. This means a² = 5K + i and b² = 5Q + ¿ for integers K and Q. From this it follows that a² − b² = 5(K – Q); that is, a²- 6² is divisible by 5. = = -

Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
icon
Related questions
Question

Please show your work,

How the number of created/defined boxes is related to Pigeonhole Principal?

How the number of created/defined boxes is related to given in the problem integers?

Read the proof below. If the numbers given in the second sentence are {64, 69, 97, 118}, then
which boxes end up with at least two numbers? (Select all)
Box 0 Box 1 Box 4 o
Box 1
Box 4
Claim. Among any 4 integers, there are two, a and b, such that a² – 6² is divisible by 5.
Proof. We create three boxes labeled B₁, B₁, and B4, so that integer n is placed in B; if
n² mod 5 i.
=
-
Now given any 4 integers, when they are placed among these 3 boxes, some box (say B₂) will
contain at least two integers (call them a and b) by the Pigeonhole Principle. Since a and b are
both in box B₁, we know that a² mod 5 i and 6² mod 5 = i. This means a
a²
= 5K + i and
6² = 5Q + i for integers K and Q. From this it follows that a² − 6² = 5(K – Q); that is,
a²
6² is divisible by 5.
Transcribed Image Text:Read the proof below. If the numbers given in the second sentence are {64, 69, 97, 118}, then which boxes end up with at least two numbers? (Select all) Box 0 Box 1 Box 4 o Box 1 Box 4 Claim. Among any 4 integers, there are two, a and b, such that a² – 6² is divisible by 5. Proof. We create three boxes labeled B₁, B₁, and B4, so that integer n is placed in B; if n² mod 5 i. = - Now given any 4 integers, when they are placed among these 3 boxes, some box (say B₂) will contain at least two integers (call them a and b) by the Pigeonhole Principle. Since a and b are both in box B₁, we know that a² mod 5 i and 6² mod 5 = i. This means a a² = 5K + i and 6² = 5Q + i for integers K and Q. From this it follows that a² − 6² = 5(K – Q); that is, a² 6² is divisible by 5.
Expert Solution
Step 1

This is a simple consequence of using the division algorithm. The solution has been attached in step 2.

steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Follow-up Questions
Read through expert solutions to related follow-up questions below.
Follow-up Question

For 97, why would it be Box 4? Isn't it should belong to box 1 too?

Solution
Bartleby Expert
SEE SOLUTION
Similar questions
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,