text stringlengths 1 2.12k | source dict |
|---|---|
the probability of event A, three dots showing, is P(A) = 1 6 on a single toss. Suppose a coin tossed then we get two possible outcomes either a 'head' ( H ) or a 'tail' ( T ), and it is impossible to predict whether the result of a toss will be a. Denote by #Adenote the number of point in A. Class 11 Maths Probability Ex 16. The solutions to these problems are at the bottom of the page. Let E = Event of drawing 2 balls, none of which is blue. This video shows examples of using probability trees to work out the overall probability of a series of events are shown. First we find the probability of each event. So before seeing the patient I'm already able to identify the two most likely diagnoses and assign an initial probability for each. The solutions given to the questions for the in between exercises and exercises given at the end of the chapter are prepared by our subject matter experts in a simple and lucid language. Team A wins the series in two games with probability 1/4. All NCERT Questions, Examples and Exercises are solved with step-by-step answers to all questions explained in detail. Answers and links to explanations to these these GMAT probability problems are at the end of set. 2 List the elements of the following sets. Introduction to Conditional Probability Some Examples A "New" Multiplication Rule Conclusion Conditional Probability Here is another example of Conditional Probability. In reality, I'm not particularly interested in using this example just so that you'll know whether or not you've been ripped off the next time you order a hamburger! Instead, I'm interested in using the example to illustrate the idea behind a probability density function. Therefore, both the events will have half probability. On infinite sums19 6. Not all Markov chains. Hope you like them and do not forget to like , social share and comment at the end of the page. Bayes' theorem is a mathematical equation used in probability and statistics to calculate conditional | {
"domain": "minoronzitti.it",
"id": null,
"lm_label": "1. YES\n2. YES\n\n",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9828232924970204,
"lm_q1q2_score": 0.8556432605768571,
"lm_q2_score": 0.8705972549785201,
"openwebmath_perplexity": 428.6329198709035,
"openwebmath_score": 0.7154899835586548,
"tags": null,
"url": "http://vnbk.minoronzitti.it/probability-examples-and-solutions.html"
} |
theorem is a mathematical equation used in probability and statistics to calculate conditional probability. 1 of the bags is selected at random and a ball is drawn from it. Get Free NCERT Solutions for Class 11 Maths Chapter 16 Probability. Theoretical probability is an approach that bases the possible probability on the possible chances of something happen. Probability: Theory and Examples. Expected Value 7. If none of the possible outcomes are favorable for a certain event (a favorable outcome is impossible), the probability is 0. ) the second time will be the same as the first (i. The problem is: we want 1 novel and 1 reference work, but we don’t care which one was picked first. These notes can be used for educational purposes, pro-vided they are kept in their original form, including this title page. Probability concept includes some terms. 1 Probability Spaces. Measure Theory 1. Even though we discuss two events (usually labeled A and B), we’re really talking about performing one task (rolling dice, drawing cards, spinning a spinner, etc. Find the Standard Deviation of a random variable X whose probability density function is given by f(x) where: Solution. develop the theory, we will focus our attention on examples. Listed in the following table are problem sets and solutions. P(AjB) is read The probability of A given B. a Show that $$f\left( x \right)$$ is a probability density function. The mean is $100(7) + 200(4) = 1,500$ and the standard deviation is. Walpole Raymond H. The probability distribution given is discrete and so we can find the variance from the following: We need to find the mean μ first: Then we find the variance: Example 2. Instead of events being labeled A and B, the norm is to use X and Y. EXAMPLE: Suppose that three slips of paper have the names a, b, c. Here different types of examples will help the students to understand the problems on probability with playing cards. Plus, get practice tests, quizzes, and personalized coaching to help | {
"domain": "minoronzitti.it",
"id": null,
"lm_label": "1. YES\n2. YES\n\n",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9828232924970204,
"lm_q1q2_score": 0.8556432605768571,
"lm_q2_score": 0.8705972549785201,
"openwebmath_perplexity": 428.6329198709035,
"openwebmath_score": 0.7154899835586548,
"tags": null,
"url": "http://vnbk.minoronzitti.it/probability-examples-and-solutions.html"
} |
probability with playing cards. Plus, get practice tests, quizzes, and personalized coaching to help you succeed. Return from Examples of Probability Problems to Free Math Videos Online or to 8th Grade CTCT Math. The geometric probability is the area of the desired region (or in this case, not so desired), divided by the area of the total region. com Jobs & Careers 874,804 views 6:57. com or just starting a probability unit, you may want to take a look at the introductory probability lesson or the lesson on independent events. We randomly select 5 balls. Readers with a solid background in measure theory can skip Sections 1. random variables that take a discrete set of values. Kroese School of Mathematics and Physics The University of Queensland c 2018 D. Conditional probability is the probability of one event occurring with some relationship to one or more other events. This solutions manual provides answers for the even-numbered exercises in Probability and Statistical Inference, 8th edition, by Robert V. It is also suitable for self-study. Probability and statistics, the branches of mathematics concerned with the laws governing random events, including the collection, analysis, interpretation, and display of numerical data. If it isn't a trick coin, the probability of each simple outcome is the same. Example: toss a coin 100 times, how many Heads will come up? Probability says that heads have a ½ chance, so we can expect 50 Heads. Bonferroni's inequalities28 9. All Chapter 25 - Probability Exercise Questions with Solutions to help you to revise complete Syllabus and Score More marks. For example activity H here, we have the same exact thing, expected duration of 3 plus 4 times 6 plus 9 all divided by 6 to give you 6. Answers and links to explanations to these these GMAT probability problems are at the end of set. com or just starting a probability unit, you may want to take a look at the introductory probability lesson or the lesson on independent events. | {
"domain": "minoronzitti.it",
"id": null,
"lm_label": "1. YES\n2. YES\n\n",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9828232924970204,
"lm_q1q2_score": 0.8556432605768571,
"lm_q2_score": 0.8705972549785201,
"openwebmath_perplexity": 428.6329198709035,
"openwebmath_score": 0.7154899835586548,
"tags": null,
"url": "http://vnbk.minoronzitti.it/probability-examples-and-solutions.html"
} |
may want to take a look at the introductory probability lesson or the lesson on independent events. mathematics of probability theory, but also, through numerous examples, the many diverse possible applications of this subject. As we study a few probability problems, I will explain how "replacement" allows the events to be independent of each other. Probability calculator is a online tool that computes probability of selected event based on probability of other events. A life insurance salesman sells on the average 3 life insurance policies per week. These NCERT solutions play a. What is the probability to get a 6 when you roll a die? A die has 6 sides, 1 side contain the number 6 that give us 1 wanted outcome in 6 possible outcomes. Problems like those Pascal and Fermat solved continuedto influence such early researchers as Huygens, Bernoulli, and DeMoivre in establishing a mathematical theory of probability. Probability Distribution: A probability distribution is a statistical function that describes all the possible values and likelihoods that a random variable can take within a given range. Ma 162 Spring 2010 Ma 162 Spring 2010 April 21, 2010 Problem 1. It is known that probability that a randomly selected student who plays football also plays baseball is 0. Example: At a car park there are 100 vehicles, 60 of which are cars, 30 are vans and the remainder are lorries. The general situation, then, is the following: given a sequence of random variables,. probability with a view toward data science applications. Probability is finding the possible number of outcomes of the event occurrence. On infinite sums19 6. Suppose you toss a fair coin. the basic concepts of a probability model and the axioms commonly assumed of probability models. Conditional Probability Homework Solutions 1. Example: the probability that a card is a four and red =p(four and red) = 2/52=1/26. This problem asked us to find some probabilities involving a spinner. You can think of this as a | {
"domain": "minoronzitti.it",
"id": null,
"lm_label": "1. YES\n2. YES\n\n",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9828232924970204,
"lm_q1q2_score": 0.8556432605768571,
"lm_q2_score": 0.8705972549785201,
"openwebmath_perplexity": 428.6329198709035,
"openwebmath_score": 0.7154899835586548,
"tags": null,
"url": "http://vnbk.minoronzitti.it/probability-examples-and-solutions.html"
} |
This problem asked us to find some probabilities involving a spinner. You can think of this as a binomial with all failures. Spector and Mazzeo examined the effect of a teaching method known as PSI on the performance of students in a course, intermediate macro economics. a) We first construct a tree diagram to represent all possible distributions of boys and girls in the family. Example Questions Using Probability Formulas. If every vehicle is equally likely to leave, find the probability of: a) van leaving first. Probability can be expressed in a variety of ways including a mathematically formal way such as using percentages. Since there are 13 spades in the deck, the probability of drawing a spade is. (a) In how many ways can a committee of five consisting of 3 girls and 2 boys be chosen? (b) What is the probability that a committee of five, chosen at random from the class, consists of three girls and two boys? (c) How many of the possible committees of five have no boys?(i. Instructors may obtain all of the solutions by writing to either of the authors, at [email protected] For example, the length of time a person waits in line at a checkout counter or the life span of a light bulb. Example of Binomial Distribution and Probability This Tutorial will explain the Binomial Distribution, Formula, and related Discrete Probabilities Suppose you toss a coin over and over again and each time you can count the number of “Heads” you get. Just keep in mind that what conditional probability does for us is to adjust the denominator of our probability fraction to account for what we KNOW has already occurred. Probability is a branch of mathematics, and a lot of people have trouble with math. A college survey shows that 10% of freshmen, 15% of sophomores, 60% of juniors, and 85% of seniors like Probability. Compound event – an event with more than one outcome. Sometimes it can be computed by discarding part of the sample space. Sketch a graph. A first look at rigorous probability | {
"domain": "minoronzitti.it",
"id": null,
"lm_label": "1. YES\n2. YES\n\n",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9828232924970204,
"lm_q1q2_score": 0.8556432605768571,
"lm_q2_score": 0.8705972549785201,
"openwebmath_perplexity": 428.6329198709035,
"openwebmath_score": 0.7154899835586548,
"tags": null,
"url": "http://vnbk.minoronzitti.it/probability-examples-and-solutions.html"
} |
by discarding part of the sample space. Sketch a graph. A first look at rigorous probability theory. This situation and all the problems any student faces nowadays became a reason to find a solution and create a website where students could find college homework help for the price they could afford. The meaning (interpretation) of probability is the subject of theories of probability. Exercises with both a short answer and a full solution are marked with and those with only a short answer are marked with (when more appropriate, for example, in "Show that " exercises, the short answer provides a hint to the key step). Example 2: Coin-A is tossed 200 times, and the relative occurrence of Tails is 0. Instead, we can usually define the probability density function (PDF). You can also get free sample papers, Notes, Important Questions. If it was, the probability of picking a red ball (etc. Theory of Probability (MATH230A/STAT310A, Fall 2007/08) The first quarter in a yearly sequence of probability theory. Identifying when a probability is a conditional probability in a word problem. , 10 trials), and the probability of getting "heads" was 0. This is COMPLETE Solution Manual for Probability and Statistics for Engineers and Scientists, 9th edition Ronald E. Find the z-scores that correspond to 33 minutes and 60 minutes. This presentation will be about examples of this form of mathematics in real life. The left side of the binomial probability function is written f(3|10,0. To determine whether to accept the shipment of bolts,the manager of the facility randomly selects 12 bolts. For example, if a traffic management engineer looking at accident rates wishes to. Find the z-scores that correspond to 33 minutes and 60 minutes. Read and learn for free about the following article: Conditional probability and independence If you're seeing this message, it means we're having trouble loading external resources on our website. For example, one way to partition S is to break into sets F | {
"domain": "minoronzitti.it",
"id": null,
"lm_label": "1. YES\n2. YES\n\n",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9828232924970204,
"lm_q1q2_score": 0.8556432605768571,
"lm_q2_score": 0.8705972549785201,
"openwebmath_perplexity": 428.6329198709035,
"openwebmath_score": 0.7154899835586548,
"tags": null,
"url": "http://vnbk.minoronzitti.it/probability-examples-and-solutions.html"
} |
external resources on our website. For example, one way to partition S is to break into sets F and Fc, for any event F. Solution: No, we cannot, because the experiment (tossing the coin) may have been repeated a very small number of times, and thus the relative occurrence in such a scenario will not give the true probability. Free PDF download of NCERT Solutions for Class 10 Maths Chapter 15 - Probability solved by Expert Teachers as per NCERT (CBSE) Book guidelines. Exercise :: Probability - General Questions. We write P(AjB) = the conditional probability of A given B. Example: The door prize at a party with 25 people is given by writing numbers 1 through 25 on the bottom of the paper plates used. If a woman does not have breast cancer, the probability is 7 percent that she will still have a positive mammogram. n (E) = Number of ways of drawing 2 balls out of (2 + 3) balls. For Example, cancer is related to age, and then using Bayes theorem, a person’s age can be used to more accurately assess the probability that they have cancer, compared to the assessment of the probability of cancer made without knowledge of the person’s age. The coin toss is nothing but experimenting with tossing a coin. Spector and Mazzeo examined the effect of a teaching method known as PSI on the performance of students in a course, intermediate macro economics. Consider the coin flip experiment described above. Example: If a dice is thrown twice, find the probability of getting two 5's. Solution to Example 1. Theoretical probability is an approach that bases the possible probability on the possible chances of something happen. Probability and playing cards is an important segment in probability. Also, remember that you are comparing the number of ways the outcome can occur to the number of ways the outcome cannot occur (not the total outcomes). In statistics, the normal distributions are used to represent real-valued random variables with unknown distributions. If the joint probability of | {
"domain": "minoronzitti.it",
"id": null,
"lm_label": "1. YES\n2. YES\n\n",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9828232924970204,
"lm_q1q2_score": 0.8556432605768571,
"lm_q2_score": 0.8705972549785201,
"openwebmath_perplexity": 428.6329198709035,
"openwebmath_score": 0.7154899835586548,
"tags": null,
"url": "http://vnbk.minoronzitti.it/probability-examples-and-solutions.html"
} |
to represent real-valued random variables with unknown distributions. If the joint probability of relaxed import restrictions and a price war is 0. Then we can apply the appropriate Addition Rule: Addition Rule 1: When two events, A and B, are mutually exclusive, the probability that A or B will occur is the sum of the probability of each event. The probability of a sample point is a measure of the likelihood that the sample point will occur. GMAT Advanced Probability Problems By Mike MᶜGarry on January 3, 2014 , UPDATED ON October 30, 2015, in GMAT Math In the following probability problems, problems #1-3 function as a set, problems #4-5 are another set, and problems #6-7 are yet another set. Normal Distribution Examples and Solutions. A probability distribution is a table or an equation that links each outcome of a statistical experiment with its probability of occurrence. Student's Solutions Guide for Introduction to Probability, Statistics, and Random Processes by Hossein Pishro-Nik | Jun 20, 2016 4. The series would last at most 4 games before either Team A wins two games or loses (to Team B) three games. troductory engineering courses in probability theory. P(freshman or sophomore) = 30/101 + 41/101 = 71/101. Coin-B is tossed an unknown number of times, but it. Thus the marginal probability distribution for A gives A's probabilities unconditional on B, in a margin of the table. The function f ( x ) is called a probability density function for the continuous random variable X where the total area under the curve bounded by the x -axis is equal to `1. Instead, we can usually define the probability density function (PDF). Formula for the probability of A and B (independent events): p(A and B) = p(A) * p(B). The problem is: we want 1 novel and 1 reference work, but we don’t care which one was picked first. 1 of the bags is selected at random and a ball is drawn from it. Probability distributions can, however, be applied to grouped random variables which gives rise | {
"domain": "minoronzitti.it",
"id": null,
"lm_label": "1. YES\n2. YES\n\n",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9828232924970204,
"lm_q1q2_score": 0.8556432605768571,
"lm_q2_score": 0.8705972549785201,
"openwebmath_perplexity": 428.6329198709035,
"openwebmath_score": 0.7154899835586548,
"tags": null,
"url": "http://vnbk.minoronzitti.it/probability-examples-and-solutions.html"
} |
it. Probability distributions can, however, be applied to grouped random variables which gives rise to joint probability distributions. We can write this statement mathematically as follows: P(10≤ X ≤ 20) =. Durrett Probability: Theory and Examples 4th Edition. This solution contains questions, answers, images, explanations of the complete Chapter 15 titled Probability of Maths taught in Class 10. In probability theory and applications, Bayes' theorem shows the relation between a conditional probability and its reverse form. In the National Lottery, 6 numbers are chosen from 49. In what follows, S is the sample space of the experiment in question and E is the event of interest. You use probability in daily life to make decisions when you don't know for sure what the outcome will be. All Probability Exercise Questions with Solutions to help you to revise complete Syllabus and Score More marks. Distributions 3. On infinite sums19 6. The graphs below show the radial wave functions. July 1, 2015. Therefore, both the events will have half probability. Binomial distribution problems for practice Binomial distribution practice problems Binomial distribution problem 1 Question (Binomial distribution problems): Expected value of a binomial random variable X is 10 and the probability of. We always give back probability in to all our clients, whether you are our long-term client or simply ordering for the first time. It is assessed by considering the event's certainty as 1 and impossibility as 0. We try to provide all types of shortcut tricks on probability problem on balls here. An event is an occurrence that can be determined by a given level of certainty. It includes the list of lecture topics, lecture video, lecture slides, readings, recitation problems, recitation help videos, tutorials with solutions, and a problem set with solutions. Introduction: Probability (from the Latin probare to prove, or to test) is a number between zero and one that shows how likely a certain | {
"domain": "minoronzitti.it",
"id": null,
"lm_label": "1. YES\n2. YES\n\n",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9828232924970204,
"lm_q1q2_score": 0.8556432605768571,
"lm_q2_score": 0.8705972549785201,
"openwebmath_perplexity": 428.6329198709035,
"openwebmath_score": 0.7154899835586548,
"tags": null,
"url": "http://vnbk.minoronzitti.it/probability-examples-and-solutions.html"
} |
Latin probare to prove, or to test) is a number between zero and one that shows how likely a certain event is. Probability distribution tables In this tutorial I show you how to construct probability distribution tables for a discrete random variable for three different type examples. Such random variables generally take a finite set of values (heads or tails, people who live in London, scores on an IQ test), but they can also include random. If the ball drawn is red, find the probability that it is drawn from the third bag. There are six ways to roll a 7 and two ways to roll an 11, so the probability of a natural is (6 + 2)/36 = 8/36 = 2/9. Scroll down the page for more examples and solutions of word problems that involve the probability of independent events. 11 If we toss a coin 1000 times and find that it comes up heads 532 times, we estimate the probability of a head coming up to be 532 1000 0. Binomial distribution problems for practice Binomial distribution practice problems Binomial distribution problem 1 Question (Binomial distribution problems): Expected value of a binomial random variable X is 10 and the probability of. An urn contains 5 red balls and 2 green balls. These NCERT solutions play a. This Aptitude Test Questions sections presents "Probability" solved problems. If it was, the probability of picking a red ball (etc. Examples of using the formula to find conditional probability In some situations, you will need to use the following formula to find a conditional probability. \ 1 P(5) 6 =. This sampling method is based on the fact that every member in the population has an equal chance of getting selected. What is the probability that the survey will show a greater percentage of. in Teachers. Distributions 3. probability of the event given that the other event has occurred. You can find several more examples here: Probability of A and B. 5L; also, on c, be careful about using the same set sizes to calculate the probability that the second student | {
"domain": "minoronzitti.it",
"id": null,
"lm_label": "1. YES\n2. YES\n\n",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9828232924970204,
"lm_q1q2_score": 0.8556432605768571,
"lm_q2_score": 0.8705972549785201,
"openwebmath_perplexity": 428.6329198709035,
"openwebmath_score": 0.7154899835586548,
"tags": null,
"url": "http://vnbk.minoronzitti.it/probability-examples-and-solutions.html"
} |
on c, be careful about using the same set sizes to calculate the probability that the second student is taking a language class, since you’ve already chosen the first. An examples from ecology: How are species abundance estimates determined from small samples? To summarize: There are at least two uses for statistics and probability in the life sciences. Statistics Solutions is the country’s leader in probability and dissertation statistics. Statistics Solutions is the country's leader in probability and dissertation statistics. In other words, it is used to calculate the probability of an event based on its association with another event. problems included are about: probabilities, mutually exclusive events and addition formula of probability, combinations, binomial distributions, normal distributions, reading charts. In what follows, S is the sample space of the experiment in question and E is the event of interest. The mathematical and probability models of lottery provide information that players should know before they launch into a long-run play. Independence of three or more events34 12. 12 that she has exactly these two risk factors (but not the other). Probability concept includes some terms. It is less than 10 dollar. A team with equal numbers of men and women will have three men and three women. Binomial Distribution. P(AjB) is read The probability of A given B. 7) Anita randomly picks 4 cards from a deck of 52-cards and places them back into the deck ( Any set of 4 cards is equally likely ). Hoping that the book would be a useful reference for people who apply probability in their work, we have tried to emphasize the results that are important for applications, and illustrated their use with roughly 200 examples. org are unblocked. Step-by-step solutions provided. Student's Solutions Guide for Introduction to Probability, Statistics, and Random Processes - Kindle edition by Hossein Pishro-Nik. Student's Solutions Guide for Introduction to Probability, | {
"domain": "minoronzitti.it",
"id": null,
"lm_label": "1. YES\n2. YES\n\n",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9828232924970204,
"lm_q1q2_score": 0.8556432605768571,
"lm_q2_score": 0.8705972549785201,
"openwebmath_perplexity": 428.6329198709035,
"openwebmath_score": 0.7154899835586548,
"tags": null,
"url": "http://vnbk.minoronzitti.it/probability-examples-and-solutions.html"
} |
- Kindle edition by Hossein Pishro-Nik. Student's Solutions Guide for Introduction to Probability, Statistics, and Random Processes by Hossein Pishro-Nik | Jun 20, 2016 4. Plus, get practice tests, quizzes, and personalized coaching to help you succeed. Introduction to Probability with Examples and Solutions Probability is a section of math that is essential in various aspects of life. The number of rainy days, Xcan be represented by a binomial distribution with n= 31trials (the number of days in the month of October), success probability p= 0:16(representing a rainy day) and failure probability q= 1 p= 0:84. It is not too much to say that the path of mastering statistics and data science starts with probability. Discrete probability distributions give the probability of getting a certain value for a discrete random variable. Visitors are requested to carefully read all shortcut examples. A simple example is the tossing of a fair (unbiased) coin. The pictures below depict the probability distributions in space for the Hydrogen wavefunctions. Binomial probability concerns itself with measuring the probability of outcomes of what are known as Bernoulli Trials, trials that are independent of each other and that are binary — with two possible outcomes. What is the probability of the occurrence of a number that is odd or less than 5 when a fair die is rolled. The results are summarised in the table below. The concept is very similar to mass density in physics: its unit is probability per unit length. There are two ways for it to win in three games: LWW or WLW; both occur with probability 1/8 so that the probability that Team A wins in exactly 3 games is also 1/4. In probability theory and applications, Bayes' theorem shows the relation between a conditional probability and its reverse form. Anyone has the right to use this work for any purpose, without any conditions, unless such conditions are required by law. Random Variables 4. So the probability of getting 2 blue | {
"domain": "minoronzitti.it",
"id": null,
"lm_label": "1. YES\n2. YES\n\n",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9828232924970204,
"lm_q1q2_score": 0.8556432605768571,
"lm_q2_score": 0.8705972549785201,
"openwebmath_perplexity": 428.6329198709035,
"openwebmath_score": 0.7154899835586548,
"tags": null,
"url": "http://vnbk.minoronzitti.it/probability-examples-and-solutions.html"
} |
unless such conditions are required by law. Random Variables 4. So the probability of getting 2 blue marbles is: And we write it as "Probability of event A and event B equals the probability of event A times the probability of event B given event A" Let's do the next example using only notation:. Examples involving conditional probability Math 30530, Fall 2013 September 5, 2013 Math 30530(Fall 2012) Conditional examples September 5, 20131 / 5. Both the classical and frequency approaches have serious drawbacks, the first because the words "equally. For any two of the three factors, the probability is 0. example, what probability should we assign to the customer choosing soup and then the meat? If 8/10 of the customers choose soup and then 1/2 of these choose meat, a proportion 8=10 ¢1=2=4=10 of the customers choose soup and then meat. b) Find the mean and standard deviation of X. We provide examples on Probability problem on Balls shortcut tricks here in this page below. When we flip a coin there is always a probability to get a head or a tail is 50 percent. Joint Probability Distributions. Read and learn for free about the following article: Conditional probability and independence If you're seeing this message, it means we're having trouble loading external resources on our website. It provides mathematically complete proofs of all the essential introductory results of probability and measure theory. It shows the exact probabilities for a particular value of the random variable. This presentation will be about examples of this form of mathematics in real life. This is typically possible when a large number of random effects cancel each other out, so some limit is involved. Conditional probability and independence31 11. The probability distribution given is discrete and so we can find the variance from the following: We need to find the mean μ first: Then we find the variance: Example 2. Genetics for Probability To provide a scientific context for our probability | {
"domain": "minoronzitti.it",
"id": null,
"lm_label": "1. YES\n2. YES\n\n",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9828232924970204,
"lm_q1q2_score": 0.8556432605768571,
"lm_q2_score": 0.8705972549785201,
"openwebmath_perplexity": 428.6329198709035,
"openwebmath_score": 0.7154899835586548,
"tags": null,
"url": "http://vnbk.minoronzitti.it/probability-examples-and-solutions.html"
} |
variance: Example 2. Genetics for Probability To provide a scientific context for our probability problems, we will use examples from genetics. Chapter 5: Normal Probability Distributions - Solutions Note: All areas and z-scores are approximate. Suppose you are a teacher at a university. Probability can be expressed in a variety of ways including a mathematically formal way such as using percentages. The solutions to these problems are at the bottom of the page. Formula sheet also available. However, there is a probability greater than zero than X. In addition, there are 6 outcomes that. A random variable, X, is a function from the sample space S to the real. Chapter 5: Normal Probability Distributions - Solutions Note: All areas and z-scores are approximate. Compound event – an event with more than one outcome. Find the Standard Deviation of a random variable X whose probability density function is given by f(x) where: Solution. Explore more on other related concepts @ BYJU'S. Suppose the reaction times of teenage drivers are normally distributed with a mean of 0. This course will guide you through the most important and enjoyable ideas in probability to help you cultivate a more quantitative worldview. Compute the probability of randomly drawing five cards from a deck and getting exactly two Aces. Plus, get practice tests, quizzes, and personalized coaching to help you succeed. You win if the 6 balls you pick match the six balls selected by the machine. Schaum's Outline of Probability and Statistics EXAMPLE 2. It provides mathematically complete proofs of all the essential introductory results of probability and measure theory. Suppose a simple random sample of 100 voters are surveyed from each state. \ 1 P(5) 6 =. And then in the next segment we'll look at Bayes theorem. Applied Problem Solving in a Workplace Contents Introduction 5 Theme A – Approaches to problem Solving 6 Recognising Complex Problems 6 Activity 1a Identifying complex problems. Therefore, both | {
"domain": "minoronzitti.it",
"id": null,
"lm_label": "1. YES\n2. YES\n\n",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9828232924970204,
"lm_q1q2_score": 0.8556432605768571,
"lm_q2_score": 0.8705972549785201,
"openwebmath_perplexity": 428.6329198709035,
"openwebmath_score": 0.7154899835586548,
"tags": null,
"url": "http://vnbk.minoronzitti.it/probability-examples-and-solutions.html"
} |
Solving 6 Recognising Complex Problems 6 Activity 1a Identifying complex problems. Therefore, both the events will have half probability. Enter the trials, probability, successes, and probability type. 5th edition correct mistakes in previous editions and has some more beautiful examples. This means that the probability of the coin landing on heads would be ½. A sample space (S) is a non empty set whose elements are called outcomes. The results are summarised in the table below. Ma 162 Spring 2010 Ma 162 Spring 2010 April 21, 2010 Problem 1. Independence 2. Probability: Theory and Examples Solutions Manual The creation of this solution manual was one of the most important im-provements in the second edition of Probability: Theory and Examples. What is the probability that a randomly chosen person in the class will weigh more than 160 lbs. • Probability of an event E = p(E) = (number of favorable outcomes of E)/(number of total outcomes in the sample space) This approach is also called theoretical probability. Solution; Determine the value of $$c$$ for which the function below will be a probability density function. This lesson describes how hypergeometric random variables, hypergeometric experiments, hypergeometric probability, and the hypergeometric distribution are all related. What is the probability that an. ©The McGraw-Hill Companies, Inc. The solutions given to the questions for the in between exercises and exercises given at the end of the chapter are prepared by our subject matter experts in a simple and lucid language. Answers and links to explanations to these these GMAT probability problems are at the end of set. Show that the solution $$X_t$$ of SDE examples, Stochastic Calculus The Probability Workbook is powered by WordPress at Duke WordPress Sites. Theoretical probability is an approach that bases the possible probability on the possible chances of something happen. P(B|A) is also called the "Conditional Probability" of B given A. We randomly select 5 | {
"domain": "minoronzitti.it",
"id": null,
"lm_label": "1. YES\n2. YES\n\n",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9828232924970204,
"lm_q1q2_score": 0.8556432605768571,
"lm_q2_score": 0.8705972549785201,
"openwebmath_perplexity": 428.6329198709035,
"openwebmath_score": 0.7154899835586548,
"tags": null,
"url": "http://vnbk.minoronzitti.it/probability-examples-and-solutions.html"
} |
happen. P(B|A) is also called the "Conditional Probability" of B given A. We randomly select 5 balls. 1-9 A red die has face numbers {2, 4, 7, 12, 5, 11}. Here $Y=g(X)$, where $g$ is a differentiable function. E 2 = students in the debating team. 7) Anita randomly picks 4 cards from a deck of 52-cards and places them back into the deck ( Any set of 4 cards is equally likely ). If it isn't a trick coin, the probability of each simple outcome is the same. Students can get a fair idea on the probability questions which are provided with the detailed step-by-step answers to every question. Solution: No, we cannot, because the experiment (tossing the coin) may have been repeated a very small number of times, and thus the relative occurrence in such a scenario will not give the true probability. 2 Normal Distributions: Finding Probabilities If you are given that a random variable Xhas a normal distribution, nding probabilities. How is Chegg Study better than a printed A First Course In Probability 9th Edition student solution manual from the bookstore? Our interactive player makes it easy to find solutions to A First Course In Probability 9th Edition problems you're working on - just go to the chapter for your book. For this example, since the mean is 8 and the question pertains to 11 fires. All Probability Exercise Questions with Solutions to help you to revise complete Syllabus and Score More marks. | {
"domain": "minoronzitti.it",
"id": null,
"lm_label": "1. YES\n2. YES\n\n",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9828232924970204,
"lm_q1q2_score": 0.8556432605768571,
"lm_q2_score": 0.8705972549785201,
"openwebmath_perplexity": 428.6329198709035,
"openwebmath_score": 0.7154899835586548,
"tags": null,
"url": "http://vnbk.minoronzitti.it/probability-examples-and-solutions.html"
} |
# Logarithmic Differentiation for Multivariable functions?
I was wondering if, and how exactly logarithmic differentiation may be applied to a multivariate function.
For example, I have been working with the function
$$f(x,y)=\frac{x-y}{x+y}$$
Does the following process hold? Specifically, does the chain rule step with del f hold?
$$\ln(f(x,y))=\ln(x-y)-\ln(x+y)$$
$$\Rightarrow \frac{1}{f(x,y)} \nabla f = \langle \frac{2y}{x^2-y^2} , \frac{-2x}{x^2-y^2} \rangle$$
Solving for $\nabla f$, does give me the correct answer. I'm wondering is my notation would be correct, and if this will ever not work.
Thanks for any help.
• If you are ok, you can accept the answer and set as solved. Thanks! – user Jan 4 '18 at 20:17
You define
$$g(x,y)=\ln(f(x,y))=\ln(x-y)-\ln(x+y)$$
and thus
$$\nabla g=\left(\frac{1}{f(x,y)}f_x,\frac{1}{f(x,y)}f_y\right)=\frac{1}{f(x,y)}\left(f_x,f_y\right)=\frac{1}{f(x,y)}\nabla f$$
• Ahhh, Okay, this seems very obvious now. Sorry if that was a dumb question. Thank you. – Kyle B Jan 3 '18 at 22:15
• @KyleB You are welcome! Bye – user Jan 3 '18 at 22:22
You could take a simpler function and checked whether it holds. The usual differentiation rules hold true for the gradient as well: sum, difference, product and quotient. For instance, $\nabla(fg)=g\nabla f+f\nabla g$, $\nabla(\frac{f}{g})=\frac{g\nabla f-f\nabla g}{g^2}$, $\nabla(\ln f)=\frac{\nabla f}{f}$.
Yes I really believe your result as well as your notation are correct. May be you just need to put it in a more general setting. I would suggest you to proceed as follows.
Suppose that $f:\mathbb{R}^n\to\mathbb{R}$, which is differentiable and strictly positive in a certain open set $U\subset\mathbb{R}^n$. Then the function $F=\ln\circ f$ is also differntiable on $U$ with: $\nabla F(x)=\ln'(f(x))\cdot \nabla f(x)=\frac{1}{f(x)}\cdot\nabla f(x)$ (chain rule). Hence we can solve for $\nabla f(x)$, as we are in vector space $\mathbb{R}^n$ and get the answer right. | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9848109494088427,
"lm_q1q2_score": 0.8556301307411661,
"lm_q2_score": 0.868826784729373,
"openwebmath_perplexity": 249.26760286003292,
"openwebmath_score": 0.9340419173240662,
"tags": null,
"url": "https://math.stackexchange.com/questions/2590898/logarithmic-differentiation-for-multivariable-functions"
} |
Remember the chain rule statement: If $G$ and $H$ are differentianble functions and $F=H\circ G$ is well defined, then $F$ is also differentiable with $\nabla F(x)=\nabla H(G(x))\cdot\nabla G(x)$. | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9848109494088427,
"lm_q1q2_score": 0.8556301307411661,
"lm_q2_score": 0.868826784729373,
"openwebmath_perplexity": 249.26760286003292,
"openwebmath_score": 0.9340419173240662,
"tags": null,
"url": "https://math.stackexchange.com/questions/2590898/logarithmic-differentiation-for-multivariable-functions"
} |
# Math Help - Complex roots of a quadratic equation
1. ## Complex roots of a quadratic equation
The question:
Use the properties of the complex conjugate to show that if the complex number 'z' is a root of a quadratic equation $ax^2 + bx + c = 0$ with a, b, c being real coefficients, then so is the conjugate of 'z'.
My attempt:
Let z = $z_{1} \pm z_2i$
$\frac{-b \pm \sqrt{b^2 - 4ac}}{2a} = z_{1} \pm z_2i$
$\frac{1}{2a}(-b \pm \sqrt{b^2 - 4ac}) = z_{1} \pm z_2i$
Basically, I changed the quadratic formula to look like a complex number in Cartesian form. Is this an acceptable answer? My textbook doesn't have solutions for 'show' and 'prove' questions.
Thanks!
2. The roots of $ax^2 + bx + c = 0$ are
$x = \frac{-b \pm \sqrt{b^2 - 4ac}}{2a}$.
If $b^2 - 4ac < 0$ then that means $\sqrt{b^2 - 4ac}$ is imaginary. So we can say $\sqrt{b^2 - 4ac} = ni$, where $n$ is some multiple of $i$.
So $x = \frac{-b \pm n i}{2a}$
$= -\frac{b}{2a} \pm \left(\frac{n}{2a}\right)i$.
So the two roots are complex conjugates.
3. Ahh, thanks. So would my solution be acceptable, or should I simplify it like yours?
4. Originally Posted by Glitch
Ahh, thanks. So would my solution be acceptable, or should I simplify it like yours?
To be honest, I can't really follow your solution...
5. It's pretty much the same as yours, except you replaced the square root with 'ni'. I was trying to show that the general form of a complex number is equivalent to a simplified quadratic formula.
6. Originally Posted by Glitch
The question:
Use the properties of the complex conjugate to show that if the complex number 'z' is a root of a quadratic equation $ax^2 + bx + c = 0$ with a, b, c being real coefficients, then so is the conjugate of 'z'.
The standard way of proving the is to use properties of the complex conjugate.
If $a$ is a real number then $\overline{a}=a$.
The conjugate of a sum is the sum of conjugates.
Therefore we have: | {
"domain": "mathhelpforum.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.984810949854636,
"lm_q1q2_score": 0.855630126111154,
"lm_q2_score": 0.8688267796346599,
"openwebmath_perplexity": 286.72099066278463,
"openwebmath_score": 0.9516220092773438,
"tags": null,
"url": "http://mathhelpforum.com/pre-calculus/152372-complex-roots-quadratic-equation.html"
} |
$\overline {az^2 + bz + c} = \overline 0 = 0\, \Rightarrow \,a\overline z ^2 + b\overline z + c = 0$
7. Originally Posted by Glitch
The question:
Use the properties of the complex conjugate to show that if the complex number 'z' is a root of a quadratic equation $ax^2 + bx + c = 0$ with a, b, c being real coefficients, then so is the conjugate of 'z'.
My attempt:
Let z = $z_{1} \pm z_2i$
$\frac{-b \pm \sqrt{b^2 - 4ac}}{2a} = z_{1} \pm z_2i$
$\frac{1}{2a}(-b \pm \sqrt{b^2 - 4ac}) = z_{1} \pm z_2i$
But at this point you haven't yet said that $\sqrt{b^2- 4ac}$ is an imaginary number!
Basically, I changed the quadratic formula to look like a complex number in Cartesian form. Is this an acceptable answer? My textbook doesn't have solutions for 'show' and 'prove' questions.
Thanks!
8. Originally Posted by Plato
The standard way of proving the is to use properties of the complex conjugate.
If $a$ is a real number then $\overline{a}=a$.
The conjugate of a sum is the sum of conjugates.
Therefore we have:
$\overline {az^2 + bz + c} = \overline 0 = 0\, \Rightarrow \,a\overline z ^2 + b\overline z + c = 0$
...and it is true for every polynomial...
9. Fair point. So if I add:
When $b^2 - 4ac < 0$, $\sqrt{b^2 - 4ac} = ni, n \in R$
And replace the square root with the imaginary part 'n', would that suffice?
10. Hello, Glitch!
I have a very primitive solution . . .
Use the properties of the complex conjugate to show that
if the complex number $z$ is a root of a quadratic equation
$f(x) \:=\:ax^2 + bx + c = 0$ with $a, b, c$ real coefficients,
then so is the conjugate of $z.$
We are told that $z \:=\:p + qi$ is a solution of the quadratic.
. . Hence: . $a(p+qi)^2 + b(p+qi) + c \:=\:0$
This simplifies to: . $(ap^2 - aq^2 + bp + c) + q(2ap + b)i \;=\;0$
. . And we have: . $\begin{Bmatrix}ap^2 - aq^2 + bp + c \;=\;0 \\ q(2ap + b) \;=\;0 \end{Bmatrix}$
The conjugate of $z$ is: . $\overline z \:=\:p - qi$
Consider $f(\overline z) \;=\;a(p-qi)^2 + b(p-qi) + c$ | {
"domain": "mathhelpforum.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.984810949854636,
"lm_q1q2_score": 0.855630126111154,
"lm_q2_score": 0.8688267796346599,
"openwebmath_perplexity": 286.72099066278463,
"openwebmath_score": 0.9516220092773438,
"tags": null,
"url": "http://mathhelpforum.com/pre-calculus/152372-complex-roots-quadratic-equation.html"
} |
Consider $f(\overline z) \;=\;a(p-qi)^2 + b(p-qi) + c$
. . . . . . . $f(\overline z) \;=\;\underbrace{(ap^2 - aq^2 + bp + c)}_{\text{This is 0}} - \underbrace{q(2ap + b)}_{\text{This is 0}}i$
$\text{Therefore: }\:f(\overline z) \,=\,0\:\text{ and }\:\overline z\text{ is also a solution.}$ | {
"domain": "mathhelpforum.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.984810949854636,
"lm_q1q2_score": 0.855630126111154,
"lm_q2_score": 0.8688267796346599,
"openwebmath_perplexity": 286.72099066278463,
"openwebmath_score": 0.9516220092773438,
"tags": null,
"url": "http://mathhelpforum.com/pre-calculus/152372-complex-roots-quadratic-equation.html"
} |
# How to find precise value in terms of $\pi$
I've some argument like:
$$\arctan(\sqrt3 + 2)$$ and as explained here How to calculate $\arctan(\sqrt3-2)$ to be $-15°$ by hand? i made an assumption and found that it should be $\frac{5\pi}{12}$. I found the exact value of $\sqrt3 + 2$ then by table i found it's equal to $\tan(75^{\circ})$ and finally i found $\arctan(\tan(75^{\circ}))$ But what if i have something more complicated to do assumption on like:
$$\arccos({\frac{\sqrt{\sqrt3+2}}{2}})$$
So i'm interesting if there is any sequence of operations on argument itself to convert it into fraction of $\pi$ without guessing about how many it should be?
The best bet is to "unravel" the expression, try to simplify it by getting rid of roots and recognizing patterns:
$$\phi=\arccos\frac{\sqrt{\sqrt{3}+2}}{2}$$ $$\cos\phi=\frac{\sqrt{\sqrt{3}+2}}{2}$$ $$4\cos^2\phi=\sqrt{3}+2$$ $$2(2\cos^2\phi-1)=\sqrt{3}$$ $$2\cos2\phi=\sqrt{3}$$ $$\cos2\phi=\frac{\sqrt{3}}{2}$$ $$2\phi=\arccos\frac{\sqrt3}{2}=\frac{\pi}{6}$$ $$\phi=\frac{\pi}{12}$$
You'll always get some sort of polynomial in trigonometric functions. The goal is to reduce the degree of polynomial by using multiple angle formulas. If you don't recognize them yourself, you can take a look at Chebyshev polynomials of the first kind which tell you the multiple angle formulas: $\cos n\phi= T_n(\cos\phi)$. In this case, we recognized $T_2(x)=2x^2-1$.
Depending on how well twisted the expression is, you may have to get creative. There may be more than just multiple angle tricks: possibly, you have to use addition theorems as well, recognizing $\cos(x+y)$ where $x$ and $y$ are not equal, and so on. But the main trick is still just "undoing" the operations that you don't want to see.
• Yes, that's exactly what i was looking for. Thanks a lot! Dec 6 '17 at 9:06
• very nice derivation !
– user
Dec 6 '17 at 9:10
As $2+\sqrt3=\dfrac{(\sqrt3+1)^2}2$ | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9848109503004294,
"lm_q1q2_score": 0.8556301147913687,
"lm_q2_score": 0.8688267677469951,
"openwebmath_perplexity": 178.46067235076143,
"openwebmath_score": 0.8249925374984741,
"tags": null,
"url": "https://math.stackexchange.com/questions/2553562/how-to-find-precise-value-in-terms-of-pi"
} |
As $2+\sqrt3=\dfrac{(\sqrt3+1)^2}2$
$$\dfrac{\sqrt{2+\sqrt3}}2=\dfrac{\sqrt3+1}{2\sqrt2}=\cos30^\circ\cos45^\circ+\sin30^\circ\sin45^\circ=\cos(45^\circ-30^\circ)$$ | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9848109503004294,
"lm_q1q2_score": 0.8556301147913687,
"lm_q2_score": 0.8688267677469951,
"openwebmath_perplexity": 178.46067235076143,
"openwebmath_score": 0.8249925374984741,
"tags": null,
"url": "https://math.stackexchange.com/questions/2553562/how-to-find-precise-value-in-terms-of-pi"
} |
# How to find this limit?
1. Mar 4, 2006
### pivoxa15
Find the limit as (x,y)->(0,0) for (yx^2)/(x^2+y^2)
If do this literally, I get 0/0 hence no limit but a limit does exist for this function. How do I get it? What is the general way to find the limits of multi variable functions?
2. Mar 4, 2006
### VietDao29
Ehh???
Who tells you that 0 / 0 means the limit does not exist there? It's one of the Indeterminate forms.
Generally, to find a limit of a 2 variable function, one can change it to polar co-ordinate, and go from there: $$x = r \cos \alpha \quad \mbox{and} \quad y = r \sin \alpha$$
Now (x, y) -> (0, 0) means that r -> 0, and $$\alpha$$ can take whatever value. So if you can show that when r -> 0, the expression will tend to some value independent of $$\alpha$$, then the limit exists there.
---------------
Example:
$$\lim_{\substack{x \rightarrow 0 \\ y \rightarrow 0}} \frac{x ^ 2 + y ^ 2}{xy}$$
Change it to polar form, we have:
$$\lim_{\substack{x \rightarrow 0 \\ y \rightarrow 0}} \frac{x ^ 2 + y ^ 2}{xy} = \lim_{r \rightarrow 0} \frac{r ^ 2}{r ^ 2 \sin \alpha \cos \alpha} = \lim_{r \rightarrow 0} \frac{1}{\cos \alpha \sin \alpha}$$
That means the limit of that expression does depend on $$\alpha$$, hence the limit does not exist at (0, 0).
Can you get this? :)
3. Mar 4, 2006
### moose
The way I would think about this one is that if x and y are approaching the same thing, why not set y equal to x? That way you would have x^3/2x^2
Now you can think about which one is changing faster, etc.
4. Mar 5, 2006
### pivoxa15
I see. It is clever. Is it the standard way of evaluating multivariable limits? What other ways are there?
5. Mar 5, 2006
### pivoxa15
Your method does not work in most cases.
6. Mar 5, 2006
### devious_ | {
"domain": "physicsforums.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9848109480714625,
"lm_q1q2_score": 0.8556301078374529,
"lm_q2_score": 0.8688267626522814,
"openwebmath_perplexity": 795.0478097083534,
"openwebmath_score": 0.8857300877571106,
"tags": null,
"url": "https://www.physicsforums.com/threads/how-to-find-this-limit.113049/"
} |
5. Mar 5, 2006
### pivoxa15
Your method does not work in most cases.
6. Mar 5, 2006
### devious_
Other ways include approaching the point from various lines, e.g. if you're looking at (x,y) -> (0,0) then sometimes letting (x,y) approach the origin from the x-axis or the y-axis ((x,0) or (y,0)) can help you prove the limit doesn't exist.
7. Mar 5, 2006
### benorin
So we may, upon trying the limit along various curves such as y=x, y=x^2, the x-axis (e.g. y=0), the y-axis (e.g. x=0) which all give the value of the limit to be 0, conjecture the value of the limit to be 0. Now we must prove it:
To prove that $$\lim_{(x,y)\rightarrow (0,0)} \frac{yx ^ 2}{x^2 + y^2}=0,$$ we require that
$$\forall\epsilon >0, \exists \delta >0 \mbox{ such that } 0<\sqrt{x^2 + y^2}<\delta\Rightarrow \left| \frac{yx ^ 2}{x^2 + y^2}-0\right| < \epsilon$$
(and in case you didn't know, the symbol $$\forall$$ is read "for every", the symbol $$\exists$$ is read "there exists", and the symbol $$\Rightarrow$$ is read "implies".)
The proof is this: We will need the following inequality
$$0\leq y^2\Rightarrow x^2\leq x^2+y^2\Rightarrow \frac{x^2}{x^2+y^2}\leq 1.$$
Let us work the absolute value term contained in the $$\epsilon ,\delta$$ definition of the limit described above, we have
$$\left| \frac{yx ^ 2}{x^2 + y^2}-0\right| =\frac{|y|x ^ 2}{x^2 + y^2} =|y|\frac{x ^ 2}{x^2 + y^2} \leq |y| = \sqrt{y^2} \leq \sqrt{x^2+y^2} <\delta$$
we want to choose $$\delta$$ so that the absolute value term we just worked with is always less than $$\epsilon$$ given that $$0<\sqrt{x^2+y^2} <\delta .$$ Evidently, we may choose $$\delta =\epsilon$$ to this end, and the proof is complete upon stating this formally.
I know that PF does not permit full solutions to be posted, however it is understood that proofs of this sort are quite tricky to construct, examples are few in texts that require them, and I will have rendered sufficient pedagogical substance by even successfully relating it.
--Ben | {
"domain": "physicsforums.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9848109480714625,
"lm_q1q2_score": 0.8556301078374529,
"lm_q2_score": 0.8688267626522814,
"openwebmath_perplexity": 795.0478097083534,
"openwebmath_score": 0.8857300877571106,
"tags": null,
"url": "https://www.physicsforums.com/threads/how-to-find-this-limit.113049/"
} |
--Ben
EDIT: Thanks VietDao29, all that short-hand is Greek to me.
Last edited: Mar 5, 2006
8. Mar 5, 2006
### VietDao29
One more way is to use the inequality:
$$x ^ 2 + y ^ 2 \geq 2|xy|$$, one can prove it by doing a little rearrangement, and noticing the fact that: (|x| + |y|)2 >= 0.
I'll give one example that's similar to your problem.
----------------
Example:
Find:
$$\lim_{\substack{x \rightarrow 0 \\ y \rightarrow 0}} \frac{x ^ 3 y ^ 3}{x ^ 2 + y ^ 2}$$
Now using the inequality above, we have:
$$\left| \frac{x ^ 3 y ^ 3}{x ^ 2 + y ^ 2} \right| \leq \left| \frac{x ^ 3 y ^ 3}{2xy} \right| = \frac{1}{2} |x ^ 2 y ^ 2| = \frac{1}{2} x ^ 2 y ^ 2$$
Now as (x, y) tends to (0, 0),
$$\frac{1}{2} x ^ 2 y ^ 2 \rightarrow 0$$, hence $$\left| \frac{x ^ 3 y ^ 3}{x ^ 2 + y ^ 2} \right| \rightarrow 0$$, thus $$\frac{x ^ 3 y ^ 3}{x ^ 2 + y ^ 2} \rightarrow 0$$, so we can conclude that:
$$\lim_{\substack{x \rightarrow 0 \\ y \rightarrow 0}} \frac{x ^ 3 y ^ 3}{x ^ 2 + y ^ 2} = 0$$
Can you get this? :)
--------------
EDIT:
By the way, benorin:
That symbols is read Delta, the symbol that is read "there exists" should be $$\exists$$ .
Last edited: Mar 5, 2006
9. Mar 5, 2006
### pivoxa15
The method you used in your example looked a bit suspect.
If we follow your way and do the limit(x->0, y->0) of (xy)/(x^2+y^2)
we get the limit being smaller than 1/2 which is wrong since it should have no limit at all.
10. Mar 5, 2006
### Benny
Sorry to intrude on your topic but I would like to know if using polar coordinates is a valid method when the limit is (x,y) -> (0,0). Yes, the angle is arbitrary but each combination of a (r,angle) as r approaches zero corresponds to taking the limit along the straight line. Ie. not every single path is considered.
I can see that converting to polar coordinates is sufficient to verify that the limit does not exist. But is it sufficient to show that a limit exists? I apologise if I missed anything.
11. Mar 5, 2006
### HallsofIvy | {
"domain": "physicsforums.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9848109480714625,
"lm_q1q2_score": 0.8556301078374529,
"lm_q2_score": 0.8688267626522814,
"openwebmath_perplexity": 795.0478097083534,
"openwebmath_score": 0.8857300877571106,
"tags": null,
"url": "https://www.physicsforums.com/threads/how-to-find-this-limit.113049/"
} |
11. Mar 5, 2006
### HallsofIvy
Staff Emeritus
No, that's perfectly valid. You do not have to assume the angle is constant as r goes to 0. The point is that, in polar coordinates, the distance from the origin is measured by a single variable, r. r is completely independent of the angle. That was the point VietDao29 made in his first post- the limit, as r goes to 0, depended upon the angle and so the limit itself does not exist.
In your problem, $\frac{xy^2}{x^2+ y^2}$, changing to polar coordinates gives $\frac{r^3cos(\theta)sin^2(\theta)}{r^2}= r cos(\theta)sin^2(\theta)$. What does that go to as r goes to 0? Does it depend on $\theta$?
12. Mar 5, 2006
### Benny
Ok, that's good. Thanks for the clarification.
13. Mar 5, 2006
### VietDao29 | {
"domain": "physicsforums.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9848109480714625,
"lm_q1q2_score": 0.8556301078374529,
"lm_q2_score": 0.8688267626522814,
"openwebmath_perplexity": 795.0478097083534,
"openwebmath_score": 0.8857300877571106,
"tags": null,
"url": "https://www.physicsforums.com/threads/how-to-find-this-limit.113049/"
} |
### Benny
Ok, that's good. Thanks for the clarification.
13. Mar 5, 2006
### VietDao29
Yes, the limit of:
$$\lim_{\substack{x \rightarrow 0 \\ y \rightarrow 0}} \frac{xy}{x ^ 2 + y ^ 2}$$ does not exist at (0, 0).
So by using the inequality x2 + y2 >= 2|xy|. We have:
$$\left| \frac{xy}{x ^ 2 + y ^ 2} \right| \leq \frac{1}{2} \left| \frac{xy}{xy} \right| = \frac{1}{2}$$
So that means:
$$-\frac{1}{2} \leq \frac{xy}{x ^ 2 + y ^ 2} \leq \frac{1}{2} \quad (*)$$. Hence, no conclusion can be drawn by looking at the inequality (*). Why? Because we don't know if the expression does converge to some value between -1 / 2, and 1 / 2; or it just diverges.
It's like the limit: $$\lim_{x \rightarrow \infty} \sin x$$ does not exist, although we know that: -1 <= sin(x) <= 1. It's because sin(x) does not tend to any specific number (i.e converges to any value) as x tends to infinity.
---------------
However, if we have $$\lim_{x \rightarrow \alpha} |f(x)| = 0$$, then we also have: $$\lim_{x \rightarrow \alpha} f(x) = 0$$. Why?
It's because $$\forall \varepsilon > 0, \exists \delta > 0 : 0 < |x - \alpha| < \delta \Rightarrow ||f(x)| - 0| = |f(x)| = |f(x) - 0| < \varepsilon$$. Now according to the definition of limit, we also have:
$$\lim_{x \rightarrow \alpha} f(x) = 0$$. Can you get this?
You can do the same to prove that if:
$$\lim_{\substack{x \rightarrow \alpha \\ y \rightarrow \beta}} |f(x, y)| = 0$$ then $$\lim_{\substack{x \rightarrow \alpha \\ y \rightarrow \beta}} f(x, y) = 0$$.
Can you get this? :)
---------------
Now just read my last post again to see if you can understand it.
:)
14. Mar 5, 2006
### benorin
Having verified it, I submit in passing that
$$-\frac{1}{2} \leq \frac{xy}{x ^ 2 + y ^ 2} \leq \frac{1}{2}$$
are the best bounds possible.
15. Mar 5, 2006
### pivoxa15
I see your point. Using polar coords to find limits of multivariable functions is better than your first principles method. | {
"domain": "physicsforums.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9848109480714625,
"lm_q1q2_score": 0.8556301078374529,
"lm_q2_score": 0.8688267626522814,
"openwebmath_perplexity": 795.0478097083534,
"openwebmath_score": 0.8857300877571106,
"tags": null,
"url": "https://www.physicsforums.com/threads/how-to-find-this-limit.113049/"
} |
Where did you learn evaluating limits of multivarialbe functions using polar coords? I did not see them in calculus textbooks.
16. Mar 6, 2006
### VietDao29
Yes, using polar co-ordinate is far better, and easier than the second way. :)
And guess what? I learnt how to do it at this site, too... :tongue:
17. Mar 6, 2006
### HallsofIvy
Staff Emeritus
Yes, but that tells you nothing about whether the limit at (0,0) exists.
18. Mar 6, 2006
### benorin
Like I said, "in passing".
19. Mar 7, 2006
### pivoxa15
Are the functions we have been discussing 3D or 2D?
20. Mar 7, 2006
### benorin
Recall that z=f(x,y) is a surface, and hence 3-D. | {
"domain": "physicsforums.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9848109480714625,
"lm_q1q2_score": 0.8556301078374529,
"lm_q2_score": 0.8688267626522814,
"openwebmath_perplexity": 795.0478097083534,
"openwebmath_score": 0.8857300877571106,
"tags": null,
"url": "https://www.physicsforums.com/threads/how-to-find-this-limit.113049/"
} |
# How to discuss coefficients in big-O notation
What notation is used to discuss the coefficients of functions in big-O notation?
I have two functions:
• $f(x) = 7x^2 + 4x +2$
• $g(x) = 3x^2 + 5x +4$
Obviously, both functions are $O(x^2)$, indeed $\Theta(x^2)$, but that doesn't allow a comparison further than that. How do I discuss the the coefficients 7 and 3. Reducing the coefficient to 3 doesn't change the asymptotic complexity but it still makes a significant difference to runtime/memory usage.
Is it wrong to say that $f$ is $O(7x^2)$ and $g$ is $O(3x^2)$ ? Is there other notation that does take coefficients into consideration? Or what would be the best way to discuss this?
• It's not wrong, it's just redundant, because $O(7 x^2) = O(x^2)$. – Oli Charlesworth Oct 7 '13 at 23:17
• See also our reference question. – Raphael Oct 28 '13 at 7:35
Big-$O$ and big-$\Theta$ notations hide coefficients of the leading term, so if you have two functions that are both $\Theta(n^2)$ you cannot compare their absolute values without looking at the functions themselves. It's not wrong per se to say that $7x^2 + 4x + 2 = \Theta(7x^2)$, but it's not informative because $7x^2 + 4x + 2 = \Theta(3x^2)$ is also true (and, in fact, it's $\Theta(kx^2)$ for any positive constant $k$).
There are other notations you might want to use instead. For example, $\sim$ notation is a much stronger claim than big-$\Theta$:
$\qquad \displaystyle f(x) \sim g(x) \iff \lim_{x \to \infty} \frac{f(x)}{g(x)} = 1$
For example, $7x^2 + 4x + 2 \sim 7x^2$, but the claim $7x^2 + 4x + 2 \sim 3x^2$ would be false. You can think of tilde notation as $\Theta$ notation that preserves the leading coefficients, which seems to be what you're looking for if you do care about the leading coefficient of the dominant growth term.
• Tilde notation is what I'm looking for. I was sure there was something I just couldn't recall what it was called and searches proved fruitless. Thanks! – El Bee Oct 7 '13 at 23:48 | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9732407175907054,
"lm_q1q2_score": 0.8556214216334299,
"lm_q2_score": 0.8791467580102418,
"openwebmath_perplexity": 295.9506517504927,
"openwebmath_score": 0.7434012293815613,
"tags": null,
"url": "https://cs.stackexchange.com/questions/16346/how-to-discuss-coefficients-in-big-o-notation"
} |
The tilde is one approach. If you want to stick with $O$, you could say
$\qquad f(x) = 7x^2 + O(x)$ and
$\qquad g(x) = 3x^2 + O(x)$.
• Even better: say f(x) = 7x^2 + o(x^2), using little-o notation to clarify that what's left is asymptotically smaller than x^2. – templatetypedef Oct 9 '13 at 4:06
• O(x) is strictly smaller than o(x^2), so using that would be less clear than using big-O. On the other hand, using little-o is definitely more common when you want to say that you've got the right first term, because then you don't need to worry about the next term. (And if we're wanting to be completely clear, then we would need to explain why we don't just write down 7x^2+4x+2 in the first place, since it is exactly correct. – Teepeemm Oct 9 '13 at 4:43
• You're absolutely right... my apologies! – templatetypedef Oct 9 '13 at 17:56
• Note that the rigorous way of writing this would be "$f(x) = 7x^2 + g(x)$ with $g(x) \in O(x)$". In any case, this is very useful if you want to fix more than the "first" constant; you can say "$f(x) = 7x^2 + 4x + O(1)$" which you can not do with $\sim$. – Raphael Oct 28 '13 at 7:29 | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9732407175907054,
"lm_q1q2_score": 0.8556214216334299,
"lm_q2_score": 0.8791467580102418,
"openwebmath_perplexity": 295.9506517504927,
"openwebmath_score": 0.7434012293815613,
"tags": null,
"url": "https://cs.stackexchange.com/questions/16346/how-to-discuss-coefficients-in-big-o-notation"
} |
# Permutations: How many outcomes have a 1 in them if P(n,k) = P(13,3) and the probability it will occur if randomly generated?
There is a set of numbers {1,2,3,4,5,6,7,8,9,10,11,12,13}. I am trying to find out how many subsets I can form that have 3 numbers in them and also the amount of subsets that will have a number 1 in them. Also, if I was to randomly generate a single outcome, what is the probability it will have a 1 in it if all outcomes have equal chance of occurring?
I know that the probability can be calculated from (Number of subsets that have 1 in them)/(Total number of permutations)
I figured out the Total total number of permutations = 13!/(13-3)! = 1716
But I can't figure out how to determine how many subsets will have a 1 in them. In addition to this, is there a way to generalise the method? For example, what if I would like to find out the number of subsets that have a number 1 and a number 2 in them for the same n and k parameters?
• For subsets do you mean ignoring order, which is usual, or considering order, which seems to be implied by your use of permutations? – Ross Millikan Feb 22 '18 at 15:49
• Oh in this problem I do want to consider order. So 1,2,3 is different from 1,3,2 and so on. – Lobster Feb 22 '18 at 16:04
• That is what I considered in my answer. You are then selecting three element permutations from thirteen, not a subset. As I commented on the other answer, the fraction that include $1$ is the same either way. – Ross Millikan Feb 22 '18 at 16:11
It looks like instead of subsets you mean three element permutations that include $1$. You can count those by choosing first the location of the $1$, which gives three choices, then the first other element, $12$, and the second other element, $11$ for a total of $3 \cdot 12 \cdot 11=396$. You are correct that the chance a random permutation includes a $1$ is $\frac {396}{1716}=\frac 3{13}$ This is not surprising as you are choosing three elements from thirteen. | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9732407172026312,
"lm_q1q2_score": 0.8556214197514067,
"lm_q2_score": 0.8791467564270271,
"openwebmath_perplexity": 199.73320338133198,
"openwebmath_score": 0.8103286623954773,
"tags": null,
"url": "https://math.stackexchange.com/questions/2661883/permutations-how-many-outcomes-have-a-1-in-them-if-pn-k-p13-3-and-the-pro"
} |
To have both $1$ and $2$ you have three places to put the $1$, two places for the $2$, and $11$ choices for the third number.
• Thanks! This was a great help! – Lobster Feb 22 '18 at 16:16
This is not actually a case of permutation, but rather a case of combination. Because in a subset, the arrangement of the numbers are not important. Therefore it is the use of combinations and not permutations.
Subset 3 numbers in them = 13C3 = 286 - choosing 3 numbers out of 13
Subset 3 numbers with 1 in them = 12C2 = 66 - choosing 2 numbers given one of the number is 1 (there is only 12 numbers to pick, because 1 is chosen by default)
• You can use either permutations or combinations as long as you are consistent. The probability of having a $1$ comes out $\frac 3{13}$ eitherj way, as it should. There are $3!$ times more total permutations and $3!$ times more that include a $1$. – Ross Millikan Feb 22 '18 at 15:56
• Welcome to MSE. Please use MathJax. – José Carlos Santos Feb 22 '18 at 16:01
• Oh right, i forgot to answer the probability. You are absolutely right about the consistency part, and both method works. My only concern is about technicality especially with subsets, because with other question (not the probability one), the answer may be different, due to order being considered. – Zirc Feb 22 '18 at 16:02 | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9732407172026312,
"lm_q1q2_score": 0.8556214197514067,
"lm_q2_score": 0.8791467564270271,
"openwebmath_perplexity": 199.73320338133198,
"openwebmath_score": 0.8103286623954773,
"tags": null,
"url": "https://math.stackexchange.com/questions/2661883/permutations-how-many-outcomes-have-a-1-in-them-if-pn-k-p13-3-and-the-pro"
} |
Question
# The chance that Doctor A will diagonise disease X correctly is $$60\%$$. The chance that a patient will die by his treatment after correct diagnosis is $$40\%$$ and the chance of death after wrong diagnosis is $$70\%.$$ A patient of Doctor A who had disease X died. The probability that his disease was diagonised correctly is
A
513
B
613
C
213
D
713
Solution
## The correct option is D $$\dfrac{6}{13}$$Let us define the following events.$${ E }_{ 1 }:$$ Disease $$X$$ is diagnosed correctly by doctor $$A$$.$${ E }_{ 2 }:$$ Disease $$X$$ is not diagnosed correctly by doctor $$A$$.$$B:$$ A patient (of doctor $$A$$) who has disease $$X$$ dies.Then, we are given, $$P({ E }_{ 1 })=0.6$$,$$P({ E }_{ 2 })=1-P({ E }_{ 1 })=1-0.6=0.4$$and $$\displaystyle P\left( \frac { B }{ { E }_{ 1 } } \right) =0.4$$, $$\displaystyle P\left( \frac { B }{ { E }_{ 2 } } \right) =0.7$$By Bay's Theorem$$\displaystyle P\left( \frac { { E }_{ 1 } }{ B } \right) =\frac { P\left( { E }_{ 1 } \right) P\left( \frac { B }{ { E }_{ 1 } } \right) }{ P\left( { E }_{ 1 } \right) P\left( \frac { B }{ { E }_{ 1 } } \right) +P\left( { E }_{ 2 } \right) P\left( \frac { B }{ { E }_{ 2 } } \right) }$$$$\displaystyle=P\left( \frac { { E }_{ 1 } }{ B } \right) =\frac { 0.6\times 0.4 }{ 0.6\times 0.4+0.4\times 0.7 } =\frac { 0.24 }{ 0.24+0.28 } =\frac { 0.24 }{ 0.52 } =\frac { 6 }{ 13 }$$Mathematics
Suggest Corrections
0
Similar questions
View More
People also searched for
View More | {
"domain": "byjus.com",
"id": null,
"lm_label": "1. YES\n2. YES\n\n",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9867771786365549,
"lm_q1q2_score": 0.8555711042249107,
"lm_q2_score": 0.867035763237924,
"openwebmath_perplexity": 5050.975292858223,
"openwebmath_score": 0.5884534120559692,
"tags": null,
"url": "https://byjus.com/question-answer/the-chance-that-doctor-a-will-diagonise-disease-x-correctly-is-60-the-chance-that/"
} |
# In $\mathbb{R}^4$, let $U=$ span$\{(1,1,0,0),(1,1,1,1)\}$.
(a) Compute an orthonormal basis for $U$.
(b) Find $u\in U$ such that the Euclidean distance $||u-(1,2,3,4)||$ is as small as possible.
Here's what I have:
(a) To find an orthonormal basis, we'll use the Gram-Schmidt Algorithm. The process is as follows:
Given $k$ basis vectors $v_1,v_2,\cdots,v_k$, we apply the following steps:
1. Let $q_1=\frac{1}{||v_1||}v_1$.
2. For $i=2$ to $k$, repeat steps 3 and 4.
3. Let $w_i=v_i-\langle q_1,v_i\rangle q_i-\langle q_2,v_i\rangle q_2-\cdots-\langle q_{i-1},v_i\rangle q_{i-1}$
4. Let $q_i=\frac{1}{||w_i||}w_i$
The vectors $q_1,\cdots q_k$ are our orthonormal basis. Now, we apply these steps to the given problem. $$q_1=\frac{1}{||v_1||}v_1=\frac{1}{\sqrt{2}}v_1=(\frac{1}{\sqrt{2}},\frac{1}{\sqrt{2}},0,0)$$ $$w_2=v_2-\langle q_1,v_2\rangle q_1=(1,1,1,1)-(\frac{1}{\sqrt{2}}+\frac{1}{\sqrt{2}})(\frac{1}{\sqrt{2}},\frac{1}{\sqrt{2}},0,0)=(0,0,1,1)$$ $$q_2=\frac{1}{\sqrt{2}}w_2=(0,0,\frac{1}{\sqrt{2}},\frac{1}{\sqrt{2}})$$ So $\{q_1,q_2\}$ is an orthonormal basis for $U$.
(b) I recognize this as a least squares problem, but I'm a bit lost on how to actually set it up, because we don't have something with the form $Ax\approx b$. I mean, I know that $b=(1,2,3,4)$ and $u$ somehow represents $Ax$, but we don't have a matrix $A$, and $u$ is just an element of the span of $2$ vectors.
• Hint: the underlying mechanism of the solution to the least-squares problem you’re familiar with is orthogonal projection onto a vector space. – amd Jan 7 '18 at 4:47
Your proof for part (a) is correct. For part (b) let $$u=(\alpha , \alpha ,\beta ,\beta)$$ You need to minimize $$(\alpha -1)^2+( \alpha -2)^2 + (\beta -3)^2+ (\beta-4)^2.$$ Partial derivatives are zero at $\alpha = 3/2$ and $\beta =7/2$. Thus $u=(3/2, 3/2, 7/2,7/2)$is the desired vector. | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.986777179025415,
"lm_q1q2_score": 0.8555710960862588,
"lm_q2_score": 0.8670357546485407,
"openwebmath_perplexity": 139.23827355764874,
"openwebmath_score": 0.98429936170578,
"tags": null,
"url": "https://math.stackexchange.com/questions/2595145/in-mathbbr4-let-u-span-1-1-0-0-1-1-1-1"
} |
• Do you think you could elaborate on this a bit? Is the choice that $u=(\alpha,\alpha,\beta,\beta)$ from the fact that the vectors that span $U$ have the same first two entries? – Atsina Jan 7 '18 at 5:06
• Sure. From your part (a), you have found a basis in form of (1,1,0,0) and (0,0,11). $u=(\alpha,\alpha,\beta,\beta)=\alpha (1,1,0,0)+\beta (0,0,1,1)$ – Mohammad Riazi-Kermani Jan 7 '18 at 5:20
Because you have an orthonormal basis, things become increasingly easy.
The least squares problem is solved by
$$x_{ls} = (A^TA)^{-1}(A^Tb)$$
Where $A$ is a matrix which has your basis as columns and $b$ is $<1,2,3,4>$. Solve this for $x_{ls}$ and then the solution is $Ax_{ls}$.
• This is more along the lines of what I was searching for, but Mohammad's solution is slightly less computationally intensive. I wish I could accept multiple answers. – Atsina Jan 7 '18 at 6:02
• @Atsina Because there is an orthonormal basis for the subspace, things are even easier than what been written here: $A^TA=I_2$, so your equation reduces to $x_{ls}=A^Tb$ and $u=AA^Tb=(u_1^Tb)u_1+(u_2^Tb)u_2$, i.e., it’s the sum of the orthogonal projections onto the basis vectors. – amd Jan 11 '18 at 1:10
The shortest distance to $U$ is measured along a direction orthogonal to it, therefore the element of $U$ that minimizes the distance to a given vector $b$ is the orthogonal projection of $b$ onto $U$, that is, the component of $b$ that lies in $U$. | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.986777179025415,
"lm_q1q2_score": 0.8555710960862588,
"lm_q2_score": 0.8670357546485407,
"openwebmath_perplexity": 139.23827355764874,
"openwebmath_score": 0.98429936170578,
"tags": null,
"url": "https://math.stackexchange.com/questions/2595145/in-mathbbr4-let-u-span-1-1-0-0-1-1-1-1"
} |
There are various ways to compute this projection, but since you’ve already constructed an orthonormal basis for $U$, the easiest thing to do is to compute the individual projections onto the basis vectors and combine them. In fact, this is exactly what you do at each step of the Gram-Schmidt process: you compute the orthogonal projection of the current vector onto the space spanned by the orthonormal basis vectors generated up to that point and subtract that projection from the vector to get its component that doesn’t lie in that span. So, using that projection formula from the Gram-Schmidt process, \begin{align} u = (u_1^Tb)u_1+(u_2^Tb)u_2 &= \frac3{\sqrt2}\left(\frac1{\sqrt2},\frac1{\sqrt2},0,0\right)+\frac7{\sqrt2}\left(0,0,\frac1{\sqrt2},\frac1{\sqrt2}\right) \\ &= \left(\frac32,\frac32,\frac72,\frac72\right). \end{align}
The connection to finding a least-squares solution to the possibly-inconsistent linear system $Ax=b$ is that you essentially replace $b$ with its orthogonal projection onto the column space of $A$.
Muhammad gave you a nice way using partial derivative so I'll just throw out here another way without using derivatives
The shortest distance to a plane create angle of $\pi/2$, so let's create the vector $\vec v=\begin{bmatrix}1-a\\2-a\\3-b\\4-b\end{bmatrix}$, this vector is the vector from the point $(1,2,3,4)$ to an arbitrary point on the plane.
I want that this arbitrary point on the plane will minimize $\vec v$, so I'll check when the vector create angle of $\pi/2$ to the plane($\langle\cdot,\cdot\rangle$ is the dot product):$$\langle\vec v,(1,1,0,0)\rangle=0\\\langle\vec v,(0,0,1,1)\rangle=0$$here I get 2 equations: $(1-a)1+(2-a)1=0\implies a=1.5$ and $(3-b)1+(4-b)1=0\implies b=3.5$ thus the answer is $u=(1.5,1.5,3.5,3.5)$ | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.986777179025415,
"lm_q1q2_score": 0.8555710960862588,
"lm_q2_score": 0.8670357546485407,
"openwebmath_perplexity": 139.23827355764874,
"openwebmath_score": 0.98429936170578,
"tags": null,
"url": "https://math.stackexchange.com/questions/2595145/in-mathbbr4-let-u-span-1-1-0-0-1-1-1-1"
} |
Question
# Find the vector equation of the plane passing through the points $$(2, 1, -1)$$ and $$(-1, 3, 4)$$ and perpendicular to the plane $$x - 2y + 4z = 10.$$ Also show that the plane thus obtained contains the line $$\vec{r} = -\hat{i} + 3\hat{j} + 4\hat{k} + \lambda(3 \hat{i} - 2\hat{j} - 5\hat{k}).$$
Solution
## Let the equation of plane through $$(2, 1, -1)$$ be$$a(x - 2) + b(y - 1) + c(z + 1) = 0 ....(i)$$$$\because (i)$$ passes through $$(-1, 3, 4)$$$$\therefore a (-1 - 2) + b (3 - 1) + c (4 + 1) = 0$$$$\Rightarrow -3a + 2b + 5c = 0 ...(ii)$$Also plane (i) is perpendicular to plane $$x - 2y + 4z = 10$$$$\Rightarrow \vec{n_1} \perp \vec{n_2} \Rightarrow \vec{n_1}. \vec{n_2} = 0$$$$\therefore 1a - 2b + 4c = 0 ...(iii)$$From (ii) and (iii), we get$$\dfrac{a}{8 + 10} = \dfrac{b}{5 + 12} = \dfrac{c}{6 - 2} \Rightarrow \dfrac{a}{18} = \dfrac{b}{17} = \dfrac{c}{4} = \lambda (say)$$$$\Rightarrow a = 18\lambda, b = 17\lambda, c = 4\lambda$$Putting the value of a, b, c in (i), we get$$18\lambda (x - 2) + 17\lambda (y - 1) + 4\lambda (z + 1) = 0$$$$\Rightarrow 18x - 36 + 17y - 17 + 4z + 4 = 0$$$$\Rightarrow 18x + 17y + 4z = 49$$$$\therefore$$ Required vector equation of plane is$$\vec{r}. (18\hat{i} + 17\hat{j} + 4\hat{k}) = 49 ...(iv)$$Obviously plane (iv) contains the line$$\vec{r} = (-\hat{i} + 3\hat{j} + 4\hat{k}) + \lambda (3\hat{i} - 2\hat{j} - 5\hat{k}) ....(v)$$Since, point $$(-\hat{i} + 3\hat{j} + 4\hat{k})$$ satisfy equation (iv) and vector $$(18\hat{i} + 17\hat{j} + 4\hat{k})$$ is perpendicular to, $$(3\hat{i} - 2\hat{j} + 5\hat{k}),$$ as $$(-\hat{i} + 3\hat{j} + 4\hat{k}). (18\hat{i} + 17\hat{j} + 4\hat{k}) = -18 + 51 + 16 = 49$$ and $$(18\hat{i} + 17\hat{j} + 4\hat{k} ). (3\hat{i} - 2\hat{j} - 5\hat{k}) = 54 - 34 - 20 = 0$$Therefore, (iv) contains line (v).Mathematics
Suggest Corrections
0
Similar questions
View More
People also searched for
View More | {
"domain": "byjus.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9867771786365549,
"lm_q1q2_score": 0.8555710957491032,
"lm_q2_score": 0.8670357546485407,
"openwebmath_perplexity": 917.3506577436331,
"openwebmath_score": 0.3425378203392029,
"tags": null,
"url": "https://byjus.com/question-answer/find-the-vector-equation-of-the-plane-passing-through-the-points-2-1-1-and/"
} |
Riemann Sum Approximations: When are trapezoids more accurate than the middle sum?
We can approximate a definite integral, $\int_a^b f(x)dx$, using a variety of Riemann sums. If $T_n$ and $M_n$ are the nth sums using the trapezoid and midpoint (middle) sum methods and if the second derivative of $f$ is bounded on $[a, b]$ then does the following theorem imply that $M_n$ "tends to be more accurate" then $T_n$?
If $f''$ is continuous on $[a, b]$ and $|f''(x)| \leq K$, $\forall$ $x \in [a, b]$. Then,
$\left| \int_a^b f(x)dx - T_n \right| \leq K\frac{(b-a)^3}{12n^2}$
and
$\left| \int_a^b f(x)dx - M_n \right| \leq K\frac{(b-a)^3}{24n^2}$
For this question let, $E_{T_n} = \left| \int_a^b f(x)dx - T_n \right|$ and $E_{M_n} = \left| \int_a^b f(x)dx - T_n \right|$
The theorem is presented (without proof) in a calculus 2 book. It only really seems to imply that, we can with 100% certainly bound E_{M_n} smaller than we can bound E_{T_n}. But, that says nothing about the actual values of E_{T_n} or E_{M_n}.
So, isn't it possible to customize a function so that $E_{T_n} < E_{M_n}$ for a particular n? Could we even make a function so that $E_{T_n} < E_{M_n}$ $\forall n$?
• For a particular $n$, absolutely: that's equivalent to doing it for $n=1$ and replicating the function across multiple intervals. Just consider any function satisfying $f(0)=f(1)=0$ and $\int_0^1 f(x)\, dx = 0$, but $f(1/2) \ne 0$. Then $E_T = 0$ but $E_M$ can be as large as you want (by rescaling $f$). May 4, 2016 at 8:40
• This shows $T = 0$, not $E_T = 0$.
– RRL
May 5, 2016 at 2:20
• Although the Midpoint Rule is typically more accurate, it should be said that the Trapezoid Rule can be used to get $guaranteed$ upper and lower bounds for integrals of concave and convex functions respectively, which cannot be said for the Midpoint Rule.
– user123641
Oct 30, 2017 at 15:56 | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.986777179803135,
"lm_q1q2_score": 0.8555710933702467,
"lm_q2_score": 0.8670357512127872,
"openwebmath_perplexity": 194.42908696013507,
"openwebmath_score": 0.9835159182548523,
"tags": null,
"url": "https://math.stackexchange.com/questions/1771002/riemann-sum-approximations-when-are-trapezoids-more-accurate-than-the-middle-su"
} |
As you observed, the midpoint method is typically more accurate than the trapezoidal method. This is suggested by the composite error bounds, but they don't rule out the possibility that the trapezoidal method might be more accurate in some cases.
We can get a better understanding by examining the local errors for single-segment rules. Consider an interval $[a,b]$ and define interval length $h = b-a$ and midpoint $c = (a+b)/2.$ Note that $b-c = c-a = (b-a)/2 = h/2.$
The midpoint error is
$$E_M = f(c)h - \int_a^b f(x) \, dx = \int_a^b [f(c) - f(x)] \, dx.$$
Using a second-order Taylor approximation,
$$f(c) = f(x) + f'(x)(c-x) + \frac{1}{2} f''(\xi_x)(x-c)^2,$$
we see
$$E_M = -\int_a^b f'(x)(x-c) \, dx + \frac{1}{2}\int_a^b f''(\xi_x)(x-c)^2 \, dx.$$
Applying integration by parts to the first integral on the RHS we get
$$\int_a^b f'(x)(x-c) = \left.(x-c)f(x)\right|_a^b - \int_a^b f(x) \, dx = \frac{h}{2}[f(a) + f(b)] - \int_a^b f(x) \, dx .$$
Note that this result gives us the error $E_T$ for the trapezoidal method.
Hence,
$$E_M = -E_T + \frac{1}{2}\int_a^b f''(\xi_x)(x-c)^2 \, dx.$$
It is actually not that easy to find examples where $|E_T| < |E_M|$. Using the above result, we can surmise that this could happen when the midpoint method overestimates, $E_M > 0$, the trapezoidal method underestimates $E_T < 0,$ and we have high curvature in a small neighborhood of a point in the interval.
Here is a somewhat contrived example.
Consider the following function that meets those requirements. Note that the second derivative is piecewise continuous but bounded -- which does not degrade the composite $O(n^{-2})$ accuracy.
$$f(x) = \begin{cases} 0.25 + 0.75\exp(-200 x^2), &\mbox{if } -1 \leqslant x \leqslant 0 \\ 0.99 + 0.01 \cos(\pi x), &\mbox{if } \,\,\,\,\,\,\, 0 < x \leqslant 1 \end{cases}.$$
Then
\begin{align}\int_{-1}^1 f(x) \, dx &\approx 1.2870\\ M &\approx 2 \\ T &\approx 1.2300 \\ E_M &\approx 0.7130 \\ E_T &\approx 0.0570 \end{align} | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.986777179803135,
"lm_q1q2_score": 0.8555710933702467,
"lm_q2_score": 0.8670357512127872,
"openwebmath_perplexity": 194.42908696013507,
"openwebmath_score": 0.9835159182548523,
"tags": null,
"url": "https://math.stackexchange.com/questions/1771002/riemann-sum-approximations-when-are-trapezoids-more-accurate-than-the-middle-su"
} |
• I think you can use periodic smooth functions to get non-contrived examples.
– Ian
May 5, 2016 at 2:49 | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.986777179803135,
"lm_q1q2_score": 0.8555710933702467,
"lm_q2_score": 0.8670357512127872,
"openwebmath_perplexity": 194.42908696013507,
"openwebmath_score": 0.9835159182548523,
"tags": null,
"url": "https://math.stackexchange.com/questions/1771002/riemann-sum-approximations-when-are-trapezoids-more-accurate-than-the-middle-su"
} |
+0
# If three runners receive medals how many ways can the three medalists be chosen out of a field of 28?
0
457
3
+8
Is it 28 x 27 x 26?
peacemantle May 2, 2015
### Best Answer
#2
+92749
+10
Badinage, you are right.
There are 28 ways for the first, 27 ways for the second and 26 ways for the 3rd That is 28*27*26
BUT it doesn't matter what order they are chosen. so you have to divide by 3! = 6
$${\frac{{\mathtt{28}}{\mathtt{\,\times\,}}{\mathtt{27}}{\mathtt{\,\times\,}}{\mathtt{26}}}{{\mathtt{6}}}} = {\mathtt{3\,276}}$$
this is how I would normally do it
28C3
$${\left({\frac{{\mathtt{28}}{!}}{{\mathtt{3}}{!}{\mathtt{\,\times\,}}({\mathtt{28}}{\mathtt{\,-\,}}{\mathtt{3}}){!}}}\right)} = {\mathtt{3\,276}}$$
Melody May 2, 2015
#1
+520
+8
Yes, that's the answer your teacher is seeking.
However, as a challenge extension you could extend this to include ties, e.g., from 2 up to 28 ties for first, up to 27 ties for second, etc. I'm not sure how to do this, though, and it sounds complicated.
# 🌹 🌹 🌹 🌹 🌹 🌹 🌹 🌹
.
Badinage May 2, 2015
#2
+92749
+10
Best Answer
Badinage, you are right.
There are 28 ways for the first, 27 ways for the second and 26 ways for the 3rd That is 28*27*26
BUT it doesn't matter what order they are chosen. so you have to divide by 3! = 6
$${\frac{{\mathtt{28}}{\mathtt{\,\times\,}}{\mathtt{27}}{\mathtt{\,\times\,}}{\mathtt{26}}}{{\mathtt{6}}}} = {\mathtt{3\,276}}$$
this is how I would normally do it
28C3
$${\left({\frac{{\mathtt{28}}{!}}{{\mathtt{3}}{!}{\mathtt{\,\times\,}}({\mathtt{28}}{\mathtt{\,-\,}}{\mathtt{3}}){!}}}\right)} = {\mathtt{3\,276}}$$
Melody May 2, 2015
#3
+520
+5
Yes, you are right, Melody. The question doesn't say 1st, 2nd and 3rd places. Maybe there are 3 runners who are to be awarded a medal for being a comically costumed competitor for St Patrick's Day, or some such.
Badinage May 3, 2015
### New Privacy Policy | {
"domain": "0calc.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9867771766922544,
"lm_q1q2_score": 0.8555710906730021,
"lm_q2_score": 0.8670357512127872,
"openwebmath_perplexity": 1991.436812778065,
"openwebmath_score": 0.37264788150787354,
"tags": null,
"url": "https://web2.0calc.com/questions/if-three-runners-receive-medals-how-many-ways-can-the-three-medalists-be-chosen-out-of-a-field-of-28"
} |
Badinage May 3, 2015
### New Privacy Policy
We use cookies to personalise content and advertisements and to analyse access to our website. Furthermore, our partners for online advertising receive information about your use of our website.
For more information: our cookie policy and privacy policy. | {
"domain": "0calc.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9867771766922544,
"lm_q1q2_score": 0.8555710906730021,
"lm_q2_score": 0.8670357512127872,
"openwebmath_perplexity": 1991.436812778065,
"openwebmath_score": 0.37264788150787354,
"tags": null,
"url": "https://web2.0calc.com/questions/if-three-runners-receive-medals-how-many-ways-can-the-three-medalists-be-chosen-out-of-a-field-of-28"
} |
# Math Help - recurrence relations
1. ## recurrence relations
1)
Find a recurrence relation for the number of bit string of length n that contain three consecutive 0's
What are the initial conditions? how many bit strings of length 7 contain three consecutive 0's?
2)
Give the recursive algorithm for finding the minimum of a finite set of
integers.
3)
Find the solution to the following recurrence relation and initial
condition:
xn+2 = 4xn; n = 0, 1, 2, ... x0 = 2, x1 = 1.
4)
Give the recursive algorithm for finding the sum of the first n odd
positive integers.
5)
Find the solution to the following recurrence relation and initial
condition:
xn+2 = 2xn+1 + 3xn; n = 0, 1, 2, ... x0 = 1, x1 = -1.
2. Hello, narbe!
5) Find the solution to the following recurrence relation and initial condition:
. . $x_{n+2} \:= \:2x_{n+1} + 3x_n\qquad x_0 = 1,\;\;x_1 = \text{-}1$
Crank out the new few terms . . .
. . $\begin{array}{ccccc} x_2 &=&2(\text{-}1) + 3(1) &=& 1 \\
x_3 &=& 2(1) + 3(\text{-}1) &=& \text{-}1 \\
x_4 &=& 2(\text{-}1) + 3(1) &=& 1 \\
x_5 &=& 2(1) + 3(\text{-}1) &=& \text{-}1 \\
\vdots & & \vdots & & \vdots \end{array}$
Got it?
3. ## yeah but ...
yes I got the solution! but how can I demonstrate it as a function ??????
4. Originally Posted by narbe
1)
Find a recurrence relation for the number of bit string of length n that contain three consecutive 0's
What are the initial conditions? how many bit strings of length 7 contain three consecutive 0's?
I think it's easiest to count the number of strings of length n that do not contain three consecutive zeros. Call this number $y_n$.
We can get a string of length n+1 without three consecutive zeros in three ways: (1) take such a string of length n and add a 1 at the end, (2) take such a string of length n-1 and add 10 at the end, (3) take such a string of length n-2 and add 100 at the end. Therefore $y_{n+1} = y_n+y_{n-1}+y_{n-2}$. | {
"domain": "mathhelpforum.com",
"id": null,
"lm_label": "1. YES\n2. YES\n\n",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9888419677654415,
"lm_q1q2_score": 0.8555698946830687,
"lm_q2_score": 0.8652240930029118,
"openwebmath_perplexity": 166.87613553863903,
"openwebmath_score": 0.896514892578125,
"tags": null,
"url": "http://mathhelpforum.com/discrete-math/52607-recurrence-relations.html"
} |
Now let $x_n$ denote the number of strings of length n that do contain three consecutive zeros. There are altogether $2^n$ strings of length n, so $x_n = 2^n-y_n$. It easily follows from the relation for the y's that $x_{n+1} = x_n+x_{n-1}+x_{n-2}+2^{n-2}$. The initial conditions are $x_1=x_2=0,\ x_3=1$. From there, you can use the recurrence relation to work your way up to 7. (I get the answer $x_7=47$, but don't rely on my arithmetic.)
5. Hello, narbe!
It's easy . . .
Look at the terms:
. . $\begin{array}{ccccc}x_0 &=& 1 \\ x_1 &=& \text{-}1 \\ x_2 &=& 1 \\ x_3 &=& \text{-}1 \\ \vdots \\ x_n &=& (\text{-}1)^n & \Leftarrow &\text{There!}\end{array}$
6. Originally Posted by narbe
3) Find the solution to the following recurrence relation and initial
condition:
x_{n+2}= 4x_{n}; n = 0, 1, 2, ... x_{0} = 2, x_{1} = 1.
This is a second order difference equation with a constant coefficient, there is a very simple way for this equation.
Such equations have solution of the type $x(n)=c_{1}\lambda_{1}^{n}+c_{2}\lambda_{2}^{n}$ for $n\in\mathbb{N}$, where $c_{1},c_{2}$ are arbitrary constants.
Just substitute this value into the solution and solve $\lambda_{1}$ and $\lambda_{2}$, then use these values together with the initial conditions to find the desired solution.
However, here, I would like to show you a different solution way for this equation.
First set, $y(n):=x(2n)$ for $n\in\mathbb{N}$, then from the equation, we get
$y(n+1)=x(2n+2)=4x(2n)=4y(n)$ or simply $y(n+1)=4y(n)$ for $n\in\mathbb{N}$.
It is easy to solve this equation and we get $y(n)=c_{1}4^{n}$ for all $n\in\mathbb{N}$, where $c_{1}$ is an arbitrary constant.
Since $y(0)=x(0)=2$, we see that $c_{1}=2$.
Thus, we have $x(n)=24^{n/2}=2^{n+1}$ is a solution of the equation.
Next, set $z(n):=x(2n-1)$ for $n\in\mathbb{N}$ and solve $z(n+1)=x(2(n+1)-1)=x(2n+1)=4x(2n-1)=z(n)$ or simply $z(n+1)=4z(n)$ for $n\in\mathbb{N}$ with $z(1)=x(1)=1$.
Finally, sum these results. | {
"domain": "mathhelpforum.com",
"id": null,
"lm_label": "1. YES\n2. YES\n\n",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9888419677654415,
"lm_q1q2_score": 0.8555698946830687,
"lm_q2_score": 0.8652240930029118,
"openwebmath_perplexity": 166.87613553863903,
"openwebmath_score": 0.896514892578125,
"tags": null,
"url": "http://mathhelpforum.com/discrete-math/52607-recurrence-relations.html"
} |
# How and How Not to Compute a Relative Error
The relative error in a scalar $y$ as an approximation to a scalar $x$ is the absolute value of $e = (x-y)/x$. I recently came across a program in which $e$ had been computed as $1 - y/x$. It had never occurred to me to compute it this way. The second version is slightly easier to type, requiring no parentheses, and it has the same cost of evaluation: one division and one subtraction. Is there any reason not to use this parenthesis-free expression?
Consider the accuracy of the evaluation, using the standard model of floating point arithmetic, which says that $fl(x \mathbin{\mathrm{op}} y) = (x \mathbin{\mathrm{op}} y)(1+\delta)$ with $|\delta| \le u$, where $\mathrm{op}$ is any one of the four elementary arithmetic operations and $u$ is the unit roundoff. For the expression $e_1 = (x-y)/x$ we obtain, with a hat denoting a computed quantity,
$\widehat{e_1} = \displaystyle\left(\frac{x-y}{x}\right) (1+\delta_1)(1+\delta_2), \qquad |\delta_i| \le u, \quad i = 1, 2.$
It follows that
$\left| \displaystyle\frac{e - \widehat{e_1}}{e} \right| \le 2u + u^2.$
Hence $e_1$ is computed very accurately.
For the alternative expression, $e_2 = 1 - y/x$, we have
$\widehat{e_2} = \left(1 - \displaystyle\frac{y}{x}(1+\delta_1)\right) (1+\delta_2), \qquad |\delta_i| \le u, \quad i = 1, 2.$
After a little manipulation we obtain the bound
$\left| \displaystyle\frac{e - \widehat{e_2}}{e} \right| \le u + \left|\displaystyle\frac{1-e}{e}\right|(u + u^2).$
The bound on the relative error in $\widehat{e_2}$ is of order $|(1-e)/e|u$, and hence is very large when $|e| \ll 1$. | {
"domain": "nhigham.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9888419671077918,
"lm_q1q2_score": 0.8555698941140544,
"lm_q2_score": 0.8652240930029118,
"openwebmath_perplexity": 953.7469024119811,
"openwebmath_score": 0.8781653046607971,
"tags": null,
"url": "https://nhigham.com/2017/08/14/how-and-how-not-to-compute-a-relative-error/"
} |
To check these bounds we carried out a MATLAB experiment. For 500 single precision floating point numbers $y$ centered on $x = 3$, we evaluated the relative error of $y$ as an approximation to $x$ using the two formulas. The results are shown in this figure, where an ideal error is of order $u \approx 6\times 10^{-8}$. (The MATLAB script that generates the figure is available as this gist.)
As expected from the error bounds, the formula $1-y/x$ is very inaccurate when $y$ is close to $x$, whereas $(x-y)/x$ retains its accuracy as $y$ approaches $x$.
Does this inaccuracy matter? Usually, we are concerned only with the order of magnitude of an error and do not require an approximation with many correct significant figures. However, as the figure shows, for the formula $|1-y/x|$ even the order of magnitude is incorrect for $y$ very close to $x$. The standard formula $|x-y|/|x|$ should be preferred.
## 2 thoughts on “How and How Not to Compute a Relative Error”
1. Raúl Martínez says:
Nick,
Thank you for delving into this. Your result is certainly far from obvious and I find it very helpful. In my own work, I don’t recall computing the relative error using 1–y/x (though I cannot be certain), but I have sometimes used the latter expression in writing. After reading your note, I can see that such usage could mislead a reader into using that expression for computation, so I’ll be mindful not to use it in the future.
Sincerely,
Raúl Martínez
2. For interested parties I converted Nick’s gist above to Python:
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters | {
"domain": "nhigham.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9888419671077918,
"lm_q1q2_score": 0.8555698941140544,
"lm_q2_score": 0.8652240930029118,
"openwebmath_perplexity": 953.7469024119811,
"openwebmath_score": 0.8781653046607971,
"tags": null,
"url": "https://nhigham.com/2017/08/14/how-and-how-not-to-compute-a-relative-error/"
} |
# Based on the code by Nick Higham # Compares relative error formulations using single precision and compared to double precision N = 501 # Note: Use 501 instead of 500 to avoid the zero value d = numpy.finfo(numpy.float32).eps * 1e4 a = 3.0 x = a * numpy.ones(N, dtype=numpy.float32) y = [x[i] + numpy.multiply((i – numpy.divide(N, 2.0, dtype=numpy.float32)), d, dtype=numpy.float32) for i in range(N)] # Compute errors and "true" error relative_error = numpy.empty((2, N), dtype=numpy.float32) relative_error[0, :] = numpy.abs(x – y) / x relative_error[1, :] = numpy.abs(1.0 – y / x) exact = numpy.abs( (numpy.float64(x) – numpy.float64(y)) / numpy.float64(x)) # Compute differences between error calculations error = numpy.empty((2, N)) for i in range(2): error[i, :] = numpy.abs((relative_error[i, :] – exact) / numpy.abs(exact)) fig = plt.figure() axes = fig.add_subplot(1, 1, 1) axes.semilogy(y, error[0, :], '.', markersize=10, label="$|x-y|/|x|$") axes.semilogy(y, error[1, :], '.', markersize=10, label="$|1-y/x|$") axes.grid(True) axes.set_xlabel("y") axes.set_ylabel("Relative Error") axes.set_xlim((numpy.min(y), numpy.max(y))) axes.set_ylim((5e-9, numpy.max(error[1, :]))) axes.set_title("Relative Error Comparison") axes.legend() plt.show() | {
"domain": "nhigham.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9888419671077918,
"lm_q1q2_score": 0.8555698941140544,
"lm_q2_score": 0.8652240930029118,
"openwebmath_perplexity": 953.7469024119811,
"openwebmath_score": 0.8781653046607971,
"tags": null,
"url": "https://nhigham.com/2017/08/14/how-and-how-not-to-compute-a-relative-error/"
} |
# Thread: The centroid of a triangle with coordinates
1. ## The centroid of a triangle with coordinates
Triangle DEF has vertices D(1,3) and E(6,1), and centroid at C(3,4). Determine the coordinates of point F.
I know that the medians in a triangle intersect at the centroid and that the centroid divides each median in a ration of 2:1. Also, I know that each median intersects a side at its midpoint with the shorter part of the median. What I did was find the midpoint between point E and F by taking half of the line D to C and adding onto C to give point G. The coordinates of point G was found to be (4, 4.5). Since I knew that the change in the coordinates between points E and G, (-2, 3.5), was only half of the line EF I doubled it and added it point E to give the answer (2, 8). I wanted to know if there was an easier way to do this.
2. Originally Posted by darksoulzero
Triangle DEF has vertices D(1,3) and E(6,1), and centroid at C(3,4). Determine the coordinates of point F.
I know that the medians in a triangle intersect at the centroid and that the centroid divides each median in a ration of 2:1. Also, I know that each median intersects a side at its midpoint with the shorter part of the median. What I did was find the midpoint between point E and F by taking half of the line D to C and adding onto C to give point G. The coordinates of point G was found to be (4, 4.5). Since I knew that the change in the coordinates between points E and G, (-2, 3.5), was only half of the line EF I doubled it and added it point E to give the answer (2, 8). I wanted to know if there was an easier way to do this.
Read Centroid - AoPSWiki
3. ## centroid of triangle
Hi darksoulzero,
Your solution is confusing.Here is a suggested method.
connect M midpoint of DE and C (centroid) with extended lenght.F lies on this line. FC = 2CM. Slope diagram of C and M = 2/1/2.Slope diagram of FC is twice that or 4/1. Working from point C one point left and 4 points up gives F (2,8)
bjh | {
"domain": "mathhelpforum.com",
"id": null,
"lm_label": "1. YES\n2. YES\n\n",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9908743634192694,
"lm_q1q2_score": 0.8555126119143079,
"lm_q2_score": 0.8633916099737806,
"openwebmath_perplexity": 1294.70776827927,
"openwebmath_score": 0.7026728391647339,
"tags": null,
"url": "http://mathhelpforum.com/geometry/174934-centroid-triangle-coordinates.html"
} |
bjh
4. If ABC is a triangle with $\displaystyle $$A\left( {{x_1},{y_1}} \right),B\left( {{x_2},{y_2}} \right),C\left( {{x_3},{y_3}} \right)$$$ then its centroid is
$\displaystyle $$G\left( {\tfrac{{{x_1} + {x_2} + {x_3}}}{3},\tfrac{{{y_1} + {y_2} + {y_3}}}{3}} \right)$$$
5. Hello, darksoulzero!
$\displaystyle \text{Triangle }D{E}F\text{ has vertices: }D(1,3)\text{ and }E(6,1)\text{, and centroid at }C(3,4).$
$\displaystyle \text{Determine the coordinates of point }F.$
Code:
1
F o-----+
\ :
\ :4
\ :
\ :
\:0.5
(3,4)o---+
D C\ :
o \ :2
(1,3) * \:
M o
(3.5,2) * E
o
(6,1)
We have vertices $\displaystyle D(1,3)$ and $\displaystyle E(6,1)$, and centroid $\displaystyle C(3,4).$
The midpoint of $\displaystyle DE$ is: $\displaystyle M(3\tfrac{1}{2},\,2).$
The median to side $\displaystyle DE$ starts at $\displaystyle \,M$, passes through $\displaystyle \,C,$
. . and extends to $\displaystyle \,F$, where: .$\displaystyle FC \,=\,2\!\cdot\!CM.$
Going from $\displaystyle \,M$ to $\displaystyle \,C$, we move up 2 and left $\displaystyle \frac{1}{2}$
Hence, going from $\displaystyle \,C$ to $\displaystyle \,F$, we move up 4 and left 1.
Therefore, we have: .$\displaystyle F(2,8).$ | {
"domain": "mathhelpforum.com",
"id": null,
"lm_label": "1. YES\n2. YES\n\n",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9908743634192694,
"lm_q1q2_score": 0.8555126119143079,
"lm_q2_score": 0.8633916099737806,
"openwebmath_perplexity": 1294.70776827927,
"openwebmath_score": 0.7026728391647339,
"tags": null,
"url": "http://mathhelpforum.com/geometry/174934-centroid-triangle-coordinates.html"
} |
# Find angle(s) of intersection between circle and line segment on circle
I have a circle (given a center and radius) and a line segment (given a coordinate for both points). The line segment passes through the circle and intersects with the circle in one or two points (one if the segment is tangential or if it ends inside the circle).
How can I find the angle or the two angles where the line segment intersects the circle, relative to the top of the circle?
Please provide an example. Unrelated to the diagram below, a set of points to use in an example are as follows: circle radius $1.5$ with center $(3, 4)$. Line segment from $(3, 3)$ to $(6, 7)$.
If it's easier, it's acceptable to find both points by treating the line segment as a line and ignoring a tangential intersection
I am trying to find the angle shown as ?° in the diagram below. The answer in this case is 57°
• What is the other point that you're using to define this angle? Yes, the angle in the image may be 57 degrees, but what is the significance of the other point that you're measuring from? What I'm saying is: the point seems arbitrary. So I could pick any point on the circle and have any angle that I want. – foobar1209 Mar 16 '14 at 23:40
• The point is just the top of the circle. It could be anything, but the top makes the most sense. – Keavon Mar 16 '14 at 23:41 | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9787126525529015,
"lm_q1q2_score": 0.8554704541799163,
"lm_q2_score": 0.8740772400852111,
"openwebmath_perplexity": 150.47076647157192,
"openwebmath_score": 0.7090710401535034,
"tags": null,
"url": "https://math.stackexchange.com/questions/712665/find-angles-of-intersection-between-circle-and-line-segment-on-circle"
} |
Set the center of the circle to be $\left(0,0\right)$. Then the set of points on the circle are those such that $x^2+y^2=r^2$ and the set of points on the line segment are solutions to $y=mx+b$ from some $m$ and $b$ (these are easily found given the two endpoints of the line segment). Substituting, we have $$x^2+(mx+b)^2=r^2\Longleftrightarrow (m^2+1)x^2+2mbx+(b^2-r^2)=0$$ Then this is just a quadratic you can solve with the quadratic formula giving you $x$, and you can get $y$ by $y=mx+b$. However, this gives you two solutions; you must pick the right one (find which is between the two endpoint). Fortunately finding the angle after this is pretty easy: it's just simple trigonometry. If $(x,y)$ is the solution, $\tan^{-1}\left(\frac{y}{x}\right)$ gives you the angles measure counterclockwise from the $x$-axis. You asked for the angle from the $y$-axis, which is then $\frac{\pi}{2}-\tan^{-1}\left(\frac{y}{x}\right).$
A worked example | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9787126525529015,
"lm_q1q2_score": 0.8554704541799163,
"lm_q2_score": 0.8740772400852111,
"openwebmath_perplexity": 150.47076647157192,
"openwebmath_score": 0.7090710401535034,
"tags": null,
"url": "https://math.stackexchange.com/questions/712665/find-angles-of-intersection-between-circle-and-line-segment-on-circle"
} |
A worked example
I'll work out the example you have given. We have radius $r=\frac{3}{2}$, center $\left(3,4\right)$ and a line segment from $(3,3)$ to $(6,7)$. First we'll move the center to $(0,0)$. We do this by subtracting $(3,4)$ from each point. This gives us the center (as desired) of $(0,0)$, and a line segment from $(0,-1)$ to $(3,3)$. Then the line between the two points is $y=\frac{4}{3}x-1$. The equation for the circle is $x^2+y^2=\frac{9}{4}$. Substituting the equation for the line in, we have $$x^2+\left(\frac{4}{3}x-1\right)^2=\frac{25}{9}x^2-\frac{8}{3}x+1=\frac{9}{4}$$ which gives the quadratic $$\frac{25}{9}x^2-\frac{8}{3}x-\frac{5}{4}=100x^2-96x-45=0$$ Then the quadratic equation gives $x=\frac{96\pm \sqrt{96^2+4\cdot 100\cdot 45}}{200}=-0.345,1.305$. We're going to want the solution with positive $x$, so $x=1.305$. Then $y=\frac{4}{3}(1.305)-1=0.740$. To find the desired angles, we merely take $90-\tan^{-1}\left(\frac{0.740}{1.305}\right)=90-29.56=60.44$. I'm not sure what the discrepancy between my answer and the one you provided is; it could be rounding errors, but it is more likely I just made a calculation error somewhere (please do point it out if you see it).
I know it seems like a lot, but the technique is relatively straight forward, the calculation is just some hard work. I hope this answer has shed some light on the process for you.
• You made no error. The example I provided is different from the diagram provided in the question. Since this is a detailed and easy to understand answer I will mark it as accepted, but wait a few days before awarding you the bounty. – Keavon Mar 17 '14 at 2:03
• Sounds good. Glad i could help :) – cderwin Mar 17 '14 at 2:26
Hint: First, for convenience - transform the circle's to $(0,0)$ and normalize (so the radius of the given circle is now 1). The circle's equation is $x^2+y^2=1$
Now, we are given $(x_1, y_1)$, $(x_2,y_2)$. Denote $f(x)=mx+n$, the line that accepts those two points. | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9787126525529015,
"lm_q1q2_score": 0.8554704541799163,
"lm_q2_score": 0.8740772400852111,
"openwebmath_perplexity": 150.47076647157192,
"openwebmath_score": 0.7090710401535034,
"tags": null,
"url": "https://math.stackexchange.com/questions/712665/find-angles-of-intersection-between-circle-and-line-segment-on-circle"
} |
Assuming intersection, $x^2+(mx+n)^2=1\Leftrightarrow x^2+m^2x^2+2mnx+n^2=1$
• Please provide an example with circle radius $1.5$ with center $(3,4)$ and line segment from $(3,3)$ to $(6,7)$. – Keavon Mar 17 '14 at 0:37
• First, transform to (0,0) and normalize, by the transofrmation T(x,y)=(x-3,y-4)/(1.5). Transform all the points with T and you'll get a new problem with the same answer you're looking for. After transforming, find the line and circle equations and continue from there. – Astro Nauft Mar 17 '14 at 7:45
Hint:
1. Find the equation of the circle and line. The circle should be easy, use the line slope and a point to find the equation.
2. Find the intersection. This is solving for either variable and then plugging it in to get coordinates.
3. Draw a right triangle using a diagonal radius to the intersection and a horizontal line. Based on what you know about slope and tangents, this should help you find an angle that is complementary to your angle. | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9787126525529015,
"lm_q1q2_score": 0.8554704541799163,
"lm_q2_score": 0.8740772400852111,
"openwebmath_perplexity": 150.47076647157192,
"openwebmath_score": 0.7090710401535034,
"tags": null,
"url": "https://math.stackexchange.com/questions/712665/find-angles-of-intersection-between-circle-and-line-segment-on-circle"
} |
# Show that $\left( 1 + \frac{x}{n}\right)^n$ is uniformly convergent on $S=[0,1]$. [duplicate]
Show that $\left( 1 + \frac{x}{n}\right)^n$ is uniformly convergent on $S=[0,1]$.
Given $f_n(x)=\left( 1 + \frac{x}{n}\right)^n$ is a sequence of bounded function on $[0,1]$ and $f:S \rightarrow \mathbb R$ a bounded function , then $f_n(x)$ converges uniformly to $f$ iff
$$\lim\limits_{n \rightarrow \infty} ||f_n - f|| = \lim\limits_{n \rightarrow \infty}\left(\sup |f_n(x) - f(x)| \right)= 0$$
As $$f(x) = \lim\limits_{n \rightarrow \infty} \left( 1 + \frac{x}{n}\right)^n = e^x$$
We have
$$\begin{split} \lim\limits_{n \rightarrow \infty} \left\|\left( 1 + \frac{x}{n} \right)^n - e^x\right\| &= \lim\limits_{n \rightarrow \infty} \left|\sup_{x \in S}\left[\left( 1 + \frac{x}{n}\right)^n - e^x \right ]\right|\\ &= \lim\limits_{n \rightarrow \infty} \left|\left( 1 + \frac{1}{n} \right)^n - e^1 \right|\\ &= \lim\limits_{n \rightarrow \infty} |e-e| \\ &= 0 \end{split}$$
I am new to sequence. Is this appropriate to show convergence?
Going back to the definition, How can I show that:
1. "$f_n(x)=\left( 1 + \frac{x}{n}\right)^n$ is a sequence of bounded function on $[0,1]$"?
2. $f:S \rightarrow \mathbb R$ a bounded function? | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.978712650690179,
"lm_q1q2_score": 0.8554704493413514,
"lm_q2_score": 0.8740772368049822,
"openwebmath_perplexity": 263.70698307808743,
"openwebmath_score": 0.9416009187698364,
"tags": null,
"url": "https://math.stackexchange.com/questions/2392765/show-that-left-1-fracxn-rightn-is-uniformly-convergent-on-s-0-1"
} |
2. $f:S \rightarrow \mathbb R$ a bounded function?
• Continuous functions are bounded on closed intervals. For any $n$, $f_n(x)$ expands to a polynomial, which is continuous anywhere. – IntegrateThis Aug 14 '17 at 0:15
• The third line in your last calculation is wrong: shouldn't have a limit in front of $|e-e|$. – symplectomorphic Aug 14 '17 at 1:23
• @Will Fisher: well, sure, as written it doesn't make a difference. But the point is that it in preserving the limit from the second to the third line it looks like the student is arguing that $|(1+1/n)^n-e|$ equals $|e-e|$. – symplectomorphic Aug 14 '17 at 1:27
• @Will Fisher: no, you have misunderstood the OP. The OP is proving that $f_n\to f$ uniformly by invoking hypotheses, and the questions at the bottom are about how to show the hypotheses hold. – symplectomorphic Aug 14 '17 at 1:29
• Have you shown that the sup obtains when $x=1$? It is true, but it seems to me to require proof (and you have the absolute value in the wrong place: as it stands - the absolute value of the sup of the difference-, the sup is 0 at $x=0$; you want the sup of the absolute value of the difference instead). – NickD Aug 14 '17 at 1:51
If you don't want to verify the precise maximum you can bound as
$$0 \leqslant e^x - \left(1 + \frac{x}{n} \right)^n =e^x \left[1 - \left(1 + \frac{x}{n} \right)^ne^{-x}\right] \\ \leqslant e^x \left[1 - \left(1 + \frac{x}{n} \right)^n \left(1 - \frac{x}{n} \right)^n\right] \\ = e^x \left[1 - \left(1 - \frac{x^2}{n^2} \right)^n \right],$$
since $e^{x/n} > 1 + x/n$ which implies $e^{x} > (1 + x/n)^n$ for $x \in (-n,\infty).$
By Bernoulli's inequality, $(1 - x^2/n^2)^n \geqslant 1 - x^2/n$ and
$$0 \leqslant e^x - \left(1 + \frac{x}{n} \right)^n \leqslant \frac{e^xx^2}{n} \leqslant \frac{e}{n},$$
which enables you to prove uniform convergence on $[0,1]$. | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.978712650690179,
"lm_q1q2_score": 0.8554704493413514,
"lm_q2_score": 0.8740772368049822,
"openwebmath_perplexity": 263.70698307808743,
"openwebmath_score": 0.9416009187698364,
"tags": null,
"url": "https://math.stackexchange.com/questions/2392765/show-that-left-1-fracxn-rightn-is-uniformly-convergent-on-s-0-1"
} |
which enables you to prove uniform convergence on $[0,1]$.
Let's write explicitly the difference $$e^x - ( 1 + \frac{x}{n})^n = \sum_{ k \ge 0} \frac{x^k}{k!} - \sum_{k = 0}^n \binom{n}{k}\left(\frac{x}{n}\right )^k=\\ =\sum_{k\ge 0} \frac{[1-\prod_{l=1}^{k-1}(1- l/n)] x^k}{k!}$$. Since every coefficient $1- \prod_{l=1}^{k-1} (1-\frac{l}{n})$ is $\ge 0$ ( and $0$ for $k \ge n+1$ ) we conclude that
$$0 < e^x - (1+ \frac{x}{n})^n\le e^1 - (1 + \frac{1}{n})^n$$ for all $n \ge 0$ and $x\in [0,1]$.
Now, it's only necessary to check ( or use ) that $(1+\frac{1}{n})^n \to e$.
As shown in inequality $(2)$ of this answer, $\left(1+\frac xn\right)^n$ is increasing in $n$. Thus, for $x\ge0$, \begin{align} \frac{\mathrm{d}}{\mathrm{d}x}\left(e^x-\left(1+\frac xn\right)^n\right) &=e^x-\left(1+\frac xn\right)^{n-1}\\ &\ge e^x-\left(1+\frac xn\right)^n\\[3pt] &\ge0 \end{align} So on $[0,1]$, $$0\le e^x-\left(1+\frac xn\right)^n\le e-\left(1+\frac1n\right)^n$$
The logarithm $\ln:[1,e]\to[0,1]$ is uniformly continuous on this interval, so it is a uniform homeomorphism, and it suffices to show that $\ln f_n(x)=n\ln (1+x/n)$ is uniformly convergent on $[0,1]$. But this follows immediately from Taylor's theorem: $$n\ln(1+x/n)-x=O(x^2/n).$$ | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.978712650690179,
"lm_q1q2_score": 0.8554704493413514,
"lm_q2_score": 0.8740772368049822,
"openwebmath_perplexity": 263.70698307808743,
"openwebmath_score": 0.9416009187698364,
"tags": null,
"url": "https://math.stackexchange.com/questions/2392765/show-that-left-1-fracxn-rightn-is-uniformly-convergent-on-s-0-1"
} |
# What type of bifurcation is this?
Consider the dynamical system
$$dx/dt = -\cos(r)\sin(x)$$
Clearly $$x=0$$ and $$x=\pi$$ are two fixed points of this system. The stability of these two fixed points change as r is varied. Starting from $$r=0$$, the zero fixed point is initially stable but becomes unstable at $$r=\pi/2$$ and the opposite happens for the other fixed point.
Is this a transcritical bifurcation? I have so far only seen systems where one of the fixed point approaches the other fixed point and their stability switch as they cross each other.
However in my system, the fixed points remain at the same values of $$x$$. Only stability changes. If not transcritical, what type of bifurcation is this?
TL;DR: I don't believe the system displays a transcritical bifurcation.
Your stability analysis is correct. For instance, for $$r=0$$, $$\dot{x}$$ is simply a negative sine function, so positive $$x\approx 0$$ values have negative derivatives (and decrease, i.e., move towards zero) and negative values have positive derivatives (so increase and also move towards zero), i.e., $$x=x^*=0$$ is stable for $$r<\pi/2$$. See figure below:
And the system does go through a bifurcation as $$r$$ is varied — though not one of the simple ones, due to the singular nature of the system at $$r=r^*=\pi/2$$: For this value of $$r$$ all points $$x\in[0,2\pi]$$ are (neutrally stable) fixed points, since the system is simply $$dx/dt=0$$. That's how I'd sketch its bifurcation diagram:
It looks like we could say there's a collision on $$r^*=\pi/2$$ and the fixed points "exchange stabilities — just like in a transcritical bifurcation, however, I think we have something different here, for two reasons: | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9787126475856414,
"lm_q1q2_score": 0.8554704482329465,
"lm_q2_score": 0.8740772384450967,
"openwebmath_perplexity": 719.3710125165959,
"openwebmath_score": 0.9300766587257385,
"tags": null,
"url": "https://physics.stackexchange.com/questions/637017/what-type-of-bifurcation-is-this"
} |
I. If we check the formal conditions for the system $$\dot{x}=f_r(x)$$ to go through a transcritical bifurcation (e.g., Guckenheim & Holmes or Wolfram MathWorld), we'll see they are: \begin{align} f_r(x)\Bigr|_{\forall r, x=x^*}=0 \tag{equilibria}\\ \frac{\partial f_r}{\partial x}\Bigr|_{r=r^*, x=x^*} = 0 \tag{null eigenvalue}\\ \frac{\partial^2 f_r}{\partial r\partial x}\Bigr|_{r=r^*, x=x^*} \ne 0 \tag{TC1}\\ \frac{\partial^2 f_r}{\partial^2 x}\Bigr|_{r=r^*, x=x^*} \ne 0 \tag{TC2} \label{TC2} \end{align} where TC stands for transversality condition. And it's clear that our $$f_r(x)$$ fails to satisfy \ref{TC2}.
II. By changing variables, $$r \mapsto -r + \pi/2$$, the system becomes $$f_r(x)=-\sin(r)\sin(x)$$ and $$r^*=0$$. If we then try to put $$f_r(x)$$ in a algebraic normal form, by Taylor expanding it around $$(r^*,x^*)$$ we obtain, after a new change of variables $$r\mapsto r-r^3/6$$, $$f_r(x) = rx -r\frac{x^3}{6} +O(5)$$ which I don't believe can be put in the normal form for the transcritical bifurcation, nor any of the other simple ones: \begin{align} \dot{x} &= r - x^2 \tag{saddle-node}\\ \dot{x} &= rx - x^2 \tag{transcritical}\\ \dot{x} &= r - x^3 \tag{pitchfork} \end{align} Which is perhaps not that surprising, given the system's bifurcation diagram. | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9787126475856414,
"lm_q1q2_score": 0.8554704482329465,
"lm_q2_score": 0.8740772384450967,
"openwebmath_perplexity": 719.3710125165959,
"openwebmath_score": 0.9300766587257385,
"tags": null,
"url": "https://physics.stackexchange.com/questions/637017/what-type-of-bifurcation-is-this"
} |
• I missed out a negative sign in the equation. Thanks for pointing it out. If not transcritical, does this type of bifurcation have some name to it that I can search for? May 17 at 18:47
• @SnehaSrikanth Not that I know, maybe we could call it transcritical-like? :) May 17 at 18:50
• @SnehaSrikanth I'm now convinced the system doesn't display a transcritical bifurcation, check my updated answer. May 18 at 19:24
• Thanks for such a clear detailed answer! I still want to keep the question open for anyone who might be able to pinpoint what kind of bifurcation this is. I am new to StackExchange.. do I edit this post and change the question or make a new question? I do not want your answer to become irrelevant. May 19 at 11:44
• Ok will make that change! I am actually unable to upvote yet (I need 15 reputations for that). I'll surely upvote when I hit 15 reputations :D May 19 at 16:14 | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9787126475856414,
"lm_q1q2_score": 0.8554704482329465,
"lm_q2_score": 0.8740772384450967,
"openwebmath_perplexity": 719.3710125165959,
"openwebmath_score": 0.9300766587257385,
"tags": null,
"url": "https://physics.stackexchange.com/questions/637017/what-type-of-bifurcation-is-this"
} |
# Proof that $\forall k\in\mathbb Z^+$, $\lfloor\log_2(2k+1)\rfloor=\lfloor\log_2(2k)\rfloor$
I wrote a proof for this but am not completely sure if this is valid. Specifically, can I go from $$m\leq k+0.5$$ to $$m\leq k$$ because $$m,k\in\mathbb Z^+$$ with no further explanation? Any feedback would be greatly appreciated!
Proof. Let $$n=\lfloor\log_2(2k+1)\rfloor$$. Then, \begin{align*} n&\leq\log_2(2k+1)\lt n+1&&\text{(since \forall x\in\mathbb R, \lfloor x\rfloor\leq x\lt x+1),}\\ \implies2^n&\leq2k+1\lt2^{n+1}&&\text{(by algebra).}\\ \end{align*} Observe that $$2^n\in2\mathbb Z^+$$ so $$2^n=2m$$ for some $$m\in\mathbb Z^+$$. Thus, \begin{align*} 2m&\leq2k+1&&\text{(since 2m=2^n\leq2k+1),}\\ \implies m&\leq k+0.5&&\text{(by algebra),}\\ \implies m&\leq k&&\text{(since m,k\in\mathbb Z^+),}\\ \implies 2m&\leq2k&&\text{(by algebra),}\\ \implies 2^n&\leq2k&&\text{(since 2^n=2m),}\\ \implies 2^n&\leq2k\lt2^{n+1}&&\text{(since 2k+1\lt2^{n+1}\rightarrow2k\lt2^{n+1}),}\\ \implies n&\leq\log_2(2k)\lt n+1&&\text{(by algebra),}\\ \therefore n&=\lfloor\log_2(2k)\rfloor&&\text{(since \forall x\in\mathbb R, \lfloor x\rfloor\leq x\lt x+1).} \end{align*} $$\tag*{\blacksquare}$$
• In your latter paragraph it seems you can just go from line $1$ to lines $4/5$ Dec 3, 2019 at 21:29
• Your proof looks good to me! Dec 3, 2019 at 21:37
Note that for all $$n \in \mathbb{N_{>0}}$$ there exist $$m \in \mathbb{N}$$ such that $$\begin{eqnarray*} 2^m \leq n < 2^{m+1}. \end{eqnarray*}$$ This value $$m$$ is $$\lfloor\log_2(n)\rfloor$$ And $$n$$ increases passed a power of $$2$$ the value $$m$$ will increase by $$1$$.
If $$n$$ increases (by $$1$$) from an even value to an odd value the $$m$$ will not change (provided $$n>1$$). So $$\begin{eqnarray*} \lfloor\log_2(2k+1)\rfloor = \lfloor\log_2(2k)\rfloor. \end{eqnarray*}$$ | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9787126451020108,
"lm_q1q2_score": 0.8554704476672624,
"lm_q2_score": 0.8740772400852111,
"openwebmath_perplexity": 1664.525540282596,
"openwebmath_score": 0.9861103892326355,
"tags": null,
"url": "https://math.stackexchange.com/questions/3461890/proof-that-forall-k-in-mathbb-z-lfloor-log-22k1-rfloor-lfloor-log-2"
} |
# sketch the region enclosed by the given curves and find its area
sketch the region enclosed by the given curves and find its area:
$$y=\frac 1x,\; y=x,\; y=\frac x4,\; x>0.$$
I have no problem sketching the area between the curves but there are three, and only one constant value, so I don't know what to put as my second a/b value. I tried using 1/x as a b value but that just gave me an equation answer and the answer isn't an equation.
edit: i forgot about the intersections as constant values. but now I see how to split them up.
This is chapter 6.1 calculus James Stewart btw (area between curves)
• Just FYI: there are many calculus textbooks each with their own chapter/section scheme. "Chapter 6.1" isn't useful information without telling us what textbook you're using. – Adam Saltz Sep 2 '13 at 21:28
From Wolfram Alpha, we can sketch the curves to find the area of interest:
Note that we need to find the points of intersection: at $x = 0$ the lines $y = x, \;y = \frac x{4}$ intersect. At $x= 1$, the lines $y = x$ and $y = \frac 1x$ intersect. At $x = 2,$ the lines $y = \frac 1x$ and $y = \frac x4$ intersect. You can solve this by integrating between the relevant curves from $x = 0$ to $x = 1$, and likewise integrating between the relevant curves between $x = 1$ and $x = 2$, then summing: $$\int_0^1 \left(x - \frac x4\right)\,dx \quad + \quad \int_1^2 \left(\frac 1x - \frac x4\right)\,dx$$
• ok I solved it but I got ln2 - 1/2 and the answer is ln2 O_o i double checked calculations what did i do wrong?? – J L Sep 2 '13 at 21:39
• You have to evaluate the second integral $F(2) - F(1)$ – Namaste Sep 2 '13 at 21:42
• First integral $\frac 12 - \frac 18 = \frac 38$. Second integral: $\ln 2 - \frac 12 - (\ln 1 - \frac 18) = \ln 2 - \frac 38$. Sum, we get $\ln 2$. – Namaste Sep 2 '13 at 21:44
• i figured it out i wrote 7/8 instead of 3/8 for some reason – J L Sep 2 '13 at 21:45
• Good then, that should agree. Is all good? – Namaste Sep 2 '13 at 21:47 | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9845754474655619,
"lm_q1q2_score": 0.8554255136568153,
"lm_q2_score": 0.8688267779364222,
"openwebmath_perplexity": 248.53720058628775,
"openwebmath_score": 0.9202216863632202,
"tags": null,
"url": "https://math.stackexchange.com/questions/482453/sketch-the-region-enclosed-by-the-given-curves-and-find-its-area"
} |
Hint: Suppose that we integrate with respect to $x$. Since there are two types of upper curves, draw a vertical line at $x=1$ (where the two upper curves of $y=x$ and $y=1/x$ intersect) that splits the region into two cases. You should obtain: $$\left[\int_0^1 x - \frac x4~dx \right] + \left[\int_1^2 \frac 1x - \frac x4~dx \right]$$
• ohhh yeahh i see. thanks for your help :) I forgot about spliting things into two integrals – J L Sep 2 '13 at 21:26
If you sketched the region correctly then you should be seeing a sort of triangle whose base is given by the line $y=x/4$ whose left side is given by $y=x$ and whose right side is given my $y=1/x$.
The first thing you have to do is to identify the crossing points, that is, the endpoints of this distorted triangle. One crossing point is obviously given by $(0,0)$ where the lines $y=x$ and $y=x/4$ meet, for the next one you have to solve the equation $$\frac{1}{x}=x$$ from where you obtain $x=1$ (we care only about the positive solution since $x>0$). The other vertex of the desired region is given by solving $$\frac{1}{x}=\frac{x}{4}$$ from where you can obtain the solution $x=2$. Look at your sketched region, we will integrate in terms of x-slices. Usually one integrates the area between the two curves $f(x)$ and $g(x)$ in the $x$-region $[a,b]$ as $\int_a^b f(x)-g(x) \; dx$. In this case however, the expression for the upper limit changes exactly at $x=1$ so there should be TWO subtractions instead of one. The desired expression for the area $A$ is $$A = \int_{0}^1 x-\frac{x}{4}\; dx + \int_{1}^2 \frac{1}{x}-\frac{x}{4} \; dx$$ And you should be able to calculate that integral yourself. Hope that helps.
Make a scetch of all three curves over the domain $x>0$. Can you see how they form and bound a triangle-like figure? | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9845754474655619,
"lm_q1q2_score": 0.8554255136568153,
"lm_q2_score": 0.8688267779364222,
"openwebmath_perplexity": 248.53720058628775,
"openwebmath_score": 0.9202216863632202,
"tags": null,
"url": "https://math.stackexchange.com/questions/482453/sketch-the-region-enclosed-by-the-given-curves-and-find-its-area"
} |
What do you mean by "only one constant value"? If you sketch the three curves, you'll see two regions which look like triangles with one bent edge (the $y=1/x$ part). In one of those regions, all the points have positive $x$-coordinates. In the other, the $x$-coordinates are all negative. Integrate to find the area of the positive one. | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9845754474655619,
"lm_q1q2_score": 0.8554255136568153,
"lm_q2_score": 0.8688267779364222,
"openwebmath_perplexity": 248.53720058628775,
"openwebmath_score": 0.9202216863632202,
"tags": null,
"url": "https://math.stackexchange.com/questions/482453/sketch-the-region-enclosed-by-the-given-curves-and-find-its-area"
} |
# Is the cartesian product of groups the product of a normal subgroup and its quotient group?
I'm studying elementary group theory, and just seeing the ways in which groups break apart into simpler groups, specifically, a group can be broken up as the sort of product of any of its normal subgroups with the quotient group of that subgroup. So I wondered how you could do the inverse of that operation:
1. Given two groups $A$ and $B$, construct a group $G$ which admits a normal subgroup $H$ isomorphic to $A$, such that $G/H$ is isomorphic to $B$.
I think I have a proof that the cartesian product $A \times B$ (with the usual component-wise operation) verifies (1), but since I'm just starting out I'm not totally confident in my construction. Furthermore, if I'm right, is this the only group up to isomorphism satisfying (1)?
Edit: I just noticed Proving the direct product D of two groups G & H has a normal subgroup N such that N isomorphic to G and D/N isomorphic to H, which seems to positively answer my question. In that case I'd like to draw attention to the follow up question above (uniqueness up to isomorphism).
Yes, the direct product $A \times B$ satisfies the property, as you've noticed. But it's not unique up to isomorphism. For example, the dihedral group $D_n$ has a normal subgroup $H \simeq \mathbb Z/n \mathbb Z$, with $G/H \simeq \mathbb Z/2 \mathbb Z$, but $D_n$ is not isomorphic (for $n > 1$) to $\mathbb Z/2\mathbb Z \times \mathbb Z/n\mathbb Z$.
More generally, you're asking whether, given an exact sequence of the form $1 \to N \to G \to H \to 1$, is $G$ isomorphic to $N \times H$? The answer is no, as I've shown. Many counterexamples are provided by semidirect products (something you'll learn soon enough if you're studying elementary group theory). | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9886682461347529,
"lm_q1q2_score": 0.8554195796709044,
"lm_q2_score": 0.8652240860523328,
"openwebmath_perplexity": 122.5503894866553,
"openwebmath_score": 0.9384512305259705,
"tags": null,
"url": "https://math.stackexchange.com/questions/409626/is-the-cartesian-product-of-groups-the-product-of-a-normal-subgroup-and-its-quot"
} |
For abelian groups, the concept of Ext functor allows one to classify all such extensions (given abelian groups $A,B$, "how many" groups $G$ are there with an exact sequence $0 \to B \to G \to A \to 0$ is given by $\mathrm{Ext}(A,B)$), but this is much more advanced.
• If each of A,B,C is abelian and the sequence 0 -> A -> B -> C -> 0, what would be some restrictions on A, C that would ensure that B is isomorphic to A x C? What if A and C are cyclic? – gen Oct 24 '18 at 22:27
You're correct that $A\times B$ satisfies (see here) the stated property, but in general it will not be the only such group.
The simplest example is with $A=B=\mathbb{Z}/2\mathbb{Z}$, in which case $\mathbb{Z}/4\mathbb{Z}$ also has the desired property.
Your idea about the direct product working is true. The general idea you are looking for however is that of a semidirect product which refutes your claim of uniqueness in the general setting.
It's interesting to ask when the direct product is the only possibility and that can actually be answered by finding the group $\text{Ext}(B,A)$. This is know as an extension problem. We have that if $\text{Ext}(B,A)=1$ then $A\times B$ is the unique extension of $B$ by $A$.
I believe the converse is false however, but I can't think of an example at the moment. That is, there exist pairs $(B,A)$ such that $\text{Ext}(B,A)\neq 1$ but $B\times A$ is the unique (up to group isomorphism, not extension equivalence) extension of $B$ by $A$. | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9886682461347529,
"lm_q1q2_score": 0.8554195796709044,
"lm_q2_score": 0.8652240860523328,
"openwebmath_perplexity": 122.5503894866553,
"openwebmath_score": 0.9384512305259705,
"tags": null,
"url": "https://math.stackexchange.com/questions/409626/is-the-cartesian-product-of-groups-the-product-of-a-normal-subgroup-and-its-quot"
} |
# How do I solve a Continued Fraction of solution to quadratic equation?
I know that it is possible to make a CF (continued fraction) for every number that is a solution of a quadratic equation but I don't know how.
The number I'd like to write as a CF is:
$$\frac{1 - \sqrt 5}{2}$$
How do I tackle this kind of problem?
-
Let's rewrite $\ \dfrac {1-\sqrt{5}}2=-1+\dfrac {3-\sqrt{5}}2$ to have something positive to evaluate then : $$\frac 1{\dfrac {3-\sqrt{5}}2}=\frac 2{3-\sqrt{5}}=\frac {2(3+\sqrt{5})}{(3-\sqrt{5})(3+\sqrt{5})}=\frac {2(3+\sqrt{5})}{9-5}=\frac {3+\sqrt{5}}{2}=2+\frac {\sqrt{5}-1}{2}$$ (we want the term at the right to be between $0$ and $1$ at each stage)
You may continue this process until repetition !
You should get : $$\dfrac {1-\sqrt{5}}2=-1+\cfrac 1{2+\cfrac 1{1+\cfrac 1{1+\ddots}}}$$
-
So this solution is [-1;2,1,1,...], isn't that different from the one in the post above? – Spyral Aug 23 '12 at 18:51
@Spyral: Sasha has a minus sign over the whole C.F. I have only the integer part with a sign (both results are correct, perhaps that this one is more common...) – Raymond Manzoni Aug 23 '12 at 18:57
That confused me indeed.. I thought a C.F. was UNIQUE.. so your solution being [-1,2,1,1,...], sasha's being -[0;1,1,...] and Brian M. Smiths being [0;1,1,...] is kind of confusing me =/ – Spyral Aug 23 '12 at 19:08
Even though all these methods might be correct, this one was the clearest to me, thanks – Spyral Aug 23 '12 at 19:12
@Spyral: There are many types of continued fraction. The standard one in Number Theory is the simple continued fraction given in the very nice answer by Raymond Manzoni. For these, there is almost a uniqueness theorem (depending on how you define things, a rational will have two simple continued fraction expansions that are minor variants of each other). For generalized continued fractions, there is definitely not uniqueness. – André Nicolas Aug 23 '12 at 19:14 | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9886682444653242,
"lm_q1q2_score": 0.8554195627648858,
"lm_q2_score": 0.8652240704135291,
"openwebmath_perplexity": 253.13043857529271,
"openwebmath_score": 0.9445370435714722,
"tags": null,
"url": "http://math.stackexchange.com/questions/185971/how-do-i-solve-a-continued-fraction-of-solution-to-quadratic-equation"
} |
Suppose $x$ is a root of $p(z) = z^2 - b z - c$. Then, diving $p(z)$ over $z$ and solving that for $z$ gets us $$z = b+ \frac{c}{z}$$ Iterating: $$z = b + \cfrac{c}{b + \cfrac{c}{z}} = \cfrac{b}{c + \cfrac{c}{b+ \ddots}}$$ Since $\frac{1-\sqrt{5}}{2}$ is a root of $z^2 - z -1$ we have: $$\frac{1-\sqrt{5}}{2} = -\frac{1}{\frac{1+\sqrt{5}}{2}} = - \cfrac{1}{1 + \cfrac{1}{1+ \frac{1}{1+\ddots}}}$$
Added: Consider a sequence, defined by $x_{n+1} = b + \frac{c}{x_n}$, with $x_0 = \frac{c}{y}$. Few initial terms of the sequence are $\frac{c}{y}$, $b + y$, $b + \cfrac{c}{b+y}$, $b + \cfrac{c}{b + \cfrac{c}{b+y}}$, etc. It is well known that terms of this sequence can also be obtained as a ratio of two solutions, $a_n$ and $b_n$ to the following recurrence equation: $$v_{n} = b v_{n-1} + c v_{n-2} \tag{1}$$ with initial conditions $a_0=y$, $a_1 = c$ and $b_0 = 1-\frac{b}{c} y$, $b_1 = y$. Then $x_n = \cfrac{a_n}{b_n}$. The solution to $(1)$ has the form: $$v_{n} = v_0 \frac{z_1 z_2^n - z_2 z_1^n}{z_1-z_2} + v_1 \frac{z_1^n - z_2^n}{z_1-z_2}$$ where $z_1$ and $z_2$ are the two roots of $z^2 - b z -c = 0$. Assume $z_2>z_1$. In the large $n$ limit, $$\lim_{n \to \infty} x_n = \lim_{n \to \infty} \frac{a_n}{b_n}= \lim_{n\to \infty} \frac{a_1 (z_1^n - z_2^n) + a_0 (z_1 z_2^n - z_1^n z_2)}{b_1 (z_1^n - z_2^n) + b_0 (z_1 z_2^n - z_1^n z_2)} = \frac{a_0 z_1 - a_1}{b_0 z_1 - b_1} = \frac{c (c- y z_1)}{c (y - z_1) + b y z_1}$$ In the case at hand $x_0 = \infty$ and $x_1 = b$, corresponding to the limit of $y \to \infty$, in which case the value of the continued fraction becomes: $$\lim_{n \to \infty} x_n = \lim_{y \to 0} \frac{c (c- y z_1)}{c (y - z_1) + b y z_1} = - \frac{c}{z_1} = z_2$$ | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9886682444653242,
"lm_q1q2_score": 0.8554195627648858,
"lm_q2_score": 0.8652240704135291,
"openwebmath_perplexity": 253.13043857529271,
"openwebmath_score": 0.9445370435714722,
"tags": null,
"url": "http://math.stackexchange.com/questions/185971/how-do-i-solve-a-continued-fraction-of-solution-to-quadratic-equation"
} |
-
The result of the continued fraction will be the larger of two roots. With $b>0$ and $c>0$ both roots are real. – Sasha Aug 23 '12 at 18:49
How do you get the other root? Can you give some intuition about why, when you pass from the iterations to the limit, one of the roots "disappears"? – Rahul Aug 23 '12 at 18:52
@RahulNarain The product of roots of the quadratic polynomial is the free term. Thus, the smaller root is $z_2 = -\frac{c}{z_1}$. – Sasha Aug 23 '12 at 18:54
OK, but that doesn't answer my second question, because surely $z_2$ also satisfies $z=b+c/z$, $z = b+c/(b+c/z)$, and so on. – Rahul Aug 23 '12 at 19:03
@RahulNarain I have expanded the post, addressing your second question now. – Sasha Aug 23 '12 at 19:26
The general procedure is as follows for positive $x$. Let $x_0=x$, and let $[a_0;a_1,a_2,\dots]$ be the desired CF expansion. Then $a_0=\lfloor x_0\rfloor$. Given $x_n$ and $a_n$, let $$x_{n+1}=\frac1{x_n-a_n}$$ and $a_{n+1}=\lfloor x_{n+1}\rfloor$.
Since $\frac12(1-\sqrt5)$ is negative, let’s work with its absolute value, $x=\frac12(\sqrt5-1)$. Clearly $0\le x<1$ so $a_0=0$. Then $$x_1=\frac1x=\frac2{\sqrt5-1}=\frac{2(\sqrt5+1)}4=\frac{1+\sqrt5}2\;;$$ so $$\lfloor x_1\rfloor=\left\lfloor\frac{1+\sqrt5}2\right\rfloor=1\;,$$ since $2\le\sqrt5<3$, and $a_1=1$.
Now $$x_2=\frac1{x_1-1}=\frac2{\sqrt5-1}=x_1\;,$$ so everything repeats: $a_2=1$, $x_3=x_1$, $a_3=1$, etc. Thus, $x=[0;1,1,1,\dots]$, and your number is the negative of this.
- | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9886682444653242,
"lm_q1q2_score": 0.8554195627648858,
"lm_q2_score": 0.8652240704135291,
"openwebmath_perplexity": 253.13043857529271,
"openwebmath_score": 0.9445370435714722,
"tags": null,
"url": "http://math.stackexchange.com/questions/185971/how-do-i-solve-a-continued-fraction-of-solution-to-quadratic-equation"
} |
# Math
A radioactive substance decays according to the formula
Q(t) = Q0e−kt
where Q(t) denotes the amount of the substance present at time t (measured in years), Q0 denotes the amount of the substance present initially, and k (a positive constant) is the decay constant.
(a) Find the half-life of the substance in terms of k.
(b) Suppose a radioactive substance decays according to the formula
Q(t) = 36e−0.0001074t
How long will it take for the substance to decay to half the original amount? (Round your answer to the nearest whole number.)
1. 👍 0
2. 👎 0
3. 👁 1,867
1. .5 = e^-k T
ln .5 = - k T
T = -.693/-k = .693/k
b)
T = .693 / .0001074 = 6454 years
1. 👍 0
2. 👎 3
2. A radioactive substance decays according to the formula
Q(t) = Q0e−kt
where Q(t) denotes the amount of the substance present at time t (measured in years), Q0 denotes the amount of the substance present initially, and k (a positive constant) is the decay constant.
(a) Find the half-life of the substance in terms of k.
(b) Suppose a radioactive substance decays according to the formula
Q(t) = 36e−0.0001238t
How long will it take for the substance to decay to half the original amount? (Round your answer to the nearest whole number.)
1. 👍 0
2. 👎 0
## Similar Questions
1. ### calculus
A sample of a radioactive substance decayed to 94.5% of its original amount after a year. (Round your answers to two decimal places.) (a) What is the half-life of the substance? (b) How long would it take the sample to decay to
2. ### algebra 2
In the formula A(t) = A0ekt, A is the amount of radioactive material remaining from an initial amount A0 at a given time t, and k is a negative constant determined by the nature of the material. An artifact is discovered at a
3. ### calculus
assume the half-life of the substance is 31 days and the initial amount is 183.9 grams. (a) Fill in the right hand side of the following equation which expresses the amount A of the substance as a function of time t (the
4. ### Calc | {
"domain": "jiskha.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9825575188391107,
"lm_q1q2_score": 0.8554119002026702,
"lm_q2_score": 0.8705972768020108,
"openwebmath_perplexity": 883.4274277294363,
"openwebmath_score": 0.8712039589881897,
"tags": null,
"url": "https://www.jiskha.com/questions/1041569/a-radioactive-substance-decays-according-to-the-formula-q-t-q0e-kt-where-q-t-denotes"
} |
4. ### Calc
A sample of a radioactive substance decayed to 93.5% of its original amount after a year. a) What is the half-life of the substance? ? years (b) How long would it take the sample to decay to 10% of its original amount? ? years
1. ### precalculus
Twenty percent of a radioactive substance decays in ten years. By what percent does the substance decay each year?
2. ### Exponential Modeling
The half-life of a radioactive substance is one day, meaning that every day half of the substance has decayed. Suppose you have 100 grams of this substance. How many grams of the substance would be left after a week?
3. ### Calculus
The radioactive element polonium decays according to the law given below where Q0 is the initial amount and the time t is measured in days. Q(t) = Q0 · 2-(t/140) If the amount of polonium left after 700 days is 45 mg, what was
4. ### Calculus-Modeling Equations
An unknown radioactive element decays into non-radioactive substances. In 420 days the radioactivity of a sample decreases by 39 percent. 1.What is the half-life of the element? 2.How long will it take for a sample of 100 mg to
1. ### Calculus
The rate of decay is proportional to the mass for radioactive material. For a certain radioactive isotope, this rate of decay is given by the differential equation dm/dt = -.022m, where m is the mass of the isotope in mg and t is
2. ### calculus
radioactive Carbon 14 in a dead organism decays according to the equation A=A e^.000124t where t is in years and A0 is the amount at t=0. Estimate the age of a skull uncovered in an archeological site if 10% of the original Carbon
3. ### mathematics
The exponential formula for the half-life of a radioactive isotope is y=y0ekt, where y is the amount of the isotope remaining after t years, y0 is the initial amount of the isotope, k is the decay constant, and e is the
4. ### Math/Calculus | {
"domain": "jiskha.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9825575188391107,
"lm_q1q2_score": 0.8554119002026702,
"lm_q2_score": 0.8705972768020108,
"openwebmath_perplexity": 883.4274277294363,
"openwebmath_score": 0.8712039589881897,
"tags": null,
"url": "https://www.jiskha.com/questions/1041569/a-radioactive-substance-decays-according-to-the-formula-q-t-q0e-kt-where-q-t-denotes"
} |
4. ### Math/Calculus
After 5 days, a particular radioactive substance decays to 37% of its original amount. Find the half life of this substance. Is this right? Th= ln 2/ln(1/.37) x 5 days | {
"domain": "jiskha.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9825575188391107,
"lm_q1q2_score": 0.8554119002026702,
"lm_q2_score": 0.8705972768020108,
"openwebmath_perplexity": 883.4274277294363,
"openwebmath_score": 0.8712039589881897,
"tags": null,
"url": "https://www.jiskha.com/questions/1041569/a-radioactive-substance-decays-according-to-the-formula-q-t-q0e-kt-where-q-t-denotes"
} |
Episode #125 of the Stack Overflow podcast is here. We talk Tilde Club and mechanical keyboards. Listen now
# Tag Info
14
The way I have explained the fundamental theorem of arithmetic in the past is by establishing what it means to be prime (has exactly two positive divisors) and then having students construct factor trees (where the prime factors at the end are circled). The prime definition avoids some of the caveat-language otherwise seen ("a number only divisible by ...
14
It might not be possible to get your brother to arrive at the proof himself, no matter how much you scaffold it. ("You can lead a horse to water" and all that.) If he's into maths and appreciates a good proof, you might get the desired enthusiasm by just showing him the proof! That said, here's an idea. Forget primes for a moment, and think about ...
14
I think it turns out that "perfect" numbers do not interact much with other parts of number theory. Some of these very old, elementary, very ad-hoc definitions of special classes of integers have proven (and will prove) to interact interestingly with other ideas, but some seem not to. It's not easy for a beginner to guess the significance or subtlety of one ...
13
I don't really answer the question but: why do you want your brother to come to the answer right now? Now, your brother understands that, to prove that the set of prime numbers is infinite, you can assume it is finite. And, from this pool of prime numbers, you can construct a new one that is not in the family. Why don't you let your brother play with that ...
12
This is indeed tricky, and it seems to me the most effective way (in far more general, similar situations) is to show them the problem would be to have them apply their method to another, close problem where the answer is actually opposite. Either they will explain why it does not apply there, and you can argue that the difference is subtle enough to warrant ...
11 | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9825575178175919,
"lm_q1q2_score": 0.8554118993133387,
"lm_q2_score": 0.8705972768020108,
"openwebmath_perplexity": 618.7862224429809,
"openwebmath_score": 0.5858034491539001,
"tags": null,
"url": "https://matheducators.stackexchange.com/tags/number-theory/hot"
} |
11
To really understand why the integers $\mathbb{Z}$ have unique prime factorization, it helps to understand how unique prime factorization can fail in other settings. For example, $$(2 + \sqrt{10}) \cdot (2 - \sqrt{10}) = -6 = -2 \cdot 3,$$ so prime factorizations in $\mathbb{Z}[\sqrt{10}] = \{a + b\sqrt{10}: a, b \in \mathbb{Z}\}$ aren't unique. On the other ...
10
What's wrong is that most of the justification is missing. Why can $N = p^2/q^2$ only happen if $q^2 = 1$? This can be justified using the fundamental theorem of arithmetic (which states that integers have unique prime factorization), but that justification needs to be made explicit, and they need to make sure that the fundamental theorem of arithmetic has ...
10
I would recommend Python combined with SageMath, as already recommended by Joseph O'Rourke, or rather SageMath and Python comes naturally. Python is a modern, and widely used, interpreted language (no compilation needed) it supports big integers via the bignum type. (But using SageMath I think this is tangential, I mention it for completeness mainly.) ...
9
The two statements aren't literally "the same", because as the student observed, they say different things. However, they are logically equivalent: each implies the other. (Similarly, "4/2" isn't literally the same expression as "5 - 3", but they provably represent the same number.) If we could only prove things by repeating the same statement, we couldn't ...
9
Maybe the issue is that if the values you're multiplying have units, then the result of multiplying will have the product of those units. Therefore, your result can't really be equivalent to a value in the base set, because the units are different. Therefore, if applying this to the real world, I suggest considering the repeated-addition interpretation (...
8 | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9825575178175919,
"lm_q1q2_score": 0.8554118993133387,
"lm_q2_score": 0.8705972768020108,
"openwebmath_perplexity": 618.7862224429809,
"openwebmath_score": 0.5858034491539001,
"tags": null,
"url": "https://matheducators.stackexchange.com/tags/number-theory/hot"
} |
8
There is some value beyond the algorithm to insist on the fact that quotient and remainder in an Euclidean division are uniquely determined as soon as one settles on some convention on the remainder. What they are exactly depends on ones convention (non-negative remained, smallest absolute value, or still something else) but if one fixes a convention then ...
8
Another classic is the following: A rectangular floor measures $300 \text{ cm} \times 195 \text{ cm}$. What is the largest square tiles that can be used to cover the floor exactly?
8
Going back to Euclid, I have found questions such as `Given a large supply of rods of length $15$ and $21$, what lengths can be measured?' can appeal to students. This also motivates the result $\gcd(a,b) = ra+sb$ of the (extended) Euclidean Algorithm.
8
Some nice geometrical applications arise in the analysis of periodical curves such as Roulettes (Spirograph curves), Star Polygons, etc. Concrete experience with implementations in toys like Spirograph also provides excellent motivation for more abstract concepts such as cyclic groups.
8
I wrote an article for NCTM's grades 8-14 journal, The Mathematics Teacher, which is about building towards ${\rm F}\ell{\rm T}$ by thinking through ways in which the following statement can be generalized: If you subtract a natural number from its square, then the result is even. I wrote more about this in some earlier StackExchange posts, e.g., MESE ...
8
What is the name of this subdiscipline in math education? In one of the comments, Dave L Renfro has a reference to Piaget, whose work was primarily done with younger schoolchildren. With respect to extending this work into the older years of one's education, a potentially good place to look would be APOS Theory, which is due to Ed Dubinsky and collaborators....
7 | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9825575178175919,
"lm_q1q2_score": 0.8554118993133387,
"lm_q2_score": 0.8705972768020108,
"openwebmath_perplexity": 618.7862224429809,
"openwebmath_score": 0.5858034491539001,
"tags": null,
"url": "https://matheducators.stackexchange.com/tags/number-theory/hot"
} |
7
(Summary: I would suggest exploring it flexibly, but ensuring students also know the "rigid" version.) Rather than directly addressing Euclid's algorithm for the $\gcd$ of two whole numbers, I believe one witnesses similar phenomena when covering the standard algorithm for division. For example, I observe analogs with your remarks of: The flexible method ...
7
Mathematically, even perfect numbers give a good number theory example to the general idea of classification, i.e. all even perfects have a specific form. I use perfect numbers in my number theory class for two or three pedagogical reasons: with some trial and error (and the help of some computational software), I have the students essentially discover ...
7
Wilson's Theorem is very powerful for proving things related to quadratic residues, and I think also in general a good theoretical tool. Motivating it by just saying "hey let's multiply everything together" seems very reasonable and even playful. Why is this theoretical? It is basically saying that if you multiply all units together you get a specified ...
7
The way I understand the question is: If students are not taught fractions, but instead formal deductive proofs of properties of natural numbers, would they learn mathematics better? I find it unlikely. Students struggle with fractions in primary school. Students usually struggle with proofs in gymnasium or university. It seems unlikely that primary school ...
6
I think using actual small primes actually detracts from finding the solution. If you are thinking about finding a number that is not divisible by 2,3, or 5, it is easy to come up with one (11) without having to use a formula. Thus, I would get him thinking about primes more symbolically. Given 3 primes, $p_1, p_2, p_3$ what is their LCM? What is ...
6 | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9825575178175919,
"lm_q1q2_score": 0.8554118993133387,
"lm_q2_score": 0.8705972768020108,
"openwebmath_perplexity": 618.7862224429809,
"openwebmath_score": 0.5858034491539001,
"tags": null,
"url": "https://matheducators.stackexchange.com/tags/number-theory/hot"
} |
6
You probably already know that $1/\zeta(2)$ is the probability of two "random" integers being relatively prime. Since this constant is related to number theory, you should expect any proof of the Basel formula to be hard work. Probably the best proof from the point of view of transparency is obtained by evaluating \int_0^1\int_0^1 \frac{1}{1-xy}{\rm d}x{\...
6
What computer languages might one recommend for, say, investigations in number theory? I find Mathematica ideal, e.g.: "Mod sequences that seem to become constant; and the number 316" "Does 53 diverge to infinity in this Collatz-like sequence?" But: (a) there is a huge start-up learning curve, and (b) Mathematica is not free. Because of the latter, I ...
6 | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9825575178175919,
"lm_q1q2_score": 0.8554118993133387,
"lm_q2_score": 0.8705972768020108,
"openwebmath_perplexity": 618.7862224429809,
"openwebmath_score": 0.5858034491539001,
"tags": null,
"url": "https://matheducators.stackexchange.com/tags/number-theory/hot"
} |
Here's a word problem for the greatest common divisor: 12 boys and 15 girls are to march in a parade. The organizer wants them to march in rows, with each row having the same number of children, and with each row composed of children with the same gender. What is the largest number of children per row that satisfies these constraints? There should be $\... 6 I've heard very good reviews of the 2017 book, "An Illustrated Theory of Numbers" by MH Weissman. The book's main site is here; a write-up, along with some reviews, by the American Mathematical Society can be found here. To quote from the latter (emphasis added by me): An Illustrated Theory of Numbers gives a comprehensive introduction to number theory, ... 5 Euler's original heuristic may "fly" with people who don't know about calculus: just as polynomials (e.g., with all real roots) are essentially products of linear factors$x-\alpha$where$\alpha$runs through the roots, one might imagine that$\sin \pi z$(using radian measure) is a products of something like$1-{z\over n}$for$n$non-zero integer, and ... 5 I like to ask my probability students the question: If you pick an integer between 2 and 100 uniformly at random, what's the probability that it's the average of two (not necessarily different) primes? I like that above question (easily equivalent to Goldbach) because there's no preference for even versus odd numbers as in Goldbach. It also gets ... 5 I am not sure whether this really answers your question, but I could think of the following strategy of introducing these sets of numbers. It is not based on any kind of research and just based on personal experience with first year university students where I sometimes give something similar as a "naive idea" in addition to the proper definitions. The ... 5 Some caveats: I own both books, and have taken number theory courses up to graduate level. Also, your questions are clearly somewhat subjective: what is difficult, relevant or complete for one person, depends | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9825575178175919,
"lm_q1q2_score": 0.8554118993133387,
"lm_q2_score": 0.8705972768020108,
"openwebmath_perplexity": 618.7862224429809,
"openwebmath_score": 0.5858034491539001,
"tags": null,
"url": "https://matheducators.stackexchange.com/tags/number-theory/hot"
} |
are clearly somewhat subjective: what is difficult, relevant or complete for one person, depends on their previous exposure, inclination, course content, and ability. So...in my opinion.. both books are classics, which means they have been around ... 5 Look at patterns in decimal expansions: what is the period of the repeating decimal of$1/n$? From numerical data, the period is at most$n-1$, and you only get equality when$n = p$is prime (but not conversely:$1/11$has decimal period$2$, not$10$). If you look at the period of the decimal of$1/p$for primes$p$besides$2$and$5\$, you find that ... | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9825575178175919,
"lm_q1q2_score": 0.8554118993133387,
"lm_q2_score": 0.8705972768020108,
"openwebmath_perplexity": 618.7862224429809,
"openwebmath_score": 0.5858034491539001,
"tags": null,
"url": "https://matheducators.stackexchange.com/tags/number-theory/hot"
} |
Only top voted, non community-wiki answers of a minimum length are eligible | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9825575178175919,
"lm_q1q2_score": 0.8554118993133387,
"lm_q2_score": 0.8705972768020108,
"openwebmath_perplexity": 618.7862224429809,
"openwebmath_score": 0.5858034491539001,
"tags": null,
"url": "https://matheducators.stackexchange.com/tags/number-theory/hot"
} |
# Coefficient of $x^3$ in expansion of $\frac{1}{e^x\cdot (1+x)}$
If $|x|<1$, then what is the coefficient of $x^3$ in expansion of $\dfrac{1}{e^x\cdot (1+x)}$?
My Try: So I rewrote this by taking $e^x$ to the numerator to get $\frac{e^{-x}}{(1+x)}$. My problem is, how can I deduce the coefficient of $x^3$ here, since I would need to divide the numerator by the denominator, which is a cumbersome task. Is there a simpler way? How can I solve problems like these? I'd love to know.
• You just need that term. Do a few steps of the long division. – Hellen Sep 3 '17 at 14:08
• Is really long division the only method? What if I was asked the coefficient of $x^200$? I would certainly not divide then. There has to be another, more logical way. – Tanuj Sep 3 '17 at 14:09
• Not all the terms of all Taylor series have nice expressions. Some of them may take a lot of effort. I, too, hate it when I need to calculate the $x^5$ term of $\tan x$. Here you can also rewrite $1/(1+x)=1-x+x^2-x^3+\cdots$ and multiply that term-by-term with the series of $e^{-x}$. This is still easy. – Jyrki Lahtonen Sep 3 '17 at 14:12
• @JyrkiLahtonen But in this case, both Taylor series are as nice as it gets... – Clement C. Sep 3 '17 at 14:17
• @ClementC. Quite. But I still wouldn't want to calculate the $x^{200}$ term :-) – Jyrki Lahtonen Sep 3 '17 at 14:50
Hint. Note that $$\frac{1}{e^x\cdot(1+x)}=\frac{e^{-x}}{1-(-x)}=\left(\sum_{n=0}^{\infty} \frac{(-x)^n}{n!}\right)\cdot \left(\sum_{n=0}^{\infty} {(-x)^n}\right)\\ =\left(1-x+\frac{x^2}{2}-\frac{x^3}{6}+o(x^3)\right)\cdot \left(1-x+x^2-x^3+o(x^3)\right).$$ Can you take it from here?
P.S. Along the same lines, it can be seen that, more generally, the coefficient of $x^n$ in the expansion of $\frac{1}{e^x\cdot(1+x)}$ is $$\sum_{k=0}^n\frac{(-1)^k}{k!}\cdot (-1)^{n-k}=(-1)^n\sum_{k=0}^n\frac{1}{k!}.$$ See the Cauchy product wiki page. | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9825575173068324,
"lm_q1q2_score": 0.8554118972192242,
"lm_q2_score": 0.8705972751232809,
"openwebmath_perplexity": 525.2687167001895,
"openwebmath_score": 0.988427460193634,
"tags": null,
"url": "https://math.stackexchange.com/questions/2415349/coefficient-of-x3-in-expansion-of-frac1ex-cdot-1x"
} |
• Okay, I see, but how does that help me? You know if there were two terms in the numerator and one in denominator I could easily solve. But not in this case. – Tanuj Sep 3 '17 at 14:11
• @Tanuj Now you have to expand the product. – Robert Z Sep 3 '17 at 14:14
\begin{eqnarray*} \frac{e^{-x}}{1+x} &=&\left(1-x+\frac{x^2}{2}-\frac{x^3}{6}+\cdots \right) (1- x+x^2-x^3+\cdots ) \\ &=& \cdots +x^3 \underbrace{\left( -1-1-\frac{1}{2}-\frac{1}{6}\right)}_{\color{blue}{-\frac{8}{3}}}+ \cdots \end{eqnarray*}
• Can you explain what exactly did you do? – Tanuj Sep 3 '17 at 14:12
• Wow a eureka moment for me! You used that result of infinite Geometric Progression, right? – Tanuj Sep 3 '17 at 14:14
• Just used the standard expansions for the functions ... – Donald Splutterwit Sep 3 '17 at 14:16
From the two Taylor series at $0$, to order $x^3$:$$e^{-x} = 1-x+\frac{x^2}{2}-\frac{x^3}{6} + o(x^3) \tag{1}$$ and $$\frac{1}{1+x} = 1-x+x^2-x^3+o(x^3)\tag{2}$$ we obtain \begin{align} \frac{e^{-x}}{1+x} &= \left(1-x+\frac{x^2}{2}-\frac{x^3}{6} + o(x^3)\right)\left(1-x+x^2-x^3+o(x^3)\right)\\ &= 1-x+x^2-x^3+o(x^3) - x+x^2-x^3+\frac{x^2}{2}-\frac{x^3}{2}-\frac{x^3}{6}\\ &= 1-2x+\frac{5}{2}x^2{\color{red}{-\frac{8}{3}}}x^3 +o(x^3) \end{align} and you can just read off the coefficient.
Note that when expanding the product, we could have focused on only the terms $x^3$ (it would have been marginally faster, but would have required keeping track); and didn't expand any term $x^k$ with $k>3$, since anyway they are "swallowed" by the $o(x^3)$. | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9825575173068324,
"lm_q1q2_score": 0.8554118972192242,
"lm_q2_score": 0.8705972751232809,
"openwebmath_perplexity": 525.2687167001895,
"openwebmath_score": 0.988427460193634,
"tags": null,
"url": "https://math.stackexchange.com/questions/2415349/coefficient-of-x3-in-expansion-of-frac1ex-cdot-1x"
} |
# Limits of volume integrals
#### GreenGoblin
##### Member
Help choose the limits of the following volume integrals:
1) V is the region bounded by the planes x=0,y=0,z=2 and the surface z=x^2 + y^2 lying the positive quadrant. I need the limits in terms of x first, then y then z AND z first, then y and then x. And also polar coordinates, x=rcost, y=rsint, z=z.
I am trying to convince myself
2) V is the region bounded by x+y+z=1, x=0, y=0, z=0.
#### CaptainBlack
##### Well-known member
Help choose the limits of the following volume integrals:
1) V is the region bounded by the planes x=0,y=0,z=2 and the surface z=x^2 + y^2 lying the positive quadrant. I need the limits in terms of x first, then y then z AND z first, then y and then x. And also polar coordinates, x=rcost, y=rsint, z=z.
I am trying to convince myself
2) V is the region bounded by x+y+z=1, x=0, y=0, z=0.
The region V is the volume above the parabaloid surface $$z=x^2+y^2$$ and below $$z=2$$ in the first quadrant. The projection of this region onto the x-y plane is that part of the circle $$x^2 + y^2=2$$ in the first quadrant.
So this is $$x\in (0,\sqrt{2})$$ and $$y \in (0, \sqrt{2-x^2})$$ and $$z \in ( \sqrt{x^2+y^2} , 2)$$
CB
#### HallsofIvy
##### Well-known member
MHB Math Helper
(I assume that by "x first, then y then z" you are referring to going from left to right. Of course, the integration is in the opposite order.) | {
"domain": "mathhelpboards.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9825575157745542,
"lm_q1q2_score": 0.8554118909368807,
"lm_q2_score": 0.870597270087091,
"openwebmath_perplexity": 460.1375426343177,
"openwebmath_score": 0.9391376972198486,
"tags": null,
"url": "https://mathhelpboards.com/threads/limits-of-volume-integrals.1052/"
} |
"x first, then y then z" is pretty much the usual way to do an integral like this. Note that if we project into the xy-plane, the upper boundary projects to the circle $x^2+ y^2= 2$, a circle of radius $2$, centered at (0, 0) and in the first quadrant that is a quarter circle. In order to cover that entire figure, clearly x has to go from 0 to $\sqrt{2}$. Now, for each x, y must go from the x-axis, y= 0, up to the circle, $y= \sqrt{2- x^2}$. And, finally, for any given (x,y), z must go from the paraboloid, $z= x^2+ y^2$, to z= 2. The integral would be $\int_{x=0}^\sqrt{2}\int_{y= 0}^\sqrt{2- x^2}\int_{z= x^2+ y^2}^2 f(x,y,z)dzdydx$.
In the other order, z first, then y and then x, project to the yz- plane. There, of course, the paraboloid project to half of the parabola $z= y^2$. Now, z goes from 0 to 2 and, for each z, y goes from 0 to $\sqrt{z}$. Now, for each y and z, x goes from 0 to $\sqrt{2- y^2}$. The integral would be $\int_{z=0}^2\int_{y= 0}^\sqrt{z}\int_{x= 0}^\sqrt{2- y^2} f(x,y,z)dxdydz$.
For V is the region bounded by x+y+z=1, x=0, y=0, z=0, with the order "x first, then y then z", we project to the xy-plane which gives the triangle bounded by x= 0, y= 0, and x+ y= 1. x ranges from 0 to 1 and, for each x, y ranges from 0 to 1- x. For each (x, y), z ranges from 0 to 1- x- y. The integral would be $\int_{x= 0}^1\int_{y= 0}^{1- x}\int_{z= 0}^{1- x- y} f(x,y,z) dzdydx$. Can you get it for the order "z first, then y then x"?
Last edited: | {
"domain": "mathhelpboards.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9825575157745542,
"lm_q1q2_score": 0.8554118909368807,
"lm_q2_score": 0.870597270087091,
"openwebmath_perplexity": 460.1375426343177,
"openwebmath_score": 0.9391376972198486,
"tags": null,
"url": "https://mathhelpboards.com/threads/limits-of-volume-integrals.1052/"
} |
# Variance of alternate flipping rounds
I did the following exercise, but I would like to extend the question to the variance of the variate.
Bob and Bub each has his own coin. Chance of coming up "heads" is $\rho$ for Bob's coin and $\tau$ for Bub's. They flip alternatively, first Bob, then Bub, then Bob again, etc. Let Bob's flip followed by Bub's flip constitute a round, and let $R$ denote the number of rounds until each gets "heads" at least once. For $\rho = 1/3$, $\tau = 2/5$, what is the expectation of $R$?
General answer for the expectation is:
$$\mathbb{E}[R]=\frac{1 + \frac{\rho}{\tau} + \frac{\tau}{\rho} - (\rho + \tau)}{\rho + \tau - \rho \, \tau}$$
This agrees with Monte Carlo simulation I did (with $10^5$ repeats), which approximates expectation and variance (with $\rho = 1/3$, and $\tau = 2/5$) to $3.84647$ and $6.48666$ respectively.
Is anybody able to calculate variance symbolically?
• Out of curiosity, where does your expected value formula come from?
– Remy
Dec 1, 2017 at 0:23
• @Remy I derived it. In a nutshell, $R$ is distributed geometrically with parameter $p = \rho + \tau - \rho \, \tau$ (probability of success of either one of them) plus a geometric variate with parameter $p = \rho$ and weighted with probability $\mathbb{P}\{\text{Bob didn't have success, but Bub did} \, | \, \text{either had}\}$ plus a similar variate for the reverse case.
– BoLe
Dec 2, 2017 at 12:51
Please load the page $$2\sim3$$ times for the hyperlinks to work properly.
# Outline
Setup the Notations : As titled.
Solution.1 : Direct application of the conditional decomposition of expectation. This is the foolproof approach if one wants a quick numeric evaluation and doesn't want to be bothered with analysis.
Solution.2 : A framework that provides perspectives and better calculation.
Appendix.A : Supplementary material to Solution.1.
Appendix.B.1 : In-site links to existing questions that are closely related. | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9825575173068326,
"lm_q1q2_score": 0.8554118856730828,
"lm_q2_score": 0.8705972633721708,
"openwebmath_perplexity": 988.824214576845,
"openwebmath_score": 0.9992894530296326,
"tags": null,
"url": "https://math.stackexchange.com/questions/2544529/variance-of-alternate-flipping-rounds/2701095"
} |
Appendix.B.1 : In-site links to existing questions that are closely related.
Appendix.B.2 : Supplementary material to Solution.2.
# Setup the Notations
Let $$X$$ be the total number of trials of Bob's flips when his first head (success) appears.
Let $$Y$$ be that for Bub. We have $$X\sim \mathrm{Geo}[\rho]$$ independent to $$Y\sim \mathrm{Geo}[\tau]$$.
The following basics for a Geometric distribution will be useful here: \begin{align*} \mu_{_X} &\equiv \mathbb{E}[X] = \frac1{\rho} & & \tag*{Eq.(1)} \label{Eq01} \\ A_X &\equiv \mathbb{E}[X(X+1)] = \frac2{ \rho^2 } & &\tag*{Eq.(2)} \label{Eq02} \\ S_X &\equiv \mathbb{E}[X^2 ] = \frac{2 - \rho}{ \rho^2 } & &\tag*{Eq.(3)} \label{Eq03} \\ V_X &\equiv \mathbb{V}[X] = \frac{1 - \rho}{ \rho^2 } & &\tag*{Eq.(4)} \label{Eq04} \\ Q_X &\equiv \mathbb{E}[(X+1)^2] = A_X + \mu_{_X} + 1 = \frac{ 2 + \rho + \rho^2 }{ \rho^2 } & &\tag*{Eq.(5)} \label{Eq05} \end{align*} Recall that we often use $$A_X$$ to obtain $$S_X$$ because $$A_X$$ is easier to derive (it is a more natural quantity for the Geometric distribution).
The shorthands for $$Y$$ are the same $$\mu_{_Y}$$ and $$V_Y$$ etc.
# Solution.1 | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9825575173068326,
"lm_q1q2_score": 0.8554118856730828,
"lm_q2_score": 0.8705972633721708,
"openwebmath_perplexity": 988.824214576845,
"openwebmath_score": 0.9992894530296326,
"tags": null,
"url": "https://math.stackexchange.com/questions/2544529/variance-of-alternate-flipping-rounds/2701095"
} |
Just like how the expectation can be derived (which apparently you know how to), the 2nd moment (thus variance) can be obtained by conditioning on the results of the round. Denote the events of $$\{ \text{Bob head, Bub tail} \}$$ as just $$HT$$, and recall that $$X$$ is for Bob flipping alone as if Bub doesn't exist. \begin{align*} \mathbb{E}[ R^2 ] &= \rho \tau \, \mathbb{E}\left[ R^2 \,\middle|~ HH\right] + (1 - \rho)(1 - \tau)\,\mathbb{E}\left[ R^2 \,\middle|~ TT\right] \\ &\hspace{36pt} + \rho (1 - \tau) \, \mathbb{E}\left[ R^2 \,\middle|~ HT\right] + \tau (1 - \rho)\,\mathbb{E}\left[ R^2 \,\middle|~TH\right] \\ &= \rho \tau + (1 - \rho)(1 - \tau)\,\mathbb{E} \left[ (1+R)^2 \right] + \rho (1 - \tau) \, \mathbb{E}\left[ (1+Y)^2 \right] + \tau (1 - \rho)\,\mathbb{E}\left[ (1+X)^2 \right] \end{align*} Please let me know if you need justification for $$\mathbb{E}[ R^2 ~|~~TH] = \mathbb{E}[ (1+Y)^2 ]$$ and the alike. Moving on, use the \ref{Eq04} shorthand $$Q_X$$ and $$Q_Y$$ for now and rearrange. $$\mathbb{E}[ R^2 ] = \rho \tau + (1 - \rho)(1 - \tau) \left( \mathbb{E}[ R^2 ] + 2 \mathbb{E}[ R ] + 1 \right) + \rho (1 - \tau) Q_Y + \tau (1 - \rho)\,Q_X$$ Denote $$\lambda = 1 - (1 - \rho)(1 - \tau) = \rho + \tau - \rho \tau$$, and collect $$\mathbb{E}[ R^2 ]$$ on the left. $$\begin{equation*} \lambda\,\mathbb{E}[ R^2 ] = \rho \tau + (1 - \lambda) \left( 2 \mathbb{E}[ R ] + 1 \right) + \rho (1 - \tau) Q_Y + \tau (1 - \rho)\,Q_X \tag*{Eq.(6)} \label{Eq06} \end{equation*}$$ Note that the denominator of $$\mathbb{E}[ R ]$$ is just $$\lambda$$. Along with the symmetry, this suggests that the numerator of $$\mathbb{E}[ R ]$$ can be rewritten into a better form invoking the basic \ref{Eq01}. \begin{align*} 1 + \frac{ \rho }{ \tau } + \frac{ \tau }{ \rho } - (\rho + \tau) &= \bigl( 1 + \frac{ \rho }{ \tau } - \rho \bigr) + \bigl( 1 + \frac{ \tau }{ \rho } - \tau \bigr) - 1 \\ &= \frac{ \tau + \rho - \rho\tau }{ \tau } + \frac{ \rho + \tau - \rho\tau }{ \rho } - 1 \\ \implies | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9825575173068326,
"lm_q1q2_score": 0.8554118856730828,
"lm_q2_score": 0.8705972633721708,
"openwebmath_perplexity": 988.824214576845,
"openwebmath_score": 0.9992894530296326,
"tags": null,
"url": "https://math.stackexchange.com/questions/2544529/variance-of-alternate-flipping-rounds/2701095"
} |
&= \frac{ \tau + \rho - \rho\tau }{ \tau } + \frac{ \rho + \tau - \rho\tau }{ \rho } - 1 \\ \implies \mathbb{E}[ R ] = \frac1{\rho} + \frac1{\tau} &- \frac1{\lambda} = \mu_{_X} + \mu_{_Y} - \frac1{\lambda} \tag*{Eq.(7)} \label{Eq07} \end{align*} It's not a coincidence that the expectation can be expressed as such. The reason will be elaborated in the next section for Solution.2. | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9825575173068326,
"lm_q1q2_score": 0.8554118856730828,
"lm_q2_score": 0.8705972633721708,
"openwebmath_perplexity": 988.824214576845,
"openwebmath_score": 0.9992894530296326,
"tags": null,
"url": "https://math.stackexchange.com/questions/2544529/variance-of-alternate-flipping-rounds/2701095"
} |
For the sake of computing the numeric value, \ref{Eq06} was a good place to stop. With the given parameters $$\rho = 1/3$$ and $$\tau = 2/5$$, we have $$\mathbb{E}[ R ] = 23/6$$, $$Q_X = 22$$, and $$Q_Y = 16$$. That makes $$\mathbb{E}[ R^2 ] = 190/9$$ and the variance $$V_R \equiv \mathbb{E}[ R^2 ] - \mathbb{E}[R]^2 = \frac{77}{12}~.$$ See the end of Solution.2 for a Mathematica code block for the numerical evaluation and more.
One can quickly check the value of $$\mathbb{E}[ R ] \approx 3.8333$$ relative to $$\mu_{_X} = 3$$ and $$\mu_{_Y} = 2.5$$, as well as $$V_R \approx 6.146667$$ in relation to $$V_X = 6$$ and $$V_Y = 15/4$$. Both of the quantities for $$R$$ are slightly larger than the max of $$X$$ and $$Y$$, which is reasonable.
Now, if you have a strong inclination for algebraic manipulation, then the following is what you might arrive at, after some trial and error. Recall the shorthand for the 2nd moment \ref{Eq03}: $$\begin{equation*} \mathbb{E}[ R^2 ] = \frac{ 2 - \rho }{ \rho^2 } + \frac{ 2 - \tau }{ \tau^2 } - \frac{ 2 - \lambda }{ \lambda^2 } = S_X + S_Y - \frac{ 2 - \lambda }{ \lambda^2 } \tag*{Eq.(8)} \label{Eq08} \end{equation*}$$ Again, this is not a coincidence. Along with \ref{Eq07}, their respective 3rd terms seem to be another Geometric random variable with the success' parameter $$\lambda$$. The proper probabilistic analysis is the subject of Solution.2 up next.
By the way, blindly shuffling the terms around is usually not the best thing one can do. Nonetheless, just for the record, Appendix.A shows one way of going from \ref{Eq06} to \ref{Eq08} mechanically.
# Solution.2 | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9825575173068326,
"lm_q1q2_score": 0.8554118856730828,
"lm_q2_score": 0.8705972633721708,
"openwebmath_perplexity": 988.824214576845,
"openwebmath_score": 0.9992894530296326,
"tags": null,
"url": "https://math.stackexchange.com/questions/2544529/variance-of-alternate-flipping-rounds/2701095"
} |
# Solution.2
Denote $$W \equiv \min(X,Y)$$ as the smaller among the two and $$Z \equiv \max(X,Y)$$ as the larger. The key observation to solve this problem is that $$Z \overset{d}{=} R~, \qquad\qquad \textbf{the maximum has the same distribution as the 'rounds'.}$$ This allows one to think about the whole scenario differently (not as rounds of a two-player game). For all $$k \in \mathbb{N}$$, since $$X \perp Y$$ we have \begin{align*} \Pr\{ Z = k \} &= \Pr\{ X < Y = Z = k \} \\ &\hspace{36pt} + \Pr\{ Y < X = Z = k \} \\ &\hspace{72pt} + \Pr\{ X = Y = Z = k \} \\ &= \tau (1 - \tau)^{k-1} (1 - (1-\rho)^k) \\ &\hspace{36pt} + \rho (1 - \rho)^{k-1} (1 - (1-\tau)^k) \\ &\hspace{72pt} + \rho\tau (1 - \rho)^{k-1} (1 - \tau)^{k-1} \tag*{Eq.(9)} \label{Eq09} \end{align*} In principle, now that the distribution of $$Z$$ (thus $$R$$) is completely specified, everything one would like to know can be calculated. This is indeed a valid approach (to obtain the mean and variance), and the terms involved are all basic series with good symmetry.
Note that $$Z$$ is not Geometric (while $$X$$, $$Y$$, and $$W$$ are), nor is it Negative Binomial. At this point, it is not really of interest that \ref{Eq09} can be rearranged into a more compact and illuminating form ...... because we can do even better.
There are two more observations that allow one to not only to better calculate but also understand the whole picture. \begin{align*} &X+Y = W + Z \tag*{Eq.(10)} \label{Eq10} \\ &W \sim \mathrm{Geo[\lambda]} \tag*{Eq.(11)} \label{Eq11} \end{align*} This is the special case of the sum of the order statistics being equal to the original sum. In general with many summands this not very useful, but here with just two terms it is crucial. | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9825575173068326,
"lm_q1q2_score": 0.8554118856730828,
"lm_q2_score": 0.8705972633721708,
"openwebmath_perplexity": 988.824214576845,
"openwebmath_score": 0.9992894530296326,
"tags": null,
"url": "https://math.stackexchange.com/questions/2544529/variance-of-alternate-flipping-rounds/2701095"
} |
Back to the two-player game scenario, the fact that $$W$$ is Geometric with success probability $$\lambda = 1 - (1 - \rho)(1 - \tau)$$ is easy to see: a round 'fails' if and only if both flips 'fail', with a probability $$(1 - \rho)(1 - \tau) = 1 - \lambda$$.
The contour of $$W = k$$ is L-shaped boundary of the '2-dim tail', which fits perfectly with the scaling nature (memoryless) of the joint of two independent Geometric distribution. Pleas picture in the figure below that $$\Pr\left\{W = k_0 + k ~ \middle|~~ W > k_0 \right\} = \Pr\{ W = k\}$$ manifests itself as the L-shape scaling away.
The contour of $$Z = k$$ looks like $$\daleth$$, and together with the L-contour of $$W$$ they make a cross. This is \ref{Eq10} the identity $$X+Y = W+Z$$, visualized in the figures below. See Appendix.B.1 for the linked in-site posts of related topics.
Immediately we know the expectation to be: $$\begin{equation*} \mathbb{E}[ Z ] = \mathbb{E}[ X + Y - W ] = \mu_{_X} + \mu_{_Y} - \mu_{_W} = \frac1{\rho} + \frac1{\tau} - \frac1{\lambda} \tag*{Eq.(7.better)} \end{equation*}$$
This derivation provides perspectives different from (or better, arguably) those obtained by conditioning on the first round. | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9825575173068326,
"lm_q1q2_score": 0.8554118856730828,
"lm_q2_score": 0.8705972633721708,
"openwebmath_perplexity": 988.824214576845,
"openwebmath_score": 0.9992894530296326,
"tags": null,
"url": "https://math.stackexchange.com/questions/2544529/variance-of-alternate-flipping-rounds/2701095"
} |
Derivation of the 2nd moment reveals a more intriguing properties of the setting. \begin{align*} \mathbb{E}[ Z^2 ] &= \mathbb{E}[ (X + Y - W)^2 ] \\ &= \mathbb{E}[ (X + Y)^2 ] + \mathbb{E}[ W^2 ] - 2\mathbb{E}[ (X + Y) W ] \\ &= \mathbb{E}[ X^2 ] + \mathbb{E}[ Y^2 ] + 2 \mathbb{E}[ XY ] + \mathbb{E}[ W^2 ] - 2\mathbb{E}[ (W+Z) W ] \qquad\because X+Y = W+Z\\ &= \mathbb{E}[ X^2 ] + \mathbb{E}[ Y^2 ] - \mathbb{E}[ W^2 ] + 2\mathbb{E}[ XY ] - 2\mathbb{E}[ WZ ] \end{align*} Here's the kicker: when $$X \neq Y$$, by definition $$W$$ and $$Z$$ each take one of them so $$WZ = XY$$, and when $$X = Y$$ we have $$WZ = XY$$ just the same!! Consequently, $$\mathbb{E}[ ZW ] = \mathbb{E}[ XY ] =\mu_{_X} \mu_{_Y}$$ always, and they cancel. $$\begin{equation*} \mathbb{E}[ Z^2 ] = \mathbb{E}[ X^2 ] + \mathbb{E}[ Y^2 ] - \mathbb{E}[ W^2 ] = \frac{ 2 - \rho }{ \rho^2 } + \frac{ 2 - \tau }{ \tau^2 } - \frac{ 2 - \lambda }{ \lambda^2 } \tag*{Eq.(8.better)} \label{Eq08better} \end{equation*}$$ This is the proper derivation, and in \ref{Eq08} the 3rd term following $$S_X + S_Y$$ is indeed $$-S_W$$.
Keep in mind that both $$W$$ and $$Z$$ are clearly correlated with $$X$$ and $$Y$$, while our intuition also says that the correlation between $$W$$ and $$Z$$ is positive (see Appendix.B for a discussion).
While we're at it, this relation in fact holds true for any (higher) moments, $$\mathbb{E}[ Z^n ] = \mathbb{E}[ X^n ] + \mathbb{E}[ Y^n ] - \mathbb{E}[ W^n ]~.$$This is true due to the same argument that gave us $$WZ = XY$$, and using \ref{Eq09} doing the explicit sums to derive this identity is also easy. | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9825575173068326,
"lm_q1q2_score": 0.8554118856730828,
"lm_q2_score": 0.8705972633721708,
"openwebmath_perplexity": 988.824214576845,
"openwebmath_score": 0.9992894530296326,
"tags": null,
"url": "https://math.stackexchange.com/questions/2544529/variance-of-alternate-flipping-rounds/2701095"
} |
Without further ado, the variance of $$Z$$ (thus the variance of $$R$$), previously known only as the unsatisfying "\ref{Eq06} minus the square of $$\mathbb{E}[ Z ]$$'', can now be put in its proper form. \begin{align*} V_Z &\equiv \mathbb{E}[ Z^2 ] - \mathbb{E}[ Z ]^2 \\ &= \mathbb{E}[ X^2 ] + \mathbb{E}[ Y^2 ] - \mathbb{E}[ W^2 ] - ( \mu_{_X} + \mu_{_Y} - \mu_{_W} )^2 \\ &= V_X + V_Y - V_W + 2( \mu_{_W} \mu_{_Z} - \mu_{_X} \mu_{_Y}) \tag*{Eq.(12.a)} \\ &= \frac{ 1 - \rho }{ \rho^2 } + \frac{ 1 - \tau }{ \tau^2 } - \frac{ 1 - \lambda }{ \lambda^2 } + 2\left( \frac1{ \lambda } \bigl( \frac1{ \rho } + \frac1{ \tau } - \frac1{ \lambda } \bigr) - \frac1{ \rho \tau }\right) \tag*{Eq.(12.b)} \end{align*} This expression (or the symbolic one just above) is a perfectly nice formula to me. You can rearrange it to your heart's content, for example, like this $$\begin{equation*} V_Z = \bigl( \frac1{ \rho } - \frac1{ \tau } \bigr)^2 - \frac1{ \lambda^2 } + 2 (\frac1{\lambda} - \frac12) \bigl( \frac1{ \rho } + \frac1{ \tau } - \frac1{ \lambda } \bigr) \tag*{Eq.(12.c)} \end{equation*}$$ which emphasizes the role played by the difference between $$X-Y$$.
I'm not motivated to pursue a 'better' form beyond Eq.(12), and if anyone knows any alternative expressions that are significant either algebraically or probabilistically, please do share.
Let me conclude with a Mathematica code block verifying the numeric values and identities for the variance, the 2nd moment, as well as the earliest algebra of the conditioning of expectation. | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9825575173068326,
"lm_q1q2_score": 0.8554118856730828,
"lm_q2_score": 0.8705972633721708,
"openwebmath_perplexity": 988.824214576845,
"openwebmath_score": 0.9992894530296326,
"tags": null,
"url": "https://math.stackexchange.com/questions/2544529/variance-of-alternate-flipping-rounds/2701095"
} |
(* t = \tau, p = \rho, m = E[R], S = E[R^2] , h = \lambda = 1-(1-p)(1-t) *) ClearAll[t , p, m, S, V, h, tmp, simp, sq, var, basics]; basics[p_] := {1/p, (1 - p)/p^2, (2 - p)/p^2, (2 + p + p^2)/ p^2};(* EX, VX, E[X^2], E[(1+X)^2]*)
Row@{basics[1/3], Spacer@10, basics[2/5], Spacer@10, basics[1 - (1 - 1/3) (1 - 2/5)]}
simp = Simplify[#, 0 < p < 1 && 0 < t < 1] &; h = 1 - (1 - p) (1 - t); m = (1 + t/p + p/t - (t + p))/h; sq[a_] := (2 - a)/a^2;(* 2nd moment of a Geometric distribution *) var[a_] := (1 - a)/a^2;
S = tmp /. Part[#, 1]&@Solve[tmp == p t + (1 - p) (1 - t) (1 + 2 m + tmp) + p (1 - t) (1 + 2/t + sq@t) + (1 - p) t (1 + 2/p + sq@p), tmp] //simp (* this simplification doesn't matter ... *)
V = S - m^2 // simp (* neither does this. *)
{tmp = V /. {p -> 1/3, t -> 2/5}, tmp // N} (* below: veryfiy the various identities for 2nd moment and variance. Difference being zero means equal *)
{sq@t + sq@p - sq@h - S, var@p + var@t - var@h + 2 m 1/h - 2/(p t) - V, (1/p - 1/t)^2 - 1/h^2 + 2 (1/p + 1/t - 1/h) (1/h - 1/2) - V} // simp
`
$$\large\textbf{Appendix.A: }\normalsize\text{an algebraic route from \ref{Eq06} to \ref{Eq08}}$$ | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9825575173068326,
"lm_q1q2_score": 0.8554118856730828,
"lm_q2_score": 0.8705972633721708,
"openwebmath_perplexity": 988.824214576845,
"openwebmath_score": 0.9992894530296326,
"tags": null,
"url": "https://math.stackexchange.com/questions/2544529/variance-of-alternate-flipping-rounds/2701095"
} |
Consider \ref{Eq06} one part at a time. First, the $$2(1 - \lambda)\, \mathbb{E}[ R ]$$. From the the first line to the 2nd line, $$1 - \lambda = (1 - \rho)(1 - \tau)$$ is inserted for the 2nd term: \begin{align*} 2(1 - \lambda)\, \mathbb{E}[ R ] &= 2(1 - \lambda )\frac{ - 1}{\lambda} + 2(1 - \lambda) \bigl( \frac1{ \rho } + \frac1{ \tau } \bigr) \\ &= 2\frac{\lambda - 1}{\lambda} + \frac{2(1 - \rho ) }{ \rho }(1 - \tau) + (1 - \rho ) \frac{ 2(1 - \tau) }{ \rho } \\ &= 2 - \frac2{\lambda} + \bigl( \frac{2 - \rho}{ \rho } - 1\bigr) (1 - \tau) + \bigl( \frac{2 - \tau}{ \tau } - 1 \bigr) (1 - \rho ) \\ &= \color{magenta}{2 - \frac2{\lambda} } + \frac{2 - \rho}{ \rho^2 } (1 - \tau)\rho \color{magenta}{- (1 - \tau)} + \frac{2 - \tau}{ \tau^2 } (1 - \rho )\tau \color{magenta}{- (1 - \rho )} \end{align*} Next in line are the $$Q_X$$ terms. \begin{align*} \rho (1 - \tau) Q_Y + \tau (1 - \rho)\,Q_X &= \rho (1 - \tau) \bigl( \frac{ 2 + \tau }{ \tau^2 } + 1\bigr) + \tau (1 - \rho) \bigl( \frac{ 2 + \rho }{ \rho^2 } + 1 \bigr) \\ &= \rho \bigl( \frac{ 2 - \tau - \tau^2 }{ \tau^2 } + 1 - \tau \bigr) + \tau \bigl( \frac{ 2 - \rho - \rho^2 }{ \rho^2 } + 1 - \rho \bigr) \\ &= \rho \frac{ 2 - \tau}{ \tau^2 } + \tau \frac{ 2 - \rho }{ \rho^2 } \color{magenta}{- 2\tau\rho} \end{align*} Put things back together in \ref{Eq06}, the magenta terms combine with $$\rho\tau$$ and $$1 - \lambda$$ (multiplied by 1): \begin{align*} \lambda\,\mathbb{E}[ R^2 ] &= \rho \tau + (1 - \lambda) + (1 - \lambda) 2 \mathbb{E}[ R ] + \rho (1 - \tau) Q_Y + \tau (1 - \rho)\,Q_X \\ &= \rho \tau + (1 - \lambda) \color{magenta}{ {}+ 2 - \frac2{\lambda} - (1 - \tau) - (1 - \rho ) - 2\tau\rho} \\ &\hphantom{{}= \rho \tau} + \frac{2 - \rho}{ \rho^2 } (1 - \tau)\rho + \frac{2 - \tau}{ \tau^2 } (1 - \rho )\tau \tag{from \mathbb{E}[R]}\\ &\hphantom{{}= \rho \tau } + \tau \frac{ 2 - \rho }{ \rho^2 } + \rho \frac{ 2 - \tau}{ \tau^2 } \tag{from Q_X etc}\\ &= 1 - \frac2{\lambda} + \frac{ 2 - \rho }{ \rho^2 } \bigl( \rho + | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9825575173068326,
"lm_q1q2_score": 0.8554118856730828,
"lm_q2_score": 0.8705972633721708,
"openwebmath_perplexity": 988.824214576845,
"openwebmath_score": 0.9992894530296326,
"tags": null,
"url": "https://math.stackexchange.com/questions/2544529/variance-of-alternate-flipping-rounds/2701095"
} |
\tau^2 } \tag{from Q_X etc}\\ &= 1 - \frac2{\lambda} + \frac{ 2 - \rho }{ \rho^2 } \bigl( \rho + \tau - \rho\tau \bigr) + \frac{ 2 - \tau }{ \tau^2 } \bigl( \rho + \tau - \rho\tau \bigr) \\ &= 1 - \frac2{\lambda} + \frac{ 2 - \rho }{ \rho^2 } \lambda + \frac{ 2 - \tau }{ \tau^2 } \lambda \end{align*} Finally we can divide by the coefficient of $$\mathbb{E}[ R^2 ]$$ on the left hand side and obtain \ref{Eq08}. | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9825575173068326,
"lm_q1q2_score": 0.8554118856730828,
"lm_q2_score": 0.8705972633721708,
"openwebmath_perplexity": 988.824214576845,
"openwebmath_score": 0.9992894530296326,
"tags": null,
"url": "https://math.stackexchange.com/questions/2544529/variance-of-alternate-flipping-rounds/2701095"
} |
$$\large\textbf{Appendix.B.1: }\normalsize\text{In-Site Links to Related Questions}$$
I found many existing posts about this topic (minimum of two independent non-identical Geometric distributions). In chronological order: 90782, 845706, 1040620, 1056296, 1169142, 1207241, and 2669667.
Unlike the min, only 2 posts about max is found so far: 971214, and 1983481. Neither of the posts go beyond the 1st moment, and only a couple of the answers address the 'real geometry' of the situation.
In particular, consider the trinomial random variable $$T$$ that splits the 2-dim plane into the 3 regions. $$\begin{equation*} T \equiv \mathrm{Sign}(Y - X) = \begin{cases} \hphantom{-{}} 1 & \text{if}~~Y > X \quad \text{, with probability}~~ \tau( 1 - \rho) / \lambda \\ \hphantom{-{}} 0 & \text{if}~~X = Y \quad \text{, with probability}~~ \rho \tau / \lambda \\ -1 & \text{if}~~Y < X \quad \text{, with probability}~~ \rho( 1 - \tau) / \lambda \end{cases} \end{equation*}$$ This trisection of above-diagonal, diagonal, and below-diagonal is fundamental to the calculation of both $$W$$ and $$Z$$.
It can be easily shown that $$T \perp W$$, that the trisection is independent of the minimum. For example, $$\Pr\left\{ T = 1 \mid W = k\right\} = \Pr\{ T = 1\}$$ for all $$k$$.
Note that $$T$$ is not independent to $$Z$$ (even with the corner $$k=1$$ removed).
In the continuous analogue, $$\{X,Y,W\}$$ are Exponential with all the nice properties, and $$Z$$ is neither Exponential nor Gamma (analogue of Negative Binomial).
The density of the $$Z$$ analogue is easy and commonly used, but its doesn't seem to have a name. At best one can categorize it as a special case of phase-type (PH distribution).
$$\large\textbf{Appendix.B.2: }\normalsize\text{Covariance between \min(X,Y) and \max(X,Y), along with related discussions.}$$ | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9825575173068326,
"lm_q1q2_score": 0.8554118856730828,
"lm_q2_score": 0.8705972633721708,
"openwebmath_perplexity": 988.824214576845,
"openwebmath_score": 0.9992894530296326,
"tags": null,
"url": "https://math.stackexchange.com/questions/2544529/variance-of-alternate-flipping-rounds/2701095"
} |
Recall the expectations: $$\mathbb{E}[X] = \mu_{_X} = 1 / \rho$$, and the similar \begin{align*} \mu_{_Y} &= \frac1{ \tau }~, & \mu_{_W} &= \frac1{ \lambda } = \frac1{\rho + \tau - \rho\tau}~, & &\text{and}\quad \mu_{_Z} = \mu_{_X} + \mu_{_Y} - \mu_{_W} \end{align*} The covariance between the minimum and the maximum is $$\begin{equation*} C_{WZ} \equiv \mathbb{E}\left[ (W - \mu_{_W} ) (Z - \mu_{_Z} ) \right] = \mathbb{E}[ WZ ] - \mu_{_W} \mu_{_Z} = \mu_{_X} \mu_{_Y} - \mu_{_W} \mu_{_Z} \tag*{Eq.(B)} \label{EqB} \end{equation*}$$ The last equal sign invokes the intriguing $$WZ = XY$$ mentioned just before \ref{Eq08better}.
A positive covariance (thus correlation) expresses the intuitive idea that when the min is large then the max also tends to be large.
Here we do a 'verbal proof' of $$C_{WZ} > 0$$ for all combinations of parameters. The purpose is not really a technical proof but more about illustrating the relations between $$\{W, Z\}$$ and $$\{X, Y\}$$.
Since $$\mu_{_X} + \mu_{_Y} = \mu_{_W} + \mu_{_Z}$$, the covariance $$C_{WZ}$$ is in essence comparing products (of two non-negative numbers) given the value of the sum. We know that for a fixed sum, the closer the two 'sides' (think rectangle) are the larger the product.
Being the min and max, $$\mu_{_W}$$ and $$\mu_{_Z}$$ are more 'extreme' and can never be as close as $$\mu_{_X}$$ and $$\mu_{_Y}$$, throughout the entire parametric space $$\{ \rho, \tau \} \in (0, 1)^2$$. Boom, QED.
(the extreme cases where at least one of $$\{\rho, \tau\}$$ is zero or one are all ill-defined when it comes to min and max)
An algebraic proof for $$C_{WZ} > 0$$ (or for everything in this appendix) is easy. Let me emphasize the descriptive aspect. | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9825575173068326,
"lm_q1q2_score": 0.8554118856730828,
"lm_q2_score": 0.8705972633721708,
"openwebmath_perplexity": 988.824214576845,
"openwebmath_score": 0.9992894530296326,
"tags": null,
"url": "https://math.stackexchange.com/questions/2544529/variance-of-alternate-flipping-rounds/2701095"
} |
Consider what it means for $$W$$ as a Geometric distribution to be the minimum of $$X$$ and $$Y$$. \begin{align*} \frac1{\lambda} &< \min( \frac1{\rho}, \frac1{\tau} ) & &\text{faster to 'succeed' on average} \\ \lambda &> \max( \rho, \tau ) & &\text{better than the higher success parameter} \end{align*} That is, the mean of the 'minimum flip' $$\mu_{_W} < \min( \mu_{_X}, \mu_{_Y} )$$ is more extreme at the lower end.
On the other hand, $$Z$$ is NOT a Geometric distribution. However, one can define an auxiliary $$Z' \sim \mathrm{Geo}[1 / \mu_{_Z}]$$ with an equivalent mean $$\mu_{_{Z'}} = \mu_{_Z}$$. Once we have arrived at \ref{EqB}, the role of $$Z$$ can be replaced by $$Z'$$: $$C_{WZ} = C_{WZ'} = \mu_{_X} \mu_{_Y} - \mu_{_W} \mu_{_{Z'}}$$
Now we can have similar descriptions for $$\mu_{_Z}$$, while it is actually $$\mu_{_{Z'}}$$ for the Geometric distribution that is being compared with $$X$$ and $$Y$$. \begin{align*} \mu_{_Z} &> \max( \mu_{_X}, \mu_{_Y} ) & &\text{slower to 'succeed' on average} \\ \frac1{ \mu_{_Z} } &< \min( \rho, \tau ) & &\text{worse than the lower success parameter} \end{align*} That is, the mean of the 'maximum flip' is more extreme at the higher end.
This concludes the verbal argument for how $$\mu_{_W}$$ and $$\mu_{_Z}$$ are more dissimilar (than the relation between $$\mu_{_X}$$ and $$\mu_{_Y}$$) thus making a smaller product.
• Thank you for this comprehensive, inspiring answer. Solution One I don't have problem understanding, I'm upset a bit that I didn't complete my analysis. I turned back while trying to form this recursion involving nonlinear terms, like E[(1+X)^2]. Solution Two and the Appendices I am able to follow as well.
– BoLe
Mar 22, 2018 at 10:45 | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9825575173068326,
"lm_q1q2_score": 0.8554118856730828,
"lm_q2_score": 0.8705972633721708,
"openwebmath_perplexity": 988.824214576845,
"openwebmath_score": 0.9992894530296326,
"tags": null,
"url": "https://math.stackexchange.com/questions/2544529/variance-of-alternate-flipping-rounds/2701095"
} |
# Finding area problem
There is this simple geometry question that seems so easy but I think the question lacks some information (does it?). Or maybe there are other ways to solve the problem.
So the problem says, there are two squares $ABCD$ and $FCHG$ with a side of length $8$ and $10$, respectively. We are asked to find the area of the shaded region.
What makes this question a bit tricky is because the small triangle $DEF$ is not shaded. And if we are given the length of AD, then the question will be easy. Is there a way to find AD or is there any other methods to solve the problem?
By the way, the answer is $48.4$.
And also, I am pretty sure we don't need to use advance methods such as trigs, etc.
I really appreciate any helps!
## 4 Answers
Triangles $BCF$ and $DEF$ are similar triangles, which means that their sides are proportional. You know side $BC=8,$ $CF=10$ and side $EF=2$. Can you proceed?
• yes I can! thanks! – user71346 Nov 11 '13 at 10:50
Hint: Look for similar triangles. What is $\Delta DEF$ similar to?
• ah yes! so careless... thanks! – user71346 Nov 11 '13 at 10:49
Let say lines $BG$ and $FC$ intersects at $K$,
So $CK+KF=10$ and $FKG$ and $BCK$ are similar triangles.
So $\frac{KF}{CK}=10/8$ therefore $CK=40/9$ and $KF=50/9$
The area of FKG triangle = $0.5*10*50/9=27.7$
Also $AD+DE=8$ and $ADB$ and $DEF$ are similar triangles. Similarly it gives
$AD=32/5$ and $DE=8/5$
The area of $BDEK$ = area of $BFC$- area of $DEF$ - area of $BCK$ = $0.5*8*10-0.5*2*8/5-0.5*8*40/9$= 20.7
Total area = The area of $BDEK$ + The area of FKG triangle =$27.7+20.7=48.4$
"Is there a way to find AD or is there any other methods to solve the problem?"
AD is proportioan to AE as BD is proportional to BF as EC is proportional to FC.
So AD ~ 8 as 8 ~ 10. Or AD/8 = 8/10. | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9825575178175918,
"lm_q1q2_score": 0.8554118811694017,
"lm_q2_score": 0.8705972583359805,
"openwebmath_perplexity": 317.9574745436916,
"openwebmath_score": 0.8765013217926025,
"tags": null,
"url": "https://math.stackexchange.com/questions/562275/finding-area-problem"
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.