Which is the best software to create 3D mockup from scratch?
How do you create product mock-ups?
As a mod when should I vote to close content that is not flagged? Since multiple inheritance is bad (it makes the source more complicated) C# does not provide such a pattern directly. But sometimes it would be helpful to have this ability. For instance I'm able to implement the missing multiple inheritance pattern using interfaces and three classes like that: public interface IFirst { void FirstMethod(); } public interface ISecond { void SecondMethod(); }  public class First:IFirst  {      public void FirstMethod() { Console.WriteLine(&quot;First&quot;); }  }  public class Second:ISecond  {      public void SecondMethod() { Console.WriteLine(&quot;Second&quot;); }  }  public class FirstAndSecond: IFirst, ISecond {     First first = new First();     Second second = new Second();     public void FirstMethod() { first.FirstMethod(); }     public void SecondMethod() { second.SecondMethod(); } }  Every time I add a method to one of the interfaces I need to change the class FirstAndSecond as well. Is there a way to inject multiple existing classes into one new class like it is possible in C++? Maybe there is a solution using some kind of code generation? Or it may look like this (imaginary c# syntax): public class FirstAndSecond: IFirst from First, ISecond from Second { }  So that there won't be a need to update the class FirstAndSecond when I modify one of the interfaces.  EDIT Maybe it would be better to consider a practical example: You have an existing class (e.g. a text based TCP client based on ITextTcpClient) which you do already use at different locations inside your project.  Now you feel the need to create a component of your class to be easy accessible for windows forms developers. As far as I know you currently have two ways to do this:  Write a new class that is inherited from components and implements the interface of the TextTcpClient class using an instance of the class itself as shown with FirstAndSecond.  Write a new class that inherits from TextTcpClient and somehow implements IComponent (haven't actually tried this yet).   In both cases you need to do work per method and not per class. Since you know that we will need all the methods of TextTcpClient and Component it would be the easiest solution to just combine those two into one class. To avoid conflicts this may be done by code generation where the result could be altered afterwards but typing this by hand is a pure pain in the ass. How to assign values to a MATLAB matrix on the diagonal? Let's say we are talking about the indigenous pukapuka who live in Pluto.  What is correct: "the pukapuka people" or "the pukapuka peoples"?  I've read somewhere the usage of "peoples" in this context, and it has surprised me. Under what conditions is $AA^T$ invertible? Given a matrix $A$ with dimensions $m \times n$, is $B=AA^T$ invertible if and only if the rows of $A$ are linearly independent?  So far, I've tried writing A as row vectors,   $$A = \begin{bmatrix}v_1\\ v_2\\ \vdots \\ v_m\end{bmatrix}$$  where $B_{i,j} = (v_i v_j) $  The Wikipedia page on the  suggests that the condition I stated above is necessary and sufficient, but does not provide a proof. I've been modeling a hermit crab and I don't know why but some areas of the mesh are really dark on some spots, like the legs and the claws.   I hope you can help me fix it. What happened to Saruman after he was knifed by Grima? Saruman was one of Maiar, like Gandalf. Meaning that he had a mortal body but presumably, when that body was killed, would simply return back to his ("spirit?") being.  Is there any confirmation from Tolkien that this is indeed what happened after he was knifed by Grima? Or was he somehow completely destroyed since he was de-powered by Gandalf? Who is the Lord, as referred to in the title? Frodo? Sauron? Someone else? Or is it more of an abstract title, not referring to a single person, like "He who wields the One Ring"? Code block is not properly formatted when placed immediately after a list item Here is my candidate for  the most elementary proof that $\lim_{n \to \infty}(1+1/n)^n $ exists. I would be interested in seeing others.  $***$ Added after some comments: I prove here by very elementary means that the limit exists. Calling the limit "$e$" names it. $***$  It only needs Bernoulli's inequality (BI) in the form $(1+x)^n \ge 1+nx$ for $x &gt; -1$ and $n$ a positive integer, with equality only if $x = 0$ or $n = 1$. This is easily proved by induction: It is true for $n=1$, and $(1+x)^{n+1} = (1+x)(1+x)^n \ge (1+x)(1+nx) = 1+(n+1)x+nx^2 \ge 1+(n+1)x $. (If $-1 &lt; x &lt; 0$, if $1+nx \ge 0$, the above proof goes through, and if $1+nx &lt; 0$, $1+mx &lt; 0$ for all $m \ge n$ so certainly $(1+x)^m &gt; 1+mx$.)  This proof originally appeared in N.S Mendelsohn, An application of a famous inequality, Amer. Math. Monthly 58 (1951), 563 and uses the arithmetic-geometric mean inequality (AGMI) in the form $\big(\sum_{i=1}^n v_i/n\big)^n \ge \prod_{i=1}^n v_i$  (all $v_i$ positive) with equality if and only if all the $v_i$ are equal.  Let $a_n = (1+1/n)^n$ and $b_n = (1+1/n)^{n+1}$.  We will prove that $a_n$ is an increasing sequence  and $b_n$ is an decreasing sequence.  Since $a_n &lt; b_n$, this implies,  for any positive integers $n$ and $m$ with $m &lt; n$  that $a_m &lt; a_n &lt; b_n &lt; b_m$.  For $a_n$, consider n values of $1+1/n$ and $1$ value of $1$.  Since their sum is $n+2$ and their product is $(1+1/n)^n$, by the AGMI,  $((n+2)/(n+1))^{n+1} &gt; (1+1/n)^n$,  or $(1+1/(n+1))^{n+1} &gt; (1+1/n)^n$,  or $a_{n+1} &gt; a_n$.  For $b_n$, consider $n$ values of $1-1/n$ and $1$ value of $1$.  Since their sum is $n$ and their product is $(1-1/n)^n$, by the AGMI,  $(n/(n+1))^{n+1} &gt; (1-1/n)^n$  or $(1+1/n)^{n+1} &lt; (1+1/(n-1))^n$,  or $b_n &gt; b_{n+1}$.  Since $b_n-a_n  = (1+1/n)^{n+1} - (1+1/n)^n = (1+1/n)^n(1/n) =a_n/n $ and every $a_n$ is less than any $b_n$ and $b_3 = (1+1/3)^4 = 256/81 &lt; 4$, $b_n-a_n &lt; 4/n$, so $b_n$ and $a_n$ converge to a common limit.  These proofs do not seem to be really elementary,  since they use the AGMI.  However, they use a special form of the AGMI,  where all but one of the values are the same,  and this will now be shown to be implied by BI,  and thus be truly elementary.   Suppose we have $n-1$ values of $u$ and $1$ value of $v$ with $u$ and $v$ positive.  The AGMI for these values is  $(((n-1)u+v)/n)^n \ge u^{n-1}v$  with equality if and only if $u = v$.  We will now show that this is implied by BI: $(((n-1)u+v)/n)^n \ge u^{n-1}v$  is the same as  $(u+(v-u)/n)^n \ge u^n(v/u)$.  Dividing by $u^n$,  this is equivalent to  $(1+(v/u-1)/n)^n \ge v/u$.  By BI,  since $(v/u-1)/n &gt; -1/n &gt; -1$, $(1+(v/u-1)/n)^n \ge 1+n((v/u-1)/n) = v/u$  with equality only if $n=1$ or $v/u-1 = 0$. Thus BI implies this version of the AGMI. Is there any way in unix to find out who accessed certain file in last 1 week? It may be user or some script ftp it to some other place. Can I get a list of user name who accessed certain file? How can I find out who is accessing particular file?? Which site is more reasonable for questions about R, SO or stats.stackexchange.com? I've been using SO for a little over a year now, and recently I've noticed a shift of users between SO and stats.stackexchange.com.   I'm wondering if there has been any discussion on where questions about R, a statistical environment, best fits. Would you say it's better to ask R questions on SO or would it be better to ask over at stats.stackexchange.com? What, if any, determinants would you use to decide to post between the two? What about cross posting? I know I've seen somewhere how to typeset 1/2 as ½, but with arbitrary fractions (that is, a macro that takes two arguments and makes the first denominator and the second numerator...). Now I can't seem to find it.  How do I typeset an arbitrary fraction the same way as ½? Area of the Limiting Polygon Start with an equilateral triangle with unit area. Trisect each of the sides and then cut-off the corners. In this case, we get a regular hexagon - see the picture below. Next, trisect each of the sides of the hexagon and cut-off the corners. This will give a dodecagon, but not a regular one.   Continue this process ad infinitum.  What is the area of the limiting "polygon"?  My first thought was that it would be the circle tangent to the midpoint of each side. However, by making some pictures, it becomes clear quite quickly that the limiting polygon is not a circle and, in fact, might perhaps be an ellipse. The problem with that is that while there is a unique circle passing through any three points in general position, I need five generic points to specify a conic.   Can anyone suggest any hints as to how to find the area? By "hint" I don't mean "what you think might work", I mean "what you have tried and you know will work". Thanks in advance. How to install gnome shell extensions offline? I know how to go to the  website and download gnome-shell extensions, but now I need to install some extensions available there on a computer without any internet access at all. It is in a internal corporate network and there's no way I can get outside internet access on it, so I must find another way. I can copy files in a usb disk.   At my home computer, I have found my extensions at ~/.local/share/gnome-shell/extensions/ but just copying this folder to the target corporate computer didn't do the trick.   Running gnome-tweak-tool gives me a "Install Shell Extension" button but I don't know how to download an extension in a format acceptable to install using this button. I have tried to point to the folder above but it didn't work either.  What do I need to do? Is there a detailed activity log on Mac OS X that lists my recent commands and actions? How can I see what I just did on my computer? For example, an activity log showing that I copied a file from here to there? I was wondering if someone knows if there is a foot/feet symbol available in any of latex packages that I could use in my text? I would appreciate any hint.  I do really mean a foot/feet icon as in the picture below. If $P(x^5)+xQ(x^5)+x^2R(x^5)=(x^4+x^3+x^2+x+1)S(x)$ , then prove that $P(x)$ is divisible by $x-1$ $P,Q,R,S$ are polynomials such that: $P(x^5)+xQ(x^5)+x^2R(x^5)=(x^4+x^3+x^2+x+1)S(x)$ , then prove that $P(x)$ is divisible by $x-1$   I thought a lot on this but no result!! By the way,one idea is to insert some values for $x$ and try to produce a system of equations for the given polynomials,but I'm not sure it works. Deploying a static site on AWS EC2/nginx: what am I doing wrong? Procedure for reducing the degrees of freedom of an arbitrary system