Wikipedia:Reference desk/Mathematics
of the Wikipedia reference desk.
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.
December 2
Number of Factorizations
Hi, I know that (ring of integers modulo n) is not a Unique Factorization Domain (for non-prime n), so there're numbers with non-unique factorization. So, my question is: how many factorizations modulo n exist for a number m? עברית (talk) 07:56, 2 December 2016 (UTC)
- Perhaps I'm being dim, but do you have an example showing that Zn isn't a UFD? --RDBury (talk) 00:27, 3 December 2016 (UTC)
- They mean for instance 1=1x1=2x3=4x4 (mod 5). I don't know what the mean by factorizations though - one could have any number of factors like for instance 2x2x2x2 or 4x3x3. Dmcq (talk) 00:44, 3 December 2016 (UTC)
- Zn is not a domain (except if n is prime), so it can't be a UFD. That doesn't mean it doesn't have the unique factorization property though. But I just thought of an example: 6=2⋅3=2⋅3⋅3=2⋅3⋅3⋅3=2⋅3⋅3⋅3⋅3... (mod 12) so the number of factorizations is infinite. --RDBury (talk) 01:09, 3 December 2016 (UTC)
@Dmcq: Z5 is a field, so all values (except 0) are units, and there are no primes. None of your examples really count as distinct "factorizations" in this context; factors of units are ignored. --Trovatore (talk) 01:22, 3 December 2016 (UTC)- Thanks. I was trying to figure out what they meant. Dmcq (talk) 11:46, 3 December 2016 (UTC)
- They mean for instance 1=1x1=2x3=4x4 (mod 5). I don't know what the mean by factorizations though - one could have any number of factors like for instance 2x2x2x2 or 4x3x3. Dmcq (talk) 00:44, 3 December 2016 (UTC)
Website that helps you make math questions
Is there a website that helps you make a math question like for example I want to make a math question about set theory. In this question, I want to make three circles Venn diagram connecting together and each circle has a number like 23 people like comedy genre movies only, 24 people like action genre movies only, 19 like horror genre movies only, 5 people like comedy and action movies but not horror, 6 people like action and horror movies but not comedy, and 10 people like comedy and horror movies but not action and in the middle of the diagram, 10 people like all three movie genres. Then, I make questions like what is A ∩ C ∩ H, A ∩ C ∪ H, and etc? Donmust90 (talk) 15:24, 2 December 2016 (UTC)Donmust90Donmust90 (talk) 15:24, 2 December 2016 (UTC)
- I would approach this by Googling for blank Venn diagrams with the appropriate number of circles, then edit them to add the elements you want. You might consider just putting single letters and maybe digits in the diagram, allowing 26 or 36 elements (you can add Greek letters, etc., if you need more), and then use an index to map each to the full description. Otherwise, the Venn diagrams can get very crowded quickly. MS Paint allows you to add text to an existing pic, as do any number of software packages. StuRat (talk) 15:39, 2 December 2016 (UTC)
I use Ordinal Fractions in those situations.
100 C: comedy 200 no comedy 010 A: action 020 no action 001 H: horror 002 no horror 122 23 212 24 221 19 112 5 211 6 121 10 111 A ∩ C ∩ H: 10
See [1]. Bo Jacoby (talk) 15:37, 5 December 2016 (UTC).
December 6
Vector Problem
If dU/dt=WxU and dV/dt=WxV, prove that d(UxV) /dt=Wx(UxV).
This is not a homework problem. 47.29.88.170 (talk) 08:52, 6 December 2016 (UTC)
- You need the identity
- I can't immediately spot this on either the Vector algebra relations or Vector calculus identities page, but you can easily prove it by expanding each of the terms according to
- and observing that they then cancel. --catslash (talk) 10:26, 6 December 2016 (UTC)
- See Triple product#Vector triple product (Jacobi identity) --catslash (talk) 10:33, 6 December 2016 (UTC)
This is not a homework problem.
Then what is it? TigraanClick here to contact me 12:29, 6 December 2016 (UTC)
Angle quintisection
What formula is there for the sine of quintuple angle as a function of sine of simple angle? Can it be inverted to find out the sine of a fifth of an angle?--82.137.11.135 (talk) 14:09, 6 December 2016 (UTC)
- [EDITED 17:28, 6 December 2016 (UTC) per RDBury] Thanks to List_of_trigonometric_identities#Angle_sum_and_difference_identities, one can compute (I asked WolframAlpha, actually, as any lazy person would do). That formula
cannot be reformulated as a "normal" function purely of the sine (you can convert cosine in sine only if you know the sign), andcertainly not be inverted; by that I mean there is no function such that (because so the right hand side results must be equal for these values, but ).
- This is no guarantee of the possibility of "angle quintisection" (in the sense that you could construct the fifth of a given angle with straight lines and circles). See Angle_trisection#Proof_of_impossibility (I think a similar argument would apply to quintisection as well, but hunting down the polynomial's roots could prove harder). TigraanClick here to contact me 15:02, 6 December 2016 (UTC)
- Slight copy error, it should be
- You then get a polynomial in sin using cos2θ=1-sin2θ. The proof of the impossibility of angle trisection actually works for any odd number. So angle n-section is only possible (for general angles) when n is a power of 2. In fact, one only has to prove that the regular n2-gon is impossible to construct. --RDBury (talk) 15:55, 6 December 2016 (UTC)
- In other words, you have .
- However the OP didn't ask about geometric construction, only about extracting from this a formula for given (equivalent to finding given ).
- The only real problem with this is that it requires solving a quintic polynomial, which is impossible by usual means - this is the Abel–Ruffini theorem. -- Meni Rosenfeld (talk) 16:17, 6 December 2016 (UTC)
- True, I only mentioned the geometry thingie because of the thread title. (Note that although a third-degree polynomial can be factorized algebraically, it involves cubic roots which are non-constructible generally speaking.)
- As for the Abel–Ruffini theorem, it only means there is no general factorization method for quintic polynomials (with "usual means"). Maybe this particular quintic polynomial, , can be factorized. I doubt it, because it would mean finding a factorization that works for every a. The proof section of the ABT says it remains valid for a given set of algebraically independent coefficients, but the set is not that (the first four coefficients are rational). TigraanClick here to contact me 17:28, 6 December 2016 (UTC)
- Slight copy error, it should be
- Thanks for your answers. Is the situation similar for cosine case?--82.137.9.227 (talk) 19:56, 6 December 2016 (UTC)
- What is the situation when applying a numerical root-finding algorithm for the mentioned quintic equation for every a?--82.137.9.227 (talk) 20:02, 6 December 2016 (UTC)
- I made a mistake in the polynomial above, I've corrected it now. It doesn't materially change the results. I've also taken the liberty of updating Tigraan's response accordingly.
- It's true that it doesn't immediately follow from the theorem that this particular polynomial is unsolvable, but it's almost certain.
- For cosine it's quite similar - .
- There's no real problem with solving it numerically, but you can only do that once a is given (if you do it with a symbolic a, you quickly get unwieldy expressions), and it might be easier to calculate the sine directly with Taylor series or whatnot. -- Meni Rosenfeld (talk) 11:16, 7 December 2016 (UTC)
- (I'm an amateur here, so feel free to correct me.) I could easily have messed up typing all these numbers into Mathematica, but I just checked the Cayley resolvent, and it appears to have a rational root at for all . This would suggest that this is a family of rare quintics which are in fact solvable. 129.234.195.173 (talk) 16:20, 7 December 2016 (UTC)
- A little more digging suggests that it's actually an example of de Moivre's quintic. 19:36, 7 December 2016 (UTC) — Preceding unsigned comment added by 129.234.195.173 (talk)
- Interesting.
- I double-checked the resolvent and it checks out. I only wonder why Mathematica won't return the roots in radical form.
- I'm not an expert on this myself but I'd say Bo (in a comment below) is on to something, the solvability of this is probably connected to the fact that in complex numbers you can find it by simply taking a fifth root. -- Meni Rosenfeld (talk) 01:09, 8 December 2016 (UTC)
- A little more digging suggests that it's actually an example of de Moivre's quintic. 19:36, 7 December 2016 (UTC) — Preceding unsigned comment added by 129.234.195.173 (talk)
- (I'm an amateur here, so feel free to correct me.) I could easily have messed up typing all these numbers into Mathematica, but I just checked the Cayley resolvent, and it appears to have a rational root at for all . This would suggest that this is a family of rare quintics which are in fact solvable. 129.234.195.173 (talk) 16:20, 7 December 2016 (UTC)
- See Chebyshev polynomials. — 86.125.199.30 (talk) 00:45, 7 December 2016 (UTC)
Let . The problem is to solve the quintic equation . The solution can be expressed by roots (), but cannot be constructed by compas and straightedge. Bo Jacoby (talk) 22:39, 7 December 2016 (UTC).
December 7
Particular Diophantine equation
, with , and positive integers.
Can this be transformed into Pell's equation by some substitution? 24.255.17.182 (talk) 02:50, 9 December 2016 (UTC)