You are not logged in.
1. Find the angle between the asymptotes to the hyperbola 3x² - 5xy -2y² + 17x + y + 14 = 0.
This is honestly the most lengthy, involved problem I've ever worked on. I never studied the general conic equation while in school, so this is new for me. Hopefully I've done everything correctly.
First we need to get rid of the xy term by doing a rotation of axes..
So the slope of the asymptotes are
The hyperbola is oriented parallel to the y-axis and to get the angle between the asymptote and x-axis we use
So the angle between the asymptotes is
Welcome aboard Aesdyn2!
I agree there are some brilliant and knowledgeable people on this site. This is great site for learning and practicing problems. I'm not in school so I try to learn what I can.
Fruityloop
#3. 28.86751346 meters.
#4. 30°
#5. 73.2050808 meters.
Good job Bobbym!
Oops...boy was I wrong.
(a+b)(a^2-ab+b^2)=3(2007-ab) doesn't mean (a+b)=3 or (a^2-ab+b^2)=3
I don't believe there are any integers because...
Very good!
The method I used was unnecessarily complicated.
I overlooked using X=2^x in the quadratic equation.
This is something I just recently learned how to solve.
The method of solution I discovered on my own.
I'm sure this will be simple for some members on this board.
The graph is simply showing all values of X that satisfy both X<-2 and X<3. The open dot simply means that -2 isn't part of the solution, but everything less than -2 is part of the solution.
Welcome to the forum jon17!
From the first sentence one can get..
This post is a few years old, but I find this problem fascinating...
It reminds me a little bit of the game of c r a p s where you have to roll your 'point' before a 7 in order to win. You have a infinite number of possible sequence of events depending on when the 'point' or 7 appears. Using a nice diagram like Jane's...
Ben wins with the far branch on the right H-T-H or with the branch ending on the bottom left H-H-T-H.
Bill wins with the branch ending on the middle left H-H-H.
So the probability of Ben winning is (1/8+1/16)=3/16 and Bill's chances are (1/8)=2/16.
So, Ben's chances are 3/16 and Bill's chances are 2/16.
So, Ben is favored 3 to 2 with a fair coin. Ben has a 60% chance of winning and Bill has only a 40% chance of winning.
We want to find the probability of heads which will give an even chance to both parties.
Let the probability of heads be x and the probability of tails be 1-x.
Bill must win with three heads and Ben can win with either two heads and a tail or three heads and a tail so...
Nothing like beating a dead horse, but here we go...
Hi Fla$h!;
Here's #2...
Try #4 on the exercises at the bottom of this website...
http://www.math.rutgers.edu/~erowland/m … metic.html
4. Show that if x, y, z are integers such that x^3 + y^3 = z^3, then at least one of them is divisible by 7.
Yeah..good luck with that!
I am not 100% sure of myself but after a rather lengthy process I got...
I think he means y=ax/(x+b).
But, there seems to be something wrong with the numbers listed for x and y from the table.
I figured out a=9.9 and b=1.75 using x=0.5, y=2.2 and x=1.0, y=3.6, but those values for a and b don't work for the other values in the table, like x=10.0 y=7.8.
We've just had the hottest day ever here in the Pacific Northwest of the U.S. on July 29. The city I live in reached 104°F or 40°C!!!!
Somebody on T.V. said this isn't because of global warming!?!?!?
I realize it's only one day, but the temperatures are off the chart of what's normal.
I saw this on a video slot machine, there are 13 pigs in a circle like so...
P P
P P
P P
P P
P P
P P
P
Two dice are rolled and whatever number comes up, that many pigs are counted off and the pig you land on turns into a bomb. So let's say you start at the bottom pig and roll a 4-3, so 7 pigs are counted off clockwise and you would land on the top pig on the right and it would turn into a bomb. If you now roll 3-3, you land on the pig at the bottom and it turns into a bomb. If you now roll a 4-3 again, you land on the first pig you were on which is now a bomb and the game is over. So the goal is to land on all 13 pigs without landing on any of them twice or the game is over.
So what is the probability of making it all the way through 13 pigs?
No homework problem, just for fun but I haven't a clue how to solve it.
Bobbym,
How in the world did you figure that out? Somehow, you knew to choose 3 and 4 and then figured out the irrational root.
Highly impressive.
Thank you for your time.
Mathyperson,
That is brilliant! I will study this and learn from it.
Bobbym's answer is given as being correct on the website but it doesn't seem correct.
I guess the reasoning is that if we have five numbers and if we cycle through all combinations for three of them and multiply that by the different combinations of three out of five we will have the answer. So we have 1000(000-999)*5C3 = 10,000.
So 123XX will be different from XX311, but we can choose 11 for the first number and 12 for the second number and we have the same number!
Each number selected eliminates 45 other numbers, so the total number of possible IDs is only 1/46 of the total. So 100000/46 = 2173 possible IDs. I'm not totally sure my answer is correct.
Anybody else have any ideas?
9.999-0.9999=8.9991
This would only work if there are string of zeros at the end. For example..
9.9990000000.....- 0.999900000000......