Business not showing up on right hand side of google search
How do you get your Google+ profile displayed in the right hand sidebar of the Google search results page?
Short story with spaceship and humanity not realising they should be on it The plot is about:   A spaceship travelling through the universe Earth is a rogue planet whose inhabitants have been cut off and don't realise that their true purpose is to be part of the spaceship   The reason earth was in turmoil (wars etc.) was that they didn't realise that their true role was to fit into the ship  The ship contained 3 or 4 beings that made the thing work Planets throughout the universe are populated with the various beings which are components of the space craft   I seem to remember like an eye shaped being Each of them fulfil their role Humans are part of that as well.  There are loads of planets with humans on but earth has gotten overlooked so it never realised that's what they were designed for The story concludes with the ships picking up someone from Earth   and with the "human" realising that this is what they should really be doing  Humans have a different name that explains their role in the ship.   I probably read it around 30 years ago in English in a sci-fi collection book. I'm trying to write a basic program in C using gedit or sublime text (which I prefer), but no matter what I do when I try to compile or run, or even while writing, I have no option to use 'stdio.h' or any similar package. Even when I start typing #include &lt;st the only word completion sublime suggests is 'struct'.  I've read dozens of threads, but all managed to fix this by installing gcc, which I've tried to reinstall multiple times, with no luck.  This is the output from gcc -v:  Using built-in specs. COLLECT_GCC=gcc COLLECT_LTO_WRAPPER=/usr/lib/gcc/x86_64-linux-gnu/7/lto-wrapper OFFLOAD_TARGET_NAMES=nvptx-none OFFLOAD_TARGET_DEFAULT=1 Target: x86_64-linux-gnu Configured with: ../src/configure -v --with-pkgversion='Ubuntu 7.2.0-8ubuntu3' --with-bugurl=file:///usr/share/doc/gcc-7/README.Bugs --enable-languages=c,ada,c++,go,brig,d,fortran,objc,obj-c++ --prefix=/usr --with-gcc-major-version-only --program-suffix=-7 --program-prefix=x86_64-linux-gnu- --enable-shared --enable-linker-build-id --libexecdir=/usr/lib --without-included-gettext --enable-threads=posix --libdir=/usr/lib --enable-nls --with-sysroot=/ --enable-clocale=gnu --enable-libstdcxx-debug --enable-libstdcxx-time=yes --with-default-libstdcxx-abi=new --enable-gnu-unique-object --disable-vtable-verify --enable-libmpx --enable-plugin --enable-default-pie --with-system-zlib --with-target-system-zlib --enable-objc-gc=auto --enable-multiarch --disable-werror --with-arch-32=i686 --with-abi=m64 --with-multilib-list=m32,m64,mx32 --enable-multilib --with-tune=generic --enable-offload-targets=nvptx-none --without-cuda-driver --enable-checking=release --build=x86_64-linux-gnu --host=x86_64-linux-gnu --target=x86_64-linux-gnu Thread model: posix gcc version 7.2.0 (Ubuntu 7.2.0-8ubuntu3) `   This is the code:   #include &lt;stdio.h&gt;  int main(void) { printf("hello, world\n"); }   When I compile using gcc, I get nothing, no error at least. but when I try to run using just ./hello.c this is what I get. Why a line is said to have infinite number of points? If $p$ is a prime and $p \mid ab$, then $p \mid a$ or $p \mid b$. How to circumvent using an out parameter in an anonymous method block? The following method does not compile. Visual Studio warns "An out parameter may not be used within an anonymous method". The WithReaderLock(Proc action) method takes a delegate void Proc().  public Boolean TryGetValue(TKey key, out TValue value) {     Boolean got = false;     WithReaderLock(delegate     {         got = dictionary.TryGetValue(key, out value);     });     return got; }   What's the best way to get this behavior? (Please refrain from providing advice on threadsafe dictionaries, this question is intended to solve the out parameter problem in general). Where to post questions asking for expert opinion? After my lie down, I posted  on SO. As I suspected would happen, it got moved to programmers. Unfortunately, the kind of people I'm interested in getting answers from (litb,skeet et al - the top SO programmers in their respective disciplines) don't frequent Programmers much. So my question is, where to ask somewhat non-specific questions of high-powered users? Why does pizza cheese seem hotter than the crust? When I eat hot pizza or a melted cheese sandwich, the cheese feels a lot hotter than the crust or bread: in particular, the cheese might scald the roof of my mouth. but the crust will not. Is this   my imagination, or because the crust cools a little faster than the cheese, so has already cooled a bit by the time I eat it, or because the cheese cools a little faster than the crust, so transfers heat to the roof of my mouth a bit more, or what? I'll be traveling to Berlin, Germany from Colombo, Sri Lanka via Turkish Airways.  The itinerary would be: Colombo  &lt;--> Istanbul- || Istanbul- &lt;--> Berlin   The flights are all on one ticket. Would I be required to claim and re-check my baggage at Istanbul or can I check it in all the way from Colombo to Berlin without re-checking in the baggage again? Purpose of else and finally in exception handling When editing a question on , I observed that a link which was not rendered in the post was hyperlinked in the edit preview (see pictures below). I tried reproducing it in the  to see if this also happens when the post is posted for the first time and observed the same. It seems to be a bug after the shift to CommonMark, leading to the different rendering of links on client and server-side. A link following a special character (without any space) is not hyperlinked in the post but is hyperlinked in the preview. A link separated from the special character with a white space appears to have no such problem. (see pictures below and my ). Link not hyperlinked in post  Same link hyperlinked in preview Integration of $\int\frac{1}{x^{4}+1}\mathrm dx$ $F$ closed and connected then... Let $F\subset X$ be a closed and connected subset of the metric space $(X,d)$ then for every pair of points $a, b\in F$ and each $\epsilon&gt;0$ there are points $a=z_0,z_1,\ldots z_n=b$ in $F$ such that $d(z_{k-1}-z_k)&lt;\epsilon$ for $1\leq k\leq n$.  Is the hypothesis that $F$ is closed needed? biblatex – et al. beginning from second citation? Basically all I need to know is how I can use "et. al" beginning from the second citation of a source. I am using the following  \usepackage[ natbib=true, style=authoryear ]{biblatex}   I need citations to look like this:  First citation of a source     Drobetz, Schillhofer, and Zimmermann (2004)   Second and further citations     Drobetz et al. (2004)   Right now, every citation looks like the first one. With the biblatex option maxcitenames I can only adjust all citations and not all but the first one. Any help? I would like to grant the  app write access to external storage in Marshmallow.  The app does not request it explicitly (unlike other apps that seem to use the Storage Access Framework to do so).    In the app permissions screen, there is no permission listed for external storage, only for 'storage' (which seems to mean internal storage).  So there does not seem to be any direct way to grant this permission.   My phone is rooted and I could just run Syncthing as root - but this option creates many problems and sometimes results in the app hanging indefinitely.    Is there any other way around this problem? Closed form for $ \int_0^\infty {\frac{{{x^n}}}{{1 + {x^m}}}dx }$ I've been looking at  $$\int\limits_0^\infty  {\frac{{{x^n}}}{{1 + {x^m}}}dx }$$  It seems that it always evaluates in terms of $\sin X$ and $\pi$, where $X$ is to be determined. For example:  $$\displaystyle \int\limits_0^\infty  {\frac{{{x^1}}}{{1 + {x^3}}}dx = } \frac{\pi }{3}\frac{1}{{\sin \frac{\pi }{3}}} = \frac{{2\pi }}{{3\sqrt 3 }}$$  $$\int\limits_0^\infty  {\frac{{{x^1}}}{{1 + {x^4}}}dx = } \frac{\pi }{4}$$  $$\int\limits_0^\infty  {\frac{{{x^2}}}{{1 + {x^5}}}dx = } \frac{\pi }{5}\frac{1}{{\sin \frac{{2\pi }}{5}}}$$  So I guess there must be a closed form - the use of $\Gamma(x)\Gamma(1-x)$ first comess to my mind because of the $\dfrac{{\pi x}}{{\sin \pi x}}$ appearing. Note that the arguments are always the ratio of the exponents, like $\dfrac{1}{4}$, $\dfrac{1}{3}$ and $\dfrac{2}{5}$. Is there any way of finding it? I'll work on it and update with any ideas.    UPDATE:  The integral reduces to finding   $$\int\limits_{ - \infty }^\infty  {\frac{{{e^{a t}}}}{{{e^t} + 1}}dt} $$  With $a =\dfrac{n+1}{m}$ which converges only if   $$0 &lt; a &lt; 1$$  Using series I find the solution is     $$\sum\limits_{k =  - \infty }^\infty  {\frac{{{{\left( { - 1} \right)}^k}}}{{a + k}}} $$ How can I prove $n - 2\sqrt{n} = \Theta(n)$ Let $\mathbf{Y}$ be a random vector. Are $k$th moments of $\mathbf{Y}$ considered? I am self-learning on linear model theory right now, and one thing I find surprising is that although $\mathbb{E}[\mathbf{Y}]$ is defined for a random vector $\mathbf{Y} = \begin{bmatrix} y_1 \\ y_2 \\ \vdots \\ y_n\end{bmatrix}$, there is no mention of further moments besides the covariance matrix.  Google searching hasn't turned up much. Are $k$th (raw) moments of $\mathbf{Y}$ considered, or is there a different idea I don't know about?  I am learning from the text  (the TOC starts in p. 17 of the linked file). By "considered," what I mean is is there such a thing as $\mathbb{E}\left[\mathbf{Y}^k\right]$, and if so, how would such a concept be defined? The book I have only covers the first raw moment, and I find it a bit strange that there is no mention of how to define $\mathbb{E}\left[\mathbf{Y}^k\right]$ given my experience in univariate probability, nor do I have the expertise to define it.  Furthermore, if $\mathbb{E}\left[\mathbf{Y}^k\right]$ isn't defined, is there perhaps a related concept that I don't know about that is used instead? Optimal way to ignore duplicate inserts? Background  This problem relates to ignoring duplicate inserts using PostgreSQL 9.2 or greater. The reason I ask is because of this code:    -- Ignores duplicates.   INSERT INTO     db_table (tbl_column_1, tbl_column_2)   VALUES (     SELECT       unnseted_column,       param_association     FROM       unnest( param_array_ids ) AS unnested_column   );   The code is unencumbered by checks for existing values. (In this particular situation, the user does not care about errors from inserting duplicates -- the insertion should "just work".) Adding code in this situation to explicitly test for duplicates imparts complications.  Problem  In PostgreSQL, I have found a few ways to ignore duplicate inserts.  Ignore Duplicates #1  Create a transaction that catches unique constraint violations, taking no action:    BEGIN     INSERT INTO db_table (tbl_column) VALUES (v_tbl_column);   EXCEPTION WHEN unique_violation THEN     -- Ignore duplicate inserts.   END;   Ignore Duplicates #2  Create a rule to ignore duplicates on a given table:  CREATE OR REPLACE RULE db_table_ignore_duplicate_inserts AS     ON INSERT TO db_table    WHERE (EXISTS ( SELECT 1            FROM db_table           WHERE db_table.tbl_column = NEW.tbl_column)) DO INSTEAD NOTHING;   Questions  My questions are mostly academic:   What method is most efficient? What method is most maintainable, and why? What is the standard way to ignore insert duplication errors with PostgreSQL? Is there a technically more efficient way to ignore duplicate inserts; if so, what is it?   Thank you! My intent is to show that a composition of bijections is also a bijection by showing the existence of an inverse.  But my approach requires the associativity of function composition.  Let $f:  X \rightarrow Y, g:  Y \rightarrow Z, h:  Z \rightarrow W$ be functions.  $((f \circ g) \circ h)(x) = h((f \circ g)(x)) = h(g(f(x)))$, and $(f \circ (g \circ h))(x) = (g \circ h)(f(x)) = h(g(f(x)))$.  However, I am having problems in justifying that the two compositions, $(f \circ g) \circ h$ and $f \circ (g \circ h)$, have the same domain and range.  When I consulted ProofWiki, whose link is at the bottom, I got even more confused.  Specifically, for $(f \circ g) \circ h = f \circ (g \circ h)$ to be defined, ProofWiki requires that dom$g =$ codom$f$ and dom$h =$ codom$g$.  First of all, I think that it should be dom$g =$ range$f$ ....  Moreover, as you can see in the example below, you actually have to adjust domains and ranges of $f, g, h$ for the requirement to hold true.  Let $f: \mathbb R \rightarrow \mathbb R$ be $f(x) = 2x$, $g: \mathbb R^+ \rightarrow \mathbb R$ be $g(y) = ln(y)$, $h: \mathbb R \rightarrow \mathbb R$ be $h(z) = z - 10$.   Then $((f \circ g) \circ h)(x) = ln(2x) - 10 = (f \circ (g \circ h))(x)$, with dom$((f \circ g) \circ h) = \mathbb R^+$ = dom$(f \circ (g \circ h))$.  As a result, we need to set dom$f = \mathbb R^+$, range$f = \mathbb R^+$; dom$g$, range$g$, dom$h$, and range$h$ remain the same.  Am I allowed to do that?  This adjustment implies that when we say dom$f = X$, $f$ must be defined for all elements in $X$, but $X$ may not be the entire set of elements for which $f$ is defined. Closure of identity element in a topological group is the intersection of its neighborhood system Consider a topological group $G$. I want to prove that      if $\cal{U}$ is the set of all neighborhoods of $e$ (the identity element), then $\overline{\{e\}}=\cap_{U\in \cal{U}}U$.   What I thought was:  i) If $x\in \overline{\{e\}}$, then every neighborhood $V$ of $x$ intersects $\{e\}$, hence every $V$ is a neighborhood of $e$ as well, i.e. $V\in \cal{U}$.  ii) On the other hand, if $x\in \cap_{U\in \cal{U}}U$, then $x\in U$ for all $U \in \cal{U}$, meaning every $U$ is a neighborhood of $x$ intersecting $\{e\}$.  Now, I think that the missing part is an argument justifying that there is no neighborhood of $e$ that is not a neighborhood of $x$ (part i)), and that there is no neighborhood of $x$ that is not a neighborhood of $e$ (part ii)). My idea for this is to argue that there is a homeomorphism taking $e$ to $x$, therefore the neighborhood system of one cannot have more elements that the neighborhood system of the other.  Is this correct? If not, is there a way I can fix it?