Reorder a List and Find All Possible Combinations
How to generate all permutations of a list?
How many MB/sec can I expect copying to USB 3.0 enclosure with SATA drive? How to install driver for TP-Link TL-WN722N(EU)V2 on Ubuntu 17.04 Kylin I can not install the TP-LINK WN722N V2, which includes a 8188 EUS chip. Then I tried to install the backports v4.4.2,but   do not want to recognize either.  The TP-Link driver installation errors thrown out:  man@kman-livve:~$ cd '/home/kman/Documents/Tplink 722 N V2/rtl8188EUS_linux_v4.3.0.8_13968.20150417' kman@kman-livve:~/Documents/Tplink ...$ sudo make  "******************************************" "NO SKRC,we will use default KSRC" "******************************************" make ARCH=x86_64 CROSS_COMPILE= -C /lib/modules/4.10.0-15-generic/build M=/home/kman/Documents/Tplink 722 N V2/rtl8188EUS_linux_v4.3.0.8_13968.20150417  modules make[1]: Entering directory '/usr/src/linux-headers-4.10.0-15-generic' arch/x86/Makefile:140: CONFIG_X86_X32 enabled but no binutils support make[1]: *** No rule to make target '722'.  Stop. make[1]: Leaving directory '/usr/src/linux-headers-4.10.0-15-generic' Makefile:1367: recipe for target 'modules' failed   A method to know him, I do not know about. Thanks  Model:TL-WN722N(EU)_V2_161112_Linux.zip Chipset:rtl8188EUS_linux_v4.3.0.8_13 I have been playing for almost 2 days, and today it is asking me to sign up again.  I have all my game saved in my google account, but I wonder if I just log in from a trainer account will I keep my progress? I'd like to have a horizontal line extending from the end of the text on a line to the right margin. So far I've found \hrulefill and \leaders\hrule\hfill, but these draw a line that's flush with the baseline of my text — how can I get it to be vertically centered? Why the $(n+1)$th prime number cannot exceed the smallest prime divisor of $p_1\dotsc p_n + 1$ Let $p_n$ be the $n$th prime number in its natural order. We want to show that  $$p_{n+1} \leq p_1\dotsc p_n + 1 \tag{1}$$  I know $p_1\dotsc p_n + 1 &gt; 1$, so it has at least one prime divisor, but the text says that $p_{n+1}$ cannot exceed the smallest of these divisors, but I cannot understand why, especially when I imagine $p_{n+1}$ being very large. Although some examples confirm that this statement is true, I cannot make a connection as to why the $n+1$ prime number cannot exceed the smallest prime divisor. Once this has been shown to be true, $(1)$ immediately follows. What does a two overlapping circles symbol mean in an electrical schematic/diagram? In the datasheet for a A3503 Hall Effect Sensor, I saw a circuit diagram labeled 'Functional Block Diagram', and it shows a symbol I have not seen before. It's shown here between 3 - Output and 2 - Ground.  What is this supposed to represent?    The full datasheet is available Is it possible to create image data and save to a file from a script I have a master's degree in International Studies, and a double major with Computer Science from undergrad.  My transcripts suck.  There's no other way to dress it up.  I have pretty good teaching experience, and my GRE scores are awesome, and I suspect my recommendations are as bland as everyone else's.  Basically, to an admissions committee, I suspect I'm the model of a student who is probably smart enough but didn't work hard enough.  I want to do a Ph.D. in Political Science, but the response from my applications is looking pretty grim.  Am I permanently out of the running, or is there something I can do for the next few years which will help to counterbalance my unfavorable GPA? What are the rules for calling the base class constructor? I have already read        and many others   But I still have the following problem:   On one hand I've been told that if pure rotation takes place then the object goes on forever. This must imply no frictional force in any form acting on the body. On the second hand I've been told that during pure rotation(no external forces like wind) on a plane surface friction acts opposite to velocity of center of mass (accompanied by change of normal) and slows it down.     Both seem logical enough: The point of contact doesn't slip therefore no friction is required; So no retarding force and it must go on. Things don't go on forever; Friction must be present to slow it down.    So, which hand is correct? Or is there a third hand altogether? differences between 2 JUnit Assert classes The JUnit framework contains 2 Assert classes (in different packages, obviously) and the methods on each appear to be very similar. Can anybody explain why this is?  The classes I'm referring to are:  and . What's the right terminology for Unity's UI elements? I've sent a few mails to the Ayatana mailing list regarding some UI suggestions for Unity, but I'm afraid I keep confusing the right terms for the UI element, so I would like to have some clarification.  Answer Index: Does someone know how to set a command block with a command inside using the setblock command?  I have created this code /setblock &lt;x&gt; &lt;y&gt; &lt;z&gt; command_block {TileEntityData:{Command:"testfor @p[_=1]"}} but it doesn't works.  Do someone know how to do that? Regression: Transforming Variables When transforming variables, do you have to use all of the same transformation? For example, can I pick and choose differently transformed variables, as in:   Let, $x_1,x_2,x_3$ be age, length of employment, length of residence, and income.  Y = B1*sqrt(x1) + B2*-1/(x2) + B3*log(x3)   Or, must you be consistent with your transforms and use all of the same? As in:   Y = B1*log(x1) + B2*log(x2) + B3*log(x3)    My understanding is that the goal of transformation is to address the problem of normality. Looking at histograms of each variable we can see that they present very different distributions, which would lead me to believe that the transformations required are different on a variable by variable basis.   ## R Code df &lt;- read.spss(file="http://www.bertelsen.ca/R/logistic-regression.sav",                  use.value.labels=T, to.data.frame=T) hist(df[1:7])      Lastly, how valid is it to transform variables using $\log(x_n + 1)$ where $x_n$ has $0$ values? Does this transform need to be consistent across all variables or is it used adhoc even for those variables which do not include $0$'s?  ## R Code  plot(df[1:7]) During this travel ban (COVID) can my wife come visit me in the USA? I know I can visit there but not sure about her coming here Environment variables in Mac OS X Update: The link below does not have a complete answer. Having to set the path or variable in two places (one for GUI and one for shell) is lame.  Not Duplicate of:     Coming from a Windows background where it's very easy to set and modify environment variables (just go to System Properties > Advanced > Environment Variables), it does not seem to be that straight forward on Mac OS 10.5. Most references say I should update /etc/profile or ~/.profile. Are those the equivalent of System Variables and User Variables? For example, where should I set my JAVA_HOME variable?    EDIT:  I want to be able to access the variable from the terminal as well as an app like Eclipse. Also, I hope I don't have to restart/logout to make this take effect. New navigation doesn't appear to alert of question changes when watching a tag I am watching the  tag on Stack Overflow. My filter looks like this:    I do not receive notification of new questions. Previously I'd get notifications like this:    This notification does work when watching the  page of Meta.   Are notifications only active for a certain set of filter options? If so, what are they? If not, can we get them back when watching pages other than the main page? Functions that are their own inverse. What are the functions that are their own inverse?  (thus functions where $ f(f(x)) = x $ for a large domain)  I always thought there were only 4:  $f(x) = x , f(x) = -x , f(x) = \frac {1}{x} $ and $ f(x) = \frac {-1}{x} $   Later I heard about a fifth one     $$f(x) = \ln\left(\frac {e^x+1}{e^x-1}\right) $$ (for $x &gt; 0$)  This made me wonder are there more? What are conditions that apply to all these functions to get more, etc. probability question ("birthday paradox") $n$ people attend the same meeting, what is the chance that two people share the same birthday? Given the first $b$ birthdays, the probability the next person doesn't share a birthday with any that went before is $(365-b)/365$. The probability that none share the same birthday is the following: $\Pi_{0}^{n-1}\frac{365-b}{365}$. How many people would have to attend a meeting so that there is at least a $50$% chance that two people share a birthday?   So I set $\Pi_{0}^{n-1}\frac{365-b}{365}=.5$ and from there I manipulated some algebra to get $\frac{364!}{(364-n)!365^{n}}=.5\iff (364-n)!365^{n}=364!/.5=.....$   There has to be an easier way of simplifying this. A shrinking map that is not a contraction no fixed point. Working from Munkres.  Show that $f: \mathbb{R}\to \mathbb{R}$ given by $f(x) = [x+\sqrt{(x^2+1)}]/2$ is a shrinking map that is not a contraction that has no fixed point.   I figured out the fixed point part but have no clue how to show the other part.  For the fixed point part $$f(x) = x \Leftrightarrow x = [x+\sqrt{(x^2+1)}]/2$$  then $$2x = x + \sqrt{(x^2+1)}$$ $$x = \sqrt{(x^2+1)}$$ $$ x^2 = x^2+1$$  Which is a contradiction.   Thanks in advance.