Mathematics Homework Solutions
Problem
#42752

Discrete Structures : Sequences, Subsequences and Remainders

1. How do I prove that in a group of n people there are two people with the same number of acquaintances within the group?

2. Prove that given a sequence of twelve integers, a1, a2, …,a12, there is a subsequence aj, aj+1, …, ak where 12 divides ∑kn= aa n.

3. A scrape of paper is found in an old desk that read:  72 turkeys $X67.9Y
The first and last digits of the price were smudged.  What are the two smudged digits?

4. Show that from any five integers, not necessarily distinct, one can always choose three of these integers whose sum is divisible by 3.

Attached file(s):
Attachments
Here is my dilemma.doc  View File

Attachment Content Summary (Note: view attachment at the above link before purchasing. Actual attachment content may vary slightly from that shown below.)

Here is my dilemma.doc
Here is my dilemma; I have had no formal instructions with proof writing
or discrete mathematics. I am taking a problem solving class where most
of the solutions are based on discrete mathematics structures. Below
are four questions I need assistance in answering.

How do I prove that in a group of n people there are two people with the
same number of acquaintances within the group? (Am thinking this is a
pigeon hole problem)

Prove that given a sequence of twelve integers, a1, a2, …,a12, there
is a subsequence aj, aj+1, …, ak where 12 divides ∑kn= aa n.

A scrape of paper is found in an old desk that read:



72 turkeys $X67.9Y

The first and last digits of the price were smudged. What are the two
smudged digits?

ј



є

ј

not necessarily distinct, one can always choose three of these integers
whose sum is divisible by 3.

Solution Summary

Sequences, Subsequences and Remainders and Proofs are investigated. The solution is detailed and well presented.

Solution
What is this?
By OTA - Overall OTA Rating
Yupei Xiong, PhD - 4.8/5
Purchase Cost Now
$2.19 CAD (was ~$15.96)
Included in Download
  • Plain text response
$2.19 Instant Download
Add to Cart
Why you can trust BrainMass.com
  • Your Information is Secure
  • Best Online Academic Help Service
  • Students find real academic Success
Related Solutions
  • Real Analysis : Sequences - Give an example of each of the following, or argue that such a request is impossible: 1- a sequence that does not contain 0,1 as a term but contains subsequences converging to each of these values. ...
  • Real analysis - Prove: subsequences of a convergent sequences converge to the same limit as the original sequence
  • Compact Set, Convergent Sequences and Subsequences and Accumulation Points - Prove that a set A, a subset of the real numbers, is compact if and only if every sequence {an} where an is in A for all n, has a convergent subsequence converging to a point in A. For the forward ...
  • Compact Subset of R^m with Convergent Sequences - Let A be a proper subset of R^m. A is compact, x in A, (x_n) sequence in A, every convergent subsequence of (x_n) converges to x. (a) Prove the sequence (x_n) converges. Is this because all ...
  • Converging Subsequence - Theorem: Suppose that a sequence S of real numbers has a subsequence that converges to a real number a. Then S converges to a. I know this is true as an if and only if statement, but I need a count ...
Browse