Let's say a gnome Beast Master ranger chooses a Blood Hawk animal companion, is the companion able to follow the order to pick up and carry the PC?  I'm more looking at the possible issue of commanding a companion to carry something - since I don't think that's an explicit action that can be commanded.
The rulebook states that carrying capacity is the strength score times 15 (lbs). Find familiar allows me to get a hawk, which has a strength score of 5. This results in a carrying capacity of 75 lbs. This is well within the range of weights for small people such as gnomes or halflings. Does this mean my familiar can carry them and fly away (given they do not struggle)?
In programming terminology, what do you call the difference between these instructions: This is a question from the free Harvard online abstract algebra .  I'm posting my solutions here to get some feedback on them.  For a fuller explanation, see  post. This problem is from assignment 5.  a) Prove that the relation $x$ conjugate to $y$ in a group $G$ is an equivalence relation on $G$. b) Describe the elements $a$ whose conjugacy class (= equivalence class) consists of the element $a$ alone.  a) Let $G$ be a group and $R$ be a relation on $G$ defined by $a\sim b$ if $a$ is conjugate to $b$.  Then $a\sim b$ if there is a $g\in G$ such that $a = gbg^{-1}$.  Let $a$ be an element of $G$.  Then $a=eae^{-1}$.  So $a\sim a$ and $R$ is reflexive.  Let $a$ and $b$ be elements of $G$ such that $a\sim b$.  Then there is a $g\in G$ such that $a=gbg^{-1}$.  Then $b=g^{-1}ag$.  Since $g^{-1}\in G$, $b\sim a$.  Hence, $R$ is symmetric.  Let $a,b$, and $c$ be elements of $G$ such that $a\sim b$ and $b\sim c$. Then there are elements $g,g^\prime\in G$ such that $a=gbg^{-1}$ and $b=g^\prime cg^{\prime -1}$.  Then $a=g(g^\prime c g^{\prime -1})g^{-1}=(gg^\prime)c(g^{\prime -1}g^{-1})=(gg^\prime)c(gg^\prime)^{-1}$. Since $gg^\prime\in G$, $a\sim c$.  Hence $R$ is transitive.  Therefore $R$ is an equivalence relation on $G$. b) Let $S$ be the set of elements of $G$ such that, for $s\in S$, $s=gsg^{-1}$ for any $g\in G$.  Then $sg=gs$.  So $S$ is the set of elements that commute with every element of $G$.  In other words, $S$ is the center of $G$. Again, I welcome any critique of my reasoning and/or my style as well as alternative solutions to the problem. Thanks. How to tell a wlan card supports RFMON mode Can someone please tell me how to check if a wlan card supports promiscuous mode Entire function bounded by polynomial of degree 3/2 must be linear. The problem is as follows:     Suppose $f$ entire satisfying   $$ |f(z)| \leq A + B |z|^{3/2} $$   for some fixed $A,B &gt; 0$. Prove that $f$ is a linear polynomial.   I know I want to reduce it to a function where I can use a Cauchy bound, but I'm not sure how. Input string was not in a correct format A (probably trivial) induction problem: $\sum_2^nk^{-2}\lt1$ How do I sudo a command in a script without being asked for a password? I want to turn my system on automatically every day. So I use the below code in my Python script, but sudo asks me for a password every time:  os.system('sudo sh -c "echo date \'+%s\' -d \'+ \        24 hours\' &gt; /sys/class/rtc/rtc0/wakealarm"')   How can I run this script without sudo asking for the password every time? How do I get attention for one of my own questions without a good answer? divides, not divides and cardinalities In group theory it happens very often that you want to say: "The order of $H$ divides / does not divide the order of $G$." But the length of | is then always the same:  $ |H| | |G| $ produces |H|||G|  which is not ideal at all. (The negation \nmid has just this length too.) The length of "divides" should be longer than the "cardinality length". I could use   $ |H| \big| |G|$  but then there is no good way to say "does not divide" with the same length. Also, \big| is no solution when the expression has to be used in subscripts.   I thought it was just me, but I asked other group theorists, and nobody had a solution. I hope there is one.  I am seeking a division sign which is a little longer than the usual | , allows negation (with the same length) and proportionally correct use in subscripts (also under \sum etc.). It does not look professional if the "order sign" has the same length as the "divides" sign. (And what about combinations with absolute values, norms - although personally I don't use them as often as group orders.) Word for a task which is flawed or doomed to failure but which you have to do anyway? proving the inequality $\triangle\leq \frac{1}{4}\sqrt{(a+b+c)\cdot abc}$ How do I install the latest stable version of LibreOffice? LibreOffice is seeing some dramatic improvements each version and subversion that goes out.   I would like to have always the latest version of LibreOffice on my machine(s). I know of the PPA that exists but is it recommended to use it with 12.04 for daily use? What are the pro and cons of using the PPA? Will it break my system/Libreoffice installation?  Does libreoffice get eventually also upgraded in the Ubuntu repositories or does this upgrade happen only with new releases? Who manages the upgrades of libreoffice in Ubuntu and in the PPA? "GPT detected. Please create a BIOS-Boot partition" while using boot-repair Bash/Korn shell script edited on Windows throws error '...^M: not found' It's big and empty and I can't get up to the top, what should I do? I can't jump high enough, anti-gravity doesn't seem to do anything either.  My first tactic was to use the octopus summoning crown to create a pile of octopi that I could climb up, but when I teleported to the back of the room they followed me back, trapping me in the entrance. strange character replacement on SO I added a comment to  but something strange is happening. The end code reads "); but SO decided to change that to ";);.    I did not add a ; in front of the ).  To further explain what's happening here, the following:  "http://example.com/." http://example.com/. "http://example.com." http://example.com. "http://example.com" http://example.com   renders as: Hypernym for "clients", "members" and "partners" How can I go about determining the number of unique simple paths within an undirected graph? Either for a certain length, or a range of acceptable lengths.  Recall that a simple path is a path with no cycles, so I'm talking about counting the number of paths with no cycle. Can it hurt to put my GRE score on my resume? Merging two incoming broadband lines for faster Internet