User Portlet
Featured Contributor
| Discussions |
|---|
| The objective is to pack the spheres in the tetrahedron as tightly as possible without overlap |
| you need to add c1,c2,c3,c4 to the variables In[5]:= Reduce[{c1 == x1 x3, c2 == x1 x4, c3 == x2 x3, c4 == x2 x4}, {c1, c2, c3, c4, x1, x2, x3, x4}] Out[5]= (c1 == 0 && c2 == 0 && c3 == 0 && c4 == 0 && x1 == 0 && x2... |
| ![Packing maximized disks in polygons][1] &[Wolfram Notebook][2] [1]: https://community.wolfram.com//c/portal/getImageAttachment?filename=6444Main17012025.png&userId=20103 [2]:... |
| That also works. Thanks |
| min[reg1_, reg2_, tolerance_] := Block[{ rn1 = RegionNearest[N@reg1], rn2 = RegionNearest[N@reg2], start, iter, pt1, pt2 }, start = RegionCentroid[reg1]; iter[pt_] := rn1[rn2[pt]]; pt1 =... |
| For protecting an objective which is a function of a list of variables use: obj[vars_?(AllTrue[#, NumberQ] &)] as suggested to me by Wolfram support |
| I recently read that two students have proven the Pythagorean Theorem using Trigonometry. I haven't looked at their proof, but the problem seems straight forward. Consider a right triangle with sides a and b and hypotenuse c, and angle theta... |
| I use Overscript for contravariant variables and Underscript for covariant variables. |
| the one is part of the name In[7]:= a1 Out[7]= a1 |
| &[Wolfram Notebook][1] [1]: https://www.wolframcloud.com/obj/68498321-fd6f-422a-bd77-7cd34e38a11a |