I was recently looking at my network profile, and one of my PPCG questions, , was listed as 5 votes.  However, when I clicked the link, here is the result:       Simple math says that 9 - 3 = 6, 6 =/= 5. Don't tell me this is caching, because the question was last upvoted on May 27.
Noticed in :         is 320, shown 322. Also locked in 2013.  And then :         has a score of 179, shown 180.  has a score of 123, shown 122.  Neither of these posts got any votes recently.
Stripped out bottom bracket It's a well-known theorem (Corollary 8.10 in Lee Smooth) that given a smooth map of manifolds  $\phi:M\rightarrow N$ and a regular value $p\in N$ of $\phi$, the level set $\phi^{-1}(p)\subset M$ is a closed embedded submanifold. Is the converse true? That is, given an embedded submanifold $S\subset M$, is there necessarily a manifold $N$, smooth map $\phi:M\rightarrow N$, and regular value $p\in N$ of $\phi$ such that $S=\phi^{-1}(p)$?   Prop. 8.12 in Lee Smooth shows that this is true locally; specifically,     Let $S$ be a subset of a smooth $n$-manifold $M$. Then $S$ is an embedded $k$-submanifold of $M$ if and only if every point $p\in S$ has a neighborhood $U\subset M$ such that $U\cap S$ is a level set of a submersion $\phi:U\rightarrow\mathbb{R}^{n-k}$.   (and any level set of a submersion is of course the level set of a regular value). I feel like this is the kind of question where, if there is a counterexample, it probably is very simple, but I wasn't able to come up with one. Automatically make various multiple stroke colour the same as various underlying fill colours. I have auto traced a photograph in illustrator - its got thousands of vectors once I expand it and illustrator has converted each of them to a filled colour - I want to now trace the edges of them with a grungy brush but using the underlying fill colour. Where in illustrator can I stroke or outline these fills using the underlying colour - surely this is something that the program automatically does?   I've found this script online but don't know how to implement it. I'm new to this so any help appreciated. Many thanks.   James   var idoc = app.activeDocument;   var sel = idoc.selection;    for (i=0; i&lt;sel.length; i++) {       var ipath = sel[i];       ipath.stroked = true;       ipath.strokeColor = ipath.fillColor;   } least common multiple of $\{1,2,...,n\}$ is bigger than $2^{n-1}$ The least common multiple of $\{1,2,...,n\}$ is greater than $2^{n-1}$ for any $n \ge 3$.   I found this in a MATHEMATICA book, but I don't know how to prove this. Can you help me?  [Edit:  has a discussion of an asymptotic stronger result, but that relies on the . What else is known about this? JL] If $A = \tan6^{\circ} \tan42^{\circ},~~B = \cot 66^{\circ} \cot78^{\circ}$ find the relation between $A$ and $B$ My trigonometric problem is:     If $A = \tan6^{\circ} \tan42^{\circ}$ B = cot$66^{\circ} \cot78^{\circ}$ find the relation between $A$ and $B$.    Working :   $$B = \cot 66^{\circ} \cot78^{\circ} = 1- \frac{\tan24^{\circ}+\tan18^{\circ}}{\tan42^{\circ}}$$  $$A= \tan6^{\circ} \tan42^{\circ} = 1- \frac{\tan6^{\circ} +\tan42^{\circ}}{\tan48^{\circ}}$$  but it seems  this is the wrong way of doing this...please suggest. Thanks! Find $P(n+1)$ for a polynomial P Fix a nonnegative integer $n$. Let $P(x)$ be a polynomial of degree $n$ (over the real numbers) such that for all $k\in\left\{0,1,\ldots,n\right\}$, we have $P(k)=\dfrac{k}{k+1}$. Find $P(n+1)$.   My attempt:  I consider a new polynomial $Q(x)=(x+1)P(x)-x$. This $Q$ is a polynomial of degree $\leq n+1$ satisfying: $Q(k)=0\quad\forall k\in\{0,1,2,\ldots,n\}$. Therefore $Q(x)=\lambda x(x-1)\cdots(x-n)$ for a certain real $\lambda$. Hence, $Q(-1)=\lambda \cdot (-1)^{n+1}(n+1)!$, but also $Q(-1)=(-1+1)P(-1)+1=1$. Comparing these, we get $\lambda \cdot (-1)^{n+1} (n+1)! = 1$, thus $\lambda=\dfrac{(-1)^{n+1}}{(n+1)!}$. Since $Q(n+1)=\lambda(n+1)!$ then $Q(n+1)=(-1)^{n+1} $, and from $P(x) = \dfrac{Q(x)+x}{x+1}$ we deduce: $$P(n+1)=\dfrac{(-1)^{n+1}+n+1}{n+2}.$$ I doubted that the answer were $P(n+1)=\frac{n+1}{n+2}$ but the term $(-1)^{n+1}$ wasn’t expected. Is there any mistake here? Does someone have an alternative proof? So I was writing up a simple binary tree in Python and came across [...]  I don't believe this to be related to the Ellipsis object, more it seems to have something to do with an infinity loop (due to Python's shallow copy?). The source of this infinity loop and why it doesn't get expanded while expanding when accessed is something I'm completely lost to, however   &gt;&gt;&gt; a [[[[[], [], 8, 3], [[], [], 3, 2], 6, 3], [], 1, 4], [[], [], -4, 2], 0, 0] &gt;&gt;&gt; Keys(a)#With a+b [0, 1, 6, 8, 3, -4] &gt;&gt;&gt; Keys(a)#With [a,b] [8, [...], [...], 3, [...], [...], 6, [...], [...], 1, [...], [...], -4, [...], [...], 0, [...], [...]] &gt;&gt;&gt; Keys(a)[1]#?? [8, [...], [...], 3, [...], [...], 6, [...], [...], 1, [...], [...], -4, [...], [...], 0, [...], [...], 8, [...], [...], 3, [...], [...], 6, [...], [...], 1, [...], [...], -4, [...], [...], 0, [...], [...]]     Version using a+b  def Keys(x,y=[]):     if len(x):y+=[x[2]]+Keys(x[0],y)+Keys(x[1],y)#Though it seems I was using y=y[:]+, this actually outputs an ugly mess     return y   version using [a,b]  def Keys(x,y=[]):     if len(x):y+=[x[2],Keys(x[0],y),Keys(x[1],y)]     return y   So what exactly is [...]? Does a non-abelian semigroup without identity exist? Fetch the row which has the Max value for a column Table:   UserId, Value, Date.   I want to get the UserId, Value for the max(Date) for each UserId. That is, the Value for each UserId that has the latest date. Is there a way to do this simply in SQL? (Preferably Oracle)  Update: Apologies for any ambiguity: I need to get ALL the UserIds. But for each UserId, only that row where that user has the latest date. Word to describe using sarcasm or a similar approach to lead someone to recognise their own mistake How do you integrate $\int \frac{1}{a + \cos x} dx$? How do you integrate $\int \frac{1}{a + \cos x} dx$?  Is it solvable by elementary methods?  I was trying to do it while incorrectly solving a homework problem but I couldn't find the answer.  Thanks! Backstory: I've been developing a game with LibGDX for the past two years, and I've seen it refactored more times than I remember.  I jumped on the iOS iKVM port as soon as it was released. But I've been struggling with it ever since in regards to cross platform networking.  Kryonet will not port over to iOS unfortunately. So it's either I ditch Kryonet, or lose a large chunk of my target audience (iOS Users)  My question for you is:  I noticed LibGDX has cross platform classes ready for sockets and HTTP Requests, but no documentation exists for these sockets at all.  Has anyone used these sockets at all in the past, and does anyone know how they work? Find out which application listens to specific key bindings? How to extract pixel value counts from a raster in QGIS? Neatest proof that set of finite subsets is countable? I am looking for a beautiful way of showing the following basic result in elementary set theory:     If $A$ is a countable set then the set of finite subsets of $A$ is   countable.   I proved it as follows but my proof is somewhat fugly so I was wondering if there is a neat way of showing it:  Let $|A| \le \aleph_0$. If $A$ is finite then $P(A)$ is finite and hence countable. If $|A| = \aleph_0$ then there is a bijection $A \to \omega$ so that we may assume that we are talking about finite subsets of $\omega$ from now on. Define a map $\varphi: [A]^{&lt;\aleph_0} \to (0,1) \cap \mathbb Q$ as $B \mapsto \sum_{n \in \omega} \frac{\chi_B (n)}{2^n}$. Then $\varphi$ is injective hence the claim follows. (The proof of which is what is the core-fugly part of the proof and I omit it.). I have created a C# application which uses a SQL Server database. I have other computers connected to me and to each other in a workgroup. I have shared my C# application with others. When they open the application they get the error      A network related or instance-specific error occured while establishing a connection to SQL Server. the server was not found or was not accessible   But the application is working fine on my PC. The connection string I am using is   Data Source=ASHISHPC1\SQLEXPRESS;Initial Catalog=ACW;User ID=ash159;Password=ashish159   which is stored in a .config file.   The application is working fine on my PC. What must I do? I have enabled the TCP/IP in the server but the same error persists. Some change in connection string or something else? Differences between pure/mixed/entangled/separable/superposed states Why do most C programmers name variables like this:  int *myVariable;   rather than like this:  int* myVariable;   Both are valid. It seems to me that the asterisk is a part of the type, not a part of the variable name. Can anyone explain this logic? What packages do you use and recommend for creating graphics in your LaTeX documents?     As this is a community wiki post, please add your package to the accepted answer (or add a comment, and someone with >100 rep will add it to the CW answer), and include a brief description of what differentiates it from others and how it can be used (GUI drawing tool which generates code, type in raw text, or generates image for inclusion in document).   We'll eventually sort these answers under headings. Terminology of the sequences of promoters in relation to DNA strands I'm studying molecular biology and I'm trying to understand an experiment which shows the importance of promoters in the relative transcription level (RT). The image below comes from Rolf Knippers' book "Molekulare Genetik" (8th edition).    The legend says (among other things):     Die erste Zeile gibt die normale "Wildtyp"-Sequenz der 5'-flankierenden Region wieder.   Which, in english, means something like:     The first line repeats the normal wild-type sequence of the 5' flanking region.   The column on the right gives the relative transcription (RT) level, 1.0 being the highest possible level of transcription. As we can see, the lines where some parts of the "5' region" have been deleted give quite low RT levels, since some regions of the promoter are missing.  My questions are the following:  1) According to  and , I understand that RNA polymerase reads and uses both coding and non-coding strands in order to synthesize RNA. Therefore, how did they manage to use the sequences strands regions had been deleted to make a polymerase "read them" and perform transcription?  2) If the polymerase reads the template strand in the 3' -> 5' sense, shouldn't we talk of "ATAT box" or "TAAC box" instead of "TATA" or "CAAT" boxes? Does it mean that the "promoter" regions they are using on the graphic above are actually on the coding strand?  Thanks a lot for your help.