For which among the following functions $f(z)$ defined on $G=\mathbb{C}\setminus\{0\}$ is there no sequence of polynomials approximating $f(z)$ uniformly on compact subsets of $G$ ?  1)$e^z$  2)$\frac{1}{z}$  3)$z^2$  4)$\frac{1}{z^2}$  here $e^z$ and $z^2$ are entire functions so can I say they can be approximated by sequence of polynomials ? I know Runge's theorem but not understanding how to apply it.

I have read the following theorem in Complex Analysis by Cufi and Bruna on Page 420:  Runge's theorem for open sets: An open set $U$ has the property that every holomorphic function on $U$ is the uniform limit on compact sets of $U$ of a sequence of polynomials, if and only if $\mathbb C \setminus U$ has no bounded connected component.  Now I came across the following question:  For which among the following functions $f(z)$ defined on $G=\mathbb C \setminus \{0\}$, is there no sequence of polynomials approximating $f(z)$ uniformly on compact subsets of $G$? $(a)\ e^z \\(b)\ \frac1z\\(c)\ z^2\\(d)\ \frac1{z^2}$  The answer according to me should be $(b)$ and $(d)$. But if I try to apply the above theorem, I see that all the functions are holomorphic on $G$(open) and $\mathbb C \setminus G=\{0\}$ which has a bounded connected component, namely $\{0\}$. So according to the theorem, the correct answer should be $(a),(b),(c)$ and $(d)$.  Where am I going wrong in applying the theorem?


I'm thoroughly confused about the nature of electromagnetic radiation. Light is supposed to exhibit both wave and particle characteristics. But does that mean that it is both a wave and a particle or neither a wave nor a particle? If the latter, then it is not a "real" particle at all, but only occasionally behaves as one (hence, a "virtual" particle). And if the former, then it is, depending on the experimental setup being used to detect it, a "real" particle, but one that only exists (as a particle) for a limited time, which again, corresponds to the definition of a virtual particle ("a transient fluctuation that exhibits many of the characteristics of an ordinary particle, but that exists for a limited time" - Wikipedia).  So, if photons invariably appear to exhibit the characteristics of virtual particles, why are they not actually virtual particles (even in a vacuum)?

Apologies if this has been asked before (I did check and I believe it wasn't). I have a question about the  of photons (or other particles). Depending on what and how we measure the photon turns out to be either a wave or a particle. Recently I saw some web page (and I can't remember where) that maybe neither is true. Both the wave perception and the particle perception are just that: perceptions, strengthened by our perhaps limited ability to observe. What if the reality of the photon is something else, something "on top" of our two perceptions?? Could someone direct me to a site that could tell me more about it (or maybe debunk the whole idea?)?


Consider the initial value problem  $$y′=3x(y−1)^{1/3},y(x_{0})=y_{0}$$  Using the existness and uniqueness theorem, for what points ($x_{0}$,$y_{0}$) imply that the above IVP  has a unique solution on some open interval that contains $x_{0}$?  What i tried  Using the seperable equation method,  I got  a solution of $$y=1+(x^{2}+c)^{1.5}$$  Im unsure of how to find the value of $c$ given the inital conditions and whether is it necessary to find the value of $c$ for this problem. While using the  existence and uniqueness theorem, $y_{0}$ must not be equal to $1$ in order for a unique solution to exist. But from here im unsure of how to find the points  ($x_{0}$,$y_{0}$), I was thinking that since i already know that $y_{0}$ does not equals to $1$, i must combine this result with the above solution that i got  in order to get $x_{0}$ and hence the point ($x_{0}$,$y_{0}$) but im unsure how to do so, especially when there is a $c$ involved. Could anyone explain. Thanks

From the existness and uniqueness Theorem,the initial value problem  $$y'=3x(y-1)^{1/3}            ,          y(3)=-7$$  has a unique solution on some open interval that contains $x=3$. Find the solution and determine the largest open interval on which it’s unique.  What i tried,              First i tried to solve the equation by the seperable equation method to get,$$y=1+(x^2-5)^{1.5}$$. Then from here i used the existence and uniquness theorem to calculate $f(x,y)$ and $f_{y}$. From the calculations,when $y$ not equals to $1$, $f_{y}$ will be continuous, hence there will be a unique solution when $y$ not equals to $1$, according to the wxistness and uniquness theorem. However im stuck from here onwards as to finding the interval of validaty. Is my working correct. Could anyone explain. Thanks


Can anyone guide me how to install Tor in Ubuntu 14.04 LTS. I am new here and even dont have expertise in Linux, but very much willing and excited to learn Linux. I need to install Tor anyhow on my laptop (Ubuntu). Please any help and support from anyone shall be highly appreciated.

I tried to install Tor on my new version of Ubuntu, but it seems that Tor is not available in the repositories.  How else can I install and use Tor?


Whenever i try to render the results it just shows this  does anyone know how to fix?

A scene I made is not rendering, at all. This grey screen stays the same and nothing changes.  Here are my settings:  [


I am adding the reference in yje captions of Figures and Tables of my thesis. Reference is also appearing in the List of figures and list of tables at the start of the chapters. This is how I am citing in the captions of Figures and Tables.   \caption{Graph showing global increase in herbicide resistance \protect \cite{heap2019international}.}  I dont want it appear in the List of Figures and List of Tables. Is there any other approach to avoid that?

Sometimes I'd like to cite the reference in the caption of a graphic. But I want to avoid that this citation is displayed in the \listoffigures. How can I achieve that?  Fore example with this code:  \begin{figure}[htb] \centering \includegraphics{overview_pyramid.png} \caption{Overview pyramid \cite{LM2010}}\label{fg:overview_pyramid} \end{figure}


I basically don't understand the way the proof is given in my text as well as some references online. They basically do the same thing.   THEOREM: Let $m,x$ be positive integers such that $\gcd(m, x) = 1$. Then $x$ has a multiplicative inverse modulo $m$, and it is unique, $\mod m $.  Now,  this is a sufficient and  necessary condition,  but  let's just look  at the  proof  that it is the sufficient condition which is given in my texts.  Proof: Consider the sequence of m numbers $0,x,2x,...,(m−1)x$. We claim that these are all distinct,$\mod m$. Since there are only $m$ distinct values modulo $m$, it must then be the case that $ax = 1 \mod m$,  for exactly one $a (\mod m)$. This a is the unique multiplicative inverse. To verify the above claim, suppose that $ax = bx \mod m$ for two distinct values $a,b$ in the range $0 ≤ a,b ≤ m−1$. Then we would have $(a−b)x = 0 \mod m$, or equivalently, $(a−b)x = km$ for some integer $k$ (possibly zero or negative). But since $x$ and $m$ are relatively prime, it follows that $a−b$ must be an integer multiple of $m$. This is not possible since $a,b$ are distinct non-negative integers less than $m$.  What I don't see particularly in this proof is the connection betweent the $\gcd$ being one and the existence of the multiplicative  inverse. What I do  see instead is that the proof that the multiplicative inverse is  unique.    What is the connection of  the $\gcd$ being $1$ and  the existence of  the multiplicative  inverse $\mod m$?

I think the following is true:  If $q$ is coprime to $a$ then $a\mid (nq-1)$ for some $n\in\mathbb Z$.  I have started to first reducing $n\in\mathbb Z$ to $n\in\{1,\ldots,a-1\}$ and then considering all the cases $q = ka + j$ for $j=1,2,3,\ldots,a-1$. I stopped at $j=3$ and found that this is kinda messy. Does anyone have an elegant proof for this (maybe using some results from number theory)?  [Note: question has been generalized from prime $q\nmid a$ to $\,q$ coprime to $a$]


Do I need an adjective or adverb here? I usually use fast so that there is no visible difference but I hear people say things like "Lets do this real quick" all kinds of colloquial stuff so I am not certain whether "really quickly" is.

I heard the following dialog in a British English movie:     Words go round quick. All the little tongues go clack, clack, clack.   What does this mean, and why was the word "quick" used instead of "quickly"?


I am writing a leader's guide for a preschool curriculum. When I put instructions inside of parentheses, should I end a full sentence with a period?  Examples:  (Give children time to respond)  (Show slide of hermit crab) (Allow them to choose from tray of gadgets)  Do these need a period, or does it even matter? :)

I have two complete sentences; the second is in parentheses, essentially a comment on the first.  Where do I place the periods?  I would use this:     They played opera. (I covered my ears.)   Is this punctuation correct?


I am using QGIS 2.10 and everything seems to work just fine so far, except for the raster clipping function (Raster>Extraction>Clipper). I'm using a vector poligon as a mask layer, but after launching the function, it just does nothing - not even showing an error.

Having an issue in QGIS 2.10 -- clip and intersect don't seem to be working correctly. I am trying to show zipcode by a legislative district in Florida. When I clip the zipcode shapefile by the district one, some of the zip codes aren't being clipped (or intersected -- I'm getting the same result with both tools).   In the below screenshot, the bronze color is what both tools are giving me as an output. It should be giving me the bronze vectors + the areas that are blue-violet (created by the overlay of the semi-transparent blue district shapefile and the purple zip code shapefile). I don't understand why this isn't working, it seems pretty simple to me, but am I missing something?     The data for this project is here if needed:   Both shapefiles are from the US Census and are projected in NAD83.   I tried selecting only the zip codes that would be in the district, checking the "use only selected features" box in the clip tool, and got the same results.


When running my code I get this error ("java.lang.NullPointerException: Attempt to invoke interface method") and I still can't figure why.  Here is my code:  @Override public void pointerReleased(int x, int y, int x2, int y2) {     bDrag=false;     selector.pointerReleased(x, y, x2, y2);     {         IDisplayTransformation dt=mapControl.getDisplay().getDisplayTransformation();          if (canMoveMap)         {             if (x>(dt.getDeviceFrame().getXMax()*0.9) || x<(dt.getDeviceFrame().getXMax()*0.1) ||                     y>(dt.getDeviceFrame().getYMax()*0.9) || y<(dt.getDeviceFrame().getYMax()*0.1))             {                 Point pt=new Point();                 dt.toMapPoint(x, y, pt);                 IEnvelope env=mapControl.getExtent();                 env.centerAt(pt);                 mapControl.refresh(env);                 return;             }         }           Point pt=new Point(selector.getX(),selector.getY());         Point result=new Point();         dt.toMapPoint(pt, result);         pts.add(result);         mapControl.repaint();     } }   Error message:  10-16 16:53:28.566 4185-4185/ E/MessageQueue-JNI: java.lang.NullPointerException: Attempt to invoke interface method 'void cn.creable.gridgis.display.IDisplayTransformation.toMapPoint(int, int, cn.creable.gridgis.geometry.IPoint)' on a null object reference 10-16 16:53:28.566 4185-4185/ E/MessageQueue-JNI:     at cn.creable.gridgis.controls.PanTool.pointerPressed(Unknown Source) 10-16 16:53:28.566 4185-4185/ E/MessageQueue-JNI:     at cn.creable.gridgis.controls.MapControl.pointerPressed(Unknown Source) 10-16 16:53:28.566 4185-4185/ E/MessageQueue-JNI:     at cn.creable.gridgis.controls.MapView.onTouchEvent(Unknown Source)

What are Null Pointer Exceptions (java.lang.NullPointerException) and what causes them?  What methods/tools can be used to determine the cause so that you stop the exception from causing the program to terminate prematurely?


I want to be clarified about the logic of MySQL Join. Is it true in the code, that the first two (Order and Customers) operate Join first, and then the result and the last(Shippers) operate Join?  SELECT Orders.OrderID, Customers.CustomerName, Shippers.ShipperName FROM Orders INNER JOIN Customers ON Orders.CustomerID = Customers.CustomerID INNER JOIN Shippers ON Orders.ShipperID = Shippers.ShipperID

I have the following query:  SELECT c.* FROM companies AS c JOIN users AS u USING(companyid) JOIN jobs AS j USING(userid) JOIN useraccounts AS us USING(userid) WHERE j.jobid = 123;   I have the following questions:   Is the USING syntax synonymous with ON syntax? Are these joins evaluated left to right?  In other words, does this query say: x = companies JOIN users; y = x JOIN jobs; z = y JOIN useraccounts; If the answer to question 2 is yes, is it safe to assume that the companies table has companyid, userid and jobid columns? I don't understand how the WHERE clause can be used to pick rows on the companies table when it is referring to the alias "j"   Any help would be appreciated!


I performed a distro upgrade via apt-get and upgrade-tool from saucy 13.10 to trusty 14.04.  It seemed to go OK and the "about" now tells me I am running 14.04, however uname -a says I am running kernel 3.11.0-18-generic.  Was the upgrade successful?  I had expected the kernel to change to 13.13, and in fact it looks like the headers in /usr/src are for 13.3.  The machine works OK, however I'm trying to install a new ATI graphics driver and it fails due to incorrect kernel headers (it wants the headers for 3.11.0-18).  I have tried to install the 3.11.0-18 headers but apt seems not to be able to find them.  Any help appreciated.

I just upgraded from 13.10 to 14.04, but when I do uname -r, it says I have kernel 3.11. I want to have the default 14.04 kernel, (3.13 I believe). How can I get this?


I am not a physicist but I've started studying the subject and noticed that terms like "random", "randomness", "randomly" are widely used when talking about nature. For example, random movement of atoms, random fluctuations, random path of an electron etc.  My question does not concern any of these examples themselves.   What I would like to know is whether physicists use the term "randomness":  A) Literally   That is, whether physicists believe that true randomness actually exists in nature: Do physicists believe that (in some cases) something that is in a certain state X, is so not due to some cause (or a collection of causes) that preceded it and caused it to be in that particular state X rather than in some other possible state Y. In other words do physicists believe that causality is not a rule.  or   B) Figuratively   Do physicists use the term "randomness" as simply a shorter way of saying:  "we know that there must be a trillion things that caused this state X rather than this other possible state Y, but because the number of things that constitute that cause is so great, we can never know it or grasp it in its whole as humans, so in those cases we'll call it 'random' for lack of a better word, but we don't actually mean 'random' in the literal sense of the word".  ?  EDIT: I want to know how the term is used by physicists, so that I may know how to proceed with the study of the subject. I'm not interested in opening a discussion about whether nature actually is (or not) non-deterministic sometimes.

I'm not sure if this is the right place to ask this question. I realise that this maybe a borderline philosophical question at this point in time, therefore feel free to close this question if you think that this is a duplicate or inappropriate for this forum. Anyway, I'm an electrical engineer and I have some basic knowledge of quantum mechanics. I know that Schrödinger's equation is deterministic. However, quantum mechanics is much deeper than that and I would like to learn more. If this question is not clearly answerable at this point than can anyone point out some recognized sources that try to answer this question. I would appreciate it if the source is scientific and more specifically, is related to quantum theory.


I have a very simple example of an instance for creating a IconGenerator and make it visible on the map.   The problem is that it gives me a NullPointerException each time it wants to create the IconGenerator iconita = new IconGenerator(getContext());  public class Controller { GoogleMap mMap; Context context; private static Controller instance;  private Controller() { }  public static Controller getInstance() {     if (instance == null) {         instance = new Controller();     }     return instance; }  public void setContext() {     this.context = context; }  public Context getContext() {     return context; }  public Map<String, List<Marker>> adaugaRuta(ShowTheRute theRoute) {     Map<String, List<Marker>> objectMap = new HashMap<>();      IconGenerator iconita = new IconGenerator(getContext()); <-- HERE it gives NullPointerException     iconita.setContentPadding(5, -5, 5, -5);     iconita.setRotation(-270);     iconita.setContentRotation(270);      Bitmap iconbit = iconita.makeIcon("Marker 1.");     final Marker mae = mMap.addMarker(new MarkerOptions().icon(BitmapDescriptorFactory.fromBitmap(iconbit)).position(new LatLng(46.762035, 23.597659)).anchor(0f, 0.5f));     mae.isVisible();      List<Marker> marker1 = new ArrayList<>();     marker1.add(mae);      objectMap.put("marker1", marker1);      theRoute.getTheRute(objectMap);     return objectMap; }   }


I came across to this: evaluate $$\prod_{k = 1}^{n} \frac {2k - 1} {2k}.$$  I brought it to a closed-form expression in asymptotics but I suspect my asymptotics is bad and I also want to see different solutions, hence the question.  My original solution: Write   $$\begin {eqnarray} \prod_{k = 1}^{n} \frac {2k - 1} {2k} & = & \exp \left (\sum_{k = 1}^{n} \log \left (1 - \frac {1} {2k}\right) \right) \nonumber \\ & = & \exp \left (- \sum_{k = 1}^{n} \sum_{m = 1}^{\infty} \frac {1} {(2k)^m m}\right). \end {eqnarray}$$  Let $$S = \sum_{m = 1}^{\infty} \frac {1} {(2k)^m m} \tag {1}.$$ Multiply both sides of $(1)$ by $2k$ to get $2k S < S + 1$, and by $4k$ to get $4kS > S + 2$. Hence, $$\frac {2} {4k - 1} < S < \frac {1} {2k - 1}.$$ Then, $$\frac {1} {2} \left( \log (4n - 1) - \log 3 \right) - 2 + O \left(\frac {1} {n^2}\right) < \sum_{k = 1}^{n} \sum_{m = 1}^{\infty} \frac {1} {(2k)^m m} < \frac {1} {2} \log (2n - 1) - 1 + O \left(\frac {1} {n^2}\right).$$ Hence, $$\sqrt {\frac {c} {2n - 1}} < \prod_{k = 1}^{n} \frac {2k - 1} {2k} < \sqrt {\frac {3 c^2} {4n - 1}},$$ where $c$ is a constant. Any better approach?

A simple method for evaluating a product is term cancellation. For example, the product  $$\begin{align*} \prod_{k=2}^{n}\left(1-\frac{1}{k}\right)&=\prod_{k=2}^{n}\left(\frac{k-1}{k}\right)\\ &=\frac{1}{2}\cdot\frac{2}{3}\cdot\frac{3}{4}\cdots\frac{n-1}{n} = \frac{1}{n} \end{align*}$$  is done via a telescoping argument. However, if we take a product that is just a bit more complicated, say  $$\prod_{k=1}^{n}\left(1 - \frac{1}{ak}\right)$$  for some $0,1 \neq a \in \mathbb{R}$, the argument immediately breaks down. I am interested in whether there exists a closed form solution for the general product given above.  This question is in part inspired by my attempt to prove the asymptotic bound .


I am trying to access the array value of a certain person property, but  instead it is giving me the index of the string person. How do I fix this  to get the desired output?  var Stats = {     person1: [17, 0],      person2: [15, 0],     person3: [10, 2],     person4: [7, 5],     person5: [5, 7]   };    for (var key in Stats) {   if(key === person4){     console.log(key); //Output "Person4" as expected     console.log(key[0]); //Output "P" when I expect/want 7   } }

How do I enumerate the properties of a JavaScript object?  I actually want to list all the defined variables and their values, but I've learned that defining a variable actually creates a property of the window object.


I can't figure out why my scene is still so noise after I optimized the scene / lighting settings.  I have the following settings:  1. Sampling:    I increased the Sample size to 2056 I'm clamping direct and indirect light at value 7.0     2. Lightpath:    Caustics are on. I use the preset Full Global Illumination Lowering the diffuse does not help the gain in the render.     3. Portals & Area Lights:    The windows have Portals on them. Each Portal also have an area lamp on them with a strength of 25 to create some more light. Multiple Importance is enabled.     4. Sunlamp:    The scene has an Sunlamp with a strenght of 250. Multiple Importance is enabled.     5. World Settings:    I have set the max bounces to 0. as suggested in this answer (  )     *Note: I don't use the denoiser because I'm rendering on a render farm that splits the render in parts. So the denoiser does not work. *  Update: Turning off caustics did not improve the render.  Question is: Can I reduce the noise in other ways then increase the sample size?

I know that this question is a bit old or maybe overdone, but I'm running the latest edition of Blender and when I use the Cycles engine I get really fuzzy results and I can't find a simple, non-compromising solution to the quality.  I don't know exactly what I'm doing wrong here, but I'm sure others share my frustration.  Leaving everything in default settings, I started a new project and switched to the Cycles render.  I duplicated the cube and set colors for two Diffuse BSDF shaders, then went ahead and made walls and a floor all sharing the same diffuse shader.  I made two windows to emit blue light.  The screenshot has gaps between the walls because of the setup:  I'm aware that it's considered very incomplete and many have come to terms with some amount of noise, but is this normal?  Furthermore, with default settings or not, I can't change the amount of noise produced.  Supposedly, using "progressively refine" in the rendering tab should make it refine itself indefinitely, however Cycles only counts to 10 refines and then stops, creating a render which is a pixel-perfect match of the ordinary rendering method when it's completed.  I understand that there are tricks that can be used to reduce noise, but at the cost of extra processing time and usually small quality conflicts, like blurring.  My question essentially boils down to is this Cycles' current limit?


I understand that the thing that allow a lightbulb to glow white high is the fast amount of resistance the electrons face with all the many spiral the filament has. But I need a thicker more resistant filament so is there another way to increase resistance?

I want to know, is there a way to make a tungsten lightbulbs filament withstand a mass amount of thermal shock while still producing a vast amount of heat?


How can I get hard disk capacity, usage, etc. using the /proc or /sys filesystems?  If it is possible, please tell me which file(s) I need to process to get that information.


our company decide to use sharepoint 2013 my site feature.  i should change the content of email body which automatically send to users.  for example there shouldn't be SharePoint word in this mail.  how can i change the content of email body. i couldn't find in resx file.    thanks for redirection. however i don't think so that i ask for this.  I don't want to change or make a new mail template. I want to change the content of mail body.  as i mention the first part, it should't be written a word like "SharePoint" on mail body. because my customer don't know what is "sharepoint".

There seems to be a widely popular blog post () about creating these. It's tailored to SharePoint 2007, but I've read through the entire article, and it makes sense. I've followed the directions, but the emails that come through don't contain any of my changes. I've also followed directions and code to change the alert template for a specific list (done through the object model). And after I make the changes, I can get to the list through the object model and verify that my changes are saved in the AlertTemplate property for the list - but the changes don't actually come through in the alert emails. And finally, I've tried adding a new NotificationHandlerAssembly to send out a completely custom email, but the custom code in my assembly doesn't get called and my email doesn't go out - with no errors present in the Logs.


$A$ is an $m\times n$ matrix and $B$ is an $n\times m$ matrix.  $$ \det(I_m + AB) = \det(I_n + BA) $$ Solution: I found this guys: $$ \det\begin{pmatrix}I&-B\\\\A&I\end{pmatrix} \det\begin{pmatrix}I&B\\\\0&I\end{pmatrix} =\det\begin{pmatrix}I&-B\\\\A&I\end{pmatrix}\begin{pmatrix}I&B\\\\0&I\end{pmatrix} =\det\begin{pmatrix}I&0\\\\A&AB+I\end{pmatrix} =\det(I+AB) $$  and  $$ \det\begin{pmatrix}I&B\\\\0&I\end{pmatrix} \det\begin{pmatrix}I&-B\\\\A&I\end{pmatrix} =\det\begin{pmatrix}I&B\\\\0&I\end{pmatrix} \begin{pmatrix}I&-B\\\\A&I\end{pmatrix} =\det\begin{pmatrix}I+BA&0\\\\A&I\end{pmatrix} =\det(I+BA) $$  Source:

First of all, am I being crazy in thinking that if $\lambda$ is an eigenvalue of $AB$, where $A$ and $B$ are both $N \times N$ matrices (not necessarily invertible), then $\lambda$ is also an eigenvalue of $BA$?  If it's not true, then under what conditions is it true or not true?  If it is true, can anyone point me to a citation?  I couldn't find it in a quick perusal of Horn & Johnson.  I have seen a couple proofs that the characteristic polynomial of $AB$ is equal to the characteristic polynomial of $BA$, but none with any citations.  A trivial proof would be OK, but a citation is better.


Let us take 3 doors A, B, C. Now, let us say car is in A. Now if player selects A, host opens B, on switching player loses. If player selects A, host opens C, on switching player loses. If player selects B, host opens C, on switching player wins. If player selects C, host opens B, on switching player wins. So 50% winning prob instead of 66%. Although when I use total prob theorem, I do end up getting 66%. Now, can somebody explain to me the reason why the above mentioned cases are not equally likely?

I was watching the movie 21 yesterday, and in the first 15 minutes or so the main character is in a classroom, being asked a "trick" question (in the sense that the teacher believes that he'll get the wrong answer) which revolves around theoretical probability.  The question goes a little something like this (I'm paraphrasing, but the numbers are all exact):  You're on a game show, and you're given three doors. Behind one of the doors is a brand new car, behind the other two are donkeys. With each door you have a $1/3$ chance of winning. Which door would you pick?  The character picks A, as the odds are all equally in his favor.  The teacher then opens door C, revealing a donkey to be behind there, and asks him if he would like to change his choice. At this point he also explains that most people change their choices out of fear; paranoia; emotion and such.  The character does change his answer to B, but because (according to the movie), the odds are now in favor of door B with a $1/3$ chance of winning if door A is picked and $2/3$ if door B is picked.  What I don't understand is how removing the final door increases the odds of winning if door B is picked only. Surely the split should be 50/50 now, as removal of the final door tells you nothing about the first two?  I assume that I'm wrong; as I'd really like to think that they wouldn't make a movie that's so mathematically incorrect, but I just can't seem to understand why this is the case.  So, if anyone could tell me whether I'm right; or if not explain why, I would be extremely grateful.


I just can't get my head wrapped around a certain step in a proof that the sequence that approaches $e$ is monotonically increasing. The proof starts as follows:  We want to show that: $x_{n+1} \geq x_n \iff \\ \big(1 + \frac{1}{n+1}\big)^{n+1} > \big(1 + \frac{1}{n}\big)^{n} \iff  \\ \big(\frac{(n+2)n}{(n+1)^2}\big)^n > \frac{n+1}{n+2} \iff ... \\ $  Now I have trouble understanding how we get from line 2 to line 3, anyone have a simple hint that can help me?  This question is not a duplicate because it asks for one certain step in an approach that is not covered in the linked question.

Show that $U_n:=\left(1+\dfrac{1}{n}\right)^n$, $n\in\Bbb N$, defines a monotonically increasing sequence.   I must show that $U_{n+1}-U_n\geq0$, i.e. $$\left(1+\dfrac{1}{n+1}\right)^{n+1}-\left(1+\dfrac{1}{n}\right)^n\geq0.$$  I am trying to go ahead of this step.


I want to make brown paper bags of popcorn kernels and flavouring to give as gifts, but i can't seen to get the popcorn flavouring to stick to the unpopped kernels.  How do companies that sell microwave popcorn make sure it's flavoured when it's popped in the microwave? I don't want to add anything after, just have it already flavoured when it's popped.

There are commercial flavored popcorn (i.e. BetterMade) that aren't topped with flavor but coated like a potato chip.  How do I re-create that coating at home?  Specifically, I'm a fan or the 'hot' style coating (bbq, buffalo chicken, jalapeno, flame).  I've tried oils, tossing in a bowl, spraying from a bottle, but no luck  - it's just regular popcorn with a little chili powder sticking to each kernel.


I want to know the difference between these two links to my site:   My site  is working as supposed.  (with www) is showing me a privacy error.

I have a server https://www.groups.example.com - in FireFox I get the "This Connection is Untrusted" message and the "technical details" say  www.groups.example.com uses an invalid security certificate.  The certificate is only valid for the following names:  *.example.com, example.com (Error code: ssl_error_bad_cert_domain)   What other info do I need to provide in order to resolve this? Just getting confirmation of setup but am 99% sure it's Linux and using VHOSTS. Will update question as soon as this is confirmed.  Is it the fact that www.groups.example.com is seen as having 2 levels of subdomains?  The issuer is DigiCert


Prove that $ \sum_{i=1}^{N} a_i \leq \sqrt{N \sum_{i=1}^{N}a_i^2}  $. Well i choose $u=(1,\ldots,1)$ and $v=(a_1,\ldots,a_N)$ whit $a_i$ positive and. Apply $u \circ v \leq |u||v|$. With this now i want to prove that $\sum_{i,j}^{N}\frac{\partial u}{\partial x_i}\frac{\partial v}{\partial x_j}\leq N |\nabla u||\nabla v|$. I know that I am very close , but if somebody can help me, i will aprecciate..thank you

Let $n$ be a natural number and $a_1,a_2,\ldots,a_n$ are real numbers. Then prove that  $|\sum_{i=1}^n a_i|\le  \sqrt{n\cdot \sum_{i=1}^n a_i^2}$.   At first I tried to prove for $n=2$ i.e, $|a_1+a_2|\le \sqrt{2(a_1^2+a_2^2)}$, but unable to proceed. Give me some hint to proceed.


I've tested this on several different methods. The string I compare s to is exactly the same as the one that shows up in the log file. The apostrophes are to make sure there's no spaces. Anyone know what's going on?  import java.lang.reflect.Method; import android.util.Log;  public class Button {     public Button () {         for(Method m1:MyOtherClass.class.getMethods()) {         String s = m1.getName();             if(s == "Update") {                 Log.i("result","true");             }             Log.i("test", "'" + s + "'");         }     } }

I've been using the == operator in my program to compare all my strings so far. However, I ran into a bug, changed one of them into .equals() instead, and it fixed the bug.  Is == bad? When should it and should it not be used? What's the difference?


I have some Blob() object. I want to upload somewhere else (a website that handle user upload through forms).  I can put them in a FormData and send them through an XMLHttpRequest object, but then I can't read the ajax response, because I'm blocked by the  of the ajax call.  How can I get around this? Is there some way to do a regular upload without using ajax? Is there a way to deal with that "same origin policy" that will work on recent versions of Chrome and Firefox?  edit: Not sure this is a duplicate: I don't control the server being posted, so I'm not OK with just "setting the same origin policy on both domains".

How do I send a cross-domain POST request via JavaScript?  Notes - it shouldn't refresh the page, and I need to grab and parse the response afterwards.


Is it okay to use my tablet while charging it? I just got a new tablet. I havn't done it cause I wasn't sure.

Will the following situation damage or cause any harm to the battery or/and the phone:   The phone is being charging (regardless it is using the electrical outlet or via USB) and .. You are playing a game while the phone is being charging and .. You will be playing the game for 5 hours or more.   In another word, if you will be playing a android game in a android phone for 5 hours or more while the android phone is being charging, will it cause any damage or harm to the android phone and/or the battery inside the android phone?


Would just like a sanity check.   I don't see the necessity of the locally path connected condition on $A$. The proof that $\tilde{A}$ is a covering space seems straightforward.  We use the path-connectedness of $A$ obviously to talk about a single $\pi_1$. For the other part, take $i$ as the inclusion map of $A$ in $X$.  If we have $[f]\in p_*(\pi_1(\tilde{A}))$, we have a homotopy to the constant map already since $\tilde{X}$ is simply connected, so $[f] \in \ker(i_*)$.  For any $[f] \in \ker(i_*)$, by Proposition 1.31 the image of $f$ in $X$ lifts to some loop $\tilde{f}$ in $\tilde{X}$ with basepoint in $\tilde{A}$.  Here the path connectedness of $\tilde{A}$ is useful.  Then $[p(\tilde{f})] = [f]$, so $[f] \in p_*(\pi_1(\tilde{A}))$.  And that should be it?

First of all, I apologize for asking yet another question about the hypotheses of a problem in Hatcher, but the statement of one of his problems has stumped me again.  The problem is 1.3.15.  It reads as follows:     Let $p:\widetilde{X}\rightarrow X$ be a simply-connected covering space of $X$ and let $A\subseteq X$ be a path-connected, locally path-connected subspace, with $\widetilde{A}$ a path-component of $p^{-1}(A)$.  Show that $p:\widetilde{A}\rightarrow A$ is the covering space corresponding to the kernel of the map $\pi _1(A)\rightarrow \pi _1(X)$.   My question is:  why do we need to assume that $A$ is path-connected and locally path-connected?  Here is a sketch of the "proof" I have that does not make use of these hypotheses:  If we have a loop in $\widetilde{A}$, this loop is nulhomotopic in $\widetilde{X}$, and hence will be nulhomotpic when mapped down to $X$ via $p$.  On the other hand, if you go the other way and first map the loop in $\widetilde{A}$ down to $A$ via $p$, and then include this loop into $X$, by commutativity of the corresponding diagram I can't draw here, you get the same loop as the first way, which is a nulhomtopic loop.  This shows that $\pi _1[p]\left( \pi _1\left[ \widetilde{A}\right] \right)$ is contained in the kernel of the inclusion.  Convserly, if we have a loop in $A$ that is nulhomotpic in $X$, we can lift this to a loop in $\widetilde{X}$, and hence we can choose such a lift that is contained in $A'$.  Pushing this lift down via $p$, shows that the containment is actually equality.  Any idea where this proof goes wrong?  Thanks in advance!


Let $B$ be a Banach space where the dimension of the underlying vector space is countable. using the Baire category Theorem, prove that the dimension of the underlying vector space is, in fact, finite.  Can you give me how I should approach this problem? Thanks  I have checked the answer of "." However, It seems they prove that Hamel basis is uncountable, whereas My problem is proving the dimension of the underlying vector space is finite.

Let $X$ be an infinite dimensional Banach space. Prove that every basis of $X$ is uncountable.  Can anyone help how can I solve the above problem?


I am new to Python and have a problem with Negative Slicing step. So can anyone explain me Negative Slicing Step and my question is why the below code behaving like this, var1='1a2b3c4d5e6f7g8h9i' print('1st result',var1[-2:-10:-1]) #Get output print('2nd result',var1[-2:-10:1])  #No Output print('3rd result',var1[2:10:-1])   #No Output

I need a good explanation (references are a plus) on Python's slice notation.   To me, this notation needs a bit of picking up.   It looks extremely powerful, but I haven't quite got my head around it.


My friend needs a proper TeX editor for Windows and I think TeXPad OSx is by far the best. Is there anything like this for Windows 7?

What editors/IDEs are available for easing the process of writing TeX/LaTeX documents? Please state some useful features like code completion, spell checking, building final DVI or PDF files, etc.  This question is undergoing a systematic refurbishment, see  on Meta. If you’d like to see another editor feature covered here or to take care of an editor that’s not covered yet, share your ideas in that meta question.  List of editors Links to answers.


I am a new user of Ubuntu. By mistake changed the /var folder permission using chmod -R 777 /var  and I  can not use sudo command now.  Thanks

I accidently ran  sudo chmod 755 -R /   instead of  sudo chmod 755 -R ./   I stopped it after few seconds, but now there is some problems such as  sudo: must be setuid root   How can I revert permissions back?


Every simply connected, closed 3-manifold is homeomorphic to the 3-sphere.  The above is a statement of  Poincaré's conjecture. But can I generalize this in the following way?  If $\forall~n\in\mathbb{Z}\cap\left[2,\infty\right),$ every simply connected, closed n-manifold is homeomorphic to the n-sphere  Maybe I should actually take a class or something in topology?

In 2 or 3 dimensions, every closed simply connected manifold is a sphere.  In the smooth category, I suppose you could take exotic smooth structures to give examples of closed simply connected manifolds which aren't spheres, but this doesn't really give a ton of insight for me. What about in the topological category? Is there an easy example here?


I have a search box that limits options available in a dropdown menu on keyup. I'm having an issue with case sensitivity - how can I modify this function to ensure my option contains upper or lower case versions of the character typed?  Fiddle:  Notice how the results differ between 'i' and 'I'    $(document).on('keyup', '#condition-search', function(e) {   var str = $('#condition option:contains(' + $(this).val() + ')');   if (str) {     $('#condition option').hide();     str.show();   } else {     $('#condition option').show();   } }); <script src="https://ajax.googleapis.com/ajax/libs/jquery/2.1.1/jquery.min.js"></script> <input type="text" class="form-control" id="condition-search"> <select class="form-control" id="condition" size="15" style="overflow-y: scroll" ;>         <option class="cat-1">Item1</option>         <option class="cat-2">item2</option>         <option class="cat-3">Item3</option>         <option class="cat-4">item4</option>         <option class="cat-5">Item5</option>     </select>

Is there a case insensitive version of the  jQuery selector or should I do the work manually by looping over all elements and comparing their .text() to my string?


I'm planning on switching to Kubuntu once 17.04 lands (from standard Ubuntu Unity).  Right now, I'm torn between clean install or just do apt install kubuntu-desktop.  What can I expect if I decide to do apt install kubuntu-desktop, aside from the obvious (i.e. redundant apps)?  Which one do you recommend?  Will there be weird quirks?

I am using Ubuntu 12.04. I want to try out KDE and other desktop environments.   But I'm not sure if I'll like them enough to switch permanently. I want to be safe and make a transition in a piecemeal fashion.  Is it possible to install KDE on Ubuntu and yet not do away with the default Unity shell?  Could I install multiple desktop environments and switch between them by tweaking some startup configuration and then rebooting?


Rudin has a proof in which he is proving that $A=\{ p \in \mathbb{Q}\;|\; p^2<2\}$ has no maximum element (or in other words, an element which is greater than every other element).  For this he creates a rational $q=p-\dfrac{p^2-2}{p+2}$ and uses this rational $q$ to show that it is greater than $p$ and still in $A$. Since $p$ was arbitrary element of $A$, this finishes the proof.   I follow the proof but I don't understand where the formula for $q$ magically came from. Any help?

First, my apologies if this has already been asked/answered.  I wasn't able to find this question via search.  My question comes from Rudin's "Principles of Mathematical Analysis," or "Baby Rudin," Ch 1, Example 1.1 on p. 2.  In the second version of the proof, showing that sets A and B do not have greatest or lowest elements respectively, he presents a seemingly arbitrary assignment of a number $q$ that satisfies equations (3) and (4), plus other conditions needed to show that $q$ is the right number for the proof.  As an exercise, I tried to derive his choice of $q$ so that I may learn more about the problem.  If we write equations (3) as $q = p - (p^2 - 2)x$, we can write (4) as   $$ q^2 - 2 = (p^2 - 2)[1 - 2px + (p^2 - 2)x^2]. $$  Here, we need a rational $x > 0$, chosen such that the expression in $[...]$ is positive.  Using the quadratic formula and the sign of $(p^2 - 2)$, it can be shown that we need   $$ x \in \left(0, \frac{1}{p + \sqrt{2}}\right) \mbox{ for } p \in A, $$  or, for $p \in B$, $x < 1/\left(p + \sqrt{2}\right)$ or $x > 1/\left(p - \sqrt{2}\right)$.  Notice that there are MANY solutions to these equations! The easiest to see, perhaps, is letting $x = 1/(p + n)$ for $n \geq 2$.  Notice that Rudin chooses $n = 2$ for his answer, but it checks out easily for other $n$.  The Question:  Why does Rudin choose $x = 1/(p + 2)$ specifically?  Is it just to make the expressions work out clearly algebraically?  Why doesn't he comment on his particular choice or the nature of the set of solutions that will work for the proof?  Is there a simpler derivation for the number $q$ that I am missing?


Mathematician A asks Mathematician B to guess the age of his three sons. Mathematician A starts off by giving Mathematician B two clues. The two clues are:   The product of their ages is 72. When you add the ages of the sons, it will be the same as the number of apples on his his apple tree.   After these two clues, Mathematician B  claims that it is impossible to find the ages. And so, Mathematician A gives yet one more clue.   The eldest son loves to play basketball.   After this clue, Mathematician B claims that he has found the ages of the sons.  How old are Mathematician A's sons?

Two old friends, Jack and Bill, meet after a long time. Jack: Hey, how are you man? Bill: Not bad, got married and I have three kids now. Jack: That’s awesome. How old are they? Bill: The product of their ages is 72 and the sum of their ages is the same as your birth date. Jack: Cool… But I still don’t know. Bill: My eldest kid just started taking piano lessons. Jack: Oh now I get it.  How old are Bill’s kids?  I am not able to figure out how Jack get it when Bill says "My eldest kid just started taking piano lessons"?


testl   %esi, %esi jle .L7   I mean I understand that test actually ANDs the operands, but what is it doing in this case here?

I am trying to understand some assembly.  The assembly as follows, I am interested in the testl line:  000319df  8b4508        movl   0x08(%ebp), %eax   000319e2  8b4004        movl   0x04(%eax), %eax   000319e5  85c0          testl  %eax, %eax   000319e7  7407          je     0x000319f0     I am trying to understand that point of testl between %eax and %eax? I think the specifics of what this code isn't important, I am just trying to understand the test with itself - wouldn't the value always be true?


This guy  says space is not empty..  It explains how space inside nucleus is Full of fields. Does it mean to say gluons are present everywhere, even outside nucleus?  Consider a region without any dust or photon.

Added: 5 times down vote for now! Down voter is this religion or physics, please try to explain your decision.  I'm confused about this.  In physics we know for a , but I think that there is a contradiction in this term. The  are the phenomena that  contradicts the vacuum existence because, according to them, the vacuum isn't the empty space.  In vacuum the creation of particle-antiparticle pairs is allowed for small times and this is also proven in practice.  From the other side, the relativistic theory says about space-time that interactions like gravitation bend the vacuum (empty space). There seems to be a contradiction to me. If vacuum is an empty space then we can't bend it, because we can't bend something nonexistent. In other words: we can't bend 'nothing'.  Can empty space really exist in physics?  EDIT1: quote: Luboš Motl     "By definition, the space without   energy is the space whose total value   of energy is equal to 0."   But this space is nonexistent, so it is abstract and should exist only in our mind... Why is so? My second statement of this post says that in physics we cant bend nothing because such a bending is only thinking and not physics!  Another possibility is that space is unknown kind of energy, but this is contradiction in modern physics!  EDIT2:  Can any physics believe that nothing exists? By mathematical logic no! And mathematic is elementary tool in physics. Anything other than that is religion!  Nothing (empty space without energy) is only a logical state!  EDIT3: quote: Roy Simpson:     The General Relativity Vacuum is a   space-time model region without   matter.   and Luboš Motl says: "By definition, the space without energy is the space whose total value of energy is equal to 0."  Agree...   But this is only mathematical Euclidean space + time so this is only a mathematic and not physics! With other words: this is only a method of mathematical mapping. But, in real (not theoretic) physics we can't mapping empty things. Empty is only a logical state!  EDIT4:   Roy Simpsons argumentation seems to me acceptable.   quote: Roy Simpson:     Einstein struggled with this too, and   the problem has come to be known as   the "Hole argument" within GR. You   have to decide whether you are just   interested in GR's vacuum (empty   space) or the full physical vacuum   which includes quantum aspects as   well.   Thanks


I have a small problem with one of my USB hubs. It is a personal hub that I use for multiple computer/android-based (chromium/androids) devices that is used to serve as a hub for several devices like mic headsets, usb mouse, usb keyboard, and the occassional flashdrive. My problem is that I constantly have to unplug it and replug it back into the device I want to use it with.  Like for example, I have a PC in which I write all of my programs, and play video games, and I have an Android Tablet, where I keep all of my personal stuff. I have an adapter that allows me to plug regular USB 2.0 stuff into the android's microusb port including a usb hub. Now, I don't want to use a separate keyboard, mouse, and headset for each device, if both devices are in the same workstation area. So, my question is there some sort of "USB switch" I could use? A switch that connects both of my "workstation" devices to a single USB hub, and has some sort of button that all I have to do is press it to change what device the hub "belongs" to instead of unplugging and replugging in the hub?

Background  I am looking to switch my keyboard and mouse between a desktop computer and a laptop. The desktop resolution is , which eliminates most (but ) KVM switches. The monitor has the ability to switch between desktop and laptop. Both computers are plugged into the monitor. The audio is also not an issue for switching.  Problem  All KVM switches I have found come with cables that have  for audio, video, and USB. In this case, the audio and video connectors are superfluous. I could leave them disconnected, but then there'd be dangling bits of hardware (that a cat or infant could lick or bite). Also, I find the aesthetics of extraneous dangling bits to be displeasing. ;-)  The search results for USB KM switches are overrun by KVM switches, making it difficult to search for this particular hardware device.  Constraints  Hardware solutions only.  Questions  I am wondering:   What are such keyboard-mouse (KM) USB switches called? How would you eliminate the superfluous A/V connectors? Optionally, what components would be required to build such a switching device?   I contacted a 2-port USB  and they recommended that I use the KVM cables that comes with the switch--as opposed to substituting a regular USB cable.  Update  The device I have in mind would be similar to a . I could use a USB Hub plugged into the Share Switch, but that's two devices when only one should be necessary.


A short story from an anthology, read in 1980's but it wasn't a new book.  I can only remember one story, this man offended a witch doctor in a jungle village.  From then on tiny little hairy black bumps started growing out of him at nights and he decided to lop them off with a cut throat razor in every morning.  He had to do slow turns in front of a mirror to find them. I think (unsure!) that he overslept one day and saw they were actually little African people's heads.   They (again unsure) proceeded to grow out of him as the day went on... I can't recall the outcome, a vague memory that they then all advanced towards him as he cowered in the corner... maybe!

I have a recollection of reading this particular horror story as a young teen (circa 1993?), but cannot now find it. It was written in a style reminiscent of Edgar Allan Poe’s. (I have browsed the latter’s tales to no avail, however.) Here follows the story as I remember it. Thanks in advance to anyone who can point me in the right direction.  (The setting might be the 19th century.) A man travels (possibly to India or South America) to meet a friend (probably an archaeologist or explorer) who wrote to ask him to come since he has fallen terribly ill. There, the main character finds his friend uncooperative and secretive. The sick man’s health fluctuates, and his bouts of illness correlate with large lumps appearing on his skin.  One night, the puzzled protagonist decides to spy on his friend, and sees him cutting open one of his cysts with a knife. An imp-like creature emerges from the wound and addresses the feverish man. I do not remember its exact words; they seemed to imply that the infected fellow had a duty to perform should he wish to be rid of this curse. It left me with the general impression that he had to return an artifact or restore something to its earlier condition, but that this task was impossible, dooming him to a (hopefully short) life of torment borne of his own flesh.  I believe the story ends at this point, or maybe shortly afterwards as the onlooking character reels in horror and flees.


Google calendar messages (meeting invites and updates, not meeting reminders) have the header  mailed-by:  calendar-server.bounces.google.com   Alas, filtering by mailedby:calendar-server.bounces.google.com or mailed-by:calendar-server.bounces.google.com does not work.  How can I filter the Google Calendar messages?  At this time I am using   subject:("Invitation:" OR "Canceled Event:" OR "Declined:" OR "Accepted:")   but this does not include meeting updates because their subject sometimes starts with [Update] and Gmail filters cannot handle brackets (even with backslashes &c - believe me, I know regexps).

I'd like to create a Gmail filter to filter all of my Google Calendar notifications into a separate folder.  Google Calendar notifications have headers that look like the following:  Reply-To: Helen Seu <h...@g...com> Sender: Google Calendar <calendar-notification@google.com> Auto-Submitted: auto-generated Date: Thu, 01 May 2014 05:25:28 +0000 Subject: Updated Invitation: Mobile design review @  Fri May 9, 2014 3pm - 4pm From: Helen Seu <h..@g...com> To: "Mike Burton" <m...@g...com>,    In particular, the email Reply-To is the user who created the meeting, and the Sender is calendar-notification@google.com.  For some reason, Gmail does not seem to allow you to filter on the Sender field of an email. Is there another clever way to filter Google Calendar notifications to a separate folder?


In his book, Reverse Mathematics, John Stillwell says (pg. 44) "that each continuous function on R may be encoded by a set of natural numbers and hence the arithmetization project extends at least as far as the continuous functions. This remarkable result is due to Borel (1898), p. 109, and it follows that each continuous function may be encoded by a real number."  The referenced book by Borel is in French.  I can follow that a continuous function on R may be encoded by a set of natural numbers. But how does one go from that set to a real number specifically?  Of course I tried to search for this result on the innertube but, alas, I got nowhere. I'm not even sure what category in mathematics to start with to narrow the search down.  Also, given the real number, is it possible to reverse the encoding to get the continuous function back? Does every real number represent a continuous function? What book(s) are available to learn more about this intriguing result?

I have learnt that the cardinality of the power set of the natural numbers is equal to the cardinality of the real numbers. What is the function that gives the one-to-one correspondence between these two sets?  I have also learnt that there exists no set whose cardinality is strictly between the natural numbers and the real numbers. Is there a proof of this or at least some intuitiveness behind it?


$$\int_a^bf(x)dx=\int_a^b f(a+b-x) dx$$  Is anyone able to show me a rigorous proof of this identity. I understand using a substitution of $u=a-x$ gives rise to the RHS in terms of $u$ but don’t know how to show this implies that it’s also true for $x$?

This is the prove- $y=a+b-x$. Then $dy/dx=-1$ and thus $$\int_a^bf(a+b-x)dx= \int_b^a-f(y)dy = \int_a^bf(x)dx$$  But I dont understand the last part of this - Why ? $$\int_b^a-f(y)dy = \int_a^bf(x)dx$$  I know that $\int_b^a-f(y)dy = \int_a^bf(y)dy $. But something is not clear to me.


while true  do  echo "Enter the number"  read Num  while[$Num -lt 1 || $Num -gt 50]   do  echo "Please enter a new number "  read Num  done

I am using the below script to move two days back when script runs at starting two days of the year and also check first and second days of every month and move two days back. if [$month="01"] && [$day="01"]; then         date="$last_month/$yes_day/$last_year"         fulldate="$last_month/$yes_day/$last_year" else         if [$month="01"] && [$day="02"]; then                 date="$last_month/$yes_day/$last_year"                 fulldate="$last_month/$yes_day/$last_year"         else                 if [ $day = "01" ]; then                         date="$last_month/$yes_day/$year"                         fulldate="$year$last_month$yes_day"                 else                         if [ $day = "02" ]; then                                 date="$last_month/$yes_day/$year"                                 fulldate="$year$last_month$yes_day"                         else                                 date="$month/$yes_day/$year"                                 fulldate="$year$month$yes_day"                         fi                 fi         fi fi  But my bad am getting the below error message Etime_script.sh: line 19: [06=01]: command not found Etime_script.sh: line 24: [06=01]: command not found


We have a scenario where we are getting our news articles from database on runtime. So we are chnaging our meta tags and title of the news-article page via jquery.  Will this affect the crawling mechanism? Will the Google crawler read the dynamically created title and meta tags or not?

Does the Google spider knows how to render JavaScript, or only HTML?


I would like to convert a date from my filter to UTC time and then to seconds keeping the UTC time / not the local time. Examples: new Date()  // Wed Aug 19 2020 15:28:09 GMT+0200 (Central European Summer Time) moment.utc(new Date()).format()  // correctly outputs 2020-08-19T13:28:09Z - so -2h moment.utc(new Date()).format('X')  // unix timestamp 1597843870 - 19/08/2020, 15:31:10 Summer Time returns time plus 2h - not what I want moment.utc(new Date()).unix()  // again as above unix timestamp 1597843870 - 19/08/2020, 15:31:10 Summer Time returns time plus 2h - not what I want  So to summarize I need to convert the UTC formatted time to a number of seconds so it is (whenever converted with convertor the same number of seconds). Meaning this: moment.utc(new Date()).format() after conversion to seconds needs to be 1597843689 Is there any reasonable way how this could be done with a moment?

Something similar to Unix's timestamp, that is a single number that represents the current time and date. Either as a number or a string.


I'm trying to identify a short story, which was set on a world with extreme seasons.  In the story summer was so wildly extreme that at its peak the only habitable region on the world was the pole. As midsummer approached, the world's inhabitants sailed to the pole, where they took refuge in caves until midsummer was past.  I think that the population were the last descendants of the planet's original colonists, and had either no high technology left or very little, and just legends of how their ancestors had come to the world. I also think (but I'm not sure) that the story was told from the point of view of someone from off-world secretly studying the people.

I think I read this in Analog around 1980. A man in a pre-industrial type village believes that they originated on another world and keeps trying to persuade everybody of this. Nobody else agrees with this but they accept him as a harmless eccentric. Then one day he is visited by a stranger who tells him that he is absolutely correct - the village is a lost colony which has only recently been rediscovered, but the truth can't be revealed right away as they have to find the right way to break the news without causing panic. The stranger asks the man to stop trying to persuade people of his beliefs until the time is right, and the man agrees. At the end of the story it turns out that the stranger actually comes from another village on the far side of the mountains and was hired by the community leader to shut the man up.


Me either OR Me neither? MW Collegiate Dictionary says Me Either is correct.  Shouldn't it be "Me neither" in this example?   "I didn't like the movie."  "Me either."  Perhaps "either" is truly correct because the sentence equates to "I didn't either." "I didn't neither" would be incorrect because it's a double negative. Your thoughts? Should it be "Me either" or "Me neither" in that example?

In this circumstance, which would be the most correct / natural answer?     Person 1: I don't eat meat   Person 2: Neither do I / Nor do I / Me neither / Me either    says both "neither do I" and "Me neither" are often used. But I have also heard / read "me either" and "nor do I" in multiple scenarios. Which then is the correct way of saying it? Are the others wrong or just not used?


i got that when executing the code below: (the problem seems to be with the insert method but can't really figure it out) (i would appreciate if you point out the solution)**         public void writeBit(char bit) throws IOException{             b.insert(0, bit);             if(b.length()==8){                 a.write(Integer.parseInt(b.toString()));                 b.setLength(0);             }         }

What are Null Pointer Exceptions (java.lang.NullPointerException) and what causes them?  What methods/tools can be used to determine the cause so that you stop the exception from causing the program to terminate prematurely?


How do I use grep to search a nested directory structure for files containing all words in my search pattern?  I want to grep for files that contain multiple words - let’s use foo bar and bah. I can do grep -rl foo |xargs grep -rl bah| ...etc, but is there an easier way to do this? I know I can use -F for a file of strings to search for, but I believe this still searches for the strings using an OR operator (union), and I need to use the AND operator (intersection).

I would like to get the multi pattern match with implicit AND between patterns, i.e. equivalent to running several greps in a sequence:  grep pattern1 | grep pattern2 | ...   So how to convert it to something like?  grep pattern1 & pattern2 & pattern3   I would like to use single grep because I am building arguments dynamically, so everything has to fit in one string. Using filter is system feature, not grep, so it is not an argument for it.    Don't confuse this question with:  grep "pattern1\|pattern2\|..."   This is an OR multi pattern match.


For some reason this throws a PDOException.  $stmt = $db->prepare('DELETE FROM ?'); $stmt->execute([$table]);   The error I get is "General error: 1 near "?": syntax error". I echoed $table right before prepare and it shows an existing table name.  I initialized $db like this.   $db = new PDO("sqlite:my.db");  $db->setAttribute(PDO::ATTR_ERRMODE, PDO::ERRMODE_EXCEPTION);  $db->setAttribute(PDO::ATTR_EMULATE_PREPARES, 1);   I'm using PHP 5.4.4.

Why can't I pass the table name to a prepared PDO statement?  $stmt = $dbh->prepare('SELECT * FROM :table WHERE 1'); if ($stmt->execute(array(':table' => 'users'))) {     var_dump($stmt->fetchAll()); }   Is there another safe way to insert a table name into a SQL query? With safe, I mean that I don't want to do  $sql = "SELECT * FROM $table WHERE 1"


i  have questions in java ,as the below code "name" is a reference and "name" value changed during thread running, my question is why "name" doesn't print "hello,oscar" the  changed value?  public class MakeThread implements Runnable{     String name;     public  MakeThread(String name) {      this.name=name;     }     @Override     public void run() {     try {         System.out.println("i am going to sleep 10 sec");         TimeUnit.SECONDS.sleep(10);         System.out.println(Thread.currentThread().getName()+"name is:"+name);     } catch (InterruptedException e) {                   e.printStackTrace();     }        } }   public class TestRefer {         public static void main(String[] args) {     String name=new String("hello,world");     Runnable runnable=new MakeThread(name);      Thread thread2=new Thread(runnable);     thread2.start();     name= new String("hello, oscar");        System.out.println("TestRefer name " +name);     }   }   print results is :  TestRefer name:hello, oscar i am going to sleep 10 sec Thread-0 name is:hello,world

I always thought Java uses pass-by-reference. However, I've seen a couple of blog posts (for example, ) that claim that it isn't (the blog post says that Java uses pass-by-value). I don't think I understand the distinction they're making. What is the explanation?


I am only beginning to learn Java and my first project is a simple version of a sea battle. Currently when compiling my project i get the following problem:  Exception in thread "main" java.lang.NullPointerException     at SinkGame.PlaceDotComs(SinkGame.java:310)     at SinkGame.<init>(SinkGame.java:19)     at FirstVersion.main(FirstVersion.java:9)  Here are the relevant parts of the code: This is a part of SinkGame class  public class SinkGame  {    int gess_num;    DotCom dotcoms[];    Dot[] dots;    boolean gameover;         public SinkGame()    {        gess_num = 0;        gameover = false;        dotcoms = new DotCom[3];        dots = new Dot[49];         PlaceDotComs (); //Problem is here    } ...   PlaceDotComs method:  public void PlaceDotComs () {     boolean dotcom_set = false;     int dot_num = 0;      //Sets all the board dots coordinates     for (int i = 1; i < 8; i++)     {         for (int j = 1; j < 8; j++)         {                dots[dot_num].SetRow(i); // Problem is here             dots[dot_num].SetColumn(j);             dot_num ++;         }     }     //Sets dotcoms coordinates     for (int i = 0; i < 3; i++)     {         dotcom_set = false;         while (!dotcom_set)         {             dotcom_set = PlaceDotCom ((int)(Math.random()*GetActiveDotNumber()), i);             if (dotcom_set)                 ExcludeFilledDots();         }     } }   And my test class:  public class FirstVersion  {    public static void main (String[] args)    {        SinkGame new_game = new SinkGame(); //Problem here        new_game.Game();    }  }   As far as i know Null pointer exception appears when an object has been declared but not created. But in this example i have created an object in constructor: dots = New Dot[49] before calling PlaceDotComs function. Could you please explain me what the problem is and how to solve it? Thank you very much!


I have a file 50MB file hosted in my deticated linux server, each day there is almost 50K users that download this file (2.5GB a day).  There are lots of crashes and users reports that sometimes even the file can't be downloaded since the server is overload.  I wonder if someone can help me how do I calculate which server/bandwidth/anything I need to handle that?  Is there any solution where I can host the file and pay per download?  Is there any setting or anything that I can improve or do on my server that will help to fix this issue?  My current server specification is:  2 x Intel Xeon E5 2620V2 2 x (6 x 2.10 GHz) 128 GB REG ECC 256GB SSD HD 1 IP Address 1 Gbit/s port Shared Bandwidth   I'll appreciate any help from you guys.  Thank you very much.

This is a  about  Related:      I have a question regarding capacity planning. Can the Server Fault community please help with the following:   What kind of server do I need to handle some number of users? How many users can a server with some specifications handle? Will some server configuration be fast enough for my use case? I'm building a social networking site: what kind of hardware do I need? How much bandwidth do I need for some project? How much bandwidth will some number of users use in some application?


I understand that it is possible to analyse code and manually calculate the time complexity of an algorithm by hand and then determine the Big O notation. However I am curious if an algorithm exists to automatically compute this problem.

I wonder whether there is any automatic way of determining (at least roughly) the Big-O time complexity of a given function?  If I graphed an O(n) function vs. an O(n lg n) function I think I would be able to visually ascertain which is which; I'm thinking there must be some heuristic solution which enables this to be done automatically.  Any ideas?  Edit: I am happy to find a semi-automated solution, just wondering whether there is some way of avoiding doing a fully manual analysis.


Let $H$ and $K$ be normal subgroups of $G$ with a trivial intersection. $H \cap K = \{1\}$. Where $1$ is the unit. Show that $hk = kh$ for every $k \in K, h \in H$. Additionally, it asks if the statement still holds if only one of $K$ and $H$ is a normal subgroup.  Firstly, does $hk = kh$ for every $k \in K, h \in H$ mean $HK = KH$? It means that every element from $H$ commutes with every element from $K$. But does these two things tell the same thing?    What I did: Since $ H \triangleleft G$ Let $h \in H$ for every $g \in G: ghg^{-1} \in H$.  Similarly,  $k \in K \  \forall g \in G : gkg^{-1} \in K$    It is also true that $khk^{-1} \in H$ and $hkh^{-1} \in K$. So there exist such $h' \in H$ and $k' \in K$ that $khk^{-1} = h'$ and $hkh^{-1} = k'$.    $kh = h'k$ $hk = k'h$.      I do not know how to use that the intersection is trivial nor how to continue as I can't get anything out of this.

Let $H$ and $K$ be normal subgroups of a group $G$ such that they intersect trivially.  Why is it then the case that   $$hk=kh;\;\;\;\; \forall h\in H,\;\forall k\in K?$$


$$\lim_{n\to\infty}\left(\frac{1}{n}\sum_{i=0}^{n} \sqrt{\frac{i}{n}}\right)$$Any tips how to solve this problem, because clearly I have no idea how to approach it.

Need help computing: $\displaystyle\lim _{n\to\infty}\sum _{k=1}^{n}\frac{\sqrt{k}}{{n}^{\frac{3}{2}}}$  Now my intuition is that using Stolz-Cesaro  $\displaystyle\lim _{n\to\infty}\sum _{k=1}^n\frac{\sqrt{k}}{n^{\frac{3}{2}}}=\lim _{ n\to\infty}\frac{1}{n}\sum _{k=1}^n\sqrt{\frac{k}{n}}=1$  Is it correct or not?


I have a Windows Server 2008 R2 server which is hosting a public website. I recently deactivated "DNS Recursion" for security options trough the :  In the properties of my DNS server in the "Advanced" tab under server options I check the option: Disable recursion.  Now I have the problem, that DNS Names are not resolved locally. So I cannot open google.com or microsoft.com nor anything else.  Now I found out that I have to configure a split DNS configuration, such that I have:   One Zone which only answers lokal DNS queries and allows recursion One Zone which only answers external DNS queries and does not allow recursion.   My current setup looks like this:    I have a server named WIN-FOOBAR and a domain named foo.bar.com, so there are two entries _msdcs.foo.bar.com and foo.bar.com.  Now I have two questions:   If I disable recursion in the server options (e.g. in the parent node named WIN-FOOBAR), then how can I have two zones where one allows recursion and one that does not? The Forward-Lookupzone entry is a child node of WIN-FOOBAR. But I did not see an option to disable recursion for individual zones. How should I name the second zone, which is used internally? The current zone is foo.bar.com, can I create a second zone and also name it foo.bar.com as well or must it be named differently? If I name it for example foo.local, can it still resolve queries to foo.bar.com?

This is a  about Active Directory domain naming.   After experimenting with Windows domains and domain controllers in a virtual environment, I've realized that having an active directory domain named identically to a DNS domain is bad idea (Meaning that having example.com as an Active Directory name is no good when we have the example.com domain name registered for use as our website).   , but I'm still not sure about what other rules there are around naming Active Directory domains.  Are there any best practices on what an Active Directory name should or shouldn't be?


I just installed Windows 7 along with Ubuntu 13.04. I have all my software dump in my Ubuntu partitions which I want to install in Windows 7. How can I access the Ubuntu partition so that I can copy my software files in Windows 7? I can't even see partition of Ubuntu.

I have two questions on ext4:   Is there currently a way to mount an ext4 partition in Windows (XP/Vista/7) to get basic read support? If not, are there any plans to support this someday?


I have done some animations on my Mac pro using blender 2.72. However, my laptop has not GPU. So, I am using an other linux pc to do the rendering using blender 2.71. Unfortunately, the animation does not work as expected on linux machine. I remark that the armature animation is the same and work as on my Laptop, but the clothes and body does not follow the animation. What is the problem and How can I fix it ?

I just upgraded from Blender 2.69 to 2.71. I loaded my previous save file and found, to my dismay, that my pose no longer displayed properly. I'm using Makehuman version 1.0.0. It appears that FK still functions as expected, but IK does not. IK hand and foot targets do not affect arm and leg placement. The root bone appeared to work.  Any ideas how I can (preferably) revive my save files with the new version? Alternatively, is there a way I can export the pose from 2.69, save in the neutral position, then re-import the pose in 2.71? I don't see any export options for poses in 2.69.


I once read a manga about this isekai (?). From what I remembered, the MC was so mistreated had some kind of cursed or poisonous body, where nobody can touch him. This dungeon or kind of gate where he is in will grant them a wish if they completed it. I also remember that he follows a journal by this one adventurer. Whenever he reaches somewhere, this adventurer leaves his journal. The MC follows and enjoys it. There is also this Japanese girl that lives in the dungeon and is crazy strong. I remember one of the arcs where he visits a village of adventurers that can't pass to the next stage. These adventurers actually kill passing adventurers and eat them. But when they eat the MC's body parts, they all die since he has the poisonous/cursed body. In the end, the MC finished the dungeon and becomes an assassin of some sort. I love the dark theme behind this manga and also the ending is satisfying, at least to me.

A manga where a guy, his childhood best friend and (I think) three other guys get transferred to another world. And the MC has 10 skill slots. The three other guys bullied him back on Earth. When he got transferred over, him and his childhood friend (it's a girl) both got 10 skill slots that they can fill up by people or monsters dying and them dropping their skill cards. His girl best friend betrayed him to survive by siding with one of the bullies. The MC got pushed into a dungeon where time goes like 500 times slower.


There's this man I met in facebook, saying that he will give me money. He's sending pictures of his house, garden, relatives. How do I know if this is a scam? He said he lives in Kiama, Australia.

I received the below email. Is is a scam or not a scam?     Attention: Mohamed Atef,      May the peace of the Lord be with you.      Yes He left an ATM/VISA CARD with me before he traveled out of the   country, He ask me to send it to you, but do not know how to convert a   card to money when he did not give me the pin code due to security   reasons. He said that as soon as you confirm that you have received   the ATM CARD that his bank will give me the code so that I will send   it to you for onward withdrawal of your money.      I will need your full name, address and telephone number, to enable me   gives it to courier Service Company so that they will deliver it to   you.      I will be waiting for you to send to me your full address.      God bless, Rev. James Koko


So I recently installed Ubuntu onto one of my Computers and would like to uses it to scan external drives USB and what not for viruses that can affect windows PC. Is there a possible antivirus or antimalware detection tool i can use on Ubuntu to look for Viruses/Malware that can affect windows or MacOS computers?

I installed  via Terminal (Ctrl+Alt+T) with:  sudo apt-get install clamav   but how can I scan for viruses?


Can connection pooling be used only in multi-threaded or multi-process applications?   Is it possible to make use of connection pooling in web application implemented using PHP and MySQL?  If yes, please provide an example of such an application.

Is it possible to cache database connections when using PHP like you would in a J2EE container?  If so, how?


I have function like this (got it form some website long ago):  function flv2mp3() {     ffmpeg -y -i "$1" -acodec libmp3lame "$(echo -n "$1" | sed -e 's/\.[^\.]*$//').mp3" }   and I'm trying to call that function in loop:  find . -name 'Rage*' -not -name '*.mp3' -print0 | \ while read -d '' -r file; do    flv2mp3 "$file"; done   but got wierd result, it seems that it's after first invocation I 've got something like this:  stream #1:   keyframe=1   duration=0.023   dts=94.923  pts=94.923   size=388 stream #1:   keyframe=1   duration=0.023   dts=94.946  pts=94.946   size=381  Enter command: <target>|all <time>|-1 <command>[ <argument>]   and it waiting for input, what's going on? I can call flv2mp3 function without the loop just fine and it covert video to mp3.  I've also tried to put this:  flv2mp3 "$(echo -n $file | sed 's%./%%')"   because the files have ./ at the beginning but got the same results.

I have a bash script looping through the results of a find and performing an ffmpeg encoding of some FLV files. Whilst the script is running the ffmpeg output seems to be interupted and is outputting some strange looking errors like the one below. I've no idea what is going on here. Can anyone point me in the right direction?  It's as though the loop is still running when it shouldn't be and interupting the ffmpeg process.  The specific error is:  frame=   68 fps= 67 q=28.0 00000000000000000000000000001000size=      22kB time=00:00:00.50 bitrate= 363.2kbits/s dup=1 drop=0     Enter command: <target> <time> <command>[ <argument>] Parse error, at least 3 arguments were expected, only 1 given in string 'om/pt_br/nx/R3T4N2_HD3D_demoCheckedOut.flv'   Some more details from the ffmpeg output:  [buffer @ 0xa30e1e0] w:800 h:600 pixfmt:yuv420p tb:1/1000000 sar:0/1 sws_param:flags=2 [libx264 @ 0xa333240] using cpu capabilities: MMX2 SSE2Fast SSSE3 FastShuffle SSE4.1 Cache64 [libx264 @ 0xa333240] profile High, level 3.1 [libx264 @ 0xa333240] 264 - core 122 r2184 5c85e0a - H.264/MPEG-4 AVC codec - Copyleft 2003-2012 - http://www.videolan.org/x264.html - options: cabac=1 ref=5 deblock=1:0:0 analyse=0x3:0x113 me=umh subme=8 psy=1 psy_rd=1.00:0.00 mixed_ref=1 me_range=16 chroma_me=1 trellis=1 8x8dct=1 cqm=0 deadzone=21,11 fast_pskip=1 chroma_qp_offset=-2 threads=1 sliced_threads=0 nr=0 decimate=1 interlaced=0 bluray_compat=0 constrained_intra=0 bframes=3 b_pyramid=2 b_adapt=2 b_bias=0 direct=3 weightb=1 open_gop=0 weightp=2 keyint=250 keyint_min=25 scenecut=40 intra_refresh=0 rc_lookahead=50 rc=cbr mbtree=1 bitrate=500 ratetol=1.0 qcomp=0.60 qpmin=0 qpmax=69 qpstep=4 vbv_maxrate=500 vbv_bufsize=1000 nal_hrd=none ip_ratio=1.40 aq=1:1.00 Output #0, mp4, to './mp4s/pt_br/teamcenter/tc8_interactive/videos/8_SRM_EN.mp4':   Metadata:     audiodelay      : 0     canSeekToEnd    : true     encoder         : Lavf54.3.100     Stream #0:0: Video: h264 (![0][0][0] / 0x0021), yuv420p, 800x600, q=-1--1, 500 kb/s, 30k tbn, 29.97 tbc     Stream #0:1: Audio: aac (@[0][0][0] / 0x0040), 44100 Hz, mono, s16, 128 kb/s Stream mapping:   Stream #0:1 -> #0:0 (vp6f -> libx264)   Stream #0:0 -> #0:1 (mp3 -> libfaac) Press [q] to stop, [?] for help error parsing debug value0 00000000000000000000000000000000size=      13kB time=00:00:00.-3 bitrate=-3165.5kbits/s dup=1 drop=0     debug=0 frame=   68 fps= 67 q=28.0 00000000000000000000000000001000size=      22kB time=00:00:00.50 bitrate= 363.2kbits/s dup=1 drop=0     Enter command: <target> <time> <command>[ <argument>] Parse error, at least 3 arguments were expected, only 1 given in string 'om/pt_br/nx/R3T4N2_HD3D_demoCheckedOut.flv'   The script is as follows  #!/bin/bash LOGFILE=encodemp4ize.log echo '' > $LOGFILE STARTTIME=date echo "Started at `$STARTTIME`" >> $LOGFILE rsync -avz flvs/ mp4s/ --exclude '*.flv' #find flvs/ -name "*.flv" > flv-files # The loop find flvs/ -name "*.flv" | while read f do FILENAME=`echo $f | sed 's#flvs/##'` MP4FILENAME=`echo $FILENAME | sed 's#.flv#.mp4#'` ffmpeg -i "$f" -vcodec libx264 -vprofile high -preset slow -b:v 500k -maxrate 500k -bufsize 1000k -threads 0 -acodec libfaac -ab 128k "./mp4s/$MP4FILENAME" echo "$f MP4 done" >> $LOGFILE done


An Earthman who completed a course of study on an alien planet was given the ability to make worlds, which involved going through a ritual and being assigned a god of their pantheon.  The ability to create worlds is dependent on his connection to this god.    When the book starts, he has been residing on his own planet for a while, either taking a break from or retired from worldmaking.  [Creating custom planets pays very well.]  He receives a notice from the aliens who gave him the ability to create worlds.  Someone of his race -- he is the only Earthman to receive the gift of world creation -- has illegally gone through the ritual that gave him his power.  The god this person was given is the sworn adversary of his god.  Think of this as a god's version of a Holmes-Moriarty competition.  To protect the worlds he has created, he reluctantly leaves his planet and searches for his god's adversary who, as it turns out, is also his Earthly rival.  My memory insists the author was Roger Zelazny but I am not certain of that.

I read this at least 20 years ago, and I believe it was originally published in the '60s.   The main character is a human, but somehow "inherits godhood" from an alien, whose species is very long lived. IIRC this is one of the old-style god thingies, i.e. "god of thunder" not "omniscient omnipotent omnipresent transcendent being".  The plot somehow revolved around identifying and fighting some enemy which, I believe, was in turn a member of the alien species who acted as the avatar of the opposite god in the alien pantheon.  The only thing I remember for sure is that the enemy was identified as "green green" or "gringrin" (sadly, I read this in translation so I am not sure what the original meant)


I have an unlocked North American (Canada) iPhone 5s, where can I buy a data only SIM card in Japan ? I'm not interested in renting nor in a voice plan, I'll be staying for 4 weeks.  I'll be landing in Tokyo, so preferably around there. Can I get them from the airport somewhere ? I'm assuming I won't have problems with the network/frequencies, am I correct ?

Next month I am traveling to country X, where I would need Y minutes of calls, Z text messages and most importantly Q megabytes of data. How can I find the cheapest/most reliable SIM card for my needs?


I have a website and a person is trying to traverse the directories. All the website is secure and he cannot exploit any hole. However, as he is trying to traverse the directories, he sends 200 requests per seconds. This causes to shut down our server or slow downs to death. How can I block or protect against it?  I am using Php, Apache and MySql. I also use .htaccess file.  Update  I have a shared hosting so I do not have access to apache to install any plugin/mode. Other similar questions on SO are for the developers with access of apache server.

What techniques and/or modules are available to implement robust rate limiting (requests|bytes/ip/unit time) in apache?


I have php search using pdo method. But results doesn't show correctly in my application. My language is Persian and i think reason is utf8 and that should be in my pdo. Anyone can help?  if (isset($_POST['searchQuery'])) {      require_once('config.inc.php');      $search_query = $_POST['searchQuery'];     $sql = 'SELECT * from nmh where MATCH(company,name,family) AGAINST(:search_query)';     $statement = $connection->prepare($sql);     $statement->bindParam(':search_query', $search_query, PDO::PARAM_STR);     $statement->execute();     if ($statement->rowCount()) {         $row_all = $statement->fetchall(PDO::FETCH_ASSOC);         header('Content-type: application/json');         echo json_encode($row_all);     } elseif (!$statement->rowCount()) {         echo "no rows";     } }

I'm setting up a new server and want to support UTF-8 fully in my web application. I have tried this in the past on existing servers and always seem to end up having to fall back to ISO-8859-1.  Where exactly do I need to set the encoding/charsets? I'm aware that I need to configure Apache, MySQL, and PHP to do this — is there some standard checklist I can follow, or perhaps troubleshoot where the mismatches occur?  This is for a new Linux server, running MySQL 5, PHP, 5 and Apache 2.


is Java works based on Call by reference or call by value make me confusion?   class Point  {      int x, y;      public Point(int x, int y) {         this.x = x;         this.y = y;     } }  public class demo {      public static void tricky(Point arg1, Point arg2)   {         Point temp = arg1;         arg1 = arg2;         arg2 = temp;     }      public static void tricky(Point arg1, Point arg2)  {         arg1.x = 100;         arg1.y = 100;     }      public static void main(String [] args)  {          Point pnt1 = new Point(0,0);         Point pnt2 = new Point(0,0);         System.out.println("X: " + pnt1.x + " Y: " +pnt1.y);         System.out.println("X: " + pnt2.x + " Y: " +pnt2.y);         tricky(pnt1,pnt2);         System.out.println("X: " + pnt1.x + " Y:" + pnt1.y);         System.out.println("X: " + pnt2.x + " Y: " +pnt2.y);         tricky1(pnt1,pnt2);         System.out.println("X: " + pnt1.x + " Y:" + pnt1.y);         System.out.println("X: " + pnt2.x + " Y: " +pnt2.y);     } }     I'm confused after first method(tricky) got executed i got expected result, but not after second method(tricky).

I always thought Java uses pass-by-reference. However, I've seen a couple of blog posts (for example, ) that claim that it isn't (the blog post says that Java uses pass-by-value). I don't think I understand the distinction they're making. What is the explanation?


How to find the value of $\lim_{n\to\infty}S(n)$, where $S(n)$ is given by $$S(n)=\displaystyle\sum_{k=1}^{n} \dfrac{k}{n^2+k^2}$$   is unable to calculate it.  This is a question from a questions booklet, and the options for the answer are--  $\begin{align} &A) \dfrac{\pi}{2} \\ &B) \log 2 \\ &C) \dfrac{\pi}{4} \\ &D) \dfrac{1}{2} \log 2 \end{align}$

How to compute this limit:  $$\lim_{n\to\infty}\left(\frac{n}{n^2+1^2}+\frac{n}{n^2+2^2}+\cdots+\frac{n}{n^2+n^2}\right)$$  Please give me some hint.


I just got a new laptop (a Gigabyte P15 with FreeDos pre-installed) but I want to install Ubuntu (16.04).  I prepared my USB key with Rufus and the Ubuntu 16.04 .iso. It went well.  Now, I boot on the USB from the new laptop and get stuck with the Ubuntu logo (and the little dots under it). Nothing else happens. For hours. (I tried several times). The dots don't change colors like they ususally do.  I tried to set boot mode in UEFI and Legacy OS: it didn't help. In UEFI mode, I also tried to run the option "Try Ubuntu" (without installing it). I got stuck on the same screen with the Ubuntu logo.  What can I try ?  Thanks

This is the third time I've tried to install Ubuntu Server 14.04.03 64-bit on the same laptop, and each time it caused different problems.  Each time I wrote the same iso image to a USB flash drive by using a different application and OS.   Universal USB Installer (pendrivelinux.com) from Windows WinImage writer from Windows built-in image writer from Linux Mint 17.2    The iso image is the same in all three cases, the USB flash drive is the same, and the laptop is the same. However each time the installation of Ubuntu gave me different installation options. For example, the last time I installed Ubuntu, it didn't show all the packages to choose while installing (Basic Ubuntu server, etc.).


What is the best way of getting the file name in a URL using JAVA? For example if i have  I need to pull out information.html section (the file name) from the URL. I need this to work for all URLs. (they won't all be html files)

In Java, given a java.net.URL or a String in the form of http://www.example.com/some/path/to/a/file.xml , what is the easiest way to get the file name, minus the extension? So, in this example, I'm looking for something that returns "file".   I can think of several ways to do this, but I'm looking for something that's easy to read and short.


I have used two servers, Server A(local server) and Server B(remote server). I have created synonyms in the Server A for the Server B table. I have created  synonym using following syntax.  CREATE SYNONYM RemoteServerATable FOR Server B .[database_name].[schema_name].object_name   I have tried to join two tables sys.columns and sys.synonyms using below query  select s.name as [SynonymName], c.name as [ColumnName], c.object_id from [Server B].[DatabaseName].sys.columns c inner join sys.synonyms s on s.name = 'RemoteServerATable' and  c.object_id  = 1973582069   I have joined two tables using object_id of the sys.columns tables in the other server and hard coded integer value. I got this value using below query   exec ('select object_id(''[Server B DatabaseName].[Server B SchemaName].[Server B ObjectName]'') as object_id') at [Server B]   I am not getting correct columns information. Kindly suggest someways join two tables and get the column information.

I am using two servers local (SQL Server running on my system) and remote (SQL Server running on another system). I have created synonyms in my local server for a table which is located on the remote server.  Synonym used- CREATE SYNONYM [dbo].[test] FOR remoteserver_name .[database_name].[schema_name].object_name  Requirement   I need to fetch the columns of the synonym.  I can retrieve the columns of the synonym using below query in SQL server.  select * from dbo.test   where  dbo is synonym created schema name (local server schema name) and test is synonym name.  I have tried to retrieve the columns of the synonyms using below query, but I cannot fetch the columns  SELECT sys.schemas.name   AS SCHEMA_NAME,        sys.synonyms.name  AS view_name,        sys.columns.name   AS COL_NAME,        sys.types.name     AS data_typename FROM   sys.columns        INNER JOIN sys.synonyms             ON  OBJECT_ID(sys.synonyms.base_object_name) = sys.columns.object_id        INNER JOIN sys.schemas             ON  sys.schemas.schema_id = sys.synonyms.schema_id        LEFT OUTER JOIN sys.types             ON  sys.columns.system_type_id = sys.types.system_type_id WHERE  sys.types.system_type_id = sys.types.user_type_id        AND sys.schemas.name = N'scehmaname'        AND sys.synonyms.name = N'synonymname'   Can you please suggest some other way to retrieve the columns of the synonym or correct the above query?


Let $G$ be a group of odd order $n$ and suppose $|Con(G)| = k$  ( Con(G) is the set of conjugacy classes of G), prove that $$k \equiv n \pmod{ 16}.$$ How do I proceed on this? Thanks.

I have read that for any group $G$ of order $2m+1$ (odd) with $n$ conjugacy classes, it is always the case that $16$ divides the value $(2m+1)-n = |G|-n$.   This seems to me like an astonishing result: what on earth would $16$ have to do with every single odd group and its conjugacy classes? At any rate, I am wondering, assuming it is true, how would you go about proving it? I would like to show it in a reasonably simple way, but nothing whatsoever comes to mind, could anyone help? Many thanks - M.


As I am a beginner of learning the TeX and LaTeX internal mechanism, I tried to find some information about the verbatim environment and how it is handle by LaTeX. For example, if we have this command  \begin{verbatim}  ijdjdjda634&%  \end{verbatim}   How does TeX executes it? Primitive control sequences are directly executed by TeX 's stomach, right? Is it possible to write me exactly the steps of the process? Thanks!

I'm curious as to how verbatim is implemented internally in TeX. I am mostly familiar with the basics of TeX's inner mechanics (catcodes, and what not), but I'm just curious about this command.


A quantum system is often given as a wavefunction of position. This is a vector in a continuous, infinite-dimensional vector space, with uncountable dimension.  However we also know that the energy eigenkets are complete, which means that the dimension of the space should be able to be given by the number of energy eigenkets. How can this be, when the energy eigenvalues are often discrete, and hence of a countable number?

Hm, this just occurred to me while answering another question:   If I write the Hamiltonian for a harmonic oscillator as $$H = \frac{p^2}{2m} + \frac{1}{2} m \omega^2 x^2$$ then wouldn't one set of possible basis states be the set of $\delta$-functions  $\psi_x = \delta(x)$, and that indicates that the size of my Hilbert space is that of $\mathbb{R}$.  On the other hand, we all know that we can diagonalize $H$ by going to the occupation number states, so the Hilbert space would be $|n\rangle, n \in \mathbb{N}_0$, so now the size of my Hilbert space is that of $\mathbb{N}$ instead.  Clearly they can't both be right, so where is the flaw in my logic?


What does $* mean in shell?  I have code two function, run_command and run_test, they are called like this:  if [ -n "`echo ${GOAT_COMMANDS} | grep $1`" ]; then   run_command $* else   run_test $* fi   I want to understand what $* means, but Google search is very bad for searching these kinds of things.

Consider the following code:  foo () {     echo $* }  bar () {     echo $@ }  foo 1 2 3 4 bar 1 2 3 4   It outputs:     1 2 3 4       1 2 3 4   I am using Ksh88, but I am interested in other common shells as well. If you happen to know any particularity for specific shells, please do mention them.  I found the follwing in the Ksh man page on Solaris:     The meaning of $* and  $@  is   identical  when  not  quoted  or  when  used  as a parameter   assignment value or as a file name. However, when used as  a   command argument, $* is equivalent to ``$1d$2d...'', where d   is the first character of the IFS variable,  whereas  $@  is   equivalent  to  $1 $2 ....   I tried modifying the IFS variable, but it doesn't modify the output. Maybe I'm doing something wrong?


Prove  $$\lim_{n \to \infty} (\sqrt{9n^2 + 2n + 1} - 3n) = \frac{1}{3}$$  I got this problem in Harro Heuser's "Lehrbuch der Analysis Teil 1". It is surely smaller than 1 because $\sqrt{9n^2 + 2n + 1} < \sqrt{9n^2 + 6n + 1} = 3n + 1$, but I cannot get closer than that, although it looks very simple...

This is being asked in an effort to cut down on duplicates, see here: , and here: .    What methods can be used to evaluate the limit $$\lim_{x\rightarrow\infty} \sqrt[n]{x^{n}+a_{n-1}x^{n-1}+\cdots+a_{0}}-x.$$  In other words, if I am given a polynomial $P(x)=x^n + a_{n-1}x^{n-1} +\cdots +a_1 x+ a_0$, how would I find $$\lim_{x\rightarrow\infty} P(x)^{1/n}-x.$$  For example, how would I evaluate limits such as $$\lim_{x\rightarrow\infty} \sqrt{x^2 +x+1}-x$$ or $$\lim_{x\rightarrow\infty} \sqrt[5]{x^5 +x^3 +99x+101}-x.$$


I notice that not all edits of my posts trigger an inbox notification. I know that when the edit only contains a tag manipulation, then it doesn't trigger an inbox notification. But it seems there is a more complex condition (small edits?) for this. In particular, I can't find anything in my global inbox about . Maybe the reason here is that the question was closed already?   Could somebody provide a full list of which edits do not trigger an inbox notification?

Normally, when a user edits one of my posts, I receive a notification like on the following depending on the case   User has editing privilege (click to visit revision)   Users' edit is submitted to review queue (click to visit review queue)     The above notifications were received instantaneously (or less than 30 minutes, in case caching is supposed to be the answer) as the edit was done/suggested.  But I did not receive any such notification today (yet) on an edit made on my . I think it is a possible bug and should be looked at. The recent notifications list I have is shown below:


I get a NullPointerException when I try:  protected void onCreate(Bundle savedInstanceState) {         super.onCreate(savedInstanceState);         setContentView(R.layout.activity_stats);          final EditText nameText = (EditText) findViewById(R.id.creatureName);          String nameDisplay = nameText.getText().toString(); // <--- Error here          TextView name = (TextView) findViewById(R.id.textViewStatsName);         name.setText(nameDisplay);          goBackButton();     }   The EditText exists on the MainActivity, while I try to access it when another activity is created.  I want to have the same text as written on the EditText on the (empty) TextView.   I have seen that there are quite simular questions here, but sadly I never found any answer to the question. Also I am quite new to Android Studio and programming apps, so if I have done anything wrong in the code, please explain.  Thanks in advance.   EDIT:  <?xml version="1.0" encoding="utf-8"?> <RelativeLayout xmlns:android="http://schemas.android.com/apk/res/android"     xmlns:tools="http://schemas.android.com/tools"     android:layout_width="match_parent"     android:layout_height="match_parent"     android:paddingBottom="@dimen/activity_vertical_margin"     android:paddingLeft="@dimen/activity_horizontal_margin"     android:paddingRight="@dimen/activity_horizontal_margin"     android:paddingTop="@dimen/activity_vertical_margin"     tools:context="com.something.creature.StatsActivity">      <Button         android:layout_width="wrap_content"         android:layout_height="wrap_content"         android:text="Go back"         android:id="@+id/backButton"         android:layout_alignParentBottom="true"         android:layout_alignParentStart="true"         android:layout_marginStart="18dp"         android:layout_marginBottom="18dp" />      <TextView         android:layout_width="wrap_content"         android:layout_height="wrap_content"         android:text="Health Points:"         android:id="@+id/textHP"         android:layout_alignParentTop="true"         android:layout_alignParentStart="true"         android:layout_marginTop="114dp" />      <TextView         android:layout_width="wrap_content"         android:layout_height="wrap_content"         android:text="Strength Level:"         android:id="@+id/testSTRlvl"         android:layout_marginTop="44dp"         android:layout_below="@+id/textHP"         android:layout_alignParentStart="true" />      <TextView         android:layout_width="wrap_content"         android:layout_height="wrap_content"         android:textAppearance="?android:attr/textAppearanceLarge"         android:id="@+id/textViewStatsName"         android:layout_centerHorizontal="true"/> </RelativeLayout>

What are Null Pointer Exceptions (java.lang.NullPointerException) and what causes them?  What methods/tools can be used to determine the cause so that you stop the exception from causing the program to terminate prematurely?