At least in Indonesia it is.  Know why?
I was going to ask , but I came to the conclusion that I'm not going to do it (asking and building).  Now my question is: why is it (usually, if we leave the silly high-end prices alone) more expensive to build a bike from scratch?
I want to model this gun:  So I started to cut out the rough shapes from a cube (using the boolean modifier) Then I tried to clean up the geometry to be able to round the edges of the handguard.  But it does not work. When I try to bevel it like in the last pic top right it just gets really messy.  I think I took the wrong approach. How would you go about adding clean and workable geometry to such a piece and would you use the Bevel tool to create the round shapes? Which is correct, "you and I" or "you and me"? Elegant way of obtaining the envelope of oscillating function Writing string at the same position using Console.Write in C# 2.0 I have a console application project in C# 2.0 that needs to write something to the screen in a while loop. I do not want the screen to scroll because using Console.Write or Console.Writeline method will keep displaying text on console screen incremently and thus it starts scrolling.  I want to have the string written at the same position. How can i do this?  Thanks What is the definition of textbook or "raw" RSA?  What are some of the properties of textbook RSA?  How does it differ from other schemes based on RSA? Should 'fuck' be present in review audits (intentionally fake suggested edit reviews)? Creating new users using PHP not recognized by Apache 2.4 I have a server setup where new linux users are created using (PHP)  shell_exec ( '/usr/sbin/useradd ' . $username ); exec ('usermod -a -G ' . $username . ' '. $username); #add user into the usergroup exec ('usermod -a -G ' . $username . ' www-data'); #add usergroup with the www-data   And then the user script changes the owner and group of the files to this owner. The server is setup with suPHP which then allows these files to be run as the owner.  This setup worked fine with Apache 2.2 but is breaking in Apache 2.4. Everything works fine except when I try to oepn the files, it gives a 403 forbidden error. Restarting apache after the user is added fixes the issue but that is not a viable solution for me. The users are added using a web server and hence I need to be able to do this without having to reload/restart apache everytime.  I have searched for serveral hours and tried to fix the issue but haven't been able to do so! I am running ubuntu 14.04 and I am not able to downgrade to apache 2.2 as well. How to get the entity ID for a custom field in Apex? I am looking for a way to get the 15 character entity ID for a custom field on my Lead object in an Apex controller. I have tried this:  private String getEntityIdFor(String fieldName) {         Map&lt;String, Schema.SObjectField&gt; fieldMap = Schema.SObjectType.Lead.fields.getMap();         return fieldMap.get(fieldName).getDescribe().getId();     }    Of course, there is no getId() method, but this is the closest I got.   Thanks for any help. Total combinations from number of unique combination? How can you find count of the total combinations possible if you have the count of unique combinations? Suppose I need to form a sum of $3$ using $\{1,2\}$ Unique combn. $(1+1+1)$, $(1+2)$ hence '$2$' unique but total is '$3$' i.e, $(1+1+1)$, $(1+2)$, $(2+1)$ I know the elements used to make the combination Note: Number of unique combinations (ie. 2 here) is known. How can I find the total number of combination given the unique combinations? How can I verify a Google authentication access token?  I need to somehow query Google and ask: Is [given access token] valid for the [example@example.com] Google account?  Short version: It's clear how an access token supplied through the  can be used to then request data from a range of Google services. It is not clear how to check if a given access token is valid for a given Google account. I'd like to know how.  Long version: I'm developing an API that uses token-based authentication. A token will be returned upon provision of a valid username+password or upon provision of a third-party token from any one of N verifiable services.  One of the third-party services will be Google, allowing a user to authenticate against my service using their Google account. This will later be extended to include Yahoo accounts, trusted OpenID providers and so on.  Schematic example of Google-based access:    The 'API' entity is under my full control. The 'public interface' entity is any web- or desktop-based app. Some public interfaces are under my control, others will not be and others still I may never even know about.  Therefore I cannot trust the token supplied to the API in step 3. This will be supplied along with the corresponding Google account email address.  I need to somehow query Google and ask: Is this access token valid for example@example.com?  In this case, example@example.com is the Google account unique identifier - the email address someone uses to log in to their Google account. This cannot be assumed to be a Gmail address - someone can have a Google account without having a Gmail account.  The Google documentation clearly states how, with an access token, data can be retrieved from a number of Google services. Nothing seems to state how you can check if a given access token is valid in the first place.  Update The token is valid for N Google services. I can't try a token against a Google service as means of verifying it as I won't know which subset of all Google's services a given user actually uses.  Furthermore, I'll never be using the Google authentication access token to access any Google services, merely as a means of verifying a supposed Google user actually is who they say they are. If there is another way of doing this I'm happy to try. If a group satisfies $x^3=1$ for all $x$, is it necessarily abelian? I know that any group satisfying $x^2=1$ for all $x$ is abelian. Is the same true if $x^3=1$? I don't think it is, but I can't find a basic counterexample. zsh I/O redirection: redirecting and then piping; what is going on? Sums and products of algebraic numbers How does one go about proving that the sums and products of two algebraic numbers over a field $F$ (say $a,b\in K$, where $K/F$ is a field extension) is also algebraic?   If we call $f_a$ and $f_b$ the min. poly's of $a$ and $b$, then I'm assuming the answer involves such polynomials. Perhaps looking at their roots in splitting fields for both of them? And finding a "big" splitting field, constructed from those two other ones?      In particular, I'd like a way of explicitly constructing the minimal polynomials $\ f_{ab}$ of $ab$ and $f_{a+b}$ of $a+b$.     I read somewhere that $g(x)=\Pi_j\Pi_i (x-\alpha_i\beta_j)$ works for $ab$, where the $\alpha_i$ and $\beta_j$ are the roots of $f_a$ and $f_b$, respectively, but I do not know why $g(x)\in F[x]$.  Similar remarks for $a+b$ How important is the following in purchasing a laptop that will be used for image editing:   processor speed amount of RAM integrated vs. dedicated graphics card HD speed (SSD; or 5400/7200/10000 rpm) I'm going to install Linux on Lenovo B5400, which contains:   500GB Hybrid SSHD with a 8 GB SSD and 500 GB HDD   Designing partitions for my 2 Linux distros was quite easy before, when I had only HDD. I always had:   10GB for Linux distro (mounted as "/") 10GB for another distro (again "/"; for another distro; for testing purposes or to assure continuity when switching distros) 2GB for swap (used for both distros; no need to separate) 300GB+ for "/home" (used for both distros; different usernames eliminates possible conflicts)   It's simple, isn't it? I would like to keep this approach, but I know that SSD has its own specificity - it prefers to be read, continuous writing may affect its life span. I don't want to kill SSD in a year, so I would like to move some system partitions to HDD in order to protect SSD. As far as I know /tmp is one of often read&amp;written locations. How much space it needs? What else should be placed on HDD?  Or: how to design partitions to achieve exactly the same effect and to keep SSD as safe as possible?  I'd be grateful for your help. Detecting start bit in software UART I'm experimenting with writing a software UART on my microcontroller using GPIO pins. This is to temporarily add a UART channel on a project until we get the new design implemented that uses a uC with more UART ports.  What I'm having difficulty with is correctly detecting a start bit in a serial stream. The source of the stream is external and doesn't care when my device powers up. So it's very likely that my device will power on and start seeing data bits in the middle of a byte transmission. Undoubtedly, that will cause my software UART to read erroneous values, as it won't be able to tell the difference between a start bit and any other high-to-low transition.  Is this an inevitable issue with a UART channel? Or is there some clever trick that the uC manufacturers use in their hardware UARTs? Find a recurrence relation for the number of $n$-digit binary sequences with no pair of consecutive $1$s Find a recurrence relation for the number of $n$-digit binary sequences with no pair of consecutive $1$s.  I know my base case:$$a_1 = 2$$ for either $1$ or $0$. Normally to construct the recurrent relation I would say fill in $n-1$ spaces then add a $1$ or $0$, which is simply:$$a_n = 2\cdot a_{n-1}$$However, I don't believe this is right, because this doesn't take into account that there can't be any consecutive $1$s.  Even when I use the base case of $2$ digits:$$a_2 = 3$$for either $01$, $10$, or $00$, I still get the recurrence relation of:$$a_n = 3\cdot a_{n-2}$$which also does not account for $01$ and $10$ occurring consecutively.   So how would I express this? Should Suggested Edits change the technical content of a post? I have noticed a significant number of suggested edits that attempt to fix code, or change the original meaning of someone else's post.    Is this really a good idea?    I've been on StackOverflow awhile, and among the editors who have sufficient reputation to edit without approval, I've never seen anyone modify the technical content or meaning of someone else's post.   I would consider obvious syntax and spelling errors OK to change, but I have seen many suggested edits that change the meaning of the code that was posted, or add things to the code that have nothing to do with the original question. A good example of this would be adding parameters to a SQL command, when the question was not asking about SQL injection. Given a Lie group, how are you meant to find its Lie algebra?  The Lie algebra of a Lie group is the set of all the left invariant vector fields, but how would you determine them?  My group is the set of all affine maps $x \rightarrow A.x+v$ from $R^n$ to $R^n$ under function composition. Responding to your "too localized" concerns