How do I arrange selected vertices into a circular formation quickly?  The other answers does not have the same title as my question. My question is direct and simple for younger beginner to search for results.
Are there any tools in Blender that take irregular polygons and make them regular (approximate a circle)? I'm specifically looking for a solution that works with preexisting polygons. Also, it would be nice if it keeps the overall position after making it regular.    Irregular Polygons    Regular Polygons
proving the inequality $\triangle\leq \frac{1}{4}\sqrt{(a+b+c)\cdot abc}$ Currently, the only way to ask for something to be migrated to a site that isn't part of the standard migration path is through a custom mod note.  I currently have two active custom mod notes on Stack Overflow that ask for migration that are not standard targets for SO.  I believe the questions could be better answered on another site.  Fortunately, or unfortunately, the questions have been answered, and answers have been up voted and accepted. At this point, a week and a half later, migrating either of the questions would be disruptive to both communities and not necessarily produce a better answer (they've got accepted answers).  The unfortunate part is I really do believe that both questions could have gotten better answers and more attention on another site.  What I would like to see is a more streamlined way to flag for moderator attention for migrations.  The UI would look something like this:    This would allow people to find the proper site easily.  No more "Migrate this to Mathamatica.SE" because, well, that doesn't exist.  Something that I didn't do on this mock up is add a link to the corresponding help/on-topic page for the target site.  Something people could check and click before hitting the submit button.  I don't have this quite right again, because while that shows a "closing for off topic", this is a flag and not a vote to close.    The "flag for migration" is only one part of this though.  The other part would be to make another flag queue style thingy for moderators in which they could look at just migration flags created through the above interface.  By providing the mods with a "just migration" view into the flags, questions that should be migrated can be quickly identified from the multitude of existing flags and handled promptly before the migration would be disruptive. Recently I paid a lot (almost one month of my salary) for repairing my car. I am wondering if there is a way to get deduction on federal or state taxes (USA, California). Can I use film that's 20+ years old? On convergence of Bertrand series $\sum\limits_{n=2}^{\infty} \frac{1}{n^{\alpha}\ln^{\beta}(n)}$ where $\alpha, \beta \in \mathbb{R}$ Study the convergence of $$\sum_{n=2}^{\infty}  \frac{1}{n^{\alpha}\ln^{\beta}(n)}$$ where $\alpha, \beta \in  \mathbb{R}$   I have proved that:   This series diverges when $\alpha \leq 0$. This series converges when $\alpha &gt; 1, \beta &gt; 0$ This series diverges when $0 &lt; \alpha &lt; 1, \beta &gt; 0$ This series converges when $\alpha = 1, \beta &gt; 1$      Question: What happens when $\alpha &gt; 0$ and $ \beta &lt; 0$?   There are other questions on MSE which ask about this series, but this question is distinct because   I would like an argument which does not rely on the integral test for series convergence, and this question considers all real $\alpha$ and $\beta$, while other questions ask only about $\alpha, \beta &gt; 0$, where we can apply Cauchy condensation criterion Change web folders names with uppercase to lowercase or not? Why is the product of all units of a finite field equal to $-1$? Suppose $F=\{0,a_1,\dots,a_{q-1}\}$ is a finite field with $q=p^n$ elements. I'm curious, why is the product of all elements of $F^\ast$ equal to $-1$? I know that $F^\ast$ is cyclic, say generated by $a$. Then the product in question can be written as  $$ a_1\cdots a_{q-1}=1\cdot a\cdot a^2\cdots a^{q-2}=a^{(q-2)(q-1)/2}. $$ However, I'm having trouble jumping from that product to $-1$. What is the key observation to make here? Thanks! Node.JS Not working on the internet "Mutable variable is accessible from closure" in a function passed to Array.prototype.every Countable additivity implies countable subadditivity? Suppose $\mu$ is a measure in a ring $R$ of a set $X$. So for any mutually disjoint subsets $A_1,A_2,\ldots$ such that $\sum_{i=1}^\infty A_i\in R$, we have that $\mu(\sum_{i=1}^\infty A_i) = \mu(A_1)+\mu(A_2)+\cdots$. (i.e. countable additivity)  I'm wondering: Does that imply countable subadditivity? I.e. for any subsets $A_1,A_2,\ldots$ such that $\sum_{i=1}^\infty A_i\in R$, is it always true that $\mu(\sum_{i=1}^\infty A_i)\le \mu(A_1)+\mu(A_2)+\cdots$?  I believe it should be true, because you can take the mutually disjoint subsets $A_1,A_2-A_1,A_3-(A_1\cup A_2),A_4-(A_1\cup A_2\cup A_3),\cdots$, each of which is in $R$ (because unions and differences of sets in $R$ are again in $R$), then apply countable additivity, then use monotonicity on the fact that $A_n-(A_1\cup\cdots\cup A_{n-1})\subseteq A_n$.  Is that right? I just want to make sure I didn't make any mistake in my logic. Problems with # inside a verbatim that's inside a note I'm trying to use a # character inside a verbatim that's inside a note :   \begin{frame}[fragile]  \note{\begin{verbatim}  # \end{verbatim} }  \end{frame}   This produces the following errror :   >   ! Illegal parameter number in definition of \beamer@todo. >    to be read again>  >                     >   l.5 }   How can I write the # character in a way that doesn't break the latex compilation ?  Thanks in advanced,  PS : This is related to the following problem in pandoc : How are unbalanced forces even possible, given Newton's 3rd law? Let $G$ be a non abelian group of order $p^3$, with $p$ prime.  I'm proving that $Z(G)$ (its center) is of order $p$. I already know how to do it by saying that its order can't be $p^3$, nor 1, and if it's $p^2$ then $G/Z(G)$ is cyclic then G is abelian, Abs!  But I've been reading another way of proving it and the author supposes that $|Z(G)|=p^2$. Then, she says: "$\exists\ x$ outside the center of $G$, of order $p$." Could someone give me a hint? Thanks! Normally while searching using grep, the command I was using was this:  grep -nri "String"   whereas most of my colleagues do this:  grep -nri "String" *   What does the latter do (the * part)? Travelling from India to canada via Dubai and London. Do I need a transit visa I am travelling to Calgary from Delhi. I have an Air India flight from Delhi to Dubai then British Airways flight from Dubai to London and Air Canada flight from London to Calgary. My query is "Do I require a transit visa." Plz help as I am travelling in four days How to convert Bedrock texture pack to Java Edition Minecraft I'm trying to use a texture pack designed for the Bedrock Edition of Minecraft, on Java Edition. I looked at the texture names for a Java Edition texture pack and compared those to the names of the Bedrock Edition texture names, and they aren't the same. A lot of the texture names are flipped, such as:   Jungle Log (Java = jungle_log.png) (Bedrock = log_jungle.png)   Most of the texture names are flipped, like the Jungle Log (and all of the other log types) and there are some .json files that are different and/or not there.  Trying to open the Bedrock texture pack would result in some animated blocks not being animated, other blocks play the wrong sound (or no sound) when broken, if OptiFine is in the mix, the skybox could be missing, which I am pretty sure would result in an always black sky, along with no sun and moon textures.  Any help in finding a program or site that can do this would be helpful, because I tried doing it manually, but almost every texture is different.  Any help is appreciated! What are the different ways that a message can be displayed to a bash shell after a user logs in? Converting string of 1s and 0s into binary value I'm trying to convert an incoming sting of 1s and 0s from stdin into their respective binary values (where a string such as "11110111" would be converted to 0xF7). This seems pretty trivial but I don't want to reinvent the wheel so I'm wondering if there's anything in the C/C++ standard libs that can already perform such an operation? Downloading OpenStreetMap data with street names and city attributes for ArcGIS Desktop? I'm currently trying to download data from OpenStreetMap specifically from San Carlos, Venezuela. I'd like to take the OSM file and convert it to SHP for use in ArcGIS.   I've used geofabrik for other country's in the past, but Venezuela is not available for download. Exporting a bounding box of the city directly from OpenStreetMap, then using OpenStreetMap Toolbox to convert the OSM to SHP gives me the lines but it's missing street names and city. Ideally I'd have addresses as well, but I can live with just street names.  Is there any way to achieve this? Export all streets within a city from OpenStreetMap, then convert it to SHP with city and street name attributes? Odds of rolling doubles or triples given N 6-sided dice Over the holidays I played a dice game where each player had 3 to 7 d6 to roll each turn.  The game gave certain advantages to doubles and triples.  I wanted to know the odds of rolling doubles or triples given N dice to understand the importance of "upgrading" to more dice.  My question is really about how to reason about such problems:  It's easy to see that the odds of rolling doubles with 2 d6 are 1/6 (first die can be anything, and 1/6 of the time the second will match).  It's also easy to see that with 7 dice the odds are 1.0 (6 dice could be 1..6, but the 7th must match one of them).  The middle cases are fuzzier to me.  I ended up writing a program to enumerate all of the possibilities (even 6^7 is only 279,936 cases to evaluate) because that was the only way I felt I could verify any closed formula I came up with.  This also enabled me to distinguish cases of multiple doubles (or triples).  I would like to know how to derive closed forms and how to validate such solutions without brute-force simulation.