Which of the following numbers can be orders of a permutation $\sigma$ of $11$ symbols
Possible orders of permutations of $11$ symbols
hostname returns another device's name I realized that the hostname had changed while I was doing some work using terminal in OS X Yosemite. I thought there might be an IP address conflict so I reset it. However I still get another device's name (someone else's iPhone, to be exact) when I use the hostname command:  Last login: Fri May  1 15:52:42 on ttys000 SomeonesiPhone:~ irem$  SomeonesiPhone:~ irem$ hostname SomeonesiPhone.wireless.duke.local   What's going on and how can I fix this?  It appears the IP address has not changed. But the address that I get by doing ipconfig getifaddr en0 is different from my public IP address.  I looked up my public IP address using Google, like this: I want to write a function in Python that returns different fixed values based on the value of an input index.    In other languages I would use a switch or case statement, but Python does not appear to have a switch statement.  What are the recommended Python solutions in this scenario? My name includes space - How do I enter my username when typing command? My username in Minecraft is sun solar arrow. This name includes spaces. Situation - When I want to get OP privilege, a user who has OP privilege will enter: /op sun solar arrow  But my username includes spaces. So it shows an error message:  Invaild syntax  How do I enter my username? What is the minimum $ \sigma$-algebra that contains open intervals with rational endpoints What are the minimum $\sigma$-ring and $\sigma$-algebra on $\mathbb R$ which contain the open intervals with rational endpoints?  Is there a relation between this $\sigma$-algebra and Borels? On-shell and off-shell transformations in Noether's theorem For any transformation of the fields,  $$\varphi\to\varphi'=\varphi+\delta\varphi$$ the change in the Lagrangian can be written as  $$\delta\mathcal L = \text{EoM} + \partial_\mu j^\mu\tag{1}$$where "EoM" represents the equations of motion (Euler-Lagrange equations) and all other terms can be written as a total derivative of some function $j^\mu$, which is a known function in terms of the Lagrangian.   I would like to distinguish the different realizations of transformations. Let's assume that the transformation (1) leaves the action invariant, $\delta S=0$.    $\delta\mathcal L=0$   EoM $=0$, "on-shell": Noether current is conserved, $\partial_\mu j^\mu=0$. EoM $=\partial_\mu b^\mu\neq0$, "off-shell": modified Noether current $J^\mu = j^\mu+b^\mu$ is conserved, $\partial_\mu J^\mu=0$.   $\delta\mathcal L =\partial_\mu a^\mu \neq 0$, "quasi-symmetry"   EoM $=0$, "on-shell": modified Noether current $J^\mu = j^\mu-a^\mu$ is conserved, $\partial_\mu J^\mu=0$.  EoM $=\partial_\mu b^\mu\neq0$, "off-shell": modified Noether current $J^\mu = j^\mu-a^\mu+b^\mu$ is conserved, $\partial_\mu J^\mu=0$.     Is this listing correct?      What roles do the terms "on/off-shell" and "(quasi) symmetry" play in Noether's theorem?   Related: , , , , . Check if macro is fully expandable Question  Is there a way to check whether a macro is fully expandable (or rather "safe in an expansion-only context" )?    Consider this code:  \def\a{Just a string} \def\b{\a} \def\c{\def\unsafe} \def\d{\c}   How could I check which of the macros (a-d) are safe in an expansion-only context? By looking at them I know that a and b are whereas c and d are not but if I wanted to know the same for a macro I haven't written myself this could get quite useful.      Background  I am working on a way to detect whether some input is a valid number in PGF. For this I developed  which makes use of passing the input into \pgfmathfloatparsenumber. The problem I have run into is that said macro appears to somehow manages to expand the input until there is an error (if the input is in fact not safe in an expansion-only-context). I tried using protected, noexpand and similar but somehow PGF manages to circumvent those.    So the idea is to check whether the input is safe before actually passing it to PGF. The problem is: I don't know how I'd go about that... n-dimensional vector space isomorphic to the n-th product of a field as abelian groups Let $V$ be a finite dimensional vector space (of dimension n) over a field $F$. I need to show that $V$ is isomorphic to $F^n$ as abelian groups. However, I don't really understand what does "isomorphic as abelian groups" mean, my (poor) attempt to solve this was:  Let $f:V\to F^n$, $f((v_1,v_2,\ldots,v_n)):=v_1+\ldots+v_n$, clearly $f$ is a group homomorphism, but it is not biyective since, for example, in the case where $dim(V)=2$ and $F=\mathbb{R}$ we have $f((2,-2))=0=f((3,-3))$, I've also tried it by defining $f$ to be the product of a vector's entries but obviously it didn't work so I'm stuck!   I think this should be an easy problem but since I don't quite understand it, it's giving me problems. Thank you for your help. Effective marketing strategies for independent game projects I would really like to hear how other independents generally approach marketing their game with limited resources. I know how critical marketing is since I've seen it first hand on several fronts. I've been part of teams that didn't put an ounce of marketing into their project and didn't come close to meeting expectations. I've also poured a lot of time into visiting forums to discuss our previous title which resulted in minor bumps over time.  I really think  is doing some amazing grass roots marketing with the way they are managing their community around their Blog. They've massed a following that is willing to pay (far in advance) them for their game before they finish it to help support them. That's awesome.  But how many people are really willing to divulge such information that early? Should that be a concern? Should I start talking about my next project before I really have anything implemented?   What has worked for you? I would be particularly interested to hear how people approach Apple's iTunes store. I believe we're looking at around 33,000 games on the store these days. How do I boot into single-user mode from GRUB? How to send form input values and invoke a method in JSF bean Write the digits of a number into an array Two possessive nouns in a row Is this the proper way to use two possessive nouns in a row?     I am going over to Lauren's parents' house this evening.   or     The store's manager's niece was quite attractive.   What about three?*     The United States Army's general's wife's dog is on the lamb, somebody stop it.   *Three seems both unrealistic, and in the specific example I used you could make a case for adding a fourth United State's Army's but I think that seems even more unrealistic.  Additionally, I would never write this in any sort of setting other than the purpose of knowing what the rules are.  Thanks in advance, I apologize in advance if this is duplicate I'm trying to write a script which creates a Nurbs path curve, bevels it, and then stores the location of each vertex/point in that curve. I've been writing it based on the code displayed in the info panel, but it doesn't show what the vertices are supposed to be called - so I can't refer to them in the script.  Update: After following Ratt's links, I modified  for Nurbs Path and am now stuck again, though it's still progress. Below is one version I tried out, but the error message says that Curve has no attribute path_points. Of course it doesn't, because I made that up because I don't know what the Nurbs Path equivalent for bezier_points is.  import bpy import random  def pathPointLoc(cu, typ, points):      for (n) in enumerate(points):         nurb = cu.path_points[n]         print(nurb.location)      return  cu = bpy.data.curves.new("MyCurve", "CURVE") ob = bpy.data.objects.new("MyCurveObject", cu) scn = bpy.context.scene scn.objects.link(ob) scn.objects.active = ob  cu.bevel_object = bpy.data.objects["BezierCircle"] cu.taper_object = bpy.data.objects["BezierCircle"]  pathPointLoc(cu, "NURBS", [(0,0,0,1), (0,0,1,random.randint(1,4)), (0,1,1,1), (1,4,1,1)] ) I am planning a trip to Italy this coming January. My plan is to land by plane in Roma and then go to France by train/bus stopping in some Northern Italian cities on the way, enjoying the architecture, the atmosphere, the art and and the food.   I want to do it at my own pace, without heavy scheduling. Ideally, I would just decide which cities to visit, and take a train whenever I feel it. I often do this here in South Korea where I am living, taking advantage of the "standing seats" as it is called here, that is travelling (for a cheap price and no reservation) standing on the romm between two cars. From my experience, it is also doable in Taiwan (at least in some trains).  In France, regional trains usually does not need any reservation, so you can buy a ticket and take the train whenever you want.  Can I expect a similar system in Italy, that is a way to make short travels between close cities without reservation?   Example of "short travel": Pisa - Firenze. Is there an elementary proof that $\sum \limits_{k=1}^n \frac1k$ is never an integer? This question has come up    ( ), but I'm finding the answers to be generally incomplete. The general question is "Why does/doesn't my job get killed when I exit/kill ssh?", and here's what I've found.  The first question is:  How general is the following information?  The following seems to be true for modern Debian linux, but I am missing some bits; and what do others need to know?   All child processes, backgrounded or not of a shell opened over an ssh connection are killed with SIGHUP when the ssh connection is closed only if the huponexit option is set: run shopt huponexit to see if this is true. If huponexit is true, then you can use nohup or disown to dissociate the process from the shell so it does not get killed when you exit.  Or, run things with screen. If huponexit is false, which is the default on at least some linuxes these days, then backgrounded jobs will not be killed on normal logout. But even if huponexit is false, then if the ssh connection gets killed, or drops (different than normal logout), then backgrounded processes will still get killed.  This can be avoided by disown or nohup as in (2). There is some distinction between (a) processes whose parent process is the terminal and (b) processes that have stdin, stdout, or stderr .  I don't know what happens to processes that are (a) and not (b), or vice versa.   Final question: How can I avoid behavior (3)?  In other words, by default in Debian backgrounded processes run along merrily by themselves after logout but not after the ssh connection is killed.  I'd like the same thing to happen to processes regardless of whether the connection was closed normally or killed.  Or, is this a bad idea?  Edit: Another, important way to keep jobs of being killed, that works (?) in either case is to run them through .  But, the question is more about understanding when things get killed and when they don't: sometimes people want the jobs to be killed on logout, for instance.  More threads: -  -  -  -  -  -  -  - Evaluate the integral: $\int_{0}^{1} \frac{\ln(x+1)}{x^2+1} \mathrm dx$ Method defined as testMethod do not support web service callouts, test skipped find value of the $$\lim_{x\to0}\frac{e-(1+x)^{\frac{1}{x}}}{x}$$I use hospital law and can't find answer Hello. I was trying to make a bootable flash drive from the startup disk creator, and when I went to erase the flash drive I accidentally erased the wrong drive, a 1TB removable drive. The operation took less than a second and gave no warning. I tried erasing the flash drive and it took about a minute, but it took but a second to erase the 1 TB drive, which is very surprising.  Please help, Gabriel