text:
## Tuesday, 31 March 2009

### Testing Understanding of Slope

As part of our professional growth and school improvement process, several members of my department and I have formed a focus group to study formative assessment; testing which focuses on testing to make instructional decisions rather than for grading. One of our goals is to try and develop a deeper understanding of how to write better questions in order to measure student learning.

Recently I imposed on several members of my staff to give a brief assessment to their students that included two different forms of a question on slope. The questions, shown below, were of the lines y=3/4 x -3 and y=3/4 x - 2. I assumed their would be a slight difference in the number of correct responses since one had integer intercepts on both the x and y axis, and one did not.

What I didn't expect was the degree of difference. The students ranged from Algebra I students who have only recently been introduce to slope, through geometry students who had reviewed the topic twice this year according to their teacher, my own sections of Alg II students whom I assumed were much stronger on the topic than my results made me know, and a section of statistics students; many of whom are taking an additional pre-calc or calculus class. In all there were 47 students who took each form. Of the 47 who had the question with integers on both intercepts, a total of 26, or 55%, got the correct answer. Of the 47 who had the line translated one unit up the y-axis, only 10, or 21% gave the correct response.

Four more of the students who had the "easier" question had the expected types of mistakes; they either gave the reciprocal of the correct response, or the negative of it. I was not prepared for how strongly the students were bound to the x and y intercepts. Thirteen of the students using the second form had given slopes of .8 or 2/2.5 using the values they interpreted as the intercepts. Of the 22 students in Alg II who took the questions, 8 of 11 gave the correct answer for the "easier" problem, but only three of them were correct (that is, they answered 3/4) on the second form. Five more of them, however, gave the answer of 2/2.5 or .8 to the second form. There is no question in my mind that they understood the idea of slope. I have no quarrel with the people who would give full credit to the answer of .8 or 4/5. There is however, I think, some difference between the student who focuses solely on the intercepts and the ones who see the whole line, coordinate plane relationship. I think a question which differentiates between them tells me something about how they see and treat slope.

I guess I am more concerned than ever about learning how to write good assessment items that will help me, and my students, understand what they know, and don't know, about the mathematical ideas we are covering.

## Saturday, 28 March 2009

### Isoperimetric problems and scale

We had just finished that old classic about finding the minimum surface area of a can (closed cylinder) if the volume was fixed. I had given them a volume of 128 Pi cubic cm so that when they were done the radius and height would come out in integer units, four and eight cm respectively. Many found the minimum surface area to be 96 Pi square units and the ones who finished quickly were helping the others find their way through the substitution of h=128/r2 into the formula for surface area so that they could graph the function, or perhaps work out intricate details of arithmetic, "but 256 divided by 4 is 64, not 84." Finally we were ready, I thought, for a little closure.

"So, what did you notice?" Many hands up.... I point, they answer.. "The minimum is 96." I hesitated, perhaps even made a slight face of despair. I had hoped they would notice more. They picked up on the "That's not what I'm looking for" face and someone quickly added, "96 cubic centimeters... no meters, no, wait, I mean square centimeters.." amidst some laughter on their part I tried to draw them deeper into the problem. "Well, yes, that is the minimum for THIS problem, but what else did you notice?"

With long troubled faces, they poured through their solutions, what was the old man after now... we got the answer... finally a brave soul offers a trial balloon..."The surface area is less than the volume?"; drawn out as a question.
We had recently talked about the isoperimetric problems, planer figures with the same number for the area and perimeter, and I had talked about, and solved the cube with the same number for its volume and surface area... (I have several blogs a while ago on this idea; here and here and a third one here) which I assume made him think to compare the results in this fashion.
"So... " I asked. They somehow took that as encouragement and someone conjectured that the very act of "minimizing" the surface area meant it would be smaller than the volume. That seemed easy enough to counter, but I still wanted them to notice one other thing, so I thought a minute about which way to adjust and gave a second version of the same problem..."Find the minimum surface area of a cylinder with a volume of 16 pi cubic cm."
They sped quickly through the now-familiar problem, and announced that the minimum area was 24 Pi cubic inches. I waited, eyebrows lifted. A moment later the quickest realizes.... audibly..."Damn," and then to the student on his left, "It's bigger... its more than the volume!".

"So what ELSE do you notice, what seems to be true in both cases?" I ask. They struggle, nothing seems obviously the same. Someone notices, and offers, almost apologetically, that both the radius and height in the second problem were 1/2 of original solution .

I was willing to drag this out to make them think, so I asked her if she thought the radius and height would continue to diminish by 1/2 in every problem I could think up. Finally she restated what she thought might be a truism..."The radius is half the height, is that always true?"

"Well, let's test it." Earlier in the year they would have groaned when their answers led to another problem, but by now they expected that every question led to another question. This time I picked an intermediate value, knowing I only had one more chance to offer integer values, I suggested they try 54 pi cubic cm. They sped through the problem and found that indeed the height was 6, twice the radius value of 3. They were so glad to feel like they were on the track of something they didn't even notice that this time the surface area also had a numeric value of 54 pi.

I had allowed myself to get hung up between two big ideas, now I had to kill one to chase the other, so I just summarized their radius is one-half height in a simple statement. "Ok, so what have we found? The can which most efficiently contains a given volume of substance will have a height that is 2r, or equal to its diameter. It is the same distance across as it is up and down." I have always intended, and never followed up on, to make a solid that meets this equality. Maybe now I will; because the next thing I told them was wrong. I said that it was close to a typical tuna fish can. (actually the ones in my cupboard are too short for the diameter. The closest I could find was a can of Eagle Brand that was about 3.25 inches high and about 3 inches in diameter.)

Finally I wanted to try once more to drive home a big idea about that classic relationship between length, area, and volume that seems forever to not seem obvious to even advanced students. I talk about how in one case the volume was more than the surface area, and in another the volume was less, and then, we stumble upon the "Goldilocks" size, where they both are "just right."

I spend some time drawing rectangles of every kind of size and showing that you can always make one with the same ratio of sides that has exactly the same number for area and perimeter, and the same thing is true for any two or three dimensional shape... and then I said it, "Every shape is isoperimetric under some measurement scale!" and the kid sitting in the front row, before he even thought, says "That can't be so?, there must be some shapes that won't work."

So I set them one more problem; "I have a solid shape so convoluted that it has no name It has a volume of 64, and a surface area of 512 units. Blowing it up and shrinking it is like changing from measuring in inches to feet or mm or something different so let's just change the numbers. If I make a scale model of it that is bigger or smaller, what happens to the volume and surface area?"

They want a formula... I refuse...I return to the original two cylinder problems and ask what is the relationship between the original radii... they finally recall that it was four cm in the first and 2 cm in the last, the ratio was 2:1. "What about the heights?" and again they come up with 2:1...

"Ok, what about the surface areas?" I get 96/24 a few times and someone realizes 4:1...
"The volumes????" and they start to recall... Oh yeah, 8:1 squares and cubes...

"So if the volume is 64 and the surface area is 512, what happens if I make the model half as big in any length?" They realize that heads them off the wrong way and begin to work on the solution..

Finally one comes to the board with a solution... The ratio of SA : Volume = 8:1. If we increase the size by a linear dilation of k, the new ratio will be k2 8 : k3 and we want that to equal one. so we just set k2 8 = k3 which means when k=8 the ratio and surface area are the same number. "And the original shape???" I ask... "Doesn't matter." he answers... and mercifully for all of us, the bell rings.

## Monday, 23 March 2009

### An Improved Solution to the Probability Problem

My last blog gave a labored explanation of why given R red balls and W white balls in a bowl, if they are removed one at a time randomly until one color has been totally removed, what is the probability that White will be exhausted first.

Joshua Zucker gave much more elegant expalantion for the reason the probability of white being exhausted first is red/(red + white)

His solution, in my words.. forget everything except the last ball in the bowl... whatever color it is is Not the color that was exhausted. So All we have to do to know the probability that White is exhausted, is find the probability that the last ball drawn if we emptied the bowl would be red. But if we look at all the possible orders of drawing all the balls, 4/7 of the first balls drawn are red, 4/7 of the second balls drawn are red..and the same continues all the way to the end; 4/7 of the final balls drawn will be red, meaning that in 4/7 of the trials, the white balls were exhausted first.

Now I'm thinking about the case of three colors, red, white and blue. I haven't started, so if you have an easy explanation, lay it on me.... otherwise, more later.

-------------- edited afterward...
ask and you shall receive... Joshua does what he does best, thinking and explaining his thoughts on the fly... see the comment and learn ....

## Sunday, 22 March 2009

### Probably an Interesting Problem

It was a simple probability problem, but it teased me with its surprising answer, and led me on … but let me start at the beginning…
A message on the AP discussion group from “Skerbie” (would I make this up?) asked…

If there are 4 red balls and 3 white balls in a container, and you remove them one at a time at random until one color is extinguished, what is the probability the remaining balls are red?

The simple answer, 4/7… soooo… would that always happen? And what is the math at work.

I quickly tried several examples where the number of white and red differed by one and they all seemed to preserve the ratio. At first I thought that it would only work with a difference of one, but with a wake up reminder from Joshua Zucker I corrected my arithmetic flaws and figured out that, Yes, the probability of the smaller color being extinguished first is the ratio of red/(red+white). SO… to show why….

One of the first things that I thought was interesting and (at least by me) unsuspected is that the probability of drawing WWW is the same as drawing WRWRW, or RRWWW, or RWWRW or any of the possible outcomes that ends with white being exhausted first. For the original seven problem case, the probability of drawing WWW is (3/7) (2/6)(1/5)= 1/35…The same probability applies to, for example, WRWRW which is (3/7)(4/6)(2/5)(3/4)(1/3) because the last two fractions simply cancel out the impact of the red and we get 1/35 again… I picked up pretty quickly that the 35 in the denominator was the combination of 7 things taken 3 at a time. I checked a few other starting quantities and this was true of the others as well, if you had n white balls, and n+d red balls, the probability of any of the paths ending with white being exhausted first led to a probability of 1 over 2n+d choose n.

As I looked at counting the possible outcomes ending in white being exhausted, I realized that :
There was only one way to draw WWW
There were three ways to draw them with one red in the mix if the red could not be at the end
RWWW; WRWW; WWRW
And there were six ways to draw them with two reds in the mix.
RRWWW, RWRWW; RWWRW; WRRWW; WRWRW; WWRRW
And there were ten ways to draw them with three reds in the mix… this was the sequence of triangular numbers, in particular I realized that if the last one HAD to be white, the sequence was counting 2 choose 2, and then 3 choose 1; 4 choose 2; 5 choose 3. But since all of those had the same probability of occurring, then the total probability was just the sum of those multiplied by 1/35. And the sum of the numbers down that diagonal of Pascal’s arithmetic triangle was 20, which is 6 choose 3….

I extended this to realize that as long as White had N balls, and Red had N+1, then there would be 2N choose N ways to order the outcomes, and each had a probability of 2N+1 choose N

In Pascal’s triangle, these were the successive numbers marked below:

The first is for two reds and one white which leads to a probability of 2/3. The second is for three red and two white, and then for the four red, three white case. The 70/126 is the probability for starting with five red and four whites, and simplifies to the expected 5/9.

When we expand the values for 2N choose N and 2N+1 choose N,

we see why the result always leads to the result that the overall probably of white being exhausted first is Red/(Red + White) which, when there are N+1 Reds and N whites leads to (N+1) / (2N+1) .

A very similar approach shows that when the difference between the number of Reds and Whites in the bowl is two, then we just move over one column in the arithmetic triangle to get :

Ok, Maybe I’m the only old guy on the block who didn’t expect that…. But I bet a fistful of nickels that any bright kid in Alg II could look at what just happened and know where to go to find the answer if Red was three more than White…

They have the arithmetic triangle dating back to at least the thirteenth century, so why am I just finding this stuff out….

## Friday, 20 March 2009

### Things I Learned at the Carnival

They just posted the newest "Math Teachers at Play", a math education carnival, this time hosted by Kate at f(t). There are lots of good reasons you should visit if you are a teacher of math at any level, a student, someone just interested in math, or just the curious kind of person who drops by my blog.
They started this time with a link to my post on centroids, "Just an Average Point"; which proves they must have wonderful stuff...
Ok, if that isn't enough to convince you, there are all kinds of cool things I picked up in just a few moments on a couple of the links... Did you know???
33 is the largest number that is not a sum of distinct triangular numbers. Which made me wonder, can you get them all with distinct triangular numbers using addition AND subtraction???? Haven't checked myself yet, but curious.

34 is the smallest number with the property that it and its neighbors have the same number of divisors. Hmmm? That's three in a row... can you find the smallest TWO consecutive numbers that have the same number of factors (ok,gotta be bigger than 2...

40 is the only number whose letters are in alphabetical order.... which has GOT to be a great trivia question. It also got me wondering...are there numbers in Spanish, Greek, Russian, Tagalog... ???? that are in alphabetical order, and is there a language that there is not ANY number that is spelled in alphabetical order? Ok, Help me out here readers!!!!!

And besides, there was this great "space invaders" cartoon... and if you are too young to know what space invaders was...well, heck, you are just TOO YOUNG.

## Wednesday, 18 March 2009

### Just an Average Point

Somewhere back in Alg I, we introduce the midpoint, and maybe some bright kid notices that the midpoint of (2, 7) and (6, 9) is just (4, 8); which is just the average of 2 and 6 followed by the average of 7 and 9; just average the x-values and average the y-values

Later in Geometry, we introduce midpoints all over the place, midpoints of a segment, as one end of the medians of a triangle, or as a point on the perpendicular bisector, but it is almost always in an abstract approach and they never actually have to ferret out the coordinates, so that seldom gets reinforced. I think that is a shame, because in the same course, we get another nice opportunity to introduce the 2 dimensional equivalent. One of the beautiful geometric ideas that still persists in a few geometry classes is that the three medians always intersect in a point. The point is called the centroid*, and sometimes the center of gravity. (Some teachers like to have students make triangles out of cardboard and after they find the centroid the students can cut it out and balance the cardboard triangle on a pencil tip.) If you use an interactive geometry software package, like sketchpad, you can actually construct the triangle and its medians, then grab a point and drag it around and see that...wow! no matter how you alter the shape of the triangle, the three medians still intersect in a single point. If you don't have the software to play with on your on, you can open a java applet I made here and click the mouse button on any of the triangle vertices and move them freely.

But almost no geometry class I know of goes on to show that the point is really sort of a "midpoint" of the triangle, and like the midpoint of a segment, it is just an "average" point. The x,y coordinates of the centroid are just the average of the x-coordinates of the three points followed by the average of the y-coordinates.
If, for example, we had triangle ABC with A=(1, 2); B= (5, 11) and C = (9, -1) then the medians will intersect at the point where x= (1+5+9)/3=5 and y= (2+11 - 1)/3 = 4; or more simply at the point (5,4)
About this time of year as I am introducing my pre-calc class to the beauty of three dimensional analytic geometry, I dust off their memory of this little jewel from when I taught it in Alg II, and then we extend it to show it works with triangles in three-space. This requires them to a) Find the midpoints of the sides; b) write the equation the medians in the space triangle; c) find the intersection of two vector lines in space; (d) and then confirm that that point is also on the third line; and finally e) insure that it is indeed the average of the relative coordinates. I think it is a pretty good illustration of the power of the linear algebra they are learning.

As a reward, I give them a discovery lesson on tetrahedra... we talk for a minute about the difference between a two dimensional object in three space (A triangle with (x,y,z) coordinates for the points) and a three dimensional object (like a cube) . I bring out a large cardboard model of a tetrahedron (triangle based pyramid) and hold it in front of me..... and I begin to wonder aloud..." This is sort of like an extension of a triangle in three dimensions.... so what would be like the medians of a triangle in this object?"
Frequently the first guess is a line from a vertex to a point which is the "face-center" or centroid. I usually channel them (or prompt them if needed) toward this idea. "Wouldn't it be wonderful", I add, " if there was something like the centroid for the tetrahedron; where all those lines would intersect." By now they suspect that there is, and perhaps with some fear as they realize that they are about to be challenged to find one, or worse, prove it is always true.

With much the same vector approach as before, I pass out some cards with a set of four points in space (carefully chosen to make the work a little less messy than it might be), and they find centroids of the four faces, hopefully using the "average point" method. Then they must write vector equations of the four lines which I call "medial" lines that run from a vertex of the tetrahedron to the centroid of the opposite face. Finally I suggest that they solve the intersections of the four medials in sets of two, and behold that the two solutions are the same point; all four lines intersect in a single point.

Then I ask, "What is the quickest way to find the midpoint of a line segment?" "Averages", they shout.

"What is the quickest way to find the centroid of a triangle?" "Averages", some reply, but others already have anticipated the next question, and have started to calculate the average of the four x values.... could it be?

As a finale I point out that there is a pattern in the division of the segments in each of the cases..
The midpoint divides the line segment (a one space object) into a ratio of 1:1
The centroid divides the segment of a triangle (a two space object) into a ratio of 2:1
The center of gravity of a tetrahedron ( a three space object) divides the medial segments in a ratio of 3:1

Just another "average" day in mathematics class.

If you want a little more about centroids, see my web page article.

*There are three common "centers of gravity" that are studied in math, science and engineering. The most common in math is the center of masses located at the vertices of a polygon. This is more common because the other two cases can be reduced to a variation of this approach. It is this case of point masses at the vertices that I mean when I use centroid or center of gravity in this note, unless otherwise stated. A second approach is to treat the area of the polygon as if it were a sheet of uniform density. The third, and least common, approach is to represent the sides of the polygon as wire rods of uniform density.

Most students are first introduced to the terms above in reference to a point in a triangle. Since the center of masses at the vertices in a triangle give the same point as a uniform sheet, they are often confused about the various distinctions. The three centers of gravity are usually different points in other non-symmetric polygons. It is this point, the center of balance for the uniform sheet and also of point masses at the vertices, that is almost universally referenced as the centroid of a triangle.

## Tuesday, 17 March 2009

### The Pinhole Effect

David Craig, an excellent teacher with the DoDDS System in Germany wrote to tell me, "Pat, your “Tiny Circles” blog got me motivated to finally make this Sketchpad simulation that I’ve had in my head for awhile. "
The blog was about the way an image viewed through a pinhole becomes more clear (although less bright)
David included a link to a Geometers Sketchpad demo that he made to illustrate both of these effects to his students, and gave me permission to share. If you have the GSP software, you can download the demo here.
Thanks for sharing David.

## Sunday, 15 March 2009

### Catalan Asymptotic Function

I have written before about the Catalan Functions, named for Eugene Catalan of Belgium (1814-1894). I recently came across a note on the "God Plays Dice" blog that gave an asymptotic function for the Catalan Numbers (an Asymptotic function gives you a value it approaches as N gets larger and closer to infinity).. The value is given as
The nice part of this is that if n is pretty big, you can ignore all the stuff in parentheses. For example the 6th Catalan number is 132, and the value outside the parentheses is about 157.. ok, a little high, but as you work your way up, the error is smaller and smaller (at least percentage wise)... and always an upper bound (too much)....
There was also a cute joke of the kind that only a matematician could appreciate, "identify the sequence "una, dues, cinc, catorze, quaranta-dues, cent trenta-dues, quatre-cent vint-i-nou,...", which are the Catalan numbers 1, 2, 5, 14, 42, 132, 429... in the Catalan language."

Catalan Numbers first appeared in disguise in a problem Euler first proposed to Christian Goldbach in 1751. The problem is now called "Euler's Polygon Division Problem", and asks, in how many ways may a plane convex polygon of n+2 sides be divided into triangles by diagonals. The answer, of course, is the nth Catalan number.

The numbers in the Catalan sequence also answer questions such as the following. In how many paths can you move from the origin of a coordinate axis to the point (n,n) if each move consists of either an upward move or a move to the right one unit between two lattice points and you cannot cross the line y=x . Another application answers the question in how many ways can 2N beans (for an application, think votes) be divided into two containers if one container can never have less than the second?

The numbers can be found from Pascal's triangle by taking (2n Choose n) - (2n Choose n+1). These are two adjacent numbers in each even numbered row (2-1; 6-4; 20-15; etc...

## Friday, 13 March 2009

### Planes in Space - Part two

Consistent solutions to three planes

Now let’s add to our system from the last blog and make a system of three equations; {2x + 3y – 3z = 14 , –3x + y + 10z = -32, x + 7y + 4z = -4}. If we try to solve this system by the inverse method we get the dreaded “Singular Mat” error on the calculator and all we can determine is that there is NOT a single unique solution. If we use the RREF we get something that should remind us of our previous example, and for good reason. Because I chose the third line to be a linear combination of the first two, the three planes all share a common line of intersection, the line (x, y, z) = (10, -2, 0) + t [3, -1, 1] as shown by the reduced form:

The third row gives us an obviously true statement (0x + 0y + 0z = 0) that reflects that the third equation, in essence, added no new information to the system. This “row of zeros” at the bottom is the key to the student that the system had three equations but the intersection would be completely determined by any two of them.

When three planes intersect in space, there are six basic configurations (They sometimes miss the sixth possible case that all three equations are for the same plane) . I ask students to visualize and describe the different situations that can exist prior to discussion of the method of finding the solutions. In most years they come up with all five configurations and names for them. Here is a list of the five/six as my students tend to describe them.

The two consistent systems are three planes intersecting in a single point, and three planes intersecting in a single line (the book binding model – the planes are pages in a book and the common line is the binding).

The three configurations with no common points of intersection are three parallel planes, two parallel planes cut by a transverse plane (the H configuration) forming two parallel lines, and three planes intersecting in mutual pairs to form three parallel lines (the delta D configuration). The first and the second are often easy to recognize from the equations since the parallels are usually recognizable, but the third is difficult to identify without reduction.

Three configurations w/o a common solution
If we look at the three inconsistent systems possible with three planes, the more obvious cases may lead us to more understanding of the less obvious cases. First I want to look at three parallel planes, x + 2y + 3z = 1, x+ 2y + 3z = 5, and 2x + 4y + 6z = 10.
The reduced RREF augmented matrix looks like this:

The first row looks like it is directly related to the coefficients of x, y, and z in each equation, but the 0 in the constant term may seem perplexing. I think of this information as a direction vector [1,2,3] that is perpendicular to the three parallel planes. The bottom line of zeros reminds us that the last equation added no new information about the solution set. But what are we to make of the equation for the second row, 0x + 0y + 0z = 1. I tell students that this is the signal that there is NO common point of intersection. In essence, we have an intersection when 0=1, and that is never true. If the three equations had all represented the same plane, then the original line would have contained the constant term as well [1, 2, 3, 1], and is in essence, just a version of the original plane.

Now we examine a system with two of the same parallels and a third plane not parallel to them, the H configuration, { x + 2y + 3z = 1, x+ 2y + 3z = 5, 2x – y + z = 1}. The reduced matrix looks like .

How can we interpret this. The bottom row is our old insolvable friend 0x +0y + 0z = 1, reminding us that there can be no common point on the three planes (since two of them are parallel). The upper two rows look like the rows when we had a line of intersection except that both constant terms equal zero. Does this tell us anything about the two lines of intersection formed by the plane cutting through the two parallel planes. Perhaps we can find out more if we find the two intersections one at a time. If we reduce the two equations x + 2y + 3z = 3, 2x – y + z = 1, our reduced matrix looks like this,

This can be read as the system of equations x+z=1 and y+z=1... so setting z = 0 first we get a point (1,1,0) on the intersection, and using z=1 we get (0, 0, 1)

. This gives a line (x, y, z) = (1, 1, 0) + t 1, 1, -1] . If we do the intersection with the second parallel plane we get (x, y, z) = (1.4, 1.8, 0) + t [1, 1, -1]. It seems that our original reduced system was flashing the direction vector part of the two parallel lines created by the three planes in the third column.

For our final case, we pick the inconsistent situation which is most difficult to distinguish from the consistent cases, the delta D configuration in which three planes intersect in mutual pairs to form three parallel lines. An example is the three planes defined by { x + y + 7z = 5, x – y – z = 3, and 2x – y + 2z = 4} .

The reduced form looks like this,
and we are now becoming accustom to the 0001 on the bottom reminding us there is no common point for the three planes. And a quick inspection of the three planes assures us that no two of them are parallel, so the only possible case is the “delta formation” and three parallel lines of mutual intersection. What are we to make of the two upper rows. Our experience now leads us to think that [3, 4,-1] will be the direction vector for all three lines. We can verify our supposition by taking the vectors in pairs and reducing the two-equation systems to find the actual line of intersection, but as is the fashion in mathematical writing, I leave that final task as an exercise for the reader.

## Monday, 9 March 2009

### Planes in Space- part One

Take your basic bright kid in alg II or pre-calc, or often in calculus, and ask, "What is the intersection of two lines?"... They say, "A point."... good answer.

"Can you write the equation of a line?" Again they are on target.
"If I give you the equation of two lines on the plane; can you find their point of intersection?" The good ones can, and know they can.

Now ask the same bright kids, "What is the intersection of two planes in space?". They answer correctly again, "A line."
So far everything is great, but now we ask them to write the equation of a plane.... uhhh... gee..... and at this point, when asked about one of the fundamental structures of plane geometry, their analytic geometry skills are exhausted. Still, a very few may actually be able to produce x+y+z=1 or some other for the equation of a plane. Now we ask about the intersection of two planes, and almost none of them can do it. The scary part, is that very (very) few of the teachers of alg II and above that I have questioned about this could provide an answer either .
We begin by recalling that an equation in three variables, such as 2x+3y+z=6 can represent a plane in space. When students had three such equations that intersected in a unique point, they found the solution by one of several methods. Most students learn to solve such equations by the methods called elimination and substitution at the very least. Others may have also been introduced to Cramer’s rule for solving systems with determinants and perhaps two methods using matrices.

The most commonly taught matrix method is to write a matrix equation and then solve it using the inverse matrix method. A second, and as we will point out, more efficient and general method is the Gauss-Jordan reduced row-echelon form (RREF) of an augmented matrix. We give an example of both below to clarify the terminoligy.

We begin with three planes determined by the equations {x + y – 2z = 9; 2x – 3y + z = -2; and x + 3y + z = 2} This same system of equations can be expressed as the matrix equation.

Notice that the left matrix is made up of the coefficients of the three variable terms in each equation, and the right matrix contains the constant terms. We can find the intersection by taking the inverse of the left matrix and multiplying on the left of both sides of the equation. The simplified result gives

This seems to be the most commonly taught method, and the one that students and teachers seem to prefer, and yet it has two major disadvantages. The first disadvantage is that it tells you little or nothing about systems which have a solution, but not a single unique solution. In fact it most students (or teachers?) can not distinguish between the cases (and there are several different ones) with no solutions frorm the ones with an infinite number of solutons. This same defect applies to attempts to use Cramers Rule. The second problem is that the inverse method is more computationally complex, that is, it takes more operations for the solution than the alternative RREF method, and the difference grows as problems reach higher orders of magnitude. For the problems that are generally assigned at the high school level, the difference in computability presents no real problem, but the difference in the range of applicable questions can be very significant in a students understanding of general systems of three equations.

In contrast with the Inverse method that will only work if the three planes intersect in a single point, the RREF form will allow us to work with systems which do not even have the same number of equations as unknowns. This is the type of situation created when we try to find the line of intersection of two planes.

RREF for two planes

We will use the equations 2x + 3y – 3z = 14 and –3x + y + 10z = -32. When we write an augmented matrix for the system of only two equations we get a 2x4 matrix, shown here:

When we reduce this system, by matrices or otherwise, we get

which is a matrix expression of x - 3z = 10 and y + z = -2.

We notice that both equations contain a z variable, it might occur to us to ask, “What happens if we substitute different values in for z?”. For example, if we try z=0 we note that from the first equation we get x=10 and from the second we get y=-2. What does this tell us about the point (10, -2, 0). If we check it against the two original equations we notice that the point makes both equations true, 2(10) + 3(-2) – 3(0) = 14 and –3(10) + (-2) + 10(0) = -32. So the point (10, -2, 0) is on both planes and therefore must lie on the line that is their intersection.

Can we find more points? What happens if we try z=1 or z=2 or other values. Using z=1 we get x – 3(1) = 10 which simplifies to x=13 ; and y +(1) = -2 which simplifies to y=-3. Checking the point (13, -3, 1) we see that it also makes both equations true, and so it must also be on the line of intersection.

Writing the parametric equation of a line in three space

So now we have two points on the line of intersection; (10,-2, 0) and (13, -3, 1). How can we describe the line? One way is to write a formula for all the points so that someone could find as many values of (x,y,z) as they wish. We do this with parametric equations. A parametric equation is an equation that explains the values of one set of variables (in this case x, y, and z) in terms of another “parameter” which we will call t. We will define the line in terms of one point, and instructions to get from one point to another; sort of a three-space equivalent of slope.

When we worked with slope in a plane we had to find the change in x and the change in y, but now in three space we need a change in z also. If we look at our two known points, we can see that from the first we found, (10,-2, 0), to the second, (13, -3, 1), the x-value increases 3, the y-value decreases 1, and the z value increased 1. Let’s record those as a ordered triple, but to keep it separate from our points we will use brackets to enclose the changes; like this [3, -1, 1] .

We can even use this to find more points. If we add [3, -1, 1] to the last point we found (13, -3, 1) we get (16, -4, 2); and we know it is on both planes because it makes both the original equations true (Remember? They were 2x + 3y – 3z = 14 and –3x + y + 10z = -32) . Of course we do not have to add integer multiples of t, and if we allow t to be ANY real value, then we can write a general expression for all the points on the line of intersection in the form (x, y, z) = (10, -2, 0) + t [3, -1, 1] . [some texts will write this as a vector form (x, y, z) = (10+3t, -2 – t, t ) ].
And we have written the equation of the line of intersection. One of the nice things about the matrix approach is that it allows us to focus on interpreting the results... do three planes intersect in a line, in two parallel lines, in three lines all heading in the same direction? I will try to talk about these issues next, and then a little more about the equations of planes in space.

## Saturday, 7 March 2009

### Take a Look at a Trillion Dollars

In this period of huge financial losses and bailouts, people throw numbers like a trillion dollars around rather casually. I am reminded of the quote by someone ?? who said, "A billion dollars here, a billion dollars there, and pretty soon that adds up to real money."
Well, I came across a nice illustration of what a trillion dollars would look like on a page over at Page Tutor and I copied a couple of the pictures to give you an idea:

"We'll start with a $100 dollar bill. Currently the largest U.S. denomination in general circulation. Most everyone has seen them, slighty fewer have owned them. Guaranteed to make friends wherever they go. A packet of one hundred$100 bills is less than 1/2" thick and contains $10,000. Fits in your pocket easily and is more than enough for week or two of shamefully decadent fun. " Here is what$1 million dollars would look like:

"While a measly $1 million looked a little unimpressive,$100 million is a little more respectable. It fits neatly on a standard pallet..."

With 100 of those pallets, you would have \$1 billion dollars... now we are talking real money.

And then????
"Next we'll look at ONE TRILLION dollars. This is that number we've been hearing about so much. What is a trillion dollars? Well, it's a million million. It's a thousand billion. It's a one followed by 12 zeros. And notice those pallets are double stacked.)"

Look carefully, there in the bottom left corner is our six-foot tall human, dwarfed by the staggering ocean of money... That's fifty pallets wide, 100 pallets deep, and two pallets high.... 10,000 pallets of 100 milliion each..... so next time someone talks about a trillion dollar bailout...close your eyes and imagine this warehouse full of money.
Now where did I park my fork lift?

## Thursday, 5 March 2009

### I Think I KenKen, I Think I KenKen

I made the mistake of swinging by Dave Marain's MathNotations blog on a slow day... and there was that link to KENKEN.. Ok, I'm not really a big game bug.. I actually find Sudoku boring.. and those logic puzzles that match Ms. Jones as the Butcher married to Tom the Builder???? No way.. but for some reason I flicked one up and played around ... and then, what the heck, I wasn't in a hurry, so I did a bigger one... and then a harder one... then the really tough one and it took a while even giving in to get clues....
So you have been warned... the game is really addictive...but if you STILL want to try.. I have a permanent link on the sidebar just below my profile picture....and here is one if you just can't wait...... have a ball. They upgrade it each week with a few more games, although I thing you could play some of the hard ones over and over trying not to get hints...
Here are the rules, although they are right on the game...Click to enlarge

## Wednesday, 4 March 2009

### Does Your Doctor Know Statistics

Conditional probability is hard,; doctors, it seems, don't understand the implications of it with tests they do on a regular basis. In the new book, The Numbers Game, (with a long sub-title) by Michael Blastland and Andrew Dilnot,(see below, and order here and I will donate the profit to charity)... they report that only two of twenty-four physicians could correctly work out the probability that a woman has breast cancer given that she tests positive on a mammagram.

Here are the details as they give them in the book, see if you can figure it out. We know that about 0.8% or .008 of all women in the forty-fifty age group have the condition (I haven't checked that figure, that is eight out of every thousand women, will follow up... I promise). The test is 90% accurate at spotting a person who has the disease... if you have it, 9 times out of ten they will catch it. The false positive rate is only 7%. If you don't have it, there is a 93% chance they will give you a clear bill of health. So you go to the doctor and he gives you that long face and says, "Sorry, you tested positive for breast cancer." Now the million dollar question.... .what is the probability that you really have it? Out of all the women in the forty-fifty age group who get that mind numbing statement, what percent REALLY has cancer?

If you are in my stats class, or ever were, you should know how to solve that, and it seems even a little shocking that some (they actually said "Most were not only wrong, but hopelessly wrong."

My way of addressing these kinds of problems is to make a table, and figure out wher all the labels go. The problem assumes that only 8 out of a thousand women really have it, so if we assume a million tests, 8,000 women really have cancer... 992,000 do not. We put this in the table.

Now let's analyze what the test say.... of the 8,000 poeple who DO have cancer, the test will catch 90% or 7,200 of these people (the real victims are the 800 who walk away thinking they are clear and the cancer goes untreated). So we put these numbers in the correct squares of the table.

Now we want to look at the much larger group who do not have cancer; even though the test is 93% accurate in identifying those who are free from cancer, it will falsly tell 7% of the group, or 69.440 of these people that they tested positive for the cancer. We include this information in the table here.

Now we want to look at just the people who got a notice that they tested positive, and we see that there are 76,640 of them; but most of them, 69,440 of them, were false positives. Because such a large group do not have the disease, the number of false positives has swamped the true positives, and less than ten percent of these women really have cancer.

I hope that if these nubmers are anywhere near the true probability, if someone tests positive, the doctor will at least say, "Hey, most of these are false positives..but just to be sure, let's look at a second test..because the probability of another false positive is only 7% (it hasn't changed just because you already had one false positive).. so most of these people will get a clean bill of health on the second trial, but amazingly, there will still be more women who receive a second false positive (46,860) than there were actual sufferers of the disease; over six times as many... maybe there are a few questions you want to ask your G.P. ; like , "When was the last time you took a statistics course?".

## Tuesday, 3 March 2009

### Tiny Circles

Just reviewing a note about the wonderful property of pinholes. If you are in a well lighted room, look at a sign or picture far across the room. If your eyes are old like mine, it may not be very clear. If you have great eyes, pick out a small object that is difficult to see clearly. Now punch a small hole in a 3x5 card or piece of paper with a thumbtack or such. Hold it up in front of the eye and look at the object through the hole. If you move it back and forth a little, you should notice the object is in much sharper focus... WHY???

As light strikes the eye it has to be brought to bear on a single point on the retina to foucs sharply. By looking though a tiny hole, the light is all falling on a very small spot, and thus is much sharper. It does reduce the total light, so the object has to be pretty bright.

You can do the same thing by squeezing the thumb and finger together (like you are signing OK) on both hands and then push the two thumbs and fingers together. They form a little diamond shaped hole in the center, and if you peer through this, it will have the same effect. Press a little harder to make the hole smaller and the image sharper. I use this sometimes in the underground to be able to read the tube maps on the opposite wall when they aren't clear.... and it works..

I just learned that "it was the 10th-century Arab physicist, astronomer and mathematician, Ibn al-Haytham (Alhazen), who published the principle of the pinhole camera in the Book of Optics in 1021 AD. He also invented the first pinhole camera after noticing the way light was streaming through a hole in a window shutter. He improved on the camera after realizing that the smaller the pinhole, the sharper the image. He went on to designed the first camera obscura (Latin for something like Shadow room).

## Sunday, 1 March 2009

### We Just Don't Talk That Way Anymore

I love reading old journals and am often struck by the precision and beauty of language in old math and science journals.

Many brighter than I have commented on the seemingly inevitable reduction in rigor as schools require all students to take more advanced math. I think the same thing has happened across the board to language as everyone is expected to complete a high school education. I recently read a note that had two quotes, both saying essentially the same thing. The first is from Leonhard Euler and dates around the American revolution; the second is from George Box and dated around 1987Empirical Model-Building and Response Surfaces. Both are incredibly literate and knowledgable people, and yet..

"Although to penetrate into the intimate mysteries of nature and thence
to learn the true causes of phenomena is not allowed to us, nevertheless
it can happen that a certain fictive hypothesis may suffice for
explaining many phenomena"

All models are wrong... some models are useful


text:
# Thread: Find the derivative.

1. ## Find the derivative.

y= the square root of (4x+2).

Here's what i did so far, before getting stuck:
f'= (4x+2)^(1/2)
(1/2)(4x+2)^(-1/2)

Where do i go from here?

2. You were suppose to use the chain rule. dy/dx = du/du x du/dx

So let u = 4x + 2

format: plain


text:
1. ## Schauder Basis

Show that if a Normed Space X has a Schauder Basis => X is Seperable.

Definition of a Schauder Basis:

If a Normed Space X contains a sequence (e_n) with the property that for every x element of X there exists:

unique sequence of scalars !(alpha_n) such that: ||x-(alpha_1.e_1 + alpha_2.e_2+....+alpha_ne_n|| ---> 0
as n-->infinity

then (e_n) is called a Schauder Basis for X.

2. Hint: Look at the set of finite linear combinations of the basis vectors with rational coefficients: $\Big\{\sum_{n=1}^N\alpha_ne_n\Bigr\}$, where the coefficients $\alpha_n$ are rational (if the scalar field is the real numbers), or have rational real and imaginary parts (if it is the complex numbers).

3. Hi Opalg. Thank you for you hint.
I know that if I take this set of finite linear combinations you proposed I can use it as a set, say called M. Then I must show that this set M is countable and this set is dense in X.

So it is easy to argue that this set is countable since there are finitre number of operations to multiply rational coefficients to basis vectors and then sum them.

But I must now take this set M and show it is dense in X by using the fact that rational numbers Q are dense in R (reals), but I do not know how to show this with norm estimates. So not sure how to write this in "analysis language".

4. Originally Posted by frater_cp
Hi Opalg. Thank you for you hint.
I know that if I take this set of finite linear combinations you proposed I can use it as a set, say called M. Then I must show that this set M is countable and this set is dense in X.

So it is easy to argue that this set is countable since there are finite number of operations to multiply rational coefficients to basis vectors and then sum them.

But I must now take this set M and show it is dense in X by using the fact that rational numbers Q are dense in R (reals), but I do not know how to show this with norm estimates. So not sure how to write this in "analysis language".

We can start by assuming that all the vectors in the Schauder basis have norm 1 (if not, replace them by suitable scalar multiples).

Given a vector x, and ε>0, we want to find an element of the countable set M that is within distance ε of x. We can find N, and scalars $\alpha_1,\ldots,\alpha_N$, so that $\Bigl\|x- \sum_{n=1}^N \alpha_ne_n\Bigr\| < \varepsilon/2$. Then, for n=1,2,...,N, we can find rational numbers $\beta_n$ such that $|\beta_n - \alpha_n|<2^{-(n+1)}$. Now (using the triangle inequality) check that $\Bigl\|\sum_{n=1}^N (\beta_n - \alpha_n)e_n\Bigr\| < \varepsilon/2$, and hence $\Bigl\|x- \sum_{n=1}^N \beta_ne_n\Bigr\| < \varepsilon$.

5. Hi Opalg.

Thank you again it is helping me a great deal!
I'm still confused not sure how to use the triangle inequality.

I know that ||x-y||<=||x-z|| + ||z-y||

I must use this but how to choose z?

Also why is difference between rational and real number < 2^-(n+1) ?

Im getting confused also between x which is infinite sum of alpha_n e_n

and y which is finite sum of beta_n e_n

6. Originally Posted by frater_cp
Hi Opalg.

Thank you again it is helping me a great deal!
I'm still confused not sure how to use the triangle inequality.

I know that ||x-y||<=||x-z|| + ||z-y||

I must use this but how to choose z?

Also why is difference between rational and real number < 2^-(n+1) ?

Im getting confused also between x which is infinite sum of alpha_n e_n

and y which is finite sum of beta_n e_n
Okay, so let $x = \sum_{n=1}^\infty \alpha_ne_n$, $y = \sum_{n=1}^N \alpha_ne_n$ and $z = \sum_{n=1}^N \beta_ne_n$. By choosing N large enough, we can ensure that $\|x-y\|<\varepsilon/2$. The series for y is finite, but its coefficients need not be rational. So we want to show that $\|y-z\|<\varepsilon/2$. Then the triangle inequality will show that $\|x-z\|<\varepsilon$. That will complete the proof, because the series for z has rational coefficients.

To show that $\|y-z\|<\varepsilon/2$ we use the triangle inequality again, but for N vectors instead of two:

\begin{aligned}\|y-z\| = \Bigl\|\sum_{n=1}^N (\alpha_n-\beta_n)e_n\Bigr\| &\leqslant \sum_{n=1}^N \|(\alpha_n-\beta_n)e_n\| \\ &= \sum_{n=1}^N |\alpha_n-\beta_n|\|e_n\| \leqslant \sum_{n=1}^N 2^{-(n+1)}\varepsilon < \varepsilon/2\end{aligned}
(the last inequality comes from summing a geometric series).

7. ## Tibi Gratulor

Has anyone recently told you that you are a G E N I U S!

Thank you very much have a wonderful day Opalg


text:
## Elementary Geometry for College Students (6th Edition)

In a rectangle diagonal make two congruent right triangles. So by Pythagoras theorem $Diagonal^{2}= width^{2}+length^{2}$ $20^{2}=16^{2}+length^{2}$ $400=256+length^{2}$ $144=length^{2}$ length=12 cm


text:
# Does negative reference evapotranspiration make sense using FAO Penman-Monteith equation?

I computed the daily reference evapotranspiration $ET_0$ using the Crop evapotranspiration - Guidelines for computing crop water requirements - FAO Irrigation and drainage paper 56. The outputs seems realistic regarding the dynamic and the annual total but the time series contains negative values (about 1% of the time series).

The computation involves many equations for the sub-terms but the general formula is the following:

$$ET_0 = \frac{0.408 \Delta (R_n - G) + \gamma \frac{900}{T + 273}U_2(e_s - e_a)}{\Delta + \gamma(1+0.34 U_2)}$$

with

• $ET_0$ reference evapotranspiration [mm day-1],
• $R_n$ net radiation at the crop surface [MJ m-2 day-1],
• $G$ soil heat flux density [MJ m-2 day-1] (=0 in this case),
• $T$ mean daily air temperature at 2 m height [°C],
• $U_2$ wind speed at 2 m height [m s-1],
• $e_s$ saturation vapour pressure [kPa],
• $e_a$ actual vapour pressure [kPa],
• $e_s - e_a$ saturation vapour pressure deficit [kPa],
• $\Delta$ slope vapour pressure curve [kPa °C-1],
• $\gamma$ psychrometric constant [kPa °C-1].

It appears that the negative values are due to a negative values of the net radiation $R_n$. A negative value of $R_n$ makes sense but what about negative $ET_0$ ? How should I deal with these as I intend to use $ET_0$ as input for hydrological modelling ?

• Wouldn't you expect negative values if water was condensing on the ground/vegetation? Perhaps that's why the have soil heat flux? – DougS Dec 3 '17 at 17:19

Short answer, especially if it is about 1% of the time series and these values are just slightly negative, this likely indicates that the ET needs to be recalibrated slightly, and for practical purposes you can set the ET on those days to 0 mm/d. The ET calculations typically calculate potential ET, meaning that if there is no water available no ET will occur, and a similar concept applies to negative ET values (i.e. no demand for water -> no ET).

A couple of notes
- the reference $ET_0$ calculations were meant for ten-day or monthly time steps, not daily, which may be a reason for these results (see top of Ch 2)
- the equation seems to be for a specific type of reference grass, and they suggest adjusting the $ET_0$ based on crop type using a ratio; another potential adjustment to make

Overall if the negative values are infrequent and close to zero then likely setting to zero is not an issue, if the values are much less than zero than check the calculations and try the suggestions above to recalibrate the calculation.

• Thank you for your answer. Indeed, I think setting negative ET to 0 make sense for practical purposes. I also think I should inspect further the calibration parameters of the Angstrom formula FAO ch3 eq.35 when estimating the shortwave radiation. I am not sure the pyranometer is well calibrated. – Delforge Aug 9 '17 at 13:47

We are calculating $ET_0$ on a 10 minute basis and ran into the same problem on http://lapalma.HDmeteo.com.

I can confirm this problem with the FAO formula. We are clipping negative hourly values to 0. This occurs during nighttime when there is no wind and the wind term does not compensate for the radiation term.

It is true that during the night, with high humidity and absent wind the crops get wet due to dew. But dew should be collected by the pluviometer and not accounted for by negative $ET_0$.

The weather stations from Davis with integrated $ET_0$ module seem to use clipping of negative values, too, as they never report $ET_0 < 0$ even with hourly granularity.

• Since you have used FAO Penman-Monteith method for ETP calculation. Can you please tell me how to calculate $l_z$ parameter which is used to calculate solar time angle in equation 31 of chapter 3 of Allen et al 1998? – Ather Cheema Aug 4 at 8:09


text:
# How Many Four Digit Different Numbers, Greater than 5000 Can Be Formed with the Digits 1, 2, 5, 9, 0 When Repetition of Digits is Not Allowed? - Mathematics

How many four digit different numbers, greater than 5000 can be formed with the digits 1, 2, 5, 9, 0 when repetition of digits is not allowed?

#### Solution

As the number has to be greater than 5000, the first digit can either be 5 or 9.
Hence, it can be filled only in two ways.
Number of ways for filling the second digit = 4
Number of ways for filling the third digit = 3
(as repetition is not allowed)
Number of ways for filling the fourth digit = 2
Total numbers 2xx4xx3xx2=48

Concept: Combination
Is there an error in this question or solution?

#### APPEARS IN

RD Sharma Class 11 Mathematics Textbook
Chapter 16 Permutations
Exercise 16.2 | Q 28 | Page 15


text:
# When does a cofibration induce a cofibration on cylinder objects?

Suppose we have a model category $$C$$ and a cofibration $$A\hookrightarrow B$$. I want to know under what reasonable assumptions we can conclude that $$A\wedge I\to B\wedge I$$ is a cofibration (where $$\wedge I$$ denotes taking a cylinder object).

A first remark is that $$A\wedge I\to B\wedge I$$ need not be well-defined, indeed there can be many different cylinder objects. However if $$B\wedge I$$ is a very good cylinder object, meaning that $$B\coprod B \to B\wedge I$$ is a cofibration and $$B\wedge I\to B$$ is a (acyclic) fibration, and $$A\wedge I$$ is a good path object (meaning only the cofibration part of "very good"), then we can get a map $$A\wedge I\to B\wedge I$$ making the following diagram commute :

$$\require{AMScd} \begin{CD} A\coprod A @>>> A\wedge I @>>> A \\ @VVV @VVV @VVV\\ B\coprod B @>>> B\wedge I @>>> B \end{CD}$$

The question is : can we choose this map to be a cofibration ? If not, are there reasonable hypotheses one can add to make it a cofibration ?

Of course, what one might want to do is factor $$A\wedge I\to B\wedge I$$ as a cofibration followed by an acyclic fibration. The middle object is then automatically a cylinder object for $$B$$ (we can see that $$A\coprod A\to B\coprod B$$ is a cofibration, so that we can lift the map from $$B\coprod B$$ to $$B\wedge I$$ to this new thing, making it a cylinder object), which unfortunately need not be very good. Then if we factor the map from $$B\coprod B\to B\wedge I$$ as a cofibration followed by an acyclic fibration, we get a very good cylinder object, but the lift $$A\wedge I\to B\wedge I'$$ that we obtain need not be a cofibration anymore (or as far as I can see, at least)

Is there any way to make this work ? That is, to get a (very) good cylinder object $$B\wedge I$$ and a cofibration $$A\wedge I \hookrightarrow B\wedge I$$ making the above commute ?

Let me also add that I have examples in mind that suggest that we have to change the first $$B\wedge I$$ in general.

Turns out it's easier than I thought, but in this solution I don't use $$B\wedge I$$ to construct my new cylinder object.

So suppose I have a very good cylinder object $$A\wedge I$$ for $$A$$, and construct the pushout

$$\require{AMScd} \begin{CD} A\coprod A @>>> A\wedge I \\ @VVV @VVV \\ B\coprod B @>>> Z \end{CD}$$

Then automatically, $$A\wedge I\to Z$$ is a cofibration (as a pushout of a cofibration), and similarly for $$B\coprod B\to Z$$ ($$A\wedge I$$ is a good cylinder object). Then by the pushout property and on the one hand $$B\coprod B\to B$$, on the other hand $$A\wedge I\to A \to B$$, we get a map $$Z\to B$$. Then we factor this as $$Z\to W\to B$$, a cofibration followed by an acyclic fibration. Then we get a diagram

$$\require{AMScd} \begin{CD} A\coprod A @>>> A\wedge I @>>> A \\ @VVV @VVV @VVV\\ B\coprod B @>>> W @>>> B \end{CD}$$

The map $$B\coprod B\to W$$ is a cofibration as a composite of two cofibrations, same for $$A\wedge I\to W$$, and the map $$W\to B$$ is an acyclic fibration, by definition. It follows that $$W$$ is a very good cylinder object for $$B$$ : we have our desired property.

I think that's as good as one can hope, because as I said it seems unlikely that we can keep our $$B\wedge I$$ that we started with, so building a new one is about as good as it gets.


text:
# A complicated area problem: between a circle and $\sin(2x + 3y) \le 0$

Hi people! I came across this problem while writing an entrance test to CMI (Chennai Mathematical Institute) today. The question is to find the area between the two curves

$\displaystyle x^2 + y^2 = 144$ and $\displaystyle \sin(2x + 3y) \le 0$.

Well, it can be done, definitely, by "brute force" method - what we usually do to find area between two curves. But that would be insanely complicated! So is there a "nice" ("nice" is subjective - I know) way to solve this problem?

Just to share what I started off with:

$\displaystyle \sin(2x + 3y) \le 0$ $\displaystyle \implies (2n+1) \pi \le 2x + 3y \le (2n+2) \pi$ where $n$ is obviously an integer. Also, the tangents to the circle with the slope $-\dfrac{2}{3}$ are $2x + 3y = \pm 12\sqrt{13}$. We are interested in the region between these two tangents. So, to obtain the lower value of $n$, we have:

$\displaystyle (2n_{min} + 1) \pi) \ge -12\sqrt{13} \implies n = -7$

To obtain the upper value of $n$, we have: $\displaystyle (2n_{max} + 2) \pi) \le 12\sqrt{13} \implies n = +5$

So, the area we have to find is that of the intersection of the circle and the "strips" given by the region $\displaystyle \implies (2n+1) \pi \le 2x + 3y \le (2n+2) \pi$, where $n = -7, -6, \ldots, 5$. Let's just expand this to get a better idea:

The "strips" are:

1. $\displaystyle \implies -13 \pi \le 2x + 3y \le -12 \pi$
2. $\displaystyle \implies -11 \pi \le 2x + 3y \le -10 \pi$
3. $\displaystyle \implies -9 \pi \le 2x + 3y \le -8 \pi$
4. $\displaystyle \implies -7 \pi \le 2x + 3y \le -6 \pi$
5. $\displaystyle \implies -5 \pi \le 2x + 3y \le -4 \pi$
6. $\displaystyle \implies -3 \pi \le 2x + 3y \le -2 \pi$
7. $\displaystyle \implies -1 \pi \le 2x + 3y \le 0 \pi$
8. $\displaystyle \implies 1 \pi \le 2x + 3y \le 2 \pi$
9. $\displaystyle \implies 3 \pi \le 2x + 3y \le 4 \pi$
10. $\displaystyle \implies 5 \pi \le 2x + 3y \le 6 \pi$
11. $\displaystyle \implies 7 \pi \le 2x + 3y \le 8 \pi$
12. $\displaystyle \implies 9 \pi \le 2x + 3y \le 10 \pi$
13. $\displaystyle \implies 11 \pi \le 2x + 3y \le 12 \pi$

I think (note: here I don't have any solid justification), that, the area between the circle and strip number #13 (that is, $\displaystyle \implies 11 \pi \le 2x + 3y \le 12 \pi$ ) is the same as the area between the circle and $\displaystyle \implies -12 \pi \le 2x + 3y \le -11 \pi$. My reason to think so: The strips are kind of "symmetrical" about the $6.5^{\text{th}}$ strip. I mean, the half of the $6^{\text{th}}$ strip. So, we can move the strips "above" it, and "place" them in the "gaps" below the strip of symmetry. So by "moving" all the strips above the strip of symmetry, we get a continuous, "thicker" strip, which is easier (relatively) to integrate.

In the end ( if you have read till here :P ), I have to say, I couldn't actually find the area. That's why the question is here!

Note by Parth Thakkar
7 years, 2 months ago

This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.

When posting on Brilliant:

• Use the emojis to react to an explanation, whether you're congratulating a job well done , or just really confused .
• Ask specific questions about the challenge or the steps in somebody's explanation. Well-posed questions can add a lot to the discussion, but posting "I don't understand!" doesn't help anyone.
• Try to contribute something new to the discussion, whether it is an extension, generalization or other idea related to the challenge.
• Stay on topic — we're all here to learn more about math and science, not to hear about your favorite get-rich-quick scheme or current world events.

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold
- bulleted- list
• bulleted
• list
1. numbered2. list
1. numbered
2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in $$ ... $$ or $ ... $ to ensure proper formatting.
2 \times 3 $2 \times 3$
2^{34} $2^{34}$
a_{i-1} $a_{i-1}$
\frac{2}{3} $\frac{2}{3}$
\sqrt{2} $\sqrt{2}$
\sum_{i=1}^3 $\sum_{i=1}^3$
\sin \theta $\sin \theta$
\boxed{123} $\boxed{123}$

Sort by:

Well look at this argument ( I am not writing the complete solution) :

For every point in the circle $(x, y)$ satisfying the given equations, there exists a point $(-x,-y)$ that lies in the circle and doesn't satisfy the equations. And the vice-versa is also true.

So the answer is simply half the circle's area, I.e., $72 \pi$

- 7 years, 2 months ago

This seems too simple (not saying incorrect) to believe! Seriously! I spent so much time over it, typing it here, and writing it in the paper, and here you're dusting it off in one line. Man this is awesome!

- 7 years, 2 months ago

So how did the entrance test go, Parth?

- 7 years, 2 months ago

Not very great. The first part (here I assume you too have written the test, and your age isn't really 19) was very easy. Everything, except a mistake in one problem, seems correct. However, in part B, I could do two questions fully, while I could attempt two others partwise. There's no chance of me getting into it. Surely there are at least 40 people (in about 2000 odd people who took the exam) who could do at least five if not all six!

- 7 years, 2 months ago

Yeah buddy, you got that right, I gave the test too. I couldn't do all full, but did part of the last 5 problems. The mcqs were okay......really 2000 gave the test and atleast 40 people did 5 what about ISI entrance, how did it go??

- 7 years, 2 months ago

2000 is a number I got from quora (some guy had made a rough analysis). Rough figure. And 40 is the roundabout number who'll be getting a seat there. Surely there will be these many people. Obviously! And not to mention there will be a few people who'll be getting direct admission - INMO, RMO guys.

- 7 years, 2 months ago

Yeah you're right, what about ISI entrance? You gave it right?

- 7 years, 2 months ago

No. Wasn't careful at that time.

- 7 years, 2 months ago

And you might not worry about the case when $sin (2x+3y) =0$, because it resembles sets of lines, after all, and wouldn't affect the area. :D

- 7 years, 2 months ago

What were the other questions in that you found interesting?

Staff - 7 years, 2 months ago

Will surely be adding them soon!

- 7 years, 2 months ago

- 7 years, 2 months ago

Here's another: And you thought limits were always easy

I'll post others sometime later. Thanks for showing interest :D

- 7 years, 2 months ago

I couldn't stop myself from posting this one: Polynomials? That sounds familiar

- 7 years, 2 months ago

hey buddy i also wrote the same examination. in the question sin(2x+3y)<=0 you can write it as 2x+3y<=0.since if you take sin inverse on both sides you get the above equation and hence can find the area easily

- 7 years, 2 months ago

Consider the point $(\pi/2, 0)$. Does this satisfy $\sin(2x+3y) \le 0$? Yes. Does it satisfy $2x + 3y \le 0$? No. You can't write that way.

- 7 years, 2 months ago

you can write it that way.if you are that unsure you can check it out in that new pattern iit by arihant. it has the same question but with different data.

- 7 years, 2 months ago

It is wrong my friend! If the book has written that way, it is a grave mistake. It might be so that the answer turns out to be the same - but that is only a huge coincidence. Move the circle to some point other than origin, let's say $50, 50$. Clearly the circle doesn't even touch the line $2x+3y = 0$. So according to you the answer would be $0$. Clearly wrong - since the curve $\sin(2x+3y) \le 0$ is spread all over the $x-y$ plane. I don't know of any software that would plot and show you, (wolframalpha fails too). Think over for a while.

- 7 years, 2 months ago

yup buddy the ans is 72pie, yhe same question with a diff version came in ISI , its just a straight line passing thru (0,0) also the centre.

- 7 years, 1 month ago

I Cleared bothe Cmi & ISI

- 7 years ago


text:
Get the number of documents or features in an object.

ndoc(x)

nfeat(x)

## Arguments

x a quanteda object: a corpus, dfm, or tokens object, or a readtext object from the readtext package.

## Value

an integer (count) of the number of documents or features

## Details

ndoc returns the number of documents in an object whose texts are organized as "documents" (a corpus, dfm, or tokens object, a readtext object from the readtext package).

nfeat returns the number of features from a dfm; it is an alias for ntype when applied to dfm objects. This function is only defined for dfm objects because only these have "features". (To count tokens, see ntoken.)

ntoken
# number of documents
nfeat(dfm(corpus_subset(data_corpus_inaugural, Year > 1980), remove_punct = FALSE))#> [1] 3260nfeat(dfm(corpus_subset(data_corpus_inaugural, Year > 1980), remove_punct = TRUE))#> [1] 3247


text:
# PCE sensitivity indices

Hello UQWorld’ers

I have been getting some puzzling results coming from a PCE Sobol sensitivity analysis and after mulling over it for some time now i’m posting here to see if anyone has seen the same thing or knows what is going on.

I am fitting a PCE to some input/output data and calculating the Sobol indices (1st, 2nd and total order) from the PCE. So far so good. But many of these input have a zero first order indices but a nonzero second and total order indices.

How can a pair of parameters have a nonzero second order indices between them when each parameter has a zero value first order indices?

At first I thought it was a bug, the PCE model error, or just me missing how to interpret such a result. Anyway if anyone has seen this before, please do let me know (I’ve put the code below).

PCEOpts.Type = ‘Metamodel’;
PCEOpts.MetaType = ‘PCE’; % Polynomial chaos expansion

PCEOpts.ExpDesign.X = X; %Input sample (10x1000)
PCEOpts.ExpDesign.Y = Y; %Output sample (1x1000)

PCEOpts.Degree = 1:4;
myPCE = uq_createModel(PCEOpts); % Create meta model
uq_print(myPCE)

SobolOpts.Type = ‘Sensitivity’;
SobolOpts.Method = ‘Sobol’;
SobolOpts.Sobol.Order = 2;
PCESobolAnalysis = uq_createAnalysis(SobolOpts);
uq_print(PCESobolAnalysis)

ps. The model and inputs are defined in my code but not in the code sample above.

Hi @Payne001,

Thanks for posting here. It is indeed possible to have zero first-order Sobol’ indices but non-zero higher-order and total Sobol’ indices.

Let us define a deterministic computational model \mathcal{M}:\mathbb{R}^M\rightarrow \mathbb{R}, which maps the input vector \boldsymbol{x}\in \mathbb{R}^M to the model response y = \mathcal{M}(\boldsymbol{x}). In the context of global sensitivity analysis, each input component is modeled by a random variable. Hence, \boldsymbol{X} is a random vector, and the output is a random variable Y. Finally, we denote \boldsymbol{X}_{\boldsymbol{\mathsf{w}}} the subvector of \boldsymbol{X} defined by \boldsymbol{\mathsf{w}}\subset\{1,\ldots,M\}.

Recall the Hoeffding–Sobol decomposition of \mathcal{M}:

\begin{aligned} \mathcal{M}(\boldsymbol{x}) &= \mathcal{M}_0 + \sum_{i}\mathcal{M}_i(x_i)+\sum_{i<j}\mathcal{M}_{i,j}(x_{i},x_{j})+\ldots+\mathcal{M}_{1,\ldots,M}(x_1,\ldots,x_M) \\ &=\sum_{\boldsymbol{\mathsf{w}} \subset \{1,\ldots,M\}}\mathcal{M}_{\boldsymbol{\mathsf{w}}}(\boldsymbol{x}_{\boldsymbol{\mathsf{w}}}), \end{aligned}

where each component is given by

\mathcal{M}_{\boldsymbol{\mathsf{w}}}(\boldsymbol{x}_{\boldsymbol{\mathsf{w}}}) = \sum_{\boldsymbol{\mathsf{t}} \subset \boldsymbol{\mathsf{w}}} (-1)^{|\boldsymbol{\mathsf{w}}| - |{\boldsymbol{\mathsf{t}}}| } \mathbb{E}\left[Y \mid \boldsymbol{X}_{\boldsymbol{\mathsf{t}}} = \boldsymbol{x}_{\boldsymbol{\mathsf{t}}} \right].

This decomposition allows for decomposing the variance of Y to

\mathrm{Var}[Y] = \mathrm{Var}\left[\mathcal{M}(\boldsymbol{X})\right] = \sum_{\boldsymbol{\mathsf{w}} \subset \{1,\ldots,M\}}\mathrm{Var}\left[\mathcal{M}_{\boldsymbol{\mathsf{w}}}(\boldsymbol{X}_{\boldsymbol{\mathsf{w}}})\right].

The Sobol’ index is defined by

S_{\boldsymbol{\mathsf{w}}} = \frac{\mathrm{Var}\left[\mathcal{M}_{\boldsymbol{\mathsf{w}}}(X_{\boldsymbol{\mathsf{w}}})\right]}{\mathrm{Var}\left[\mathcal{M}(\boldsymbol{X})\right]},

For {\boldsymbol{\mathsf{w}}} containing a single element, say {\boldsymbol{\mathsf{w}}}=\{i\}, we obtain the first-order Sobol’ index for X_i:

S_i = \frac{\mathrm{Var}\left[\mathcal{M}_i(X_i)\right]}{\mathrm{Var}\left[\mathcal{M}(\boldsymbol{X})\right]}.

Similarly, we define the second-order Sobol’ index associated with X_i and X_j to quantify their interactive effect by taking {\boldsymbol{\mathsf{w}}}=\{i,j\}, that is,

S_{i,j} = \frac{\mathrm{Var}\left[\mathcal{M}_{i,j}(X_i,X_j)\right]}{\mathrm{Var}\left[\mathcal{M}(\boldsymbol{X})\right]}.

The total Sobol’ index for X_i aggregates all the effects related to X_i and is defined by

S_{T_i} = \sum_{i \in \boldsymbol{\mathsf{w}}\subset\{1,\ldots,M\}} S_{\boldsymbol{\mathsf{w}}}.

With the reminder above, let us consider a computational model defined by

\mathcal{M}(\boldsymbol{x}) = c_1x_1 + c_2x_2 + c_{3}x_1x_2,

and the input variables are independent standard Gaussian random variables, i.e., X_1,X_2\sim\mathcal{N}(0,1). Under this setup, the decomposition is given by

\mathcal{M}_1(x_1) = c_1x_1,\; \mathcal{M}_2(x_2) = c_2x_2,\; \mathcal{M}_{1,2}(x_1,x_2) = c_3x_1x_2.\;

Therefore, the first- and second-order Sobol’ indices are

S_1 = \frac{c^2_1}{c^2_1+c^2_2+c^2_3},\; S_2 = \frac{c^2_2}{c^2_1+c^2_2+c^2_3},\; S_{1,2} = \frac{c^2_3}{c^2_1+c^2_2+c^2_3}.

In addition, the total indices are

S_{T_1} = \frac{c^2_1 + c^2_3}{c^2_1+c^2_2+c^2_3},\; S_{T_2} = \frac{c^2_2 + c^2_3}{c^2_1+c^2_2+c^2_3}.

As a result, by taking c_1 = 0 and c_3\neq0, the first-order Sobol’ index for X_1 is zero whereas the second-order and total indices are non-zero, which concludes our analysis.

I hope this helps.

1 Like

Hey Xujia Zhu,

Thank you for your detailed reply, its nice to hear from someone who is also excited to use and discuss PCEs.

1. So as I understand your response. We have a meta model that uses a regression algorithm to map a multivariate polynomial onto a data set of x and y which is defined as: Y = M(x).

2. This meta-model can be decomposed into terms that in our case relate specifically to each input parameter (x_1,x_2) and there combination (x1x2). In the manuals I thinks these terms are called basis functions.

3. Using the coefficients of these terms, the sensitivity indices can be defined, as you have described in your response. And indeed it is possible to get a second order nonzero indices and both first order indices are zero. If that’s correct then I understand.

I guess my misunderstanding is more intuitive. A result with a second order nonzero indices and both first order indices are zero, tells me that the uncertainty in the prediction is the result of a combination of variation in both parameters simultaneously. I have also read descriptions where second order indices describe variation that cannot to decomposed into first order indices.

And crucially the individual variation in each parameter has no effect on prediction uncertainty. I find interpreting this quite difficult. I suppose to form this into a question, I know this can happen but what does it say about the system being analysed?

Many thanks,

Henry

Hi @Payne001,

Thanks for the quick follow-up. There are a few things that I would like to clarify:

1. Sobol’ indices are defined for any model with \mathrm{Var}[Y]<+\infty and mutually independent input variables (grouped into) \boldsymbol{X}. In other words, you can study these indices for your computational model (e.g., resorting to Monte Carlo simulations). To alleviate the computational burden associated with expensive simulators, we can build a surrogate model, which approximates the original model but is much cheaper to evaluate. PCE is one popular surrogate model. Moreover, thanks to the spectral representation, the Sobol’ indices of such an emulator can be analytically calculated through post-processing of the coefficients (see this paper for details).
2. The first-order Sobol’ index S_i represents the contribution of a single input variable X_i to the output uncertainty (i.e., univariate effect). The second-order Sobol’ index S_{i,j} shows the interactive effect of X_i and X_j. For a model having S_1=0 and S_{1,2}\neq 0, we can conclude that the contribution of the uncertain variable X_1 to the output uncertainty is through X_2. In our example \mathcal{M}=c_1x_1+c_2x_2+c_3x_1x_2 (let’s forget surrogate models and say that your computational model is expressed in this form), the first term represents the marginal impact of X_1 on Y (as it involves only X_1), and the third term shows the joint effect of X_1 and X_2 (as it contains both X_1 and X_2). We can see how the values of Sobol’ indices are related to the inner structure of the model.


text:
# Conformal blocks and rational normal curves

@article{Giansiracusa2010ConformalBA,
title={Conformal blocks and rational normal curves},
author={Noah Giansiracusa},
journal={arXiv: Algebraic Geometry},
year={2010}
}
We prove that the Chow quotient parametrizing configurations of n points in $\mathbb{P}^d$ which generically lie on a rational normal curve is isomorphic to $\overline{M}_{0,n}$, generalizing the well-known $d = 1$ result of Kapranov. In particular, $\overline{M}_{0,n}$ admits birational morphisms to all the corresponding geometric invariant theory (GIT) quotients. For symmetric linearizations the polarization on each GIT quotient pulls back to a divisor that spans the same extremal ray in the… Expand

#### Figures from this paper

Factorization of point configurations, cyclic covers and conformal blocks
• Mathematics
• 2012
We describe a relation between the invariants of $n$ ordered points in $P^d$ and of points contained in a union of linear subspaces $P^{d1}\cup P^{d2} \subset P^d$. This yields an attaching map forExpand
Equations for point configurations to lie on a rational normal curve
• Mathematics
• 2017
The parameter space of n ordered points in projective d-space that lie on a rational normal curve admits a natural compactification by taking the Zariski closure in $(\mathbb{P}^d)^n$. The resultingExpand
The cone of type A, level one conformal blocks divisors
• Mathematics
• 2011
We prove that the type A, level one, conformal blocks divisors on $\bar{M}_{0,n}$ span a finitely generated, full-dimensional subcone of the nef cone. Each such divisor induces a morphism fromExpand
Basepoint free cycles on $\overline{M}_{0,n}$ from Gromov-Witten theory.
• Mathematics
• 2018
Basepoint free cycles on the moduli space $\overline{M}_{0,n}$ of stable n-pointed rational curves, defined using Gromov-Witten invariants of smooth projective homogeneous spaces X are studied.Expand
Scaling of conformal blocks and generalized theta functions over $$\overline{\mathcal {M}}_{g,n}$$M¯g,n
• Mathematics
• 2016
By way of intersection theory on $$\overline{\mathcal {M}}_{g,n}$$M¯g,n, we show that geometric interpretations for conformal blocks, as sections of ample line bundles over projective varieties, doExpand
Modular Interpretation of a Non-Reductive Chow Quotient
• Mathematics
• Proceedings of the Edinburgh Mathematical Society
• 2018
Abstract The space of n distinct points and adisjoint parametrized hyperplane in projective d-space up to projectivity – equivalently, configurations of n distinct points in affine d-space up toExpand
Cyclic covering morphisms on $\bar{M}_{0,n}$
We study cyclic covering morphisms from $\bar{M}_{0,n}$ to moduli spaces of unpointed stable curves of positive genus or compactified moduli spaces of principally polarized abelian varieties. OurExpand
On Sn-invariant conformal blocks vector bundles of rank one on $${\overline{M}_{0,n}}$$M¯0,n
For any simple Lie algebra, a positive integer, and n-tuple of compatible weights, the conformal blocks bundle is a globally generated vector bundle on the moduli space of pointed rational curves. WeExpand
Veronese quotient models of $\bar{M}_{0,n}$ and conformal blocks
• Mathematics
• 2012
The moduli space $\bar{M}_{0,n}$ of Deligne-Mumford stable n-pointed rational curves admits morphisms to spaces recently constructed by Giansiracusa, Jensen, and Moon that we call Veronese quotients.Expand
On $S_n$-invariant conformal blocks vector bundles of rank one on $\overline M_{0,n}$
For any simple Lie algebra, a positive integer, and tuple of compatible weights, the conformal blocks bundle is a globally generated vector bundle on the moduli space of pointed rational curves. WeExpand

#### References

SHOWING 1-10 OF 36 REFERENCES
Forgetful linear systems on the projective space and rational normal curves over ℳ0,2nGIT
Let $\cM_{0,n}$ the moduli space of $n$-pointed rational curves. The aim of this note is to give a new, geometric construction of $\cM_{0,2n}^{GIT}$, the GIT compacification of $\cM_{0,2n}$, in termsExpand
Moduli Spaces of Stable Polygons and Symplectic Structures on $$\overline {\mathcal{M}} _{0,n}$$
AbstractIn this paper, certain natural and elementary polygonal objects in Euclidean space, the stable polygons, are introduced, and the novel moduli spaces \mathfrak{M}_{{\text{r,}}\varepsilon }Expand
GIT Compactifications of $M_{0,n}$ from Conics
• Mathematics
• 2010
We study GIT quotients parametrizing n-pointed conics that generalize the GIT quotients $(\mathbb{P}^1)^n//SL2$. Our main result is that $\overline{M}_{0,n}$ admits a morphism to each such GITExpand
The Projective Geometry of the Gale Transform
• Mathematics
• 1998
Abstract The Gale transform, an involution on sets of points in projective space, appears in a multitude of guises and in subjects as diverse as optimization, coding theory, theta functions, andExpand
TOPOLOGICAL ASPECTS OF CHOW QUOTIENTS
It has become well known now that, for a reductive algebraic group action on a smooth projective variety, Mumford’s quotients depend, in a flip-flop fashion, on choices of linearized line bundlesExpand
Forgetful Linear Systems on the Projective Space and Rational Normal Curves over M
Let M 0,n the moduli space of n-pointed rational curves. The aim of this note is to give a new, geometric construction of M GIT 0,2n , the GIT com-pacification of M 0,2n , in terms of linear systemsExpand
Variation of geometric invariant theory quotients
• Mathematics
• 1994
Geometric Invariant Theory gives a method for constructing quotients for group actions on algebraic varieties which in many cases appear as moduli spaces parameterizing isomorphism classes ofExpand
Stable n-pointed trees of projective lines
• Mathematics
• 1988
Stable n-pointed trees arise in a natural way if one tries to find moduli for totally degenerate curves: Let C be a totally degenerate stable curve of genus g ≥ 2 over a field k. This means that C isExpand
The ideal of relations for the ring of invariants of "n" points on the line
• Mathematics
• 2009
The study of the projective coordinate ring of the (geometric invariant theory) moduli space of n ordered points on P1 up to automorphisms began with Kempe in 1894, who proved that the ring isExpand
Moduli spaces of weighted pointed stable curves
Abstract A weighted pointed curve consists of a nodal curve and a sequence of marked smooth points, each assigned a number between zero and one. A subset of the marked points may coincide if the sumExpand


text:
# Factoring a polynomial

I am trying to factor the following polynomial: $$4x^3 - 8x^2 -x + 2$$

I am trying to do the following: $4x^2(x - 2)-x+2$ but I am stuck.

edit: correction.

-
It might be better to write it as $4x^2(x-2)- (x-2)$ to take advantage of what you have done so far. –  Geoff Robinson Jan 24 '12 at 19:04
It may be of value to note that there is a general formula for finding roots of 3rd degree polynomials. The formula looks complex but may be of help if you can't guess a root. See this reference for more details: en.wikipedia.org/wiki/Cubic_function –  Emmad Kareem Jan 25 '12 at 20:57

You can factor as

$$4x^2(x-2)-(x-2)=4x^2(x-2)-(1)(x-2)$$

Then factor out the $x-2$ to get

$$(x-2)(4x^2-1).$$

But, you may further factor $4x^2-1$ to get

$$(x-2)(2x-1)(2x+1).$$

-
+1:nice explanation... –  pedja Jan 24 '12 at 19:07
It wasn't "factored wrong"; it's just that it wasn't taken far enough. –  Michael Hardy Jan 24 '12 at 19:19
I agree with Michael. Could you perhaps edit that out? I think it's a little bit impolite. Incomplete and wrong are two very different things. :) –  000 Jan 25 '12 at 1:08
If you look at the revisions, the original posting contained an error where $(x-2)$ was incorrectly $(x-2x)$. I was not being impolite. But, I'll edit it out since things have changed. –  Joe Johnson 126 Jan 25 '12 at 20:02

I'll use your polynomial to illustrate a more general procedure for factoring polynomials with integer coefficients (and assuming it has at least one rational root):

First, guess a root of $4x^3-8x^2-x+2$. The so called "rational roots test" will be helpful here.

Eventually, you'll discover that $x=2$ is a root of $4x^3-8x^2-x+2$. This will imply that your polynomial has the form $$\tag{1}(x-2)(ax^2+bx+c),$$ for some constants $a, b, c$.

To find those constants, you could do one of two things (and maybe more)

1. perform the division $4x^3-8x^2-x+2\over x-2$.
2. expand (1) and set it equal to the original polynomial. Setting the coefficients of the two sides of this equation equal to each other will give you a system of equations that are solvable for $a$, $b$, and $c$.

Once you've figured out what $a,b$, and $c$ are, factor the quadratic.

Using method (2), we have:

$$4x^3-8x^2-x+2 = ax^3+(b-2a)x^2+(c-2b)x-2c$$

A moment's reflection reveals that $c=-1$; whence $b=0$; whence $a=4$. Thus \eqalign{ 4x^3-8x^2-x+2 &= (x-2)(4x^2-1)\cr &= (x-2)(2x+1)(2x-1).\cr }

Of course, the other answers are more suitable to your problem; but in the event that your polynomial doesn't factor nicely (such as for $x^3+6x^2+11x+6$), you might try using this approach.

-

Franco, you said you are stuck. Did you have an approach?

In general, for a cubic equation to be factored means the person who is asking this question is indirectly giving you a hint that there is at least one real root.

Your approach should be as follows: Step 1: first to try to see if x=0, 1 -1, 2 or -2 is a root. Chances are in some cases that one of these is a root. In that case, let us say you figured that $x=2$ is a root of $4x^3 - 8x^2 -x + 2$, then if you know factoring polynomials a little bit then you could immediately figure $4x^3 - 8x^2 -x + 2 = (x-2)(4x^2-1)$ which means the other factors can be found by the fact that $(4x^2-1^2) = (2x-1)(2x+1)$. If in some cases you cannot find the obvious root as described in Step 1, then Step 2: Observe if there is a pattern like $4x^3-8x^2$ has two coefficients $4$ and $8$, which has the same pattern as $-x+2$, i.e. $4x^3-8x^2 = 4x^2(x-2)$ and $-x+2 = -(x-2)$, which means you can combine those as $$(x-2)4x^2-(x-2) = (x-2)(4x^2-1)$$

And in some cases as here you could also do $(4x^3-x) - (8x^2-2)$ which gives you

$$x(4x^2-1)-2(4x^2-1) = (x-2)(4x^2-1) = (x-2)(2x-1)(2x+1)$$

Luckily with this question, Step 1 and Step 2 worked. What if you have a cubic equation that does not have obvious ways to factor.

Step 3: For a general cubic equation $ax^3+bx^2+cx+d=0$, apply the substitution

$$x = y - \frac{b}{3a}$$

then we get

$$a\left(y-\frac{b}{3a} \right)^3 + b\left(y-\frac{b}{3a} \right)^2+c\left(y-\frac{b}{3a} \right)+d = 0$$

which simplifies to

$$ay^3 + \left( c-\frac{b^2}{3a}\right)y+ \left(d + \frac{2b^3}{27a^2} - \frac{bc}{3a} \right) = 0$$

This is called a depressed cubic equation, because the square term is eliminated. It is much easier to use this and then find the roots. (back substitute to get the roots in terms of $x$)

For example $$2x^3-18x^2+46x-30=0$$

Substitute $x=y+3$ and simplify this cubic equation to

$2y^3-8y=0 \Rightarrow y=0,2,-2$ which then gives the roots as $x=1,3,$ and $5$.

-

$(4x^3-x)-(8x^2-2)=x(4x^2-1)-2(4x^2-1)=(x-2)(4x^2-1)=$

$=(x-2)(2x-1)(2x+1)$

-
+1: Yours didn't appear until after I sent mine. –  Joe Johnson 126 Jan 24 '12 at 19:04


text: 2021-05-12 18:03:18 +0200 received badge ● Notable Question (source) 2017-12-28 12:06:45 +0200 received badge ● Popular Question (source) 2015-09-07 00:32:03 +0200 received badge ● Scholar (source) 2015-09-07 00:31:53 +0200 commented answer Problems in solving eigenvalue equations with differential operators @nbruin Thank you very much! 2015-09-06 10:13:10 +0200 commented answer Problems in solving eigenvalue equations with differential operators @nbruin. See my simplified example (I have posted it as another answer) 2015-09-06 10:12:30 +0200 received badge ● Editor (source) 2015-09-06 10:12:07 +0200 answered a question Problems in solving eigenvalue equations with differential operators Take for example that $\hat A = a \frac{d^2}{dx^2}, a>0$ which leads to the eigenvalue equation $$\hat A f(x) = b f(x) \iff af''(x) = bf(x)$$ (I assume for simplicity that $b<0$). Using desolve_laplace I define g(x) as the solution to the equation. Then I am not able to substitute the solution to my original equation Code: sage: x,a,b = var('x,a,b') sage: f = function('f',x) sage: g = function('g',x) sage: assume(a>0); assume(b<0) sage: eqn = a*diff(f,x,2) == b*f(x) sage: g(x) = desolve_laplace(eqn, f, ivar=x) sage: g x |--> (a^2*sin(sqrt(-a*b)*x/a)*D[0](f)(0)/sqrt(-a*b) + a*cos(sqrt(-a*b)*x/a)*f(0))/a sage: eqn.substitute_function(f,g) a*D[0, 0](f)(x) == b*f(x) sage: eqn.substitute_expression(f(x) == g(x)) a*D[0, 0](f)(x) == (a^2*sin(sqrt(-a*b)*x/a)*D[0](f)(0)/sqrt(-a*b) + a*cos(sqrt(-a*b)*x/a)*f(0))*b/a  Am I clear? 2015-09-03 23:50:54 +0200 asked a question Problems in solving eigenvalue equations with differential operators Let's say we have a linear differential operator $\hat A = \sum_k a_k \frac {d^k} {dx^k}$ and we want to solve the eigenvalue equation $\hat A f(x) = a f(x)$ which is an ODE that we put in sage and outputs a solution $g(x)$. We now want to substitute $f(x)$ with $g(x)$ and simplify our expression in order to extract the eigenvalues of $\hat A$. The problem here is that I am not able to substitute the derivatives with my solution neither via eqn.substitute_expression(f(x) == g(x)) nor via eqn.substitute_function(f(x),g(x)) because D[0]f(x), ... D[0,0,...,0]f(x) remain unchanged.


text:
# Il Company produces and sells two... Crown Company produces and sells two products. The following monthly...

###### Question:

Il Company produces and sells two... Crown Company produces and sells two products. The following monthly data are provided Unit selling price Variable manufacturing costs Variable selling and administrative costs Estimate unit sales per month Slicer $1 The break even point for the current sales mix is 360 units (144 Slicer models and 21 Chopper models What would be the impact on profit 360 units are sold but 145 Slicer models sold instead of 144? Multiple Choice$3 decrease o $5 increase o oo$2 decrease < Prev 9 of 10 Next >

#### Similar Solved Questions

##### Is this a run-on sentence
Is this a run-on sentence?I thought about what he'd said soon I realized he was right....
##### Will rate! Chapter 31, Problem 017 GO In the figure, R = 11.0 12, C =...
Will rate! Chapter 31, Problem 017 GO In the figure, R = 11.0 12, C = 6.59 pF, and L = 52.0 mh, and the ideal battery has emf = 33.0 V. The switch is kept in position a for a long time and then thrown to position b. What are the (a) frequency and (b) current amplitude of the resulting oscillations?...
##### Every year, around Halloween, many street signs in a small city are defaced. The average repair...
Every year, around Halloween, many street signs in a small city are defaced. The average repair cost per sign is $68.00 and the standard deviation is$12.40 (a) If 300 signs are damaged this year, there is a 5% chance that the total repair costs for the 300 signs will exceed what value? (b) You are ...
##### 2. A telescopic lens consists of a convergent lens of 5 cm focal length and 5 cm in diameter plac...
2. A telescopic lens consists of a convergent lens of 5 cm focal length and 5 cm in diameter placed 4 cm in front a divergent lens of focal length -8 cm and diameter 4cm. In addition, a stop ween the lens 2 em from the convergent lens with a diameter of 3 cm. Determine the aperture stop, the limitin...
##### If you are trying to solve a difficult problem and get stuck, the best thing to...
If you are trying to solve a difficult problem and get stuck, the best thing to do is o take a break from the problem and think about something else for a while change context to avoid blocking both take a break and change context keep going and work on it as long as possible...
##### How do you simplify the expression cosx+tanxsinx?
How do you simplify the expression cosx+tanxsinx?...