10 investors bought 3 stocks each and any two of them bought at least one stock in common. For the stock owned by most people, what is the minimum number of people who have bought it? I tried applying the concepts of set theory as well as pigeon hole principle, but cannot really wrap my head around it.
2026-03-30 03:53:45.1774842825
How to solve this mathematical puzzle?
361 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in COMBINATORICS
- Using only the digits 2,3,9, how many six-digit numbers can be formed which are divisible by 6?
- The function $f(x)=$ ${b^mx^m}\over(1-bx)^{m+1}$ is a generating function of the sequence $\{a_n\}$. Find the coefficient of $x^n$
- Name of Theorem for Coloring of $\{1, \dots, n\}$
- Hard combinatorial identity: $\sum_{l=0}^p(-1)^l\binom{2l}{l}\binom{k}{p-l}\binom{2k+2l-2p}{k+l-p}^{-1}=4^p\binom{k-1}{p}\binom{2k}{k}^{-1}$
- Algebraic step including finite sum and binomial coefficient
- nth letter of lexicographically ordered substrings
- Count of possible money splits
- Covering vector space over finite field by subspaces
- A certain partition of 28
- Counting argument proof or inductive proof of $F_1 {n \choose1}+...+F_n {n \choose n} = F_{2n}$ where $F_i$ are Fibonacci
Related Questions in PUZZLE
- Maximum number of guaranteed coins to get in a "30 coins in 3 boxes" puzzle
- Interesting number theoretical game
- Number of divisors 888,888.
- Who has built the house of Mason?
- Is there any tri-angle ?
- In what position , the dogs will reside?
- Number of ways to go from A to I
- Who is the truth teller (logic puzzle)
- How many solutions are there if you draw 14 Crosses in a 6x6 Grid?
- Symmetric latin square diagonal elements
Related Questions in PIGEONHOLE-PRINCIPLE
- Is it possible to make a computer network of 75 computers
- Pigeonhole principle: prove that a class of 21 has at least 11 male or 11 female students.
- Proving that a set of 2016 natural numbers contain a non-empty set with a sum divisible by 2016
- Question on proof of Erdos and Szekeres
- Pigeon Hole Principle Proof integrated with sets
- # of vertices and # of connected components proof problem?
- Prove that any collection of 8 distinct integers contains distinct x and y such that x - y is divisible by 7.
- Hint for problem on $4 \times 7$-chessboard problem related to pigeonhole principle
- Pigeonhole principle subsets
- $80$ balls in a row. $50$ of them are yellow and $30$ are blue. Prove that there are at least $2$ blue balls with a distance of exactly $3$ or $6$.
Related Questions in MAXIMA-MINIMA
- optimization with strict inequality of variables
- Minimum value of a complex expression involving cube root of a unity
- Calculation of distance of a point from a curve
- Find all local maxima and minima of $x^2+y^2$ subject to the constraint $x^2+2y=6$. Does $x^2+y^2$ have a global max/min on the same constraint?
- Solving discrete recursion equations with min in the equation
- Trouble finding local extrema of a two variable function
- Why do I need boundedness for a a closed subset of $\mathbb{R}$ to have a maximum?
- Find the extreme points of the function $g(x):=(x^4-2x^2+2)^{1/2}, x∈[-0.5,2]$
- Maximizing triangle area problem
- Find the maximum volume of a cylinder
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
You have $45$ pairs of people who must own a stock in common. If a stock is owned by $n$ people, it covers $\frac 12n(n-1)$ pairs. If the most people who own the same stock is $4$, there can be seven stocks owned by four people and one stock owned by two. This accounts for $43$ pairs, so we must have a stock owned by five. If the most people who own one stock is five, you can have six stocks owned by five people each, which could cover $90$ pairs. In this case it is natural to assume (I have not justified this) that the stocks come in three pairs with the stocks in each pair belonging to a disjoint set of five people. This fails bcause of overlap. Let stock A belong to people $1-5$ and stock B to people $6-10$. Then one of C,D belongs to at least three of $1-5$ and one of E,F belongs to at least three of $1-5$ as well. Say these are C,E. Somebody of $1-5$ owns both C and E by the pigeonhole principle and will therefore only have two matches from each within $6-10$ and will be missing one. Then the maximum ownership goes up to six and we have five different stocks. We can demonstrate a solution here. $$ \begin {array} {c c c c c c c c c c}\\1&2&3&4&5&6&7&8&9&10\\ A&A&A&A&A&A&B&B&B&B\\B&B&C&C&D&D&C&C&C&C\\E&E&E&E&E&E&D&D&D&D\end {array}$$ We know six is sufficient, four is not enough, and it seems five doesn't work but it is not certain.