I have an assignment in which I have a queue (from the class ArrayQueues) for which I am supposed to write a method in another class (Queues) that splits the queue into two. The method, split(Queue queue), takes the queue and returns another queue with half the items of the first queue, but it does not simply take the first half or second half. It takes every other item in the original queue and distributes the items evenly. This is how I am going about it:  public class Queues{ public static <E> Queue<E> split(Queue<E> queue){     Queue<E> queue1 = new ArrayQueue<>(queue.capacity());     Queue<E> queue2 = new ArrayQueue<>(queue.capacity());     int size = queue.size();//I did this because the size of queue changes after every iteration due to it being dequeued     for(int i = 0; i < size;i++){         if(i%2==0){             queue2.enqueue(queue.dequeue());//adds item from queue to queue2 and removes that item from queue         }else{             queue1.enqueue(queue.dequeue());//add item from queue to queue1 and removes item from queue         }     queue = queue1;     return queue2;     } }   The result I get is queue2 and queue1 both have the appropriate items (every other item from queue). However, the original queue is now empty, and I understand that it would be since I have been dequeueing it. But I set   queue = queue1   Why is it empty even after I set it to queue1?

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 have recieved a laptop from my workplace, it had no OS on it so I installed Ubuntu 18.04.3 LTS, but unfortunately it cannot find the wifi adaptor. I am running on 5.0.0-23-generic.  02:00.0 Network controller [0280]: Realtek Semiconductor Co., Ltd. RTL8821CE 802.11ac PCIe Wireless Network Adapter [10ec:c821]    Can you guys please help me enable my wifi? I can download anything with USB-Tethering

We just bought a Lenovo  (which is supposed to have the Intel 8265 for wireless). This laptop was bought in part because it is certified to run Ubuntu and as such to me at least it would make sense for things to work out of the box... but no such luck.  First, I installed Ubuntu 17.10 and after installation realised Wi-Fi was not working. I also tried Ubuntu 16.04 from a USB drive since that is the version of Ubuntu it is certified for, but no luck there either.  The wireless chip is not detected by lshw (or even lspci by the looks of it), ip link does not show a wireless interface, and the iwlwifi kernel module is not loaded at boot (I can load this myself using modprobe iwlwifi but this does not make Wi-Fi work). I think it is a combined Wi-Fi/Bluetooth chip, and Bluetooth does appear to work (or at least Bluetooth shows up in Gnome and rfkill list).  modinfo iwlwifi | grep 8265 shows me a file ending in -34 is supposedly loaded but only a file ending in -33 (and some other lower numbers) is present in /lib/firmware, if that helps).  I have also installed the Linux 4.14.9 kernel in an attempt to get things to work, but this did not resolve the issue either.  Further information  root@ThinkPad-E570:~# modinfo iwlwifi | grep 8265 firmware:       iwlwifi-8265-34.ucode root@ThinkPad-E570:~# rfkill list all 0: tpacpi_bluetooth_sw: Bluetooth     Soft blocked: no     Hard blocked: no 1: hci0: Bluetooth     Soft blocked: no     Hard blocked: no root@ThinkPad-E570:~# dmesg | grep iwl root@ThinkPad-E570:~# lspci -nnk | grep 0280 -A3 05:00.0 Network controller [0280]: Realtek Semiconductor Co., Ltd. Device [10ec:c821]     Subsystem: Lenovo Device [17aa:c024]   Update  I just noticed that the laptop does not have an Intel wireless chip at all, but in fact has a Realtek one... which means that the  of the shop I bought this laptop at were not accurate... Sigh. Same problem stands, however, just with a crappier wireless chip.


I have this bit of code which returns an error, and I can't explain why. Basically I retrieve from GET the table and the id of the post I want to pull from database, and everything works fine as long as the table name is fixed and not :table. You can clearly see I'm new to PDO, so do you have any thoughts on where I'm doing wrong?    $pageid = $_GET["id"]; //31 $tablename = $_GET["table"]; //table_name $pdo = new PDO("mysql:host=$servername;dbname=$dbname", $username, $password); $pdo->setAttribute(PDO::ATTR_ERRMODE, PDO::ERRMODE_EXCEPTION); $sql="SELECT * FROM :table WHERE id LIKE :pageid"; $stmt = $pdo->prepare($sql); $stmt->bindValue(':table', $tablename); $stmt->bindValue(':pageid', $pageid); $stmt->execute(); $result = $stmt->fetch(PDO::FETCH_ASSOC);   The error is the following, so appearently the table name is wrapped by ' breaking the script? That seems weird, since the :pageid doesn't have them and the code generating both is the same.       Uncaught exception 'PDOException' with message 'SQLSTATE[42000]: Syntax error or access violation: 1064 You have an error in your SQL syntax; check the manual that corresponds to your MySQL server version for the right syntax to use near ''table_name' WHERE id LIKE 31' at line 1' in /...   Thanks a lot for any advice

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"


Edit Note:  This question has been linked to these questions about using an article before adjectives modifying numbers. This question here has nothing to do with adjectives at all:       The question  Why do we use the article 'a' when referring to 100, but not when referring to any other plural counting?  Here's an example:     I saw a hundred birds today.   But when talking about other count that 100, we don't use 'a' because it's plural:        I saw ninety-nine birds today.   I saw two birds today.   I saw two thousand birds.   I saw seventy-five birds.      Is there a grammatical or historical explanation?

The indefinite article a(n), derives from the old English word an meaning "one". Generally this word only occurs in determiner function before noun phrases which are singular. However, there seem to be some cases where this determiner occurs before plural noun phrases. I say that, but actually these noun phrase seem so bizarre to me, in terms of their structure, that I'm not sure they're definitely noun phrases at all. Here are some examples:   a full three months before we left an amazing two days an awkward ten minutes   Ignoring the article here for a moment, these noun phrases are odd because the adjective is occurring before the numeral. We would normally expect to see:   three full months two amazing days ten awkward minutes   Even given the oddness of the word order in the original phrases, I can see no reason why the normally singular indefinite article is licensed here.   Can anybody give an account of the syntactic structure of these phrases, and/or explain why the semantically singular article is able to be used with such phrases - even if they compulsorily trigger plural verb agreement?  Here is an example of one of these instances which seems to demand a plural verb:   An amazing two million people attend every year. *An amazing two million people attends every year. (ungrammatical)


Does it mean either a or b will generate the whole of $\langle a,b \rangle$ or does it mean that some of the elements will be generated by a, some by b, and some by $a^rb^q$? The book I'm reading doesn't really make it very clear.

Let there be $H$ subgroup of symmetric group $S_4$, so that $H= \langle (12)(34),(234) \rangle$. What does the notation $\langle (12)(34),(234) \rangle$ mean? I know that if there's one elements, then it's all the powers of that element.  Thanks in advance!


I am in 9th grade and have recently become interested in physics. I have a basic understand of relativity, electromagnetism, and a bit of knowledge about on quantum mechanics. However, I don't have much of an understanding at all about the mathematic of these subjects and would like to learn. I am just starting geometry and have completed algebra. Any suggestions for books or online recources to help me?

I'm interested in learning physics. I do realize that the subject is large and that it would be easier if I had a specific area of interest. However, I do not. I suppose I want to learn about the fundamentals of it all; the axioms that combine all physics fields. Or, in other words, a high school physics class.   Specifically, a book or series of videos would be helpful. I looked over MIT and unfortunately the material wasn't for me. I don't mean to be "picky" so I am not completely ruling out any resource just yet.   Thanks in advance.


Please verify for me?  Base case: $n = 0 $  $0 < 2^0$  $0 < 1$. This is true.  Inductive step: Suppose $n \geq 0$. Assume $P(k)$ is true if $k = n$. We must deduce that $P$ holds for $k+1$.  $n < 2^n$  $n - 2^n < 0$  $(n+1) - 2^{n+1}$  $n+1 - (2^n \times 2)$  $n+1 - (2^n + 2^n)$  $n - (2^n + 2^n) + 1$  $n - 2^n - 2^n + 1$  $(n - 2^n) - (2^n-1)$  We know $(n - 2^n) < 0$, that is to say $(n-2^n)$ is negative.  For all values of $n \geq 0, (2^n-1)$ is always a non-negative number.  A negative number minus a non-negative number is always negative, so  $(n - 2^n) - (2^n-1) < 0$ is true.  $(n - 2^n) < (2^n-1)$.  $n < (2^n + 2^n) -1$  $(n+1) < 2^{n+1}$  So $n < 2^n$ for all $n \geq 0$.

These are just the examples from my textbook, but I don't think it did not explain well.  One of the problem was to prove the inequality   $$n<2^n$$  for all integers $n$.  I understand we assume if $P(n)$ is true, $P(k+1)$ is true.  Thus $k+1< 2^{k+1}$  But in the text book, they added one more line that I don't understand:  $$k+1<2^k+1 \le 2^k+2^k=2\cdot2^k=2^{k+1}$$  I understand  $$k+1<2^{k+1}$$  But how do I know $2^k+1$ is larger than $k+1$, and smaller than $2^{k+1}$?  I have one another example just in case,  proving $2^n<n!$ using induction.  $$2^{k+1}=2\cdot 2^k<2\cdot k!<(k+1)k!=(k+1)!$$  I understand we should start with $2^{k+1}<(k+1)!$, but  Where did $2\cdot k!$ come from? Textbook says it came from inductive hypothesis, but I still don't get it.  Please advise.


I'm changing my username on Ubuntu 14.04 as read on another question and I then get this message.      Please enter a username matching the regular expression configured   via the NAME_REGEX[_SYSTEM] configuration variable.  Use the `--force-badname'   option to relax this check or reconfigure NAME_REGEX.   I have no idea what this means or if it's anything serious. Is it serious?

I'm running Ubuntu 12.10 desktop 32 bit. Currently I have only a user, type administrator. I'd like to create another administrator user but I keep getting the following error:  Failed to create user GDBus.Error:org.freedesktop.Accounts.Error.Failed: running '/usr/sbin/adduser' failed: /usr/sbin/adduser returned an error (1): adduser: Please enter a username matching the regular expression configured via the NAME_REGEX[_SYSTEM] configuration variable.  Use the `--force-badname' option to relax this check or reconfigure NAME_REGEX.  Any suggestion is appreciated.


How can I prove that the following transformation is canonical:  $\begin{cases}\overline{q}_i=\dfrac{q_i}{Q} \\ \overline{p}_i=Qp_i-2Pq_i \end{cases},\ i\in\overline{1,n}$  where $Q=\sum_{i=1}^n q^2_i$ and $P=\sum_{i=1}^n p_i q_i$?  I struggled a lot trying to obtain that the jacobian matrix is symplectic, but it looks too ugly. Is there any easier method the suits to this problem?

We had a couple of examples where we were supposed to calculate the  (CT), but we never actually talked about a condition that decides whether a transformation is a canonical one or not.   Let me give you an example: We had the transformation: $$P=q \cdot \cot(p), \qquad Q=\ln \left(\frac{\sin(p)}{q}\right).$$  How do I see whether this transformation is a canonical one or not?   You don't have to carry out the full calculation, but maybe you can give me a hint what I need to show here?


Most people say upper left is the best, due to recognizability issues. I saw a video on   and showed that CNN did the bold move, to put it in the middle. Then i checked  and the logo was on the left, so they updated their bold move.   Any other UX tips for the placement?

I'm designing a website for a rather unknown software company. The company likes the design but cannnot get along with our desicion to center their logo on the top of their page, although all the other elements are centered. Therefore a left aligned logo wouldn't look good. I know, it seems all UX studies prove them right, but positioning the logo in the center isn't a unpopular practice anymore.   Furthermore I think the way we read a website has adapted the last 10 years. Are there any studies about this topic that could help prove my point?  Thanks


I know I am wrong, this question is just to understand logically why, I am not an engineer but an hobbist While designing a pcb for a mcu I should put a decoupling capacitor near each power lines. We do it because the current draw of the ic could change and the capacitor will supply it immediately Until here i hope we all agree but why can't i put this cap only near the Vcc? this is a hyperbole/example of what i am trying to say:  I heard that the answer could be: "Because the electrons moves from - to +" but i don't think that this is correct logic, because this could bring me to make the board in the opposite situation: the cap near gnd and a very long track until vcc I hope that i m not going to "shock" anyone with this dumb question, please it is just a curiosity

I guess I've been somewhat ignorant when it comes to the finer details of pcb layout. Lately I've read a couple of books that try their best to lead me on the straight and narrow. Here is a couple of examples of a recent board of mine, and I have highlighted three of the decoupling caps. The MCU is a LQFP100 package and the caps are 100nF in 0402 packages. The vias connect to ground and power plane.     The top cap (C19) is placed according to best practices (as I understand them). The other two are not. I haven't noticed any problems. But then again the board has never been outside the lab.  I guess my question is: How big a deal is this? As long as the tracks are short, does it matter?  The Vref pins (reference voltage for the ADC) also have a 100nF cap across them. Vref+ comes from an onboard TL431 shunt regulator. Vref- goes to ground. Do they require special treatment like shielding or local ground?    EDIT    Thanks for great suggestions! My approach has always been to rely on an unbroken ground plane. A ground plane will have the lowest possible impedance, but this approach may be too simplistic for higher frequency signals. I've made a quick stab at adding local ground and local power under the MCU (The part is an NXP LPC1768 running at 100MHz). The yellow bits are the decoupling caps. I'll look into paralleling caps. The local ground and power are connected to the GND layer and the 3V3 layer where indicated.  The local ground and power are made with polygons (pour). It's going to be a major rerouting job to minimize the length of the "tracks". This technique will limit how many signal tracks can be routed under and across the package.  Is this an acceptable approach?


I'm new to Ubuntu. Just started my course this week. I would like a  simple explanation for what the kernel is and what it does in Ubuntu.

What exactly is the Linux kernel? And does Ubuntu, at the core, use a modified Linux kernel? In what manner is it distinguished by the NT/Windows 8 kernel?


How much knowledge of maths is required for learning ? Also from where can I learn this math?

I'm a bachelor student majoring in math, and pretty interested in physics. I would like a book to study for classical mechanics, that will prepare me to work through . What books would be good for a beginner?


all time or all-time, not sure which one it is. Are they different in different scenarios?

Consider the following sentence:     The labour-intensive and time-intensive part starts tomorrow.   I want to write this without rewriting the word "intensive."  Is this the correct way to do it?     The labour- and time-intensive part starts tomorrow.   Note the hyphen hanging after the word labour. Or should there be no hyphen after labour? Can anyone point me to a reference that talks about this?


assume that I have a long variable and I want to set 1 or zero for specific bits during my code what is the best way using function or defining Thanks

How do you set, clear, and toggle a bit?


Well, I know that this is noetherian but I don't really understand how I can get a chain of prime ideals here to find the Krull dimension and assure that it is the supremum.

If $R$ is a Noetherian ring then we know that the Krull dimension of the polynomial ring $R[X]$ is $\rm dim(R)+1.$ Is there any formula for the Krull dimension of the power series ring $R[[X]] $ When $R$ is a Noetherian ring ?


I am trying to solve the following problem:          Let $P(z)$ be a polynomial in $z $of degree $n$. Show that if $|P(z)| ≤ M$ for     $|z| = 1$ then $|P(z)| ≤ M|z|^n$ for all $|z| ≥ 1$.      But I am having some trouble. I know that if $P(z)=a_nz^n+\dots+a_0$, then  $$a_k=\frac{k!}{2\pi i}\int_{|z|=1}\frac{p(\zeta)}{\zeta^{k+1}}d\zeta$$   and therefore $$|a_k|\le k!M$$  but after this I am stuck. Any help would be apreciated.

Let $p(z)= \sum_{k=0}^n a_k z^k$ ,  $a_n \neq 0$ , be a polynomial of degree $n$ such that $|p(z)| \leq M$ for $|z| \leq 1$.  Show that $|p(z)| \leq M|z|^n$ for $|z| \geq 1$  This was an exam question. Part (a) of this question asked the converse: if $|p(z)| \leq M|z|^n$ and $|z|$ is sufficiently large, then $p(z)$ is a polynomial. This question came straight out of Ahlfors' Complex Analysis, which I solved by showing, using the Cauchy Estimate,  $|p^n (z)|  \leq \frac{n!M|z|^k}{R^n} = 0$ as $R \to \infty$.   I would like to work backwards with this.   May I do this, or similar:   $p(z) = \frac{1}{2\pi i} \int_{c} \frac{f(\zeta)d\zeta}{\zeta-z}$  $\Rightarrow  |p(z)| \leq \frac{2\pi M|z|^n}{1(2\pi)}= M|z|^n$


Let's say for some reason, I want to have a class template MyTemp with some static data member smDummyVar :  Mytemp.h  #ifndef MY_TEMP_H #define MY_TEMP_H  template<class T> class MyTemp{ ... private:    static int smDummyVar;    ... };  #include "MyTemp.cpp"  #endif //MY_TEMP_H   Mytemp.cpp  ... template<class T> int MyTemp<T>::smDummyVar = 0; ...   Since the compiler requires that the definition and declaration of a template be at the same place, so I include MyTemp.cpp in MyTemp.h .  Now: I want to use MyTemp at many places and create objects using the template:  case1.cpp  #include "MyTemp.h"  void dummyfunc1(){     MyTemp<int> myTemp1; }   case2.cpp  #include "MyTemp.h"  void dummyfunc2(){     MyTemp<int> myTemp2; }   I won't get any error from the compiler, but I'd get warning from the linker:  "multiple definition for MyTemp<int>::smDummyVar" ... defined in invalid_group(case1.o) ... rejected in favour of symbol defined in ...(case2.o)   Question: how can I get rid of this warning ?  Thanks a lot in advance for your help !  ====================================  inspired by one of the answers in this thread  I found the following solution:  i. remove #include "MyTemp.cpp" in MyTemp.h  ii. specialized.h  #include "MyTemp.h" typedef MyTemp<int> MySpecialized;   iii. specialized.cpp  #include "MyTemp.cpp" template class MyTemp<int>;   iv. give specialized.cpp to cmake file  v. include specilized.h in case1.cpp and case2.cpp  the "multiple definition" warning issued by the linker will go away.  Thank you guys for helping !

Quote from :     The only portable way of using templates at the moment is to implement them in header files by using inline functions.   Why is this?  (Clarification: header files are not the only portable solution. But they are the most convenient portable solution.)


When using each combined with or , which is correct:  Each individual or group is happy. Each individual or group are happy. Each individual or group is filled with laughter. Each individual or group are filled with laughter.

Here is my construction,     If e1 or e2 are positioned a non-zero angle with respect to f, a   single intersection point is directly considered. If e1 is unfixed,   the sweeping of e1 through the intersection point is allowed.   My question is as I am trying to use only one edge (e1 and e2 are edges), in the above are should be is or not


I am using Ubuntu 12.04 and I have a iPhone 4 with iOS 5.1 that I just recently jailbroke. I was wondering if there was anyway that I can sync my music to my iPhone?

What ubuntu applications provide support? (guides, how to's, status) Also, specifically, details on support for syncing music to iPhone's and iPod's with the latest OS version:   Can you sync music to apple devices using >iOS4? (iPhone & iPod) What applications allow you to do this and how? (guides, how to's, status)    What has already been established is:   Apple does not support Linux and has no plans to.  provides some support, however it currently does not support music/video synchronization with devices >iOS4. Go to  and scroll to the section titled "" to see if your device version is supported.


Is the CLUI (Command Line User Interface) and GUI (Graphical User Interface) utilize different TTYs or both of them share the same TTY?   I understood in the past that they both share the same TTY but I might be wrong. I got a bit confused when reading about that and saw different phrasings that made see the CLUI/GUI-TTY issue a bit confusing one.  I understand what is a TTY machine from history (60s/70s) but don't know if a modern virtual TTY "bases" both CLUI and GUI, or if there is TTY one per each (one for CLUI and one for GUI), and my question is if there really is.  Update due to Sparhawk's comment:  By CLI I mean to either the CLUI I run from my GUI-including-distro (like the Debian desktop CLUI) or my other no-GUI distro, like the Debian server CLUI or Ubuntu WSL.

When I install some Linux distros with a GUI, they come with the shells sh and Bash. The CLI let you operate the system through sh and Bash, but what about the GUI? Does the GUI let you operate the system through sh and Bash or it has it's own shell to intermediate between you and the kernel?


I have somewhat written the program but still there are some issued while executing it, I'm in 7th standard and I don't know much about how to exactly make it work, please help. name = input('Enter your name: ') print(name[0]) print(name[1]) print(name[2]) print(name[3]) print(name[4]) print(name[5]) print(name[6]) print(name[7]) print(name[8]) print(name[9]) print(name[10]) print(name[11]) print(name[12]) print(name[12]) print(name[13])  The problem is that when I run this program and if the letters are less than 13 it gives an error, how can I prevent this?

In C++, I can iterate over an std::string like this:  std::string str = "Hello World!";  for (int i = 0; i < str.length(); ++i) {     std::cout << str[i] << std::endl; }   How do I iterate over a string in Python?


I'm about to go shoot outside and it is currently cold and slightly snowing. I know film cameras stop working when its too cold but I haven had issues with my digital camera. I've also gotten snow all over it before. Is there a way to keep my camera warm/weatherproof? I have a canon dslr.

I’m going to Queenstown, NZ in a couple of weeks and want to take my (very new, very precious) Canon 7D with me. I’ve done a little bit of research on how to protect my baby from cold climate (e.g. ) and found that the biggest problem is probably going to be condensation. Some suggestions have been to place the camera in a plastic bag or letting the camera gradually adjust to the new temperature or placing silica gel in the camera bag to absorb moisture. I am leaning toward the latter at the moment because it sounds like it’s the easiest, so I was just wondering if anyone has had any experience in this matter and could share their wisdom.  As an alternative I could take my Canon 350D, as I really wouldn’t care if that got damaged in the snow. However I’m a film student and tend to take just as many videos as photos – hence why I really want to take the 7D. But I would seriously regret it if it got damaged… dilemma!   So as I actually haven’t used a question mark in the body of text, I will specify that the question is: What safety precautions should I take when taking photos in the snow?  Cheers.


I have a proof style question regarding vectors and orthonormal bases. It is as follows:  Let V1 and V2 be an orthonormal basis for W which is a subset of R^n. Prove that if w is a vector in W then the following holds:  ||w||^2 = (w . V1)^2 + (w . V2)^2   I have tried a few things here however the first thing I noticed was this provided condition looks very similar to the Cauchy-Schwarz Inequality but was not really sure how that is relevant.  One of the things I have tried was breaking down each part of the equation. I thought if w is inside W which is an orthonormal basis it would have a length of 1 so the left hand side of the equation would be equal to 1 but then I got stuck as I know when orthogonal vectors are dotted against each other their dot product is 0 which would mean the left hand side would be 0 + 0 which is obviously not equal to 1.  I have in my notes all the properties of vector dot products as well as those of orthonormal bases but cannot seem to organise those in such a way that explains the given condition.  Thank you for any feedback or advice.

let ${v_1}, {v_2} $ be an orthonormal basis for a subspace $W$. Prove that if $z$ is a vector in $W$, then $||z||^2 = (z \cdot {v_1})^2 + (z \cdot {v_2})^2$  I'm not too sure where to start on this one. I'm thinking I have to cancel out ${v_1}$ and ${v_2}$ since the dot product of two orthogonal vectors is zero. Any help is appreciated.


It is preferred to use ipad to create and edit TeX files and use LaTeX. I know some applications to use TeX but they need Internet and are not complete. Is it possible to use texlive on Ipad (IOS)?

Is there a (La)TeX distribution running on iPad?


Three server A,B & C. How to ssh connect from A to C via intermediate server B, if A to B & C to B are password less(key)? I encountered this in an interview. Anyone knows how?

I'm trying to tunnel to a server via a bridge server. So far, I've been able to get it working from the command shell properly using the following command:  ssh -A -t bridge_userid@bridgemachine.com ssh -A remote_userid@remoteserver.com   But I've been trying to wrap this into my ~/.ssh/config file and I have troubles. I've tried:  Host axp   User          remote_userid   HostName      remoteserver.com   IdentityFile  ~/.ssh/id_rsa.eric   ProxyCommand ssh -A -t bridge_userid@bridge_userid.com ssh -A remote_userid@%h   But when I do, I get the following error message from remoteserver.com and I'm not sure what is causing it:     ksh: SSH-2.0-OpenSSH_6.8^M:  not found   I know that when I log into remoteserver.com , my shell is /usr/bin/ksh.  I've tried to add path arguments to the ssh commands in the config file, but it made no difference.  Any ideas what it can be?


I just answered a question on Stack Overflow .  If you look at the history of the question my answer stands OK. But now the OP has changed the question due to some unknown reasons. Due to which now my answer has no link to the question.  So in this case should I delete the answer or wait for OP to make a correction to his/her question?  EDIT:- A user named  has now reverted the question to the original one. But I still wanted to know what should one do if this happens in future.  I know as a disciplinary action one should delete the answer in that case, but what if the answer was OK for the original posted question?

Here's the situation- someone asks a question, accepts an answer, and then un-accepts the answer, and edits the question, making that answer and other existing answers incorrect...  I've tried to research the issue on Meta and found a few cases of this happening, the general consensus seems to be that its not appreciated and the OP should have asked a new question, but there doesn't seem to be any real mechanism or suggestion as to what to do about it.   Should these cases be flagged for an edit roll back?  Related Questions-      Note- I'd rather not reference the specific case as it would likely draw a lot of negative attention to the asker, and I think keeping it broad would help in other cases.


Assume that $\sum a_n$ converges and $a_n\geq 0$. Show that $\sum \dfrac{\sqrt{a_n}}{n}$ also converges. I tried using the comparison test but it does not necessarily work since $a_n$ may be less than 1. I think of using the partial summation formula but I cannot see how to make it work. Any help will do. Thanks!

Problem:      Suppose that for every $n\in\mathbb{N}$, $a_n\in\mathbb{R}$ and $a_n\ge 0$. Given that   $$\sum_0^\infty a_n$$   converges, show that    $$\sum_1^\infty \frac{\sqrt{a_n}}{n} $$   converges.   Source: Rudin, Principles of Mathematical Analysis, Chapter 3, Exercise 7.


I saved the jpeg file in the same place where all my TeX files are placed at; which commands should I be using to make the pic appear?  I am using Bakoma TeX 11.85, but I believe it's the same in every software of TeX, but I may be wrong.

I am sorry if my question is too silly, I am totally new to LaTeX.   I have just downloaded TeXstudio 2 days ago and am trying to include some figures/images in the document. I found out about the \includegraphics command but cannot understand how it works at all. Every guide I have found jump to something like   \usepackage{graphicx} \includegraphics[width=0.5\textwidth]{bird1}   and I don't have a clue how I am supposed to use the command except that I need to use the package graphicx.  Where do I have to put my images so that TeXstudio can find it? Let's say I have an image called cat.png located at C:\Users\ASUS\Desktop\PICS, do I just type \includegraphics{cat} and TeXstudio is going to magically find it?


When I made a slice of array containig objects new array are still have references to objects in initial array. How can I make a slice with objects copies?  var obj1 = {name: 'object1'}; var obj2 = {name: 'object2'}; var array = [obj1, obj2]; var arraySlice = array.slice(0, 1); arraySlice[0].name = 'object1RENAMED'; console.log(array[0].name); console.log(arraySlice[0].name);     Prints:  object1RENAMED object1RENAMED

What is the most efficient way to clone a JavaScript object? I've seen obj = eval(uneval(o)); being used, but . I've done things like obj = JSON.parse(JSON.stringify(o)); but question the efficiency.  I've also seen recursive copying functions with various flaws.  I'm surprised no canonical solution exists.


I have a problem with Lighttpd because someone started to use some Web downloader from very good connection and it blocked my whole website. Is there any way to protect Lighttpd from DDOS attacks and flooding?

This is a  about DoS and DDoS mitigation.   I found a massive traffic spike on a website that I host today; I am getting thousands of connections a second and I see I'm using all 100Mbps of my available bandwidth.  Nobody can access my site because all the requests time out, and I can't even log into the server because SSH times out too!  This has happened a couple times before, and each time it's lasted a couple hours and gone away on its own.  Occasionally, my website has another distinct but related problem: my server's load average (which is usually around .25) rockets up to 20 or more and nobody can access my site just the same as the other case.  It also goes away after a few hours.  Restarting my server doesn't help; what can I do to make my site accessible again, and what is happening?  Relatedly, I found once that for a day or two, every time I started my service, it got a connection from a particular IP address and then crashed.  As soon as I started it up again, this happened again and it crashed again.  How is that similar, and what can I do about it?


I agree, it might have been better to leave Thor out of this, but as I said, I am a bit hot-tempered - impulsive shall we call it? There was a grumble and a rumble, a few thunderbolts which Thor liked to throw for fun, and then a flash of lightning. Thor stood in front of me, towering with rage, and swinging his hammer about. It really was time to go. “Curse the lot of you,” I cried “May you and yours be consumed in the endless Fire both now and at the end of days!”   is this a question sentence ?

But the boy was trying to fight off the dementors, even though Harry could see their cold, draining power starting to affect him. The crowd was jeering, some of them on their feet, as the woman swept out of the dungeon, and the boy continued to struggle.       “I'm your son!” he screamed up at Crouch. “I'm your son!”      “You are no son of mine!” bellowed Mr. Crouch, his eyes bulging   suddenly. “I have no son!”      The wispy witch beside him gave a great gasp and slumped in her seat.   She had fainted. Crouch appeared not to have noticed.      “Take them away!” Crouch roared at the dementors, spit flying from his   mouth. “Take them away, and may they rot there!”   What does "may they rot there" mean? Is it let them rot in the prison Azkaban?  -- From Harry Potter and the Goblet of Fire


I have issues with reading csv format like this:  "foo","bar foo, foo bar", foo, bar, far "bar", "foobar foo, foo" , bar, fobar, bar   Technically, both lines should have 5 fields accordingly with separator ,.  awk -F, '{print NF}' resolver.csv  6 6   This is where problem goes. AWK treats , as a separator between quotations marks, and provide non accurate results. Giving the separator like -F '","' makes things only worse.  awk -F, '{print $3}' test.csv   foo bar"  foo"    Any work around?

I have a a .csv file as follows:  "ID0054XX","PT. SUMUT","18 JL.BONJOL","SUMATERA UTARA, NORTH","MEDAN","","ID9856","PDSUIDSAXXX","","","","Y" "ID00037687","PAN INDONESIA, PT.","JALAN JENDERAL, SUDIRMAN, SENAYAN","","INDIA","","ID566543","PINBIDJAXXX","","0601","","Y"   I have a script that assigns each of the comma separated value to a unique variable using , as the delimiter.  The portion of the script is as under :  IFS=,  [ ! -f $INPUT ] && { echo "$INPUT file not found"; exit 99; }  while read Key  Name    Address1        Address2        City    State   Country SwiftCode       Nid     Chips   Aba     IsSwitching do           echo "-------------------------------------------------------------------"       echo "From Key : $Key"      echo "-------------------------------------------------------------------"           echo "-------------------------------------------------------------------"       echo "From Name : $Name"   What it does is separate the values having comma inside the quotes against my desired output of uniquely separating each value to their respective variables.  I tried replacing the comma like IFS=[","] but no luck. Any suggestion/ help is really appreciated.


I definitely chose one object and I don't know why it's all moving together. I want to move one object, and I never set up a parent.

I created a thick glass bottle and duplicated the interior faces to make a new object to create the liquid inside.   I went in the edit mode, selected the faces I wanted to copy and duplicated them with ShiftD. Then I pressed P to  separate the duplicated faces.   Now I try to make a duplicate of that liquid to make it flow out of the bottle, and I simply need the duplicate of one face of it. So I go to edit mode and do as I did to make the liquid from the bottle faces... but as soon as I'm back to the object mode and I want to move the duplicated faces, every thing moves with it...   I played around and tried things, and while doing so I realized that if I dupe the liquid object in object mode using ShiftD and press 0 to place it where the original is, they move together if I duplicate it and place it somewhere else so that they are separated.   Also if I pick one of the two separated objects and make it intersect with the other one, release my left mouse button to place it there, and then try to move it again, they both move together, but not at the same speed.  I really don't understand what is going on and I'm sure it's really badly explained, so what I'll do is make a screen capture of my Outliner and record the behavior of the objects and upload those to help you understand.


Whenever I am trying to install unity tweak tool through command line, this message shows up  E: Could not get lock /var/lib/dpkg/lock - open (11: Resource temporarily unavailable) E: Unable to lock the administration directory (/var/lib/dpkg/), is another process using it?   How to rectify this ?

I get this error when trying to use apt-get:  E: Could not get lock /var/lib/dpkg/lock - open (11 Resource temporarily unavailable) E: Unable to lock the administration directory (/var/lib/dpkg/) is another process using it?     How can I fix this?


I am using macOS Mojave and would like to have a keyboard shortcut to open a new Finder window, similarly to how Win + E opens the File Explorer in Windows.  I am aware that it is always open, but I'd like to get a key combination to open its window, or a new window, rather than clicking on the icon using mouse/trackpad.  Is there a handy way to do it?

Is there a default keyboard shortcut to start a new Finder window? If not, is there a way to assign one?  I tried System Preferences > Keyboard > Shortcuts > App Shortcuts and created a new item for Finder, and assigned shift-command ⌘-F, among other things, but nothing worked.


Problem: How many 5-digit numbers have distinct digits and are divisible by 3? My direction: I have tried to find all numbers with 5 digits that are divisible by 3 (30000 numbers) and then I will subtract from it numbers that do not have 5 distinct digits but I can't find it.

I'm solving a problem which asks me to find how many 5-digit numbers with distinct digits are there which are also divisible by $3$. I am familiar that there are $9\cdot9\cdot8\cdot7\cdot6=27216$ five-digit numbers with distinct digits. I know that a natural number $n$ is divisible by $3$ iff the digits sum up to a number divisible by $3$. Now, brute-forcing by a computer algorithm, i found that the result is $20928$. However, I am interested, if there is a mathematical solution for this. I know how to find amount of numbers divisible by $4$ or $5$. We just fix some amount on the last two (or last one) digit. But criterion for divisibility by $3$ is very different from those and I have no idea how to start. Eventually, I would like to find a general formula for $n$-digit numbers.  Edit: Equivallently we want to find how many solution does the equation $a+b+c+d+e=3k$ for $a,b,c,d,e\in\{0,1,2,...,9\}$, $a\neq 0$ also $a,b,c,d,e$ are all distinct and $k\in\mathbb{Z}$ (the highest possible $k$ is in this case $k=11$, the smallest being $k=5$)  Edit (2): According to the ideas from the answer. Make $A=\{0,3,6,9\},B=\{1,4,7\}, C=\{2,5,8\}$. Let's go through the cases that in the number $n$ there are $0,1,2,3,4$ digits from $A$.  i) Suppose none of $A$ is in $n$. We can't form a number divisible by three. We have to take 5 numbers, that is $3$ from $A$ and $2$ from $B$ or $2$ from $A$ and $3$ from $B$. None of the expressions $3(3k+1)+2(3k+2)$ and $2(3k+1)+3(3k+2)$ are divisible by three.  ii) Let $1$ digit from $A$ be in $n$. The amount of ways to choose the digit is $5$. Now we are left to choose $4$ digits. The only possible way is to choose $2$ from $A$ and $2$ from $B$. The amount of ways to do this is ${3\choose 2}^2=9$ which together gives $5\times 9$ ways which can be permuted and alltogether $5\times 9\times 5!=5400$ possible ways.  iii) Let $2$ digits from $A$ be in $n$. The amount of ways to choose the digit is ${5\choose 2}=10$. We are left with $3$ digits. Either all of them are from $A$ or all of them are from $B$. That's $2$ possible ways and all together $20$ possible ways which we permute to obtain $20\times 5!=2400$ possible ways.  iv) Let $3$ digits from $A$ be in $n$. The amount of ways to choose the digits from $A$ is ${5\choose 3}=10$. We are to choose $2$ digits. We must take exactly one from $B$ and exactly one from $C$. The amount of ways to do this is ${3\choose 1}^2=9$. Alltogether $9\times 10$ possible ways which we permute to get $90\cdot5!=10800$ possible ways  v) In the last case where all four digits from $A$ are present, there is no way how to make the number divisible by $3$.  Summing this all up gives $5400+2400+10800=18600$ which is less than what my algorithm yielded. We also have to subtract these which begin with $0$. Can anyone spot the mistake? (If i did any?)


how to enable mod_deflate in apache tomcat? My site pages are loading slowly.When tested on Google page speed it suggested enable compression i.e. set mod_deflate in apache tomcat.how to do it?

I am serving all content through apache with Content-Encoding: zip but that compresses on the fly.  A good amount of my content is static files on the disk.  I want to gzip the files beforehand rather than compressing them every time they are requested.  This is something that, I believe, mod_gzip did in Apache 1.x automatically, but just having the file with .gz next to it.  That's no longer the case with mod_deflate.


I am having an issue on my wife's MacBook Pro running OS X 10.10.5 (late 2012 13-inch retina). The hard drive is only 120 GB, but the "other" category in the About this Mac storage option is taking up over 81 GB. I've tried following a number of turorials online including cleaning up mail cache, downloads, browser cache, etc. to little avail.  My question is, is this expected? I feel like 81 GB for other storage is a bit excessive, but I can't find any files large enough to indicate this should be an issue (including browsing almost her entire user directory and looking at folder sizes).  Anything you could offer would help.

Every few days I get notices on my MacBook that it's running or run out of hard drive space. Curiously, restarting the computer will enable me to recover gigabytes of space (this past time, it was able to recover about 2.2GB). However, I can't identify anything in my personal activity that consumed that space.  It's possible that it's a rogue iTunes podcast or a huge software update that my Mac is automatically downloading - would either of these reclaim the space upon a restart?  One possibility that I can think of is that FileVault has some sort of disk leak, allocating but not freeing files. Does this make sense? Is there a tool that I can run to determine where this space is going? Assuming it is FileVault, should I try to disable it? What's the best way to turn of FileVault on a nearly full computer?


Base on the photos as shown, is it possible to apply the following modification/s and/or alteration/s:  a. replacement of wheels from 20" rear-18" front to 16" both rear and front.  b. installation of disc brake since the bike frame and fork is designed for rim brakes.  c. replacement of the "uncommon" rear suspension to a more common suspension easily found in shops.  The bike is an aluminum alloy.

I recently bought a bike with different tire sizes (20" rear and 18" front) now I want to replace both with a 16" tire is it possible? Also, the rear suspension mechanism is totally unknown to me even to the fellow whom I bought the bike from. Is it also replaceable because i want to change it Pardon my imbecilic queries guys, this is my very first bike :)


I want to create a SPF record for multiple subdomains, but I have no clue how to write a correct syntax. Since I am writing an application and it is not yet running live so I cannot yet test it.  But I have a number of subdomains e.g. : * api.myservice.com * booking.myservice.com * partner.myservice.com  I know how to make a record for a single domain. v=spf1 mx ptr a:server01.hosting.com mx:api.myservice.com ip4:123.12.12.14 ~all  But now I would like to add all three or more domains in the SPF record, what would be the syntax for that? Or can I simply add more PTR records? I have heard it is strongly disadvised.

I   that using multiple PTR records in a DNS configuration is not recommended.   However, the reasons are often vague, or not so obvious, naming:    "it can cause problems",  "can trigger bugs in programs expecting a single answer" : it's the software's problem then, isn't it?! "can make DNS answer packet too large" : isn't this fixed with ?   Are these good reasons? Do you know of any other (good) reasons? All this kinda looks like a "legacy fear"...


I'm little bit confused about JS's COM in SharePoint 2013 and disposing ClientContext object. As far as I can see from earlier versions of SP (2010 mainly) you had to dispose ClientContext and according to MSDN there is a method on this object called Dispose. However, when I'm trying to dispose ClientContext object, I got error that object doesn't have this method. Also, IntelliSense is not exposing it.  The question is - in SharePoint 2013 in client object model (used in JavaScript), do I have to dispose ClientContext (either initialized as new SP.ClientContext(url) or SP.ClientContext.get_current() ), and if I do, how and when?

Should objects be disposed when using the client object model?  If so, which ones?  There seems to be plenty of information on this for server side, but nothing from Microsoft specifically about client side.


$ sudo dpkg --force-architecture -i viber.deb dpkg: error: dpkg status database is locked by another process

I just wondered if somebody could tell me what this means:  E: dpkg was interrupted, you must manually run 'sudo dpkg --configure -a' to correct the problem. reidsr@ubuntu:~$ sudo dpkg --configure -a dpkg: error: dpkg status database is locked by another process reidsr@ubuntu:~$    How do I run sudo dpkg --configure -a  manually?


I am from Pakistan and like to apply for UK visitor visa with family of 4. While making seperate application at gov.uk, and filling financial detail for family, it is not possible to write N/A as it need numbers. I am confused how to find a solution for this issue. Waiting for your response, Regards,

We are sponsoring a family to visit us in UK as friends from Madagascar for two weeks. They have a 6 year old and a 16 month old.   Do the kids need their own visas, and are they the standard visitor visa or a special child visa?   Also, when I try and apply on the website I can only apply for one person so how do I apply for all the individuals in the family?   I have looked on the Immigration website and can't find the answers I need.


When using the Data Explorer for Stack Overflow, I've found some cases of answers having votes before their creation date. For example,  shows the first vote being made 2011-07-09, while the answer was created on 2011-07-10. My assumption is that this is because the Votes table does some sort of rounding on its columns (evidenced by the 00:00:00 timestamp), while the Posts table takes exact date times. Is there something else going on that I'm missing?

I was playing around with the Data Explorer and  that several posts have received votes before they were created:   have received up-votes, down-votes, and/or favorites before their creation date. About a third of these were just within a week before its creation, but most were several months before with the most extreme having three favorite counts dated 1328 days before its creation date.   exhibit being favorited before their creation date.   have been favorited before their creation date.   For all the sites I have tried running this query, I find posts like these. Curiously, only on Stack Overflow, a lot of posts have been up-voted and down-voted "before time" besides being favorited. Why do votes cast before the creation date of the post exist? Is it because of migration? If then, shouldn't the creation date be migrated properly as the vote cast dates are? Or is this a bug?


Consider the following problem:  Let $X = \{A_1, A_2, … , A_n\}$ be a set of distinct 3-elements subsets of $\{1,2, … ,36\}$ such that  $A_i$ and $A_j$ have non-empty intersection for every $i, j$;  The intersection of all the elements of X is the empty set.    Show that $n ≤ 100$.  How many such sets $X$ are there when $n = 100$?    From the solution, assuming that $A_1 = \{1, 2, 3\}$. Choose $A_{i_1}$, $A_{i_2}$, $A_{i_3}$ with $1$ not in $A_{i_1}$, $2$ not in $A_{i_2}$ and $3$ not in $A_{i_3}$. Suppose that $A_{i_1} = \{a_1, a_2, a_3\}$, $A_{i_2} = \{b_1, b_2, b_3\}$ and $A_{i_3} = \{c_1, c_2, c_3\}$. Every set in the collection $X$ has one of the following doubleton sets as a subset: $$\{1, a_1\}, \{1, a_2\}, \{1, a_3\}, \{2, b_1\}, \{2, b_2\}, \{2, b_3\}, \{3, c_1\}, \{3, c_2\}, \{3, c_3\},$$ and call this list of subsets $(t)$. I don’t understand the following part of the solution: To show that at least three different sets in the list $(t)$ are subsets of at least four sets in $X$. Suppose that at most two different sets in the list $(t)$ are subsets of at least four or more sets in $X$. Every set in $X$ contains at least one set in list $(t)$, so the total number of sets in $X$ is at most $34\cdot2+7\cdot3=89<100=|X|$.  Therefore, there are at least three different sets $P1, P2$ and $P3$ in the list $(t)$ which are subsets of at least four sets in $X$.

Let $X = \{A_1,A_2,... ,A_n\}$ be a set of distinct $3$-element subsets of $\{1, 2,... , 36\}$ such that  i) $A_i$ and $A_j$ have non-empty intersection for every $i,j$.  ii) The intersection of all the elements of $X$ is the empty set.  Show that $n ≤ 100$. How many such sets $X$ are there when $n = 100$?  Source:  BMO 2005 round 2 question.  Please help !! I am not even able to proceed with the question I tried to come up with a recurrence relation but its not working. I have only been able to figure out the number when 36 is replaced by 6, which is an easy thing to do


Low rep users can't see how many downvotes/upvotes a question or answer got, they can only see the total score.  Except they actually can. They can go to the poster's profile, click the reputation tab, and see downvotes and upvotes there.  This is a rather inconvenient and boring way to do it, but the information is available.  So if the information is available anyway, why not:  1. Give low-rep users the ability to see the ratio.  or  2. Prevent low-rep users from seeing the downvotes in the reputation tab of the profile.  If one of these was implemented, the system would be consistent.  Why is this information hidden from low-rep users on the question itself, but available if they go to the poster's profile?

Just curious, why is there a required privilege (especially one as high as 1000) to view vote counts for a post? It's not like someone can mess up a post by just viewing the vote counts. Is it just to give people incentive to reach 1000?


I was wondering if there is a phrase or word for this language technique. Virgil, and other classical poets use it quite a lot. For example      'three times she lifted herself on her elbow. Three times she fell back down...'

"Cannon to the right of them, Cannon to the left of them, Cannon in front of them."  Years ago, when I was introduced to "The Charge of the Light Brigade" (Tennyson, 1854) our teacher pointed out the repeated use of the word "cannon", like a refrain, was a figure of speech. He went on to give other examples, of which my mind retained only this:  Victory at all costs, victory in spite of all terror, victory however long and hard the road may be.   (, June 1940)


I have found my experience of Ubuntu too demanding, and want to re-install Windows Vista. However, the installation disc says I need NTFS. When I then click the reformat option, I get an Error Message :0x80004005. I have tried this Forum, but I don't understand Ubuntu terminology - I can't find my way round this OS. I've looked everywhere for DISC UTILITY to see if I can reformat the HDD from within Ubuntu, but I can't find it - it's not an option. Can anyone  help in terms I can understand??? I have a Windows installation disc, but it won't work for the reason given above.

I have absolutely no experience with Linux, and I desperately need to get my computer back up and running again with Windows.  How do I remove Ubuntu and reinstall Windows?    Editor's note: many of the answers are about removing Ubuntu from dual-boot but keeping Windows (which is a bit complicated), while other answers are about removing Ubuntu from single-boot (which is easy: basically just format the disk while installing Windows). The question as written is ambiguous between dual-boot or single-boot.


Whenever I move one of the objects in my scene, blender automatically re-renders the entire scene as if I had pressed the render button. How can I turn this off?

I don't know what setting I switched, or what happened, but for some reason now every time I move, scale or rotate an object in the 3d View - blender starts a render. I am not talking about the 3d View being in "Rendered" mode. I am talking about the same behavior as when you click the "Render" button (switch to image editor, begin full render). This is driving me crazy and I can't seem to figure out how to turn it off or what I did to start it. It happens whether I use the mouse or keys. If I open a new document the behavior goes away so it is probably a preference setting(?) If you can help, I will be eternally grateful.  Thanks in advance.


I am having trouble with the time-honored problem of ejecting 2 external hard drives (Seagate). Windows tells me that both of them have files in use. Handle shows me the following: PS blarg> handle64.exe -a -nobanner E:\ System             pid: 4      type: File          45C0: E:\$Extend\$RmMetadata\$TxfLog\$TxfLogContainer00000000000000000001 System             pid: 4      type: File          4B30: E:\$Extend\$RmMetadata\$Txf System             pid: 4      type: File          C77C: E:\$Extend\$RmMetadata\$TxfLog\$TxfLog.blf System             pid: 4      type: File          CF2C: E:\$Extend\$RmMetadata\$TxfLog\$TxfLogContainer00000000000000000002 svchost.exe        pid: 5584   type: File           270: E:\$Extend\$ObjId:$O:$INDEX_ALLOCATION svchost.exe        pid: 5584   type: File           29C: E:\System Volume Information\tracking.log  PS blarg> handle64.exe -a -nobanner I:\ System             pid: 4      type: File           488: I:\$Extend\$RmMetadata\$TxfLog\$TxfLog.blf System             pid: 4      type: File          B8D4: I:\$Extend\$RmMetadata\$TxfLog\$TxfLogContainer00000000000000000002 System             pid: 4      type: File          C2A8: I:\$Extend\$RmMetadata\$Txf System             pid: 4      type: File          D19C: I:\$Extend\$RmMetadata\$TxfLog\$TxfLogContainer00000000000000000001 svchost.exe        pid: 5584   type: File           1D0: I:\$Extend\$ObjId:$O:$INDEX_ALLOCATION svchost.exe        pid: 5584   type: File           2B4: I:\System Volume Information\tracking.log  Obviously shutting down the machine works but is annoying. I've tried closing everything in my system tray and turning off Windows Defender. I've tried looking for updated drive firmware but there doesn't seem to be any. Best I can tell the drives are not shared with the network. I've      there is a lot of noise. I've confirmed these drives aren't listed in my Start menu search indexable location. I'm in the process of turning off the checkbox Right Click -> General -> Allow files on this drive to have contents indexed in addition to file properties, and we'll see if that matters... I've noticed both of the drives have the following setting:  One forum post I found seemed to believe that with this setting, it makes sense that "Safely Remove Hardware" would give issues, since you don't need to use it with this setting. The answer would be to either use "Better Performance" & "Safely Remove..." OR use "Quick removal" & don't use "Safely Remove...". While that does sort of match the description above, that doesn't seem right to me. With my current setting, doesn't the failure message indicate that, despite the above setting, something is indeed using the drive? Any ideas what that might be? It looks like some sort of system file system management process to me, but I haven't seen anything conclusive.

I have an external HDD which I would like to "safely remove". Unfortunately, my system (Windows 7 x64) complains that "the device is currently in use".  Using  I discovered which process is holding a handle on the device:    Obviously, System is not a process that I can just kill and be done with it. I've done a bit of research and this , but no solution has been found so far (except for rebooting the machine, which I'd like to avoid if possible).  Is there any solution to this problem that I've missed?


I use \footcite command to add  my references and style=numeric and citestyle=authoryear in my document. So far everything is fine, besides I need to put the "year" field directly after the "author" field. I have tried different ways mentioned here, but either the style of footnote would be changed, or the style doesn't meet the requirement in references.  well, let the MWE talk:  \documentclass{article} \usepackage[%     backend=biber,     style=numeric,     citestyle=authoryear,     doi=true,     url=true     ]{biblatex}  \usepackage{filecontents}  \begin{filecontents}{test.bib}     @book{Foo,         title={Book title1},         author={Author1 AB},         year= {Year1},     }     @book{Bar,         title={Book title2},         author={Author2 AB},         year= {Year2},     } \end{filecontents}  \addbibresource{test.bib} \begin{document}  text\footcite{Foo}, and text\footcite{Bar}   %\nocite{*}  \printbibliography  \end{document}   So, how can I reorder the fields and keep the rest styles as they were?  p.s. The reason why I use authoryear style in the footnote is that the readers could have a rough idea about the citation when they are reading the paper in a print version. I have attached a screenshot blow:   If there is only a number like 1 or 2, like:    it wouldn't make much sense for the readers, would it?  Hope this could explain why I am trying to bring a little more info in the footnote about the citation.   Below a new MWE with an enumerate env added in the preamble (sorry, seems I don't have enough reputation to post more than 2 links...):  documentclass{article}  \usepackage[%         backend=biber,         style=authoryear,         %citestyle=authoryear,         labelnumber=true,         doi=true,         url=true         ]{biblatex}  \defbibenvironment{bibliography} {\enumerate{} %{\list{} {\printfield[labelnumberwidth]{labelnumber}} {\setlength{\leftmargin}{\bibhang}% \setlength{\itemindent}{-\leftmargin}% \setlength{\itemsep}{\bibitemsep}%     \setlength{\parsep}{\bibparsep}}} %\renewcommand*{\makelabel}[1]{\hss##1}} {\endenumerate} %{\endlist} {\item}  \usepackage{filecontents}  \begin{filecontents}{test.bib}     @book{Foo,         title={Book title1 whatever whatever whatever and tuff tuff         and gong gong},         author={Author1, AB and Author2, CD and Author3, EF},         year= {Year1},     }     @book{Bar,         title={Book title2},         author={Author2, AB},         year= {Year2},     } \end{filecontents}  \addbibresource{test.bib} \begin{document}  text\footcite{Foo}, and text\footcite{Bar}   %\nocite{*}  \printbibliography  \end{document}     Now I have a perfect footnote and numbered entries in references part, but how can I add a pair of square bracket to the numbers which exactly numeric style does?

I am having difficulties with setting up the layout of my bibliography. I would like to have a numeric style which does a none sorting so its order is as it appears in the text. Plus I would like my bibliography entry to look like this (so authoryear style):     References      [1] Surname, Y.G. Year. Title ...   I don't know what to do and can't come up with anymore keywords to look for it. I just started using biblatex.  My setup is as follows:  \documentclass[12pt,a4paper]{scrartcl} \usepackage[english]{babel} \usepackage[utf8]{inputenc} \usepackage{csquotes} \usepackage{textcomp} \usepackage{hyperref}  \usepackage[     backend=biber,     bibstyle=authoryear,     citestyle=numeric-comp     sorting=none, ]{biblatex}  \bibliography{mybib}  \begin{document}  Structures \cite{definition}  \newpage  \printbibliography  \end{document}


Probably a noob question, but I'd like some guidance on which RAID configuration is best in this server scenario. I am aware of and understand the different RAID configurations, but am after guidance in the use of RAID in a hypervised virtual machine configuration specifically.    Hardware is an older IBM x3650 with an IBM ServeRAID 8k hardware controller. There is 3x 300GB SAS drives and 2x 146GB SAS drives.  I wish to install the free VMware ESXi 6.0 hypervisor on the system and have just found out that I can't boot from USB flash drive.  So I'm gonna have to use one of the HDD's or RAID volumes to install the baremetal OS on. I'm only going to be running 2-3 VM Guests (most likely 2x Win Server 2012R2 Std's and maybe 1x Win7 Pro or Linux distro) for basic AD/DC redundancy and a RDS gateway.  Do I:   setup the 3x 300GB drives in RAID5 and the 2x 146GB drives in RAID1 setup the 3x 300GB drives in RAID1e and the 2x 146GB drives in RAID1 setup the 2x 300GB drives in RAID1, the 2x 14GB drives in RAID1 and assign the remaining 300GB drive as a global failover/hotspare leave the drives unassigned and do the RAID config using Windows Server software RAID (with the physical drives assigned to the guest)   Note that if the ESXi host allows it, I'll do a controller pass-through for the larger RAID volume for dedicated use on one of the Windows servers (which would allow me to possibly do #4 in the above list).  I'd prefer compatibility, reliability and redundancy over performance.  What I don't know, and the reason I'm asking this question, is the type of read/write (or I/O's) hypervised virtual machines will have which would lead to choosing the best RAID configuration for the drives I have listed.

This is a  about RAID levels.    What are:   the RAID levels typically used (including the RAID-Z family)?  deployments are they commonly found in? benefits and pitfalls of each?


I need to do a simulation of bottles stacked in a bin in blender, as shown here. After 114 frames, I get the result I want, but I want to define this state as frame 1, how do I set it?

Let's say I set up a Rigid Body simulation in Blender (not in GE), and then run the simulation for a number of frames. Is there a way to tell Blender to use the current state and position as the initial state? So that when I go back to frame 1, the rigid bodies stay in the same place they did in frame X.  For instance, if I want a pile of bricks, I first place the bricks in the air and then let them drop down on the ground, coming to rest. When they have come to rest, I want to use that position as the starting position.


I am not able to understand implication well. I can see If in $P \implies Q$, if Pis true and Q is false then implication is false. But i cannot understand other cases where it is taken as true. Is this just a convention ? or some underlying reasoning behind it  Thanks

Is it just for convenience that mathematicians define that false statements imply anything?  If yes, why it would be defined like this?


I truly don't know where to find this when I look it up under the search for settings it brings me to the general settings then leaves me there. I've tried to restart my iPhone but nothing seems to work and I've looked up numerous ways to try and fix it but I can seem to do it.

I have looked and looked and I can't find a solution. I need to get to the profiles and device management section on my ipad 3 but it is not under general. I tried searching for it in settings and it shows up as an option. I tap on it and it just opens General, where there is no option for profiles and device management. Please help, I already tried restarting the device.  How can I find it?


I am trying to write a basic piece of operator overloading code. However, I am getting a few errors which I cannot explain.  Header file:  class Overloading { public:     int number;     Overloading();     Overloading(int);     Overloading operator+(Overloading);     void vUselessoverloadFunction(); };   C++ code:  Overloading::Overloading() {}  Overloading::Overloading(int i) {     number = i; }  Overloading Overloading::operator+(Overloading Object2) {     Overloading NewObject;     NewObject.number = number + Object2.number;     return (NewObject); } void Overloading::vUselessoverloadFunction() {  Overloading ObjectOne(15); Overloading ObjectTwo(24); Overloading ObjectThree();  ObjectThree = ObjectOne+ObjectTwo; cout << ObjectOne.number << endl; cout << ObjectTwo.number << endl; cout << "Overloaded object value: " << ObjectThree.number << endl;  }   I am getting the following errors: On line ObjectThree = ObjectOne+ObjectTwo;:-Assignment of function 'Overloading ObjectThree()'  -Cannot convert 'Overloading' to 'Overloading()' in assignment  and on line cout << "Overloaded object value: " << ObjectThree.number << endl; -Request for member 'number' in 'ObjectThree', which is of non-class type 'Overloading()'. Any help would be greatly appreciated!

Is there any good reason that an empty set of round brackets (parentheses) isn't valid for calling the default constructor in C++?  MyObject  object;  // ok - default ctor MyObject  object(blah); // ok  MyObject  object();  // error   I seem to type "()" automatically everytime. Is there a good reason this isn't allowed?


I just have installed Koha on Ubuntu 16.4. But due to some reasons I have uninstalled it. Now I am trying to install it again but now it is telling E: unable to locate package. Please help.  Results of sudo apt update:  E: Could not get lock /var/lib/apt/lists/lock- open (11: Resources temporarily unavailable).  E: Unable to lock directory /var/lib/apt/lists/

I get this error when trying to use apt-get:  E: Could not get lock /var/lib/dpkg/lock - open (11 Resource temporarily unavailable) E: Unable to lock the administration directory (/var/lib/dpkg/) is another process using it?     How can I fix this?


I'm using terminator with Xubuntu 16.04. Unfortunately the terminal text does not highlight anything, when I used terminator on Linux Mint the username@computer: was highlighted in different colors and weight. Now its all plain text.

How can I get the bash to look colored like this?


I am on macOS Sierra 10.12.6  $ grep --version grep (BSD grep) 2.5.1-FreeBSD  $ ggrep --version ggrep (GNU grep) 3.1 Packaged by Homebrew Copyright (C) 2017 Free Software Foundation, Inc. License GPLv3+: GNU GPL version 3 or later <http://gnu.org/licenses/gpl.html>. This is free software: you are free to change and redistribute it. There is NO WARRANTY, to the extent permitted by law.     I am doing a set intersection:  BSD  $ grep -Fx --color -e '1' -e '21' <(echo 1; echo 21;) 1 # Where is the 21? Intersection of the same set should return the same set.  # -F for fixed strings # -x to match the whole line # --color just to make sure what was matched # two patterns '1' then '21'. Should be a logical OR of the two patterns # so a line matches if it matches either '1' or '21'   The input is the same as the two patterns. {1, 21}  If I flip the patterns on BSD, it works:  $ grep -Fx --color -e '21' -e '1' <(echo 1; echo 21;) 1 21     GNU  $ ggrep -Fx --color -e '1' -e '21' <(echo 1; echo 21;) 1  # works as expected 21     Is this a bug?

I am removing stop words from a text, roughly using this   I have the following  $ cat file file types extensions  $ cat stopwords i file types   grep -vwFf stopwords file  I am expecting the result: extensions  but I get the ( I think incorrect)  file extensions   It is as if the word file has been skipped in the stopwords file. Now here's the cool bit: if I modify the stopwords file, by changing the single word/letter i on the first line, to any other ascii letter apart from f, i, l, e, then the same grep command gives me a different and correct result of extensions.  What is going on here and how do I fix it?  I'm using grep (BSD grep) 2.5.1-FreeBSD on a Mac OSX GNU bash, version 4.4.12(1)


If $ X_1 , X_2 $ are independent RVs, then are ${X_1}^2 \,and\, {X_2}^2 $are independent?  P.S: this came up when i was working on the condition for which $Var({X_1 X_2})=Var({X_1}) Var({X_2})$  My Intuition says yes , but Covariance formula doesnt seem to work.

If X and Y are independent random variables both with the same mean (0) and variance, how about $X^2$ and $Y^2$? I tried calculating E($X^2Y^2$)-E($X^2$)E($Y^2$) but haven't been able to get anywhere.


Why are the commands ipconfig and ping not recognized in the command prompt on my windows 10 PC? How do I recognize this commands? Here you've a screenshot.  (Click on image to watch in full screen)

After having poorly handled the PATH system variable (resulting in deletion), I'm now looking to reinstate the variable with the original value. I found answers like  about Windows 8 and below, but not for Windows 10. I guess values are virtually identical, but I'd like to know the exact string so I'm not missing anything. EDIT: Also, Regedit tree have changed and I'm not able to locate the variable


I've seen several questions regarding this issue, but none of the answers work in LightningOut. When an event is fired from the VF page's javascript (VF page event to Lightning Component), it gives an error when it is fired more than once (I am sending changed param values): Event.setParams(): cannot modify all params in an event that has already been fired. : false -- also if I removed the setParams, it just says you can't fire it after it's already been fired. This is true for either APPLICATION or COMPONENT events. Any ideas how to get the event to be able to be fired more than once?

I am trying to fire the same lightning event from one component more than once. Is it possible to save the event in a variable and use it to fire?  I saw  question. It did not help.


Does a filament lamp still have resistance when no current flows?

By definition, a component has a resistance of $1\Omega$ if a potential difference of $1$V makes a current of $1$A flow through it. So I was a bit confused when I saw somewhere "a filament lamp has a resistance of $4\Omega$ when it carries no current."  How is it possible to define resistance if there is no current (and hence no potential difference, since $V=IR$)?


I have a list of arbitrary length, and I need to split it up into equal size chunks and operate on it. There are some obvious ways to do this, like keeping a counter and two lists, and when the second list fills up, add it to the first list and empty the second list for the next round of data, but this is potentially extremely expensive.  I was wondering if anyone had a good solution to this for lists of any length, e.g. using generators.  I was looking for something useful in itertools but I couldn't find anything obviously useful. Might've missed it, though.  Related question:


I've asked this question and even searched around but didn't get a useful answer for me.  Basically what im doing is i have a webserver on internal ip 192.168.0.100 port 80. So if im in the network it would be accessible if i type in 192.168.0.100/myportal/login.php  Ok no prob so far. Now, i would like for internal network users to access it via our public static ip which is 219.92.xx.xxx/myportal/login.php  If im outside of this network, no problem.i can access it. But how do i make it so that if im in the internal network, i can use the public ip?  now it's not practical because i have to use two different address depending on my network situation.  Why i want this? simple. because i want to buy a domain name and use it with my public ip which im hosting my own webserver. so now i cant access using public ip inside, i wont be able to use my domain later assigned to that ip.  for example, i wont be able to access it via www.vportal.com/myportal/login.php if im inside the network. so to conclude, it's not practical am i right? i would need to use internal ip when im inside. only can use domain,when im outside.  Now, im certain there is a way around this but i really hope someone can give me some idea or solution because i am NOT a network person. but i do know all the basics.   FYI, my setup is a simple setup which is modem and router.one server is using wired connection. my router is dlink dir615. now what can i do with what i got now?is it possible?  i've read about nat loopback but i know it's not possible for my situation. i really hope somebody can help and explain to me in layman's way. i really want to learn this.  thanks.

This is a  about Hairpin NAT (Loopback NAT).   The generic form of this question is:  We have a network with clients, a server, and a NAT Router. There is port forwarding on the router to the server so some of it's services are available externally. We have DNS pointing to the external IP. Local network clients fail to connect, but external work.   Why does this fail? How can I create a unified naming scheme (DNS names which work both locally and externally)?   This question has answeres merged from multiple other questions. They originally referenced FreeBSD, D-Link, Microtik, and other equipment. They're all trying to solve the same problem however.


. I am using windows 7 64 bit and want to install Ubuntu 12.04 LTS alongside windows 7   Please tell me how I can do that.

I would like to see a full how-to guide on how to install Ubuntu.


For one of my classes we just began using IntLinkedStacks, and I need to add a size() method that will count the size of my list. So, I began by creating an instance variable to define size, and then began coding. However, in my program, I keep getting a Null Exception Error. I read up what this error means, but could someone clarify what it means within this code, and why I am getting this error?  import java.util.EmptyStackException;  public class IntLinkedStack implements IntStack {    private Node top;    private int size;     public void push(int item) {       top = new Node(item, top);    }     public int pop() {       if (isEmpty()) {          throw new EmptyStackException();       }       int value = top.data;       top = top.next;       return value;    }     public boolean isEmpty() {       return top == null;       // return (size() == 0);    }     public int peek() {       if (isEmpty()) {          throw new EmptyStackException();       }       return top.data;    }     public int size() {       for(Node n = top; n.next != null; n = n.next)        size ++;       return size;    }     private static class Node {       private int data;       private Node next;        private Node(int data, Node next) {          this.data = data;          this.next = next;       }    }     public static void main(String[] args) {       IntStack s = new IntLinkedStack();       System.out.println("Size: " + s.size());       for (int i = 0; i < 5; i++) {          s.push(i*i);       }       System.out.println("Size: " + s.size());       while (!s.isEmpty()) {          System.out.print(s.pop() + " ");       }       System.out.println();       System.out.println("Size: " + s.size());    }  }

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?


Find the coefficient of $x^r$ in the expansion of $e^{e^x}$.  My Attempt:  $$e^{e^x}= 1+\dfrac {e^x}{1!} + \dfrac {(e^x)^{2}}{2!} + \dfrac  {(e^x)^{3}}{3!}+......$$  How to proceed further?

I need to find terms up to degree $5$ of $e^{e^{z}}$ at $z=0$.    I tried letting $\omega = e^{z} \approx 1+z+\frac{z^{2}}{2!}+\frac{z^{3}}{3!}+\cdots$, and then substituting these first few terms into the Taylor series expansion for $e^{z}$ as follows:     $e^{\omega} = \sum_{n=0}^{\infty}\frac{\omega^{n}}{n!} = 1 + \omega + \frac{\omega^{2}}{2!}+\frac{\omega^{3}}{3!}+\cdots = 1 + (1+z+\frac{z^{2}}{2!}+\frac{z^{3}}{3!}+\frac{z^{4}}{4!}+\cdots) + \frac{1}{2}\left(1+z+\frac{z^{2}}{2!}+\frac{z^{3}}{3!}+\frac{z^{4}}{4!}+\cdots \right)^{2}+ \frac{1}{3!}\left( 1+z+\frac{z^{2}}{2!}+\frac{z^{3}}{3!}+\frac{z^{4}}{4!}+\cdots\right)^{3}+\cdots$   But, then when I try to multiply this all out (using Maple), I find that going even further out than I have here, the terms of degree $\leq 5$ do not terminate. So, then I tried putting the command into Maple, and it came out to be something long and horrible with $e$ coefficients for each term.  I must be missing something here.  Could somebody please tell me how to finish this problem? I would ask for a complete solution, not hints or leading questions. I've been working on this for hours and am beyond frustrated. The most edifying thing for me at this point would be to see the correct, full way it's supposed to be done, work backwards, take it apart, and then be able to apply it to other situations.  Thank you.


For some reason, the PCB is not showing net names on the pads  I have all connections (rats nests) visible I have checked the "Show Pad Nets" and "Show Via Nets" under the View Configurations > View Options Panel  I have checked layer colors and everything is on  What other setting might there be which is preventing the net names from displaying within the pads/vias on the PCB layout?  I am running AD15 on Windows 8.1 and this is really bugging me!   This is an example screen shot of the PCB environment, you can see that despite the option for "show pad nets" being enabled, they are not showing.   Thanks for the help  This question is not the same as another related question "Show Pads with their Name on PCB altium " which discussed adding silkscreen designators. It is about why the Altium feature "show pad nets" does not seem to be working to show the 'virtual' net names in the PCB tool within the pads

I have imported a schematic in PCB and placed components. But one thing is missing, its not showing pads names as they are appearing in schematic. It can only show Designator and Comments of component in PCB but not the pads name.   How can I make them appear ?  Thank you  Added screenshot, how to do like this. Like 1 appearing next to pin 1, 2 appearing next to pin 2. But when I add a header, nothing appears, only the entire component designator appears.


I am newbie. I upgraded from 12.04 to 12.10 using "sudo do-release-upgrade -d". Now, I am not able to get the system to boot up.  Is there a way of reversing this and re-installing 12.04?  Kindly help.

I just installed a new version of Ubuntu and I want to roll it back to the previous version.  How can I do that? Is that even possible?


Why is the compiler showing undefined control sequence for the below code: Note that I have already given the preamble of \usepackage{amsmath}     A Hoheisel Algebra is a core structure with $R=\mathbb{C}\ \ S=\mathbb{R}$, $A$ a commutative algebra, $B$ finite with $\beta_{iiH0}\in\mathbb{R}_{\ge0}\forall i\in I$.   Any hints? Thanks beforehand.

I am using WinEdt 6 for compiling my TeX documents. I am getting an error with contains the line $\mathbb{Z}$ showing that it is undefined control sequence. How should I rectify it? Should I include any math packages or something. I am a beginner in using TeX.


I'm trying to insert a C++ code inside a LaTeX document. As in the object, I'm trying to use accent vowels, but I'm not able to add them especially in the comment section. Here's main.tex: \documentclass[a4paper, 12pt, italian]{article} \usepackage[italian]{babel} \selectlanguage{italian} \usepackage[T1]{fontenc} \usepackage[utf8]{inputenc} \usepackage{listings} \usepackage{xcolor}  \definecolor{codegreen}{rgb}{0,0.6,0} \definecolor{codegray}{rgb}{0.5,0.5,0.5} \definecolor{codepurple}{rgb}{0.58,0,0.82} \definecolor{backcolour}{rgb}{0.95,0.95,0.92}  \lstdefinestyle{mystyle}{     backgroundcolor=\color{backcolour},        commentstyle=\color{codegreen},     keywordstyle=\color{magenta},     numberstyle=\tiny\color{codegray},     stringstyle=\color{codepurple},     basicstyle=\ttfamily\footnotesize,     breakatwhitespace=false,              breaklines=true,                      captionpos=b,                         keepspaces=true,                      numbers=left,                         numbersep=5pt,                       showspaces=false,                     showstringspaces=false,     showtabs=false,                       tabsize=2 }  \lstset{style=mystyle}  \title{Casi d'uso: Prove Induttive} \author{Luca Polese} \date{December 2020}  \begin{document}  \maketitle  \section{Prime Prove Induttive} \subsection{Casi semplici} Esempio:  \lstinputlisting[language= C++]{prova1.cpp} \end{document}  Here is prova1.cpp: /**  * Questo esempio deve considerare il caso in cui la lista   * sia già vuota in partenza.  * Lo stessa varrebbe se cominciassi con un array pieno e mi   * ritrovassi ad un certo punto con un array vuoto, poichè    * la ricerca è fallita  */   //PRE: (dim>=0, A[0...dim-1] è definito) bool presente(int*A, int dim, int z){     ... } //POST: (restituisce true sse A[0...dim-1] contiene z)  I'm using OverLeaf and the result is something like this:  As you can see, all the accented vowels are missing. I hope you can help me Thanks in advice.

I'm having some problems with listings and UTF-8 in my document. Maybe someone can help me? Some characters work, like é and ó, but á and others appear at the beginning of words...  \documentclass[12pt,a4paper]{scrbook} \KOMAoptions{twoside=false,open=any,chapterprefix=on,parskip=full,fontsize=14pt}  \usepackage[portuguese]{babel} \usepackage[utf8]{inputenc} \usepackage[T1]{fontenc} \usepackage{listingsutf8}  \usepackage{inconsolata} \lstset{     language=bash, %% Troque para PHP, C, Java, etc... bash é o padrão     basicstyle=\ttfamily\small,     numberstyle=\footnotesize,     numbers=left,     backgroundcolor=\color{gray!10},     frame=single,     tabsize=2,     rulecolor=\color{black!30},     title=\lstname,     escapeinside={\%*}{*)},     breaklines=true,     breakatwhitespace=true,     framextopmargin=2pt,     framexbottommargin=2pt,     extendedchars=false,     inputencoding=utf8 }  \begin{document} \begin{lstlisting} <?php  echo 'Olá mundo!'; print 'Olá mundo!'; \end{lstlisting}  \end{document} \end{lstlisting}


This might be rather elementary. I have put it  for a while without getting any answers.   Here is the question: In the proof of the following theorem, would anyone explain how the general case (when $(\Omega,\Sigma,\mu)$ "$\sigma$-finite") can be deduced from the proved "finite" case?

I am reading a theorem about measurability of vector-valued functions in a note on functional analysis:     Theorem 3.6.1. If $X$ is a separable, metrizable locally convex space, $(\Omega, \Sigma, \mu)$ is a $\sigma$-finite measure space, and $f : \Omega \to X$ is weakly measurable, then $f$ is strongly measurable.   The proof begins     We can restrict ourselves to the case of finite measures.   Could somebody explain how the general case (when $(\Omega,\Sigma,\mu)$ is "$\sigma$-finite") can be deduced from the "finite" case?    For completeness, here are some definitions. Let $( \Omega, \Sigma, \mu )$ be a measure space, let $X$ be a Hausdorff locally convex space, and let $f : \Omega \to X$. We say that   $f$ is measurable if $f^{-1} (G) \in \Sigma$ for every open set $G \subset X$. $f$ is weakly measurable if $\varphi \circ f$ is measurable for every $\varphi \in X^*$. $f$ is strongly measurable if there exist simple functions $f_n : \Omega \to X$ such that $f(\omega) = \lim_{n \to \infty} f_n(\omega)$ for $\mu$-almost every $\omega \in \Omega$. (A simple function is a measurable function which takes only finitely many values.)   An image of proof, and surrounding definitions, can be seen .


For $a<b$, prove that every block of $b$ consecutive naturals, there are two distinct naturals whose product is divisible by $ab$. [I believe I can do this: see below]  Now, for $a<b<c$, is it true that in every block of $c$ consecutive naturals there are three distinct naturals whose product is divisible by $abc$?  Informal attempt for part 1: In $b$ consecutive integers there must be a multiple of $a$ and a multiple of $b$, since $a<b$. If they are the same, I've shown that you can select the next multiple of $a$ in the block and thus we have a product divisible by $ab$. EDIT: there isn't necessarily another multiple of $a$ but I can now show a multiple of $gcd(a,b)$.   Please answer both parts of the question, if you would like to, and certainly criticise my informal attempt where necessary. I am more interested in the second part however: my friend who gave this to me was ambiguous about whether it's actually true, so possibly I actually need to prove it's false.   I have noticed this question has been asked before, but one of the questions was abandoned because the questioner was rude, and for the other, no answer was actually reached, so I was hoping another attempt might be made.  Thank you very much for your consideration.

I have solved the simpler case of this question (with just $a$ and $b$ and a $b$ length block), but no answer on this site has ever properly answered the generalisation:  Let $a,b,c \in \Bbb{N}.\space $Suppose $a<b<c$. Does every block of $c$ consecutive naturals contain three distinct naturals whose product is divisible by $abc$?  I would be very grateful for any help.


I tried this example in $S_3$ and saw that this held but I couldn't figure out how to prove it for all $S_n$. Any help would be appreciated.

I have heard that two permutations are conjugate if they have the same cyclic structure. Is there an intuitive way to understand why this is?


Has the Marvel Universe ever crossed over with DC Universe in any books, comics, cartoons or movies?  I mean did any character or event, maybe idea or location slip from one universe to the other?  I often see art where DC characters fight, talk, drink, play, etc. with characters from Marvel.

The  (the character from Guardians of the Galaxy) says that she has appeared in both Marvel comics as Mantis and DC comics as Willow because her creator "took her with him".     After leaving Marvel Comics, writer Steve Englehart carried Mantis' tale through two other companies before returning to Marvel. In DC Comics' Justice League of America #142, she appears as Willow. Asked where she came from, Willow replies, "This one has come from a place she must not name, to reach a place no man must know." (Mantis refers to herself as "this one").   Are there any other examples of a character appearing in both Marvel and DC comics?  Especially if it's because the original creator has switched companies but still wants to utilize the same character, even under a different name?


In a calculus book that I'm reading, there is a problem as follows:  Prove that this sequence $x_n=\left(1+\dfrac{1}{2}\right)\left(1+\dfrac{1}{4}\right)...\left(1+\dfrac{1}{2^n}\right)$ is monotonic, bounded and then converges.  I can prove that this sequence is increasing, but I found no way to find the upper bound for $x_n$. Please give me some hint to find the upper bound, and may be the limit of this sequence also. Thanks

I'm asked to prove the convergence of the sequence $$X_n=\left(1+\frac12\right)\left(1+\frac14\right)\left(1+\frac18\right)\cdots\left(1+\frac{1}{2^n}\right)$$   I proved that it is increasing through the ratio test and then I want to prove that it is bounded.  My question is the following : is it enough to say that $X_n<\left(\frac32\right)^n$ for $n>1$ or not ? Namely, can we say that a sequence is bounded if $\forall$  $n$ ,  $\exists$ a $N$ such that $X_n<N$ or do I have to find a N such that $\forall$  $n$ , $X_n<N$?  In other words, can a bound depend on $n$ ?  Thanks for your help.


In a transformer, the ratio of voltages is equal to the ratio of the number of windings on each coil. So in theory, a transformer with 1 and 10 windings should be equal to one with 10 and 100 windings. Most transformers then should be able to be reduced to have one coil with only 1 (or at least, very close to 1) winding.  I would think this would be beneficial, because less wire means less resistance. Why, then, do many transformers have many windings on both coils? (my experience mostly comes from taking apart TVs and microwaves. I don't know if this is still true for power grid transformers)

Transformers have hundreds of turns on both the secondary and primary winding, and as a result use very thin copper wires for each.  But, why do they not just use fewer turns on each winding and get the same voltage ratio?   More importantly, why not use fewer turns of a thicker wire for an increased VA? (instead of 1000:100 turns of 22 awg wire, why not 100:10 turns of 16 awg wire if this would increase VA)


This message appears:  No interface can be used for capturing in this system with the current configuration.  (couldn't run /usr/bin/dumpcap in child process: permission denied)   Tell me how to avoid it.

I'm using Ubuntu 13.04.  Wireshark won't show me any logs, won't function at all. I'm connected to my WiFi,  Belkin router.


I'm coding a real-time graphics application in C++, so efficiency is very important. Now I always wondered how expensive is a function call itself? (for instance a function that has zero parameters)  I currently have this big function I wrote that can either be very long in code because I tried to avoid as many "helper function" calls as I could, or be much shorter and easier to read but includes many helper function calls.  I must note that this "big function" may be called hundreds and or even thousands of times per second.

Compared to    Simple memory access Disk access Memory access on another computer(on the same network) Disk access on another computer(on the same network)   in C++ on windows.


I've been trying to get this to work for days on end. I've reset my computer, redownloaded this update KB2592687 and waited hours for it to update. Does anyone know a way I can get past the "windows Update Standalone Installer" portion of the process? And if you could be as detailed as humanly possible about it, i'd appreciate that a lot. Since most tutorials tend to not be very specific with how I do everything and where I go to do these things.  Edit: also i already have Service Pack 1

I am attempting to install two hotfixes manually from Microsoft - one addresses the svchost.exe extreme memory usage problem, and the other addresses the slow Windows Update problem.  This system is a freshly installed Windows 7, and I have the two MSU updates saved locally to my desktop, but it is never actually finding such updates, and therefore never actually installs the two fixes.  Is there a way to force Windows Update Standalone Installer to just install the single update and not look for all the updates?


Given  \usepackage{caption} \usepackage{subcaption} \usepackage{cleveref} \crefname{subfigure}{figure}{figures} \Crefname{subfigure}{Figure}{Figures}  \begin{figure}[h] \centering \begin{subfigure}{.5\textwidth} \label{abc} \caption{..} \centering \begin{tikzpicture}[scale=1] \node at (0,1) {$d_1=1$}; \end{tikzpicture} \end{subfigure}% \begin{subfigure}{.5\textwidth} \subcaption{...} \label{...} \centering \begin{tikzpicture}[scale=1] \node at (0,1) {$d_1=1$}; \end{tikzpicture} \end{subfigure} \caption{...} \end{figure}   why does the command \cref{abc} not produce something like figure 2.a, but instead gives the name of the section ?

\documentclass{article} \usepackage{algorithm}  \begin{document} \setcounter{section}{54} \section{A section with no label} \begin{algorithm} \label{myalg} \caption{An algorithm with the label `myalg'.} \end{algorithm} Reference to myalg: \ref{myalg}. \end{document}   With this code, the reference givens 55 (the section number); if I move the label after the caption command, I get the correct reference (1).  Why should this be the case? I find it confusing: when thinking about an algorithm as an environment, you expect to be able to label it right after you began it. At the very least I would expect some kind of error or "??" to appear, rather than the previous environment or reference-able entity being used.


Can anyone explain what's wrong with this?

What is wrong with this proof?    Is $\pi=4?$


I want to create/draw a front page of a document and therefore I want to draw a line from one corner of the Page to another. Ok in the final version I want to implement some control points. But up until now I can´t get the drawing to work when I use "page coordinates" instead of points...  \documentclass{article} \usepackage[english]{babel} \usepackage{graphicx} \usepackage{tikz,xcolor}  \usetikzlibrary{shadows}      \begin{document} \thispagestyle{empty}  \begin{tikzpicture}[remember picture,overlay]     \coordinate (A) at (current page.north east, current page.north east);     \coordinate (B) at (current page.north, current page.south);     \draw[line width=1.5pt]%, cap=round]     (A) -- (B) \end{tikzpicture}  \end{document}

Consider the following:  Let's say I have a dot. I would like to be able to position this dot anywhere on the page: at the corner, in the middle, anywhere.  So far, despite poring over manuals and experimenting, I can not figure out how to do this. It seems logical that there would be some system that would place a conceptual grid on the page and then allow for an exact placement within that grid.  I'm sure it exists, but I can't seem to find it.  I can make the dot, and all sorts of other shapes, but I just don't seem to have any control over where these shapes appear on the page.  I'm sure this is an obvious question and I have overlooked something.


Physics theory posits, and observations confirm time dilation for reference frames.  In physics, this phenomenon is often described:     Moving clocks run slow.   Shouldn't it be slowly?  "Drive safe!" is clearly wrong to me: as the adverb/verb pairing is unquestionable.  But the above has two verbs, and despite my instincts telling me it should be "slowly" the overwhelming appearances of the "... run slow." in print leads me to question it here.

When someone is going to drive their car somewhere, I always used to say "drive safely" to them. Recently I was told I should say "drive safe."    (From: )   Which one is correct?  Similarly, is "do good" correct?


Why inside Main.class to instantiate a Foo class(its inner class) I have to specify it with static keyword but if I make this class as outer it is possible without 'static'?  public class Main {      public static void main(String[] args) {         Foo foo = new Foo();     }  //    class Foo { // to make it work I have to add 'static' //    } }   But if Foo.class is not Inner class of Main.class it works.  public class Main {      public static void main(String[] args) {         Foo foo = new Foo();     }  }  class Foo { }

What is the main difference between an inner class and a static nested class in Java? Does design / implementation play a role in choosing one of these?


I know that u is a continuous function where   $$u(x_0) $$ is equal to the average over the surface of all balls centered at a point $x_0$.  How would I show that this function is harmonic, or approach this problem. Would I find a harmonic function $f$ which is equal to $u$ on the boundary and just do something with the strong maximum principle?

It is fairly easy to show that harmonic functions satisfy the mean value property, but it seems harder to show the converse. I've seen the following theorem without proof:     If $u \in C(\Omega)$ satisfies $$u(z) = \frac{1}{|\partial  B_r(z)|}\int_{\partial B_r(z)} u\,dS$$ for all $z \in \Omega$ and   $B_r(z) \subset \Omega$, then $u \in C^\infty$ and $u$ is harmonic on   $\Omega$.   When I try to prove it myself, I got stuck. Could anyone kindly show me how to prove this? Thanks.


I have the following assignment:     Given a square with side length equal $1$, find a set of lines connecting four vertices of this square. Sum length of the lines should be $\le 2.735$.   I think I could use some generalization of Fermat triangle problem, but I couldn't find any interesting material on generalizing it for more points. Also, I cannot just divide square into two triangles because it gives path longer than $2\sqrt2$ in any case.  Is there any theory that could be helpful in my case?

I have four cities in $A=(0,0),B=(1,0),C=(1,1),D=(0,1)$. I am asked to build the shortest motorway to connect the cities. How can I do that?  I was thinking that first I need some compactness argument to prove that there really is the shortest way to connect cities. Or if one can prove that one can travel via finitely many line segments, the existence of minimal way migth be possible to prove via some olympiad-level inequalities.  Then I think I need to find points $E,F$ such that $\angle AEB=\angle CFD=120^\circ$. But I think it is difficult to prove that such a configuration is really a minimal.  Could anyone give hints/solution how to fill the details?  Bonus: Has anyone generalized this problem to $n$ cities in a regular $n$-gon?


I have seen in many applications as, user defined interfaces will be defined and then their respective implementation classes are available.  Then again we will call those implementation classes methods from interface level.  We we are following this approach? is there any significant idea behind this?  why can't we go with direct classes implantation without interfaces?   Thank you so much in advance, if some one elaborate this clearly.

I have seen this mentioned a few times and I am not clear on what it means. When and why would you do this?   I know what interfaces do, but the fact I am not clear on this makes me think I am missing out on using them correctly.   Is it just so if you were to do:  IInterface classRef = new ObjectWhatever()   You could use any class that implements IInterface? When would you need to do that? The only thing I can think of is if you have a method and you are unsure of what object will be passed except for it implementing IInterface. I cannot think how often you would need to do that.   Also, how could you write a method that takes in an object that implements an interface? Is that possible?