Can a Subset of Questions Appear Exactly Once in Original and New Worksheets?

In summary, the conversation discusses proving the existence of a subset of 10 questions that appear exactly once in both the original and new worksheets of a set of 50 questions. The approach involves creating a 10 by 10 matrix and using the determinant to show the existence of such a subset. The conversation also touches on the concept of permutations and the properties of the determinant.
  • #1
talolard
125
0

Homework Statement


My professor has 50 questions. In the beginning of the semester he makes 10 work sheets each with 5 questions. At the end of the semester, he makes 10 new worksheets from the same quetions, this tiem sorted by difficulty.
Prove that there exists a subset of 10 question in which each question apeared exactly once in one of the original worksheets and in one of the new worksheets


Homework Equations




5d067940d9accb27e13fa2fab2fa5ec3.png

The Attempt at a Solution



The question is isomorphic to taking 50 different balls, labeling 5 with the number 1, labeling 5 with the number 2 etc until 10, and then repeating the process with a different colored pen.
We have created 50 unique ordered pairs. We can create a 10 by 10 matrix and label 1 in the i,jth place if that ordered pair exists in our collection and 0 if it does not. Then we have a 10 by 10 binary matrix.
We can notice that if the determinant of the matrix is non 0 then there exists some sub-group of the 50 balls that has two appearances of each of the numbers 1 to 10. This is from the definition of the determinant:
In our case, the determinant sums the number of permutations who's product is not zero. If such a permutation exists then a sub-set such as we are looking for exists.

The determinant is zero if the matrix is triangular (without entries on the diagonal) or if there are exactly two permutation, one even, one odd, whos product is non zero.

The matrix can not be triangular sicne there are 50 entries but only 45 entries in each triangle.
How do I prove that there can not be a pair of an even and odd permutation.
 
Physics news on Phys.org
  • #2
To clarify: the question asks you to show there are 10 questions that appear in the same numbered spot (between 1 and 5) on the old sheet and new sheet?
 
  • #3
No. That there are ten questions such that in total every sheet out of twenty has exactly one question representing it.
 
  • #4
I still don't understand. What does it mean for a question to represent a sheet?
 
  • #5
I'll rephrase it, i apologize, I'm translating.
There are 50 questions. The profesor takes 5 and puts them ona sheet and then the next five and the next five until 10 sheets are created. Let's cal it group A. Each sheet has different questions on it.
Aftrewards, he takes the same 50 questions and makes different work sheets with them, again 10 sheets with 5 questions each. This is group B
You (I) need to prove that there is some group of 10 questions such that each question belongs to one sheet in group A and one sheet in group B and each sheet in each group is represented, i.e. a question from each sheet is in the group.
 
  • #6
In a 10 by 10 matrix, there are 55 entries including the main diagonal, so the matrix can be triangular purely on those grounds. I haven't thought this through, but you should use the fact that every test has five questions.
 
  • #7
Ok, I got it.
The determinant can only be zero if there are two different permutations, each of which satisfies the problem. So either way we are done.
 

1. What is combinatorics and why is it important?

Combinatorics is a branch of mathematics that deals with counting and arranging objects. It is important because it provides tools and techniques for solving problems related to counting and organizing information, which are essential in many fields such as computer science, statistics, and economics.

2. What are the basic principles of combinatorics?

The basic principles of combinatorics include the fundamental counting principle, permutations, and combinations. The fundamental counting principle states that if there are m ways to do one thing and n ways to do another, then there are m x n ways to do both. Permutations refer to the number of ways to arrange objects in a specific order, while combinations refer to the number of ways to select a subset of objects without considering the order.

3. How is combinatorics used in real-world applications?

Combinatorics has many real-world applications, such as in computer science for coding and cryptography, in statistics for studying probability and random processes, in economics for analyzing decision-making and optimization problems, and in biology for studying genetics and population dynamics.

4. What are some common examples of combinatorics problems?

Some common examples of combinatorics problems include counting the number of ways to arrange books on a shelf, selecting a winning combination in a lottery, and determining the number of possible outcomes in a game of dice. Other examples include scheduling problems, graph theory, and network optimization problems.

5. How can I improve my skills in combinatorics?

To improve your skills in combinatorics, it is important to practice solving problems and understanding the basic principles. You can also read books and study materials on combinatorics, attend workshops or seminars, and work on projects or research related to combinatorics. Collaborating with other mathematicians or scientists can also help in expanding your knowledge and skills in this field.

Similar threads

  • Precalculus Mathematics Homework Help
Replies
32
Views
840
  • Linear and Abstract Algebra
Replies
15
Views
4K
Replies
15
Views
2K
  • Set Theory, Logic, Probability, Statistics
Replies
3
Views
881
  • General Math
Replies
1
Views
718
  • Calculus and Beyond Homework Help
Replies
7
Views
2K
  • Calculus and Beyond Homework Help
Replies
4
Views
2K
Replies
12
Views
1K
  • Programming and Computer Science
Replies
1
Views
1K
  • Science Fiction and Fantasy Media
Replies
0
Views
981
Back
Top