Proper SE site to ask about cloudcompare question
Which computer science / programming Stack Exchange sites do I post on?
In the United States, we say that someone lives on a street, whereas I've noticed that British people say in. For instance:     Bubba lives on Washington Street.   Colin lives in Cavendish Avenue.   I believe we both would use at when a number is given. For instance:     Bubba lives at 16 Washington Street.   Colin lives at 7 Cavendish Avenue.   I don't think it matters if it's a road, avenue, street, circle, or lane — as far as I know, in America, we always live on a street. Does it vary in British English, or is it always in? If it varies, what are the rules? Can someone give me a hint how to the irreducibility of $X^{p-1} + \cdots + X+1$, where $p$ is a prime, in $\mathbb{Z}[X]$ ?    Our professor gave us already one, namely to substitute $X$ with $X+1$, but I couldn't make much of that. Choosing variables to include in a multiple linear regression model Is it possible to install an old version of Mac OS on a new Mac? How does the NSAutoreleasePool autorelease pool work? As I understand it, anything created with an alloc, new, or copy needs to be manually released. For example:  int main(void) {     NSString *string;     string = [[NSString alloc] init];     /* use the string */     [string release]; }   My question, though, is wouldn't this be just as valid?:  int main(void) {     NSAutoreleasePool *pool;     pool = [[NSAutoreleasePool alloc] init];     NSString *string;     string = [[[NSString alloc] init] autorelease];     /* use the string */     [pool drain]; } Why am I getting no power when I pedal? Let $\{a_n\}$ be defined as follows: $$a_1 = 2, a_{n+1}=\dfrac{1}{3-a_n}$$ $n \geq 1$.   Does $\{a_n\}$  converge?    Using the monotone convergence thereom, if the sequence is both bounded below and decreasing, $\forall n\in\mathbb{N}, n\geq 1$, then we can say the sequence converges.  I'm having trouble proving that the sequence is bounded below by induction.    Claim: The sequence is bounded below by $0$.  Base Case:  $n=1$  $a_1 = 2 \geq 0$, so this holds.  Induction Step  Suppose that $a_k \geq 0$, for some $k \in\mathbb{N}$. (IH)  Prove $a_k \geq 0\to a_{k+1} \geq 0$  I have some difficulty here.  $a_{k}=\dfrac{1}{3-a_{k-1}} \geq 0$  $a_{k+1}=\dfrac{1}{3-a_{k}}$, but we know $a_k \geq 0$, but we don't know how much bigger. It could be that $a_k = 4$, and then I have $a_{k+1}=\dfrac{1}{3-4}$, which is negative, and does not confirm with my claim of being bounded below by $0$. Have I gone somewhere wrong in my induction? Have a web-part display only sub-folders? I am new to SharePoint 2013. I was curious how to put a WebPart for a Document Library on a page with SharePoint 2013, not 2010.   This WebPart would then show the content of a specific library folder and not start at the root of the folder. So say I have a library with multiple folders like "Marketing", "Finance" etc,   I want to be able to create a web part that would only show the contents within the “Marketing subfolder and all of it contents. Is this possible? Jutifying: irrational + rational = irrational Is $\int_a^b f(x) dx = \int_{f(a)}^{f(b)} f^{-1}(x) dx$? How do I turn on workspaces? (Why do I only have one workspace?) How to disk copy with unreadable sectors? I want to clone a whole disk bytewise, something like  dd if=/dev/$SRC of=/dev/$DST bs=65536 count=$count   There are better tools for the job, which understand the file system (Windows) and work faster (I don't care), but they fail because of unreadable sectors on the old source disk.  There's actually a single invalid block I have to skip. So I thought about using dd multiple times like  dd if=/dev/$SRC of=/dev/$DST bs=65536 count=... dd if=/dev/zero of=/dev/$DST bs=65536 count=... skip=... seek=... dd if=/dev/$SRC of=/dev/$DST bs=65536 count=... skip=... seek=...   with replacing the broken sector data by zeros. Is this a valid approach? I found this  which confuses me. What is the integral of 1/x? What is the integral of $\frac{1}{x}$? Do you get $\ln(x)$ or $\ln|x|$? In general, does integrating $f'(x)/f(x)$ give $\ln(f(x))$ or $\ln|f(x)|$? Also, what is the derivative of $|f(x)|$? Is it $f'(x)$ or $|f'(x)|$? Ok, so I have an index.php file which has to process many different file types.  how do I guess the filetype based on the REQUEST_URI.  If I request http://site/image.jpg, and all requests redirect through index.php, which looks like this  &lt;?php    include('/www/site'.$_SERVER['REQUEST_URI']); ?&gt;   How would I make that work correctly?  Should I test based on the extension of the file requested, or is there a way to get the filetype? How is arccos derived? Stupid question but I need to understand:  If $ \cos = \dfrac{\text{adjacent}}{\text{hypotenuse}} $  What is arcosine? $ \text{adjacent} \cdot \text{hypotenuse}$? Is this the same for arcsine and arctangent? How do you become a vampire/werewolf in Elder Scrolls Online The game is released for a few days now. I have heard that you can turn into thoses beasts. I have a few questions about that   How do you turn into werewolf/vampire ? On the chat people said they can bite others but who bite them first? How long does the effect last ? Are there any cons ? Maybe if your are a vampire you take damage from the sun like in older Elder Scrolls ? Design simulates perfectly but won't work on FPGA Would approaching a distant star at near the speed of light unfold its entire history in "fast-forward"? Find the value of : $\cos x \cos 2x...\cos 999x$ given that $x=\frac {2\pi}{1999}$ My printer does not print light magenta. (Canon MP220 - CL-38) I have a Canon MP 220, with new cartridges. Prints fine everything, but it won't print light magenta. I cleaned it and deep cleaned it many times. I have no idea what could be the problem. Cartridge models: CL-38 and PG-37.  Any ideas ?  LE: Now it won't print magenta at all!