Jump to content

Wikipedia:Reference desk/Mathematics: Difference between revisions

From Wikipedia, the free encyclopedia
Content deleted Content added
Line 48: Line 48:


I currently use [[DESMOS]], which I love in general, but it doesn't do anything with foci and directrix lines. I'd like it to show those, say if I give it the equation of a parabola, in any form, or I'd like to be able to provide 2 of 3 of the focus, vertex, and directrix and have it plot the parabola and give me the equation, in whatever form I select. I'd also like similar capabilities with an ellipse or hyperbola. Looking for something free. Thanks, [[User:StuRat|StuRat]] ([[User talk:StuRat|talk]]) 16:33, 25 August 2016 (UTC)
I currently use [[DESMOS]], which I love in general, but it doesn't do anything with foci and directrix lines. I'd like it to show those, say if I give it the equation of a parabola, in any form, or I'd like to be able to provide 2 of 3 of the focus, vertex, and directrix and have it plot the parabola and give me the equation, in whatever form I select. I'd also like similar capabilities with an ellipse or hyperbola. Looking for something free. Thanks, [[User:StuRat|StuRat]] ([[User talk:StuRat|talk]]) 16:33, 25 August 2016 (UTC)

== May the force be with you ==

In this calendar for August 2016

Su Mo Tu We Th Fr Sa
.. 1 2 3 4 .. ..
.. 8 9 10 11 .. ..
.. 15 16 17 18 .. ..
.. 22 23 24 25 .. ..
.. .. .. ..

you choose a number then cross out all other numbers in the same column and row. Rinse and repeat three times so that you are left with four numbers, and however you do it they will always sum to 52. This is called a "force", and you can do it with any block of sixteen dates in any month, although the magic sum will be different if the numbers in the block are different.

I know of a party trick in which the performer tells a guest he can read his mind. He asks the guest to choose any two - digit number then tells him to perform certain arithmetical operations. When he has finished, he writes a number on a piece of paper and asks the guest for the result of the calculation. When the guest answers, the performer holds up the paper to show that the number is the same (assuming that the guest has done the calculations correctly). Is this also known as a "force"? [[Special:Contributions/213.107.114.104|213.107.114.104]] ([[User talk:213.107.114.104|talk]]) 16:55, 25 August 2016 (UTC)

Revision as of 16:55, 25 August 2016

Welcome to the mathematics section
of the Wikipedia reference desk.
Select a section:
Want a faster answer?

Main page: Help searching Wikipedia

   

How can I get my question answered?

  • Select the section of the desk that best fits the general topic of your question (see the navigation column to the right).
  • Post your question to only one section, providing a short header that gives the topic of your question.
  • Type '~~~~' (that is, four tilde characters) at the end – this signs and dates your contribution so we know who wrote what and when.
  • Don't post personal contact information – it will be removed. Any answers will be provided here.
  • Please be as specific as possible, and include all relevant context – the usefulness of answers may depend on the context.
  • Note:
    • We don't answer (and may remove) questions that require medical diagnosis or legal advice.
    • We don't answer requests for opinions, predictions or debate.
    • We don't do your homework for you, though we'll help you past the stuck point.
    • We don't conduct original research or provide a free source of ideas, but we'll help you find information you need.



How do I answer a question?

Main page: Wikipedia:Reference desk/Guidelines

  • The best answers address the question directly, and back up facts with wikilinks and links to sources. Do not edit others' comments and do not give any medical or legal advice.
See also:


August 20

Topology - properties of closure

Let X be an (irreducible) affine variety, U a nonempty open subset of X, Y an affine subvariety of X and a morphism. Denote the closure of the graph of f in by X', and denote the graph of by G. Why is the closure of G in equal to the closure of G in X'? (There should be an easy reason...) — Preceding unsigned comment added by [[User:{{{1}}}|{{{1}}}]] ([[User talk:{{{1}}}|talk]] • [[Special:Contributions/{{{1}}}|contribs]])

Y is closed in X, so is closed in . Therefore the closure of any subset of is also closed in . Sławomir Biały (talk) 12:30, 21 August 2016 (UTC)[reply]
Thank you! I'll write the full details: the claim follows from the following general proposition. Let X be a topological space, Y a closed subset of X, V an arbitrary subset of X, , then . Indeed, we can substitute for X, for Y, and the graph of f for V. We prove the general claim by noting both sides are equal to , since in general if where Y is closed in X, then . — Preceding unsigned comment added by 212.179.21.194 (talk) 15:48, 21 August 2016 (UTC)[reply]

August 21

Intersection of Ellipsoid and Hyperplane

I have an n-dimensional ellipsoid E and a hyperplan H. This hyperplane cuts E into two parts: E1 and E2 (whose disjoint union is E). I want to find another ellipsoid E' that has minimal hyper-volume and contains E1. To do this, I fist thought to formulate it as an optimization problem, but I am having difficulty with formulating it, as I don't know how to formulate the containment (of E1 in E') constraint. Could anyone help me formulating it or pointing out another way to do it (suggesting some program, or an algorithm, etc.). 213.8.204.9 (talk) 11:31, 21 August 2016 (UTC)[reply]

Here's an approach. A diameter of E1 is a line segment of maximal length that lies inside E1. We construct an ellipsoid E' inductively, as follows. An ellipsoid is determined by a set of orthogonal axes. The first axes of E' shall be a diameter of E1. Now, orthogonally project E1 onto the normal plane of this diameter. This gives a new truncated ellipsoid in one dimension lower. Repeat the construction there to get the remaining axes of the ellipsoid E'. (What is not immediately clear is if E' actually contains E1, much less that it has the least volume. But at least this gives a possible approach to the problem.) Sławomir Biały (talk) 12:25, 21 August 2016 (UTC)[reply]
This is a great idea! But now I am facing a new porblem: how to find an ellipsoid's diameter? 213.8.204.9 (talk) 12:47, 21 August 2016 (UTC)[reply]
That's a constrained optimization problem. There are two parts to it: one under the assumption that one endpoint of the diameter is on the intersection of the hyperplane H and (the solid ellipsoid) E and the other is on the boundary of E (lying on the E1 side), and the other where both endpoints lie on the boundary of E (in which case, the diameter is a diameter of the original ellipsoid, which can be found by the principal axis theorem). Sławomir Biały (talk) 13:44, 21 August 2016 (UTC)[reply]
There's also a possibility that both ends of the diameter belong to the hyperplane. --CiaPan (talk) 07:33, 24 August 2016 (UTC)[reply]


Here's a hint for another possible approach.
  • If E' is the solution ellipsoid relative to the ellipsoid E and the hyperplane H, and if φ is an affine isomorphism of your n-dimensional Euclidean space, then the solution ellipsoid relative to the ellipsoid φ E and the hyperplan φ H is just the ellipsoid φ E' .
  • Any ellipsoid is an affine image of an Euclidean ball.
Therefore you can assume E is a ball.

pma 18:39, 22 August 2016 (UTC)[reply]

August 25

Looking for 2D conic section graphing utility

I currently use DESMOS, which I love in general, but it doesn't do anything with foci and directrix lines. I'd like it to show those, say if I give it the equation of a parabola, in any form, or I'd like to be able to provide 2 of 3 of the focus, vertex, and directrix and have it plot the parabola and give me the equation, in whatever form I select. I'd also like similar capabilities with an ellipse or hyperbola. Looking for something free. Thanks, StuRat (talk) 16:33, 25 August 2016 (UTC)[reply]

May the force be with you

In this calendar for August 2016

Su Mo Tu We Th Fr Sa
..  1  2  3  4 .. ..
..  8  9 10 11 .. ..
.. 15 16 17 18 .. ..
.. 22 23 24 25 .. ..
.. .. .. ..  

you choose a number then cross out all other numbers in the same column and row. Rinse and repeat three times so that you are left with four numbers, and however you do it they will always sum to 52. This is called a "force", and you can do it with any block of sixteen dates in any month, although the magic sum will be different if the numbers in the block are different.

I know of a party trick in which the performer tells a guest he can read his mind. He asks the guest to choose any two - digit number then tells him to perform certain arithmetical operations. When he has finished, he writes a number on a piece of paper and asks the guest for the result of the calculation. When the guest answers, the performer holds up the paper to show that the number is the same (assuming that the guest has done the calculations correctly). Is this also known as a "force"? 213.107.114.104 (talk) 16:55, 25 August 2016 (UTC)[reply]