User Portlet
| Discussions |
|---|
| Or quite simply a = Range[10, 99]; 100 a + a |
| Try this formula y = x Tan[Theta] - (g x^2 (1 + (Tan^2)[Theta]))/(2 v^2) substituting your letters would be b = R Tan[Theta] - (g R^2 (1 + (Tan^2)[Theta]))/(2 v0^2) and with the figures the angles are ArcTan[.500709]... |
| John, thank you for the explanations etc it all makes sense, in regard to "well ordered" by default there are obvious reason why it is so, but I cant help think that during the search for the position of the items they were found in the order asked... |
| Thank you for the link Kuba, I look forward to reading it. |
| May be wrong here, but there are 6 equations and 5 unknowns, if you remove eqn 6 or 5 it solves to same results, if you also stipulate in findinstance, 2, i.e. at end of the line before last bracket put ,2 it only finds one solution, so there are no... |
| Does this answer your last question ok? Table[Length[Intersection[newseq[[q]], newgroup[[i]]]], {i, 1, Length[newgroup]}, {q, 1, Length[newseq]}] |
| Sarah, Is this what you are trying to achieve? array1 = Insert[array1, "", 1] {, 1, 2, 3, 4, 5, 6, 7, 8, |
| Would FindShortestTour be a better choice, (if I have read this correctly) as an example AbsoluteTiming[SeedRandom[1]; pts = RandomReal[100, {100, 2}]; pair = Partition[pts[[Last[FindShortestTour[pts]]]], 2]; ... |
| Or for the digital root you could use digitalroot[k_Integer] := Mod[k - 1, 9] + 1 |
| Is this what you are looking for? n = 2; Tuples[Range[n], {2}] |