m red balls and n blue balls are in a bag.
Two are pulled out at random.
There is an equal chance that the two are the same color or that they are different colors.
Is m + n rational?
Image credit: www.slideteam.net
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Nice solution, David!
Log in to reply
Nice problem and solution. Interesting to note that the solution pairs ( m , n ) (taking m > n without loss of generality) are all pairs of successive triangular numbers ( T n + 1 , T n ) .
Log in to reply
Definitely!
I've been wondering what the general solution might be for N colors of balls where the probability is equal for them all being the same or all being different when you pick out N balls randomly.
Log in to reply
@Geoff Pilling – I'm not getting anywhere on a general solution, or even on solutions for N = 3. I've tried finding solutions m , n , p ≥ 2 to the equation
m ( m − 1 ) ( m − 2 ) + n ( n − 1 ) ( n − 2 ) + p ( p − 1 ) ( p − 2 ) = 6 m n p
without success. Have you had more luck?
Log in to reply
@Brian Charlesworth – So far only for the trivial cases... 🤔. Although I must admit recently I haven't had much time to think about it. At some point I'll get out a piece of paper and a pencil and plow into it.
Hi @Brian Charlesworth,
I'm curious... Have you found a site that builds a community around creating and solving great math problems? (Kinda like Brilliant but more focused on the building the community aspect?)
Log in to reply
@Geoff Pilling – No luck on that front. Someone mentioned reddit but that site is a bit of a dumpster fire. I'm waiting to see how the "enhanced Discussion experience" promised by staff pans out; maybe it could be called the "Brilliant Café", a designated page (either staff- or volunteer-monitored) where all can go to join in on whatever topics are brought up by the community. If that happens then it might bring @Michael Mendrin back for another go, unless he has already found a site more like Brilliant used to be.
Log in to reply
@Brian Charlesworth – I sure hope something works out. Do you suppose that Brilliant are aware that they risk losing their customer base?
Log in to reply
@Geoff Pilling – Judging by comments from Silas Hundt, they are pleased with the activity generated by the changes they've made. They seem willing to sacrifice some of their "old" base (who were here more for the community aspect) to generate a "new" base (who are here more for the individual learning opportunities). There is more revenue to be had from the latter, so to survive as a business they have gone in that direction and in the process eliminated features that were expensive to operate and were being used by fewer and fewer members. They have committed to keeping a Community page but it may have to evolve to justify its existence (and expense).
Nice observation, @Brian Charlesworth ! You may have already worked out a proof for this, but here is mine:
Using the quadratic equation on m + n = ( m − n ) 2 leads to m = 2 2 n + 1 ± 8 n + 1 . Since m and n are integers, the numerator must be an even integer, and since 2 n + 1 is an odd integer, 8 n + 1 must be an odd integer as well, so 8 n + 1 = ( 2 p + 1 ) 2 for some integer p , which solves to n = 2 p ( p + 1 ) , a triangular number. Plugging this value back into m gives m = 2 p ( p − 1 ) or m = 2 ( p + 1 ) ( p + 2 ) , the previous or next triangular number.
It is a bit easier to simply solve ( m + n ) ( m + n − 1 ) 2 m n = 2 1 from which the identity m + n = ( m − n ) 2 is almost immediate.
Log in to reply
@Geoff Pilling had a solution posted similar to this, but I'm not sure what happened to it.
Problem Loading...
Note Loading...
Set Loading...
The probability of picking two balls of different colors is ( 2 m + n ) ( 1 m ) ( 1 n ) = ( m + n ) ( m + n − 1 ) 2 m n ,
and the probability of picking two balls of the same color is ( 2 m + n ) ( 2 m ) + ( 2 m + n ) ( 2 n ) = ( m + n ) ( m + n − 1 ) m 2 + n 2 − m − n .
For the chances to be equal, ( m + n ) ( m + n − 1 ) 2 m n = ( m + n ) ( m + n − 1 ) m 2 + n 2 − m − n which simplifies to m + n = m 2 − 2 m n + n 2 = ( m − n ) 2 .
Therefore, m + n = ∣ m − n ∣ which must be rational for positive integers m and n .