Meaning of "by" when used with dates - inclusive or exclusive
Is "do something by date X" inclusive?
What's the term for using the wrong word because it sounds the same? I was reading about various terms for incorrect words, but they didn't seem to fit.  I saw a post where someone said "what do you like to do when you're board?".  That kind of thing.  Also, would that be considered a mistake in grammar?  I didn't think so, but my friend insists it is.  I'm not sure if there even is a word for that kind of mistake, but was just curious about it.  Thanks! This is by far the weirdest problem I've come across,  My mac can perfectly access internet through safari web browser, but when I tried to do   ping www.google.com   through the terminal, it's requests is being timed out.  None of the other apps are able to reach internet either. Dropbox, Skype, Spotify all showing offline, except the browser itself  I'm guessing something bad with the DNS, but spend 2 hours trying to fix this with no luck rake db:migrate doesn't seem to work in production When calling super() in a derived class, can I pass in self.__class__? How to colorize an image as in the example? I have seen such an effect being used in many places however I haven't figured out how to replicate it via Photoshop.  I have tried desaturating the image, placing it under a layer of solid colour and then lowering the opacity of the colour. I have also tried a couple of blend modes, to no avail. The effect is nowhere near the same.  Can someone please tell me the effect used on these images? String comparison in Python: is vs. == Is it supposed to be a HTML or an HTML I've seen many people who say:     This is a HTML page.   Yet I've also seen many people who say:     This is an HTML page.   Are both usages equally correct?  Or, which is the grammatically correct one?       Possible Duplicates: What is inverse CDF Normal Distribution Formula I'm having some trouble updating a row in a MySQL database. Here is the code I'm trying to run:  import MySQLdb  conn=MySQLdb.connect(host="localhost", user="root", passwd="pass", db="dbname") cursor=conn.cursor()  cursor.execute("UPDATE compinfo SET Co_num=4 WHERE ID=100") cursor.execute("SELECT Co_num FROM compinfo WHERE ID=100") results = cursor.fetchall()  for row in results:     print row[0]  print "Number of rows updated: %d" % cursor.rowcount  cursor.close() conn.close()   The output I get when I run this program is:     4Number of rows updated: 1   It seems like it's working but if I query the database from the MySQL command line interface (CLI) I find that it was not updated at all. However, if from the CLI I enter UPDATE compinfo SET Co_num=4 WHERE ID=100; the database is updated as expected.  What is my problem? I'm running Python 2.5.2 with MySQL 5.1.30 on a Windows box. Difference between "theoretical computer science" and (beta) "computer science" Possible Duplicate:          Title says it all. From what I can see, "theoretical computer science" questions seem to be slightly more isolated to discussing algorithms, whereas "computer science" seems to have questions that are slightly broader and higher-level. Is there any place on the Stack Exchange sites where they give a longer description?  I'm just curious as to what niche the beta "computer science" site is meant to fill, as I see many topics in both forums that overlap. So I was playing around on Area 51 hoping for further news on the private beta for ebooks, and noticed that my avatar (a hand) was missing. Also the Area 51 has the old toolbar. So I looked at the flair page. The network flair has my hand, the Area 51 flair has a quilt. OK, so time to upload a new image, and WordPress -- WordPress -- I don't want to login to WordPress. Any idea what's up with that?  The following questions did not help, and have different causes and symptoms: Consider the smallest number in each of the $n\choose r$ subsets (of size $r$) of $S=\{1,2,\ldots,n\}$... Consider the smallest number in each of the $n\choose r$ subsets (of size $r$) of $S=\{1,2,\ldots,n\}$.Show that the arithmetic mean of the numbers so obtained is ${n+1}\over{r+1}$. I have no idea, how to solve it.It would be better if the solution has bijection. Please help! For groups $A,B,C$, if $A\times B$ and $A\times C$ are isomorphic do we have $B$ isomorphic to $C$? The motivation for this question is in my answer to this post :       (1) If I take $A$, $B$ and $C$ three groups such that $A\times B$ is isomorphic to $A\times C$ then do we have $B$ is isomorphic to $C$ ?   In the post a counter example is given when $A$ is an infinitely generated group. However I cannot get a counter-example when $A$, $B$ and $C$ are assumed to be finite groups. Note that there is no reason a priori if $\phi$ is an isomorphism from $A\times B$ to $A\times C$ that $\phi(A\times\{1_B\})=A\times\{1_C\}$.   In the case of finite groups it is true because of the Krull-Schmidt theorem : .  A slightly more general question is the following :     (2) If $B$ and $C$ are two finitely generated groups, can I always find a finitely generated group $A$ such that $A\times B$ is isomorphic to $A\times C$?   If $A$ is not assumed to verify any property but to be a group we can take :  $$A=B^{\mathbb{N}}\times C^{\mathbb{N}} $$  Furthermore replacing :$ \prod_{\mathbb{N}}$ by $\bigoplus_{\mathbb{N}}$ (or more likely the restricted product for groups but I am not sure of a well known notation, it is the subgroup of the product with all but a finite number components being trivial) will give you the same result for countably infinite groups.   $\underline{\text{Edit}}$ : To be clear about what I am asking. (1) is kown to be true for finite groups whereas (2) is known to be true when we are considering groups without restriction (even just for countably infinite groups). Let us pretend we are working on the smaller class of groups : the finitely generated groups. Is there any counter example to $(1)$? Is there any counter example to $(2)$?   $\underline{\text{Edit 2}}$: Here is a partial answer, from the classification of finitely generated abelian groups $(1)$ is always true if all groups are assumed to be abelian finitely generated groups. Now assume that $A\times B=G=A\times C$. Then you have (derived groups) :  $$D(G)=D(A)\times D(B)=D(A)\times D(C) $$  So the abelianizations verify :  $$A^{ab}\times B^{ab}=A^{ab}\times C^{ab}$$  Because we are now in the realm of finitely generated abelian groups we get :  $$B^{ab}=C^{ab} $$  So $(2)$ cannot be true in general for instance you can take $B:=\mathbb{Z}$ and $C=\mathbb{F}_5$, those two groups have different abelianizations.   The new question can be found here : I'm trying to use the eVis plugin in QGIS 3.16.3 to display geotagged photos (as I have in the past without difficulty), but the plugin has totally disappeared. Not only can't I find it as an icon or under the Database menu, but it doesn't appear in the list of plugins (and yes, I am looking in the complete list of all plugins!). Has it been moved somewhere I haven't come across or is it a bug? Proving that $A_n$ is the only proper nontrivial normal subgroup of $S_n$, $n\geq 5$ There is a famous Theorem telling that:  For $n≥5$, $A_n$ is the only proper nontrivial normal subgroup of $S_n$.  For the proof, we firstly start with assuming a subgroup of $S_n$ which $1≠N⊲S_n$. We proceed until at the last part of proof's body, we assume $N∩A_n=\{1\}$. This assumption should be meet a contradiction with normality of $N$ in $S_n$. There; we get $N=\{1,\pi $} in which $\pi$ is an odd permutation of order $2$. Now for meeting desire inconsistency, I have two approaches:  (a) Since every normal subgroup, having two elements, lies in the center of $G$ so, our $N⊆ Z(S_n)=\{1\}$ for $n≥5$ and then $N=\{1\}$.  (b) Clearly, $1≠N$ acting on set $\Omega=\{1,2,...,n\}$ is intransitive wherein $|\Omega|≥5$ and according to the following Proposition $S_n$ would be imprimitive.  Proposition 7.1: If the transitive group $G$ contains an intransitive normal subgroup different from $1$, then $G$ is imprimitive (Finite Permutation Groups by H.Wielandt).  May I ask if the second approach is valid? I am fond of knowing new approach if exists. Thanks. Following a global preference for , as of now, the preferences for enabling keyboard shortcuts and disabling the fixed topbar are network-wide* as well.  If you had either checked off on any site in the network, that setting has been preserved and applied to the whole network for your account already. Future changes will also apply to all* Q&amp;A sites.  Find them in their usual spot as previously on the  pages.    * With the exception of , which will support the fixed topbar after the . How to find string position within another string in C recursively? Current  enables one to upgrade to macOS Mojave from a stable release, but I want to try out a fresh installation instead of upgrading with previous data, so that I can assess it better.  I've downloaded an application named "macOS Mojave Beta" from the App Store, and running it would presumably result in an upgrade. Now I wonder what to do next. Would  and booting from it be a good idea, when I'm working with a Beta version? When should I use a struct rather than a class in C#? When should you use struct and not class in C#? My conceptual model is that structs are used in times when the item is merely a collection of value types.  A way to logically hold them all together into a cohesive whole.  I came across these rules :   A struct should represent a single value. A struct should have a memory footprint less than 16 bytes. A struct should not be changed after creation.   Do these rules work? What does a struct mean semantically? I seen many times how people describe how to's about LBP-2900, and 10-12 steps from start to end of how to download, unpack, build driver, fix driver, make it work... Could be there some .deb package with ready-to-go driver for Ubuntu? This printer is very popular...