I'm trying to recreate this product for a client in Blender.  I really thought it would be a simple project, but I cannot figure it out! I'm including the blend file here if it helps:  Here's how I got to this point.  I didn't see an easy way to create the Dodecahedron shape so I started with a circle and changed the number of vertices to 5.  I fill that shape in, duplicated it and tried my best to recreate the shape, merging vertices as I went.  I then used the Cast modifier to straighten out my shape and then at each vertices, I created an ico sphere. I did try a regular sphere and also a sub-d cube, but after those attempts failed I tried an ico sphere.  I then attempted to delete the faces where the bars would connect each sphere, and would try bridge loops to connect the two spheres together.  But the angles I could never get right.  I've also tried mirror modifiers, but it's actually kind of a difficult shape that's hard to mirror and get right. I then thought I could use the wireframe modifier on the shape and use a boolean modifer to merge with the ico spheres, it just didn't work, or at least isn't professional enough for this project. I need to make this look as close to the product as possible, including the seams. Any help is greatly appreciated! Thank you!
I've been thinking of animating some dice and while most are easy to make, I'm having some trouble figuring out a way to generate a regular dodecahedron. I could hand build it but it would be potentially uneven. Would using the base of a 5 sided cylinder and then some variation on spin be the best option or is there a better way?
calculating expected number of packets. I installed the WSL Bash on Windows 10 and set my user to e.g. 'abc' but now I want to change it to something else.  How can I change the user name of the user I'm logged in as?  When I open bash it automatically logs me in with my current user. How many $m\times n$ tables are there if they are subject to the following two conditions?    In each cell of the table we have $1$ or $-1$. The product of all the cells in any given row and the product of all cells in any given column equals $-1$.    I already know if Parity of $m$ and $n$ are different there is no such a table. what is the answer in general? Why is it that Android still can't be installed as regular OS? Are there any technical or others reasons why Android is still a firmware and not an OS which can be just installed without a lot of hassle?  Why there is no universal image which could detect appropriate drivers (kernel modules), partition NAND in some standard way and configure boot loader to boot updated OS version?  What stops Google from making a real (less firmware-like) OS (an OS for small ARM, x86 etc. devices)? Could someone please tell me what the symbol ringed in red represents?     I know it has ON Switch pointing to it, but the symbol has other lables in different parts of the document. How many spell slots does a Level 3 Warlock have? The Warlock Table in the PHB (p106) states that a Warlock has the following:   1 First-level spell slot at level 1. 2 First-level spell slots at level 2. 2 Second-level spell slots at level 3.   Does this mean that a third level Warlock has a cumulative 5 Spell Slots? (3 First-Level slots and 2 Second-Level slots)  Or do the new slots just replace old slots between levels such that a 3rd-level Warlock ultimately has only 2 second-level spell slots? Do the parent directory's permissions matter when accessing a subdirectory? If I have a root folder with some restrictive permission, let's say 600, and if the child folders/files have 777 permission will everybody be able to read/write/execute the child file even though the root folder has 600? Let's say I have Table A: BookingsPerPerson  Person_Id    ArrivalDate    DepartureDate 123456       2012-01-01     2012-01-04 213415       2012-01-02     2012-01-07   What I need to achieve with a view is the following:  Person_Id    ArrivalDate    DepartureDate    Jan-01    Jan-02    Jan-03    Jan-04    Jan-05    Jan-06    Jan-07 123456       2012-01-01     2012-01-04       1         1         1         1 213415       2012-01-02     2012-01-07                 1         1         1         1         1         1   The system is for events, so each hotel booking could take anything between 1 to 15 days but no more than that. Any ideas would be very much appreciated. How to get reflections from 3D to show up on real images Andrew Price released a nice tutorial on how to nicely put 3D objects on top of a real image:   I have seen images, such as this:  which have 3D elements over images and have actual reflections from the object showing up on the wet asphalt.  How can this effect be achieved using render passes (or any other way)?  Here is another example (from ): How fast does electricity flow? Why didn't Harry die in the dark forest? Show that the function $g(x) = x^2 \sin(\frac{1}{x}) ,(g(0) = 0)$ is everywhere differentiable and that $g′(0) = 0$ How many different/unique $4$-letter arrangements are there of the letters in the word Mississauga?  I'm thinking we need permutations? I already tried finding each letter and still don't get it... any help?   So far I've broken it off to:-  $M=1$  $I=2$  $S=4$  $A=2$  $U=1$  $G=1$  However, I don't really know what to do next. Prove that the ideal $(X_1-a_1,...,X_n-a_n)$ is maximal in $K[X_1,\dots,X_n]$ Let $K$ be a field, and $a_1,\dots,a_n \in K$. Prove that the ideal $$(X_1-a_1,\dots,X_n-a_n)$$ is maximal in $K[X_1,\dots,X_n]$.   I tried proving that the only elements outside the ideal are the invertibles of $K$ (I should still prove that this implies maximality, but it shouldn't be too difficult).  Is there a better strategy, or another stategy? I added two torus objects, and when I click one of them, it also selects the other. They both share the same node thing. I want to delete one of them, but it keeps on deleting the other with it. I can't even undo placing the second torus without removing the other. Can the graph of a bounded function ever have an unbounded derivative?    I want to know if $f$ has bounded variation then its derivative is bounded. The converse is obvious. I think the answer is "yes". If the graph were to have an unbounded derivative, it would coincide with a vertical line. Automating the scanning of graphics files for corruption Does anyone know of a way to check graphics files (particularly JPEG, GIF, and PNG) for corruption (preferably in an automated way)?    Explanation:  A few days ago, a command worked incorrectly and ended up deleting thousands of graphics files from a FAT32 volume that was practically out of space. I’ve used several different file/photo-recovery programs, but naturally, they are limited in how much they can recover (though fortunately the volume has 8KB clusters, which helps somewhat).  Anyway, some of the larger files, that were fragmented, are now corrupt. Some of them are not even real files at all (the recovery software merely dumped the clusters that were pointed to by now-overwritten directory entries), while others are broken because of fragmentation.  Moreover, because some picture formats embed a smaller version of the picture as a thumbnail, scanning the thumbnails for corruption is not reliable because it may be intact while the actual file (i.e., the picture when viewed full-size), could be corrupt.    Here are a couple of examples:      Here’s the second one. It’s so damaged that it doesn’t display anything.    (A third one wouldn’t even upload because it doesn’t even have the correct header!) Limit question on independent random variables (Exercise 4.2.4 from Grimmett and Stirzaker) Let $\{X_r | r \geq 1\}$ be independent and identically distributed with distribution function $F$ satisfying $F(y) &lt; 1$ for all $y$, and let $Y(y) = \min \{k | X_k &gt; y\}$. Show that $$ \lim_{y\rightarrow \infty} P(Y(y) \leq E[Y(y)]) = 1 - e^{-1}. $$  I managed to show that $E[Y(y)] = \alpha(y) = (1 - F(y))^{-1}$ and that $$ \lim_{y\rightarrow \infty} P(Y(y) \leq E[Y(y)]) = \lim_{y \rightarrow \infty} \left( \sum_{i = 1}^{\lfloor \alpha(y) \rfloor} {\lfloor \alpha(y) \rfloor \choose i} (-1)^{i+1} \alpha(y)^{-i} \right). $$ And the expression on the right, according to Mathematica, does indeed seem to converge to $1 - e^{-1}$. But how can I show that this is true? Can anyone give me a hint? Remove Indentation for a Single Paragraph Is there a way to remove the indentation at the beginning of a paragraph for a single paragraph.  I know I could do  \setlength{\parindent}{0cm} This is my paragraph.  Blah blah blah. \setlength{\parindent}{default}   Where default is whatever the default indentation is for the document class I am using (part of the problem is that I don't know what this default value is).  I feel as if there should be a better way to accomplish this than by the above method.  I am looking for a solution of the form:  \noindent This is my paragraph.  Blah blah blah.   Is there a way to do this, or will I have to resort to the former method?  If I have to resort to the former method, what is the default indentation value for the amsart document class? Can't reach wi-fi signal on Ubuntu, but can do it on other OS/devices (ath9k)