
Content count
6799 
Joined

Last visited

Days Won
63
Posts posted by bonanova



Here are the placeholders for a long division, along with a single digit in the quotient.
Can you piece together the dividend?
x 7 x x x

x x x / x x x x x x x x
x x x x

x x x
x x x

x x x x
x x x

x x x x
x x x x

   
 
On 3/11/2018 at 12:44 PM, plasmid said:SMH, continuing from that last line of formula...Edit: Nevermind, I think you have to calculate the value over the range of integration for the numerator and denominator separately, I don't think you can just divide through like that. And after looking it up, those limits go to zero so I've got an indeterminate 0/0 still.
SpoilerFor Poisson, appropriately scaled, cumulative prob for (L<x) is F(x) = (1  e^{x}) and the pdf for (L=x) is f(x) = F'(x) = e^{x}. So f(x) says our interval is x, and F(x), for each neighbor, says that's longer than they are. So a large interval's expected length is int (0,inf) {x f(x) F(x) F(x) } dx. (The same integral without the x gives the probability that an interval is large. Turns out it's 1/3.) Integrate by parts using u=x and dv= { f F^{2} dx } = (1/3) d( F^{3}  1 ). Then the (uv) term {x (F^{3} 1) } is zero at both 0 and inf, leaving just int (0, inf) ( 1  F^{3} ) dx = int (0, inf) { 3e^{x}  3e^{2x} + e^{3x }} dx. Was your inf involved with the (uv) term?

17 hours ago, plainglazed said:Flipping a coin eleven times results in _{11}C_{8}+_{11}C_{9}+_{11}C_{10}+_{11}C_{11 }or 232 trials that have 8 or more heads. There are _{11}C_{7} or 330 trials that would have exactly seven heads, half of which would have eight heads with one more flip:
(_{11}C_{7}/2+_{11}C_{8}+_{11}C_{9}+_{11}C_{10}+_{11}C_{11})/2^{11}=.193848
SpoilerEquates with the 3x speed version of ants on a checkerboard:
probability of reaching either of the ends of the five meeting points = 794 / 4096 
Looks like ...
Spoilerdy/dx = 1
Spoilerb = x^{a} = e^{a ln x} = e^{ln ln x} = ln x
y = e^{b} = e^{ln x} = x 
8 hours ago, CaptainEd said:That was the firstcut answer in the antchessboard problem.
SpoilerThe value is too low. It counts only once the (multiple) cases where 8 heads is reached before the "full complement" of 4 tails occurs.
The solution is easier to find if we (reasonably) assume that
Spoilerthe final toss will be Heads.

SpoilerSpoilerBut seriously, working on it.

1 hour ago, plainglazed said:Agree.
SpoilerI think you have the solution at 6.
I've been doing this in my head for two days. I was only able to eliminate 5. 
Just now, Molly Mae said:Signature updated!
I'm humbled.
btw I sharpened (with humor) the flavor text and posted this on another favorite site. It will be interesting to see how quickly it's solved there.

1 hour ago, Molly Mae said:@Molly Mae gets the coveted bonanova gold star for finding an algorithm and getting the answer in less than one day.
So now that the cat (algorithm) is out of the bag, so to speak, it should be trivial to find whether an integer can triple, (or quadruple, or quintuple) under the same manipulation.
It's also interesting that his solution forms a ring that shows the doubling process also occurs for four other ending digits (not 1, so his is the smallest.) But which ones? Incidentally, this also shows that all such integers have 18 digits.

Fun one.
SpoilerThe pickle solids weigh, whatever. They're now much easier to carry.

Things are not going well at the Acme Company.
Executive talent is hard to come by, and it is not cheap. Folks at the water cooler have no ideas, and the coffeebreakers can't imagine how to improve things either. But those who party around the teapot, they came up with something. They suggested to the Board that Acme promote the newest hire in the mail room and make him the CEO! We need to shake things up, but good. Qualifications, job experience, brains, judgment, integrity, these are all things of the past.
Some were not so sure. Doesn't make sense at all, the old timers said. Almost like appointing some guy with orange complexion to be President. That's exactly the idea, said the teapeople. Turn things on end, let the bull loose in the china shop, and see what happens. Hey  how could it be worse than what we have now? Not surprisingly, the debate was long and heated.
Such a risk merited proof of possible gain, so the old guard posed a challenge: produce a concrete example of where the idea had been tried with incontrovertible benefit. In fact, make it mathematical. You know, something that might make a good BrainDen puzzle.
We'll promote the mail room guy, they said, if you can show us an integer that doubles in value when its least significant digit is promoted to its mostsignificant position.
That is, give us a number { some digits } q that has half the value of q { same digits }.
Spoiler102 doesn't quite work, since 210 does not quite equal 204
That all happened last week, and now we're looking for the mail room guy. Was he promoted? Did the tea people find such a number? Is there one?
We need a number or a proof that one does not exist.
T.L.D.R.
What number doubles in value by by moving its last digit to the first position (if there is one)?

Al, Bert and Charlie are on the ballot for secretary of the local yacht club, and they finish in a threeway tie. To break it, they solicit the members' second choices, and again it's a threeway tie. Al notes that since the number of members is odd, a series of twoway votes would be decisive. As a reward for finding a way past the impasse, Al receives the bye and will take on the winner of a Bert vs Charlie vote to decide who gets the position as secretary. Assuming voter preferences do not change, what are the winning probabilities for the three gentlemen?

Alternate approach to the antcheckerboard problem asks: What is the probability of flipping 8 heads before 5 tails?

If we place four matches in the form of a square, they form 4 right angles.
If we place them like a hashtag (#) they form 16 right angles.
If someone removes one match, can we still form 12 right angles?
(No bending or breaking of the matches is allowed.) 
On 3/3/2018 at 10:52 AM, plasmid said:Suppose you have one guy that’s responsible for putting the bags on the conveyor belt, and the amount of time it takes him to put each subsequent bag on the belt is randomly drawn from a uniform distribution from 0 to 1 second. Also say the conveyor belt is moving at 1 meter per second to make the math easier. So you can work with a string of distances: x_{1}, x_{2}, x_{3}, … and we’re looking for the ratio of (the sum of all terms x_{n} where x_{n} > x_{n1} and x_{n} > x_{n+1}) divided by (the sum of all terms x_{n} regardless of whether it's a nonnearest neighbor segment).
For any given value of x_{n}, the probability that x_{n} > x_{n1} is simply the value of x_{n} (since we’re dealing with a uniform distribution of values over a range from 0 to 1), and similarly the probability that x_{n} > x_{n+1} is x_{n} (since these numbers are randomly generated independently of each other). So the probability that x_{n} is a nonnearest neighbor segment is the product of those two, or x_{n}^{2}.
Since the length of each segment is generated from a uniform distribution from 0 to 1, we can do an easy integral. To calculate the fraction of the conveyor belt that’s covered by nonnearest neighbor segments, I think we would want to take the integral of [length of the segment] · [probability that it’s a nonnearest neighbor segment] (which is x · x^{2} = x^{3}) and divide that by the integral of [length of the segment].
Int_{[x=0 to 1]} (x^{3} dx) / Int_{[x=0 to 1]} (x dx)
_{[x=0 to 1]} (x^{4}/4) / _{[x=0 to 1]} (x^{2}/2)
(1/4) / (1/2) = 1/2That answer would very likely change if you used a different method to generate random distances between suitcases on the conveyor belt.
The answer probably does change with the nature of the distances.
SpoilerYour answer seems lower than expected.
SpoilerI wonder what you'd calculate assuming a Poisson distribution, where the probability that any interval is smaller than say a distance x can be taken, with appropriate scaling, to be 1  e^{}^{x}. Equivalently, the probability density function for an interval of distance x would just be e^{}^{x}.

Regarding the 5 probabilities after 12 ant moves:
SpoilerEnumerating paths and treating them as equals gives { C(12,8) C(12,7) C(12,6) C(12,5) C(12,4) } / (3498) multiplied by { 1 4 6 4 1 } / 16 and summing for a result of .22995. But Al (the faster ant)'s paths involve from 8 to 12 choices, so they are not equally likely. Probabilities derived by dividing each path by the sum of all paths (3498 in this case) will be incorrect. What is the right approach?

@plasmid augments paths that touch an intermediate border point, where a choice is eliminated, by multiplying by 2 at each point. The effect is to create virtual paths that increase the count to each end point by 299, making 4096 = 2^{12} total paths and leads to the correct probability of .20551.
I have three other approaches. The first is the one I thought would be found here. Another is quick and dirty. The last one occurred to me as I'm writing this.

This one seems evidently correct but is the most involved of the three.
Call the Final points { F_{1} F_{2} F_{3} F_{4} F_{5} } with probabilities of { f_{1 }f_{2 }f_{3 }f_{4 }f_{5} }.
Start with a result from the first problem, the probabilities { d_{1 }d_{2 }d_{3} d_{4 }d_{5 }d_{6 }d_{7 }d_{8 }d_{9} } of reaching the 9 diagonal points. Then (by inspection) determine the probabilities of reaching each F_{i} from the onetofive possible starting diagonal points Dj. Call those p(Dj, Fi). There are 25, but really only 15 due to symmetry, and some are trivial. Others take just a little thought. Clearly p(D1 ,F1)=1. Then, since p(D2, F2) (4 E moves) = 1/16, we have p(D2, F1) = 15/16, and so on. Then we have
f_{i} = sum(j) { dj x p(Dj, Fi) }

This one involves the least work.
Paths to { F2 F3 F4 } don't hit an edge. So { f2 f3 f4 } = { C(12,7) C(12,6) C(12,5) } / 2^{12}
Then f_{1} = f_{5} = 1/2 ( 1  sum { f_{2} f_{3 }f_{4} } )

This one recognizes an equivalent calculation.
What is the probability of flipping 8 heads before flipping 5 tails? I don't know whether this is an easy question or not, but the answer gives f_{1} and f_{5}.

@plasmid augments paths that touch an intermediate border point, where a choice is eliminated, by multiplying by 2 at each point. The effect is to create virtual paths that increase the count to each end point by 299, making 4096 = 2^{12} total paths and leads to the correct probability of .20551.

Case by case results, inviting algorithm falsification, while limiting lengths to 10.
SpoilerRows: values of a; Columns: values of b; Elements: triangle counts.
OBTUSE 10
0 0 0 0 0 0 0 0 0 0
0 1 1 1 1 1 1 1 1 0
0 0 1 1 2 2 2 2 1 0
0 0 0 2 2 2 2 2 1 0
0 0 0 0 2 3 2 1 0 0
0 0 0 0 0 2 1 0 0 0
0 0 0 0 0 0 1 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
Row sums (obtuse triangles for 10 values of a)
0 8 11 11 8 3 1 0 0 0 <= showing no possible obtuse triangles when 2> a >7Total triangles
42More matrices, for maximum lengths of 29:
SpoilerOBTUSE 2
0 0
0 0
OBTUSE 3
0 0 0
0 1 0
0 0 0
OBTUSE 4
0 0 0 0
0 1 1 0 <= meaning a=b=2 permits (only) one obtuse triangle: c=3
0 0 0 0
0 0 0 0
OBTUSE 5
0 0 0 0 0
0 1 1 1 0 <= meaning a=2 b=4 permits (only) one obtuse triangle: c=5
0 0 1 0 0 <= showing that a=3 b=4 c=5 (right)triangle was not counted
0 0 0 0 0
0 0 0 0 0
OBTUSE 6
0 0 0 0 0 0
0 1 1 1 1 0 <= counting (only) 223, 234, 245, 256 for a=2
0 0 1 1 1 0 <= indicating a=3 b=4 c=6 obtuse triangle (only) was counted; not c=5,7
0 0 0 1 0 0
0 0 0 0 0 0
0 0 0 0 0 0
OBTUSE 7
0 0 0 0 0 0 0
0 1 1 1 1 1 0
0 0 1 1 2 1 0
0 0 0 2 1 0 0
0 0 0 0 0 0 0
0 0 0 0 0 0 0
0 0 0 0 0 0 0
OBTUSE 8
0 0 0 0 0 0 0 0
0 1 1 1 1 1 1 0
0 0 1 1 2 2 1 0
0 0 0 2 2 1 0 0
0 0 0 0 1 1 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
OBTUSE 9
0 0 0 0 0 0 0 0 0
0 1 1 1 1 1 1 1 0
0 0 1 1 2 2 2 1 0
0 0 0 2 2 2 1 1 0
0 0 0 0 2 2 1 0 0
0 0 0 0 0 1 0 0 0
0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 
I get fewer ...
Spoiler47308.
To avoid double counting, I restricted a <= b <= c.
I let a be in [1, 100] and b in [a, 100]. I then counted the integers c in [ sqrt {(a^{2})+(b^{2})}, a+b 1 ].
I also noticed 52 right triangles (Pythagorean triples) .This is a plot of possible obtuse triangles for each value of a between 1 and 100.
When a = 27 the number reaches a maximum of 1166.

13 hours ago, plasmid said:Flipping the same coin twice would be indistinguishable from not flipping it at all to your buddy. So you would just be exposing yourself to more nyaning without accomplishing anything.
Naively.I might want the first n1 coins to be heads if the valuable one was tails in the nth position. I'd have you keep flipping them until they showed heads. But /// I watched the video, so ... nah.

I can ask you to flip a coin for a 2^{nd} time?

17 hours ago, Pickett said:Approach
Let's start by identifying the 7 different groups of people involved and label them
 Total people that had only Wine = W
 Total people that had only Beer = B
 Total people that had only Water = H
 Total people that had Wine and Beer = WB
 Total people that had Wine and Water = WH
 Total people that had Beer and Water = BH
 Total people that had Wine, Beer, and Water = WBH
Now, given that, we can write our system of equations based on the problem statement:
EQUATION 1 (total cost of all drinks):
5*(WINE) + 2*(BEER) + 1*(WATER) = 293
5*(W+WB+WH+WBH) + 2*(B+WB+BH+WBH) + (H+WH+BH+WBH) = 293
Simplifies to:
5W + 7WB + 6WH + 8WBH + 2B + 3BH + H = 293EQUATION 2 (total glasses used):
W + B + H + 2WB + 2WH + 2BH + 3WBH = 106EQUATION 3 (total nonwater drinkers):
W + B + WB = 18EQUATION 4 (total wine drinkers):
W + WB + WH + WBH = 39EQUATION 5 (total nonalcohol drinkers):
H = 9EQUATION 6 (ending assumption that wineonly was half the number of beer/water drinkers):
BH = 2WSo, now that we have our 6 equations, we can start doing our algebra:
Plug equation 5 into equation 1 and 2 to simplify slightly:
1) 5W + 7WB + 6WH + 8WBH + 2B + 3BH = 284
2) W + 2WB + 2WH + 3WBH + B + 2BH = 97Plug equation 6 into equations 1 and 2:
1) 11W + 2B + 7WB + 6WH + 8WBH = 284
2) 5W + B + 2WB + 2WH + 3WBH = 97Reorder equation 1 and 2:
1) 2(W+B) + 9W + 7WB + 6WH + 8WBH = 284
2) (W+B) + 4W + 2WB + 2WH + 3WBH = 97Plug equation 3 (W+B = 18WB) into equations 1 and 2:
1) 9W + 5WB + 6WH + 8WBH = 248
2) 4W + WB + 2WH + 3WBH = 79Plug equation 4 (W=39WBWHWBH) into equation 1 and 2:
1) 4WB + 3WH + WBH = 103
2) 3WB + 2WH + WBH = 77Solve for one of the remaining variables (WB):
WB = (103  3WH  WBH) / 4Plug into equation 2:
WH = 1 + WBHAlright, so we now have 1 equation with 2 unknowns, where one of the unknowns is what we're trying to determine! So, we can list out all of the possible values of WBH and WH...which happen to be:
WBH = 1, WH = 2
WBH = 2, WH = 3
...
WBH = 18, WH = 19Anything above WBH = 18 will cause equation 4 to not work...so we can stop there with those 18 possibilities. Now it's just a matter of substituting in each of those values into our equations to find the lowest one that works. I'll spare the gory details, but WBH < 11 results in negative values for other variables at some point...so let's just show trying WBH = 11:
WBH = 11, WH = 12:
Substitute those values into our 4 equations and simplify:
 5W + 2B + 7WB + 3BH = 124
 W + B + 2WB + 2BH = 40
 W + B + WB = 18
 W + WB + = 16
Now substitute 4 into 3 to solve for B:
B = 2...so we know B = 2 and W = 16WB
Plug those two into equations 1 and 2 and simplify
 2WB + 3BH = 40
 WB + 2BH = 22
Solve (WB = 222BH)
You find BH = 4...so given BH = 4, WBH = 11, WH = 12, B = 2, and H = 9, we can find the other two values of WB = 14 and W = 2...at which point we can verify all of the original equations hold true. so therefore, WBH (total number of people who drank all three drinks) is at least 11 given the assumptions we stated.@Pickett It may not impact your solution, but the OP did not intend to say that all of us drank something.
"Class of drinkers" was not meant to preclude anyone from drinking nothing.
Meaning there are eight "classes" of drinkers.Sorry for that. I have this thing about insisting that zero is a number, rather than a denial.
Also, I get a different answer. I'll check my analysis against yours to see why.

2 hours ago, rocdocmac said:Does it necessarily mean that all 9 of the teetotalers drank water or is that an assumption? What if some didn't drink at all that day and therefore never touched one of the 106 glasses?
 It means that all of the teetotalers drank neither wine nor beer. Let's say also that the others did consume alcohol.
 One class of friends may have drunk nothing, and perforce not used a glass.

Thinking. Meantime I'll call your 10 minutes of cat flight and raise you 25 minutes of Roomfull of Teeth, as they explore new uses for the human voice, which you might actually enjoy.
Dividend please (on steroids)
in New Logic/Math Puzzles
Posted · Report reply
Here are the placeholders for a long division, solvable, even with none of the digits filled in. The quotient has been placed to the side. It has a decimal point, not shown, and its last nine digits are repeating. Meaning, of course, the last row of X's replicates a previous row.
Can you piece together the dividend?
 _________________
x x x x x x / x x x x x x x ( x x x x x x x x x x x x
x x x x x x

x x x x x x x
x x x x x x

x x x x x x x
x x x x x x x

x x x x x x x
x x x x x x

x x x x x x x
x x x x x x x

x x x x x x x
x x x x x x x

x x x x x x x
x x x x x x x

x x x x x x x
x x x x x x x

x x x x x x
x x x x x x

x x x x x x