Evaluate $$\lim_{n\to \infty}\frac{n+n^2+n^3+....+n^n}{1^n+2^n+3^n+....+n^n}$$  My Attempt  Was able to write as $$\lim_{n\to \infty}\frac{\frac{n^n-1}{n-1}}{n^n(\frac{1}{n})\sum_{r=1}^n\left(\frac{r}{n}\right)^n}$$  But not sure how to take it further though the denominator appears to be Riemann Sum

What is the limit of:  $$\lim_{n\to \infty} \frac{n^1+\dots+n^n}{1^n+\dots+n^n} = ?$$  I did some computation with big numbers, I guess it is in the interval $\left(\frac{1}{2},1\right)$.


How do I delete the four diagonal edges (the 1414mm ones) so I can have one continuous face rather than four?  I pressed X  and tried Dissolve Edge and Edge Collapse but none works without messing up the model.  I tried Limited Dissolve but it only allows me to delete up to two edges not all four.

So, I'm working on a control station that has buttons. It is a one-mesh creation, that means, I don't want to create buttons and things like that separated from the main mesh, but as you can see, I have problems. I would like to make the highlighted parts to be one with the main part around them. I've tried everything, and I have this problem on multiple creations. Any idea?  Update: I've added another example of the problem. I want them to be one face, instead of two. (2nd picture)


Hi I'm a US Citizen with a student visa for the Netherlands that expires December 1st. If I leave the Schengen zone November 30th (day before my student visa expires), to visit the Morocco (Non-Schengen country), can I re-enter the Schengen zone (Italy) still my student visa will be expired (December 3rd) and start as a tourist visit (tourist visa for 90 days)?  I know I can re-enter as a tourist back in the Netherlands but I wanted to take a post graduation trip to Italy and I'm using Morocco as my "layover" 72 hours out of Schengen zone.

I am an American citizen living in Poland for 6 months.  I arrived in Poland on February 1, 2016 without a Visa. The count toward my Schengen days began. I received my Work Visa for Poland on April 7, 2016.  The work visa expires on July 7th. I intend to stay in Poland until July 30, 2016 (which is 180 days after I entered on February 1)  My question is, do the days that I am on a Work Visa count toward my "90 days within a 180 day period" as a tourist?  And when my work visa expires on July 7th, will I be able to remain in Poland until July 30?  February 1 -> April 7 = 66 days July 7 -> July 30 = 23 days Total days as a tourist = 89 days


I understand that one is a noun and one is a verb. But is it correct to say "There is no band practice today" or "There is no band practise today"  UPDATE: I am not asking for the correct spelling of the word "practice" or "practise". The dictionary definition is clear. I am asking which usage is correct in this example sentence.

I'm rather confused as to whether you say I have a practise amp or I have a practice amp when referring to an amplifier that you use to practise your guitar playing.  I understand that the verb form is -se, but I also wonder whether "practice amp" is correct as it's a compound noun.  Any help and clarification would be gratefully received.


I came across a riddle and I wanted to do know if I solved it correctly:     If we write every natural number next to each other:   Example: $012345678910111213\cdots$   What is the digit at position $10000$?   My attempt: Left side is the amount numbers and right side is the digit size of the number: $$10 \qquad 1$$ $$90 \qquad 2$$ $$900\qquad 3$$ $$1777.5\qquad 4$$  Now we have $10000=10\cdot 1 + 90\cdot 2+900 \cdot 3+1777.5 \cdot4$  So it should be the second or third digit of $999+1778=2777$  is this correct? And is it possible to write a closed formula to get a specific position?

What's the $n$-th digit in the sequence $S$ of numbers formed by the natural numbers, i.e.,  $n$-th digit in the sequence 1 2 3 4 5 6 7 8 9 10 11 12... ? For example 11th digit in the sequence is 0.


I'm trying to convert a string to a SolidColorBrush in C#. The code I'm using is:  arrColors[arrColors.Length - 1] =                           (SolidColorBrush)new BrushConverter().ConvertFromString(sLine);   where sLine is a string read from a text file. For example, sLine might be "Black".  This code gives me a FormatException.

I have a configuration file where a developer can specify a text color by passing in a string:   <text value="Hello, World" color="Red"/>   Rather than have a gigantic switch statement look for all of the possible colors, it'd be nice to just use the properties in the class System.Drawing.Brushes instead so internally I can say something like:   Brush color = Brushes.Black;   // Default   // later on...  this.color = (Brush)Enum.Parse(typeof(Brush), prasedValue("color"));   Except that the values in Brush/Brushes aren't enums.  So Enum.Parse gives me no joy.  Suggestions?


A remote router is accessible via SSH: 16.04 scp copies files back and forth from the command line.  ASUSWRT-Merlin RT-AC68U 384.7-2 Sun Oct 21 17:18:03 UTC 2018  USER@router:/tmp/home/root#    # uname -a  Linux RT-AC68U-3D90 2.6.36.4brcmarm #1 SMP PREEMPT Sun Oct 21 13:27:49 EDT 2018 armv7l ASUSWRT-Merlin   sftp does not seem to work from the command line:  sftp user@monkeybusiness.com  user@monkeybusiness.com's password:  sh: /opt/libexec/sftp-server: not found Connection closed   I would like to use a GUI (Filezilla, Krusader, Nautilus), however I have not yet met with success with this trio.    This , however the error received is:  Error: The directory ... does not exist:     QUESTION  What else can be done configure Krusader to access the router and SCP (not SFTP) files?

I'm trying to edit a file from a remote computer connected via ssh. How can I open the remote file on my local computer to edit?


Just reinstalled Windows 7 pro and Ubuntu is no longer accessible from the windows boot manager as it was before.How do I re-enable booting into Ubuntu?  Thank you.

I installed Windows 7, which ate Ubuntu's boot file. When starting up the computer, it now goes straight to Windows, without giving me the option of booting Ubuntu.   How can I get Ubuntu back?


I mixed kali linux source list with my ubuntu sources list and tried updating ubuntu and full upgrading it. After a reboot now I am facing some problems I can not login every thing is mixed up, how can I go back to my ubuntu.

I tried installing Kali Linux tools.  I started installing some tools and there were several things I had to "agree" to and one message said add users... something in terminal, and when I came back I saw terminal reporting removing a bunch of core programs that I needed. I canceled the process but I don't know if I should reinstall Ubuntu or not.  How can I repair my system?


I am using a description environment, and one of my labels is very long  \begin{description} \item[A very long label that I would like to wrap rather than overrunning the right margin as it currently does. If it helps I am using the enumitem package, and a solution that depends on it is acceptable.] \leavevmode Text following long label. \end{description}   Is there a way to cause the text on the \item to wrap? I'm alrady using enumitem, so a fix that requires it is fine. Thanks.

In my document I have a description environment. One of the titles in the description is too long to fit in one line and I want to break it. I know this is a bad styling but I can't think of any way to shorten it. I tried \\ and \newline and they didn't work. What else can I do?  I tried to use the mdwlist package. I added the following in the begining of my document:  \renewenvironment{description}{   \begin{basedescript}{%     \renewcommand{\makelabel}[1]{\bfseries##1}%   } }{%   \desclabelstyle{\multilinelabel}    \end{basedescript}%  }   but all I got is the same result.  I also tried this without any effect:  \renewenvironment{description}{   \desclabelstyle{\multilinelabel}   \begin{basedescript}{%     \renewcommand{\makelabel}[1]{\bfseries##1}%   } }{%   \end{basedescript}% }   I can't use the \multilinelabel since the words in the label are too long, thus, I want to use \pushlabel. However, this doesn't work even in the example you given (probably, it doesn't know how to break lines). Is there any way to force break lines?


We have a custom java web app. We are setting it up in instances in different vps (different providers, different locations).Each instance is independent and self contained. We have several docens of this instances and will continue to add them.   For example:  Instance 1: http://server1/app1 Instance 2: http://server1/app2 Instance 3: http://server2/app3   Currently, we are  mapping the subdomain using A records in the DNS of myapp. Then the server uses apache reverse proxy to map it to the app.   client1.myapp.com  > server1 >> http://server1/app1 client2.myapp.com  > server1 >> http://server1/app2 client3.myapp.com  > server2 >> http://server2/app3 clientN.myapp.com  > servern >> http://anyserver/appN   What is the difference or benefit of using a reverse proxy server?  For example:  client1.myapp.com  > proxyserver >> http://server1/app1 client2.myapp.com  > proxyserver >> http://server1/app2 client3.myapp.com  > proxyserver >> http://server2/app3 clientN.myapp.com  > proxyserver >> http://anyserver/appN   Are there any perfomance issues of using the proxy instead of the DNS records? As i see it all the request would go to the proxy server instead of going drectly to the server  thanks for your time

We have a custom java web app. We are setting it up in instances in different vps (different providers, different locations). We have for example:  Instance 1: http://server1/app1 Instance 2: http://server1/app2 Instance 3: http://server2/app3   Each instance is independent and self contained. We have several docens of this instances and will continue to add them.   My question is regarding the dns managment, as we want to map different subdomains to the instances.   client1.mypp.com  > http://server1/app1 client2.mypp.com  > http://server1/app2 client3.mypp.com  > http://server2/app3  clientN.mypp.com  > http://anyserver/appN   Right now we are adding the A records manually to the DNS records to relate subdomain to the ip. We will develop some code to do it using the API of the DNS provider.   Is this the most appropiate aproach? Should we use some kind of proxy instead? We expect to have thousands of isntances accros different servers. I am interested in perfomance and availability.


I run lsb_release -a  Output:     No LSB modules are available. Distributor ID: Ubuntu Description:    Ubuntu 12.04.4 LTS Release:    12.04 Codename:   precise     I run:   nano /etc/apt/sources.list  Output:  deb mirror://mirrors.ubuntu.com/mirrors.txt precise main universe deb mirror://mirrors.ubuntu.com/mirrors.txt precise main-updates universe multiverse deb mirror://mirrors.ubuntu.com/mirrors.txt precise main-backports universe multiverse deb mirror://mirrors.ubuntu.com/mirrors.txt precise main-security universe multiverse   I run sudo apt-get update  Outuput:  Hit http://ftp.oleane.net/ubuntu/ precise Release.gpg Hit http://ftp.oleane.net/ubuntu/ precise Release Hit http://ftp.oleane.net/ubuntu/ precise/main i386 Packages Hit http://ftp.oleane.net/ubuntu/ precise/universe i386 Packages W: Failed to fetch mirror://mirrors.ubuntu.com/mirrors.txt/dists/precise/Release  Unable to find expected entry 'main-updates/binary-i386/Packages' in Release file (Wrong sources.list entry or malformed file)  E: Some index files failed to download. They have been ignored, or old ones used instead.

I have unistalled and reinstalled the Ubuntu Software Center as per info I found in a similar thread and I got the same response about line 91 or something like that.  I just tried to upload a screen shot but since I'm new it won't allow me to.  I also can not figure out how to cut and paste anything so I have to hand type what the error screen says, both when I attempt to open the software center and nothing happens, when I try to enter commands into the terminal to uninstall, reinstall, whatever I get the same following:  COULD NOT INTITIALIZE THE PACKAGE INFORMATION An unresolvable problem occured while initializing the package information Please report t:his bug against the 'update-manager' package and include the following error message: 'E: Malformed line 91 in source list/etc/apt/sources.list (dist parse)  E: The list of sources could not be read.,  E: The package list of status file could not be parsed or opened.   How do I report bugs?  What can be done about this.  I have searched and everything everyone says to do leads me back to the same line error message.  So, I don't know how to get to line 91 in the source list; to tell you what it says. Sorry, I'm really new to this. That is what I need is to find out how to get there and fix what it says. I would really like to NOT have to re partition my hard drive and start from scratch, so I'm really looking forward to getting this problem solved. I need to be able to install new software.


I have downloaded and extracted the Linux binary for the , and I'm trying to get the blackbox file to execute. I changed to the directory with the file and tried ./blackbox, which gave me a permissions error. No big deal, just run chmod 755 blackbox to give it executable permissions. But then, when I try ./blackbox again, I get the following error:  bash: ./blackbox: No such file or directory   It does the same when I give the command arguments. When I run ls -l though, I see the blackbox file and it has -rwxr-xr-x permissions, so I'm not sure why it's "losing" the file.  I'm running Ubuntu 14.04 as a dual boot with Windows 7, if that matters.  EDIT: I found a  over on Superuser, which has gotten me partially there. I ran readelf -l ./blackbox | grep ld-linux to find what I needed, then did a package content search to find out I needed the libc6-i386 package. Now I can do the following:  user@ubuntu:~/path$ ./blackbox  ./blackbox: error while loading shared libraries: libstdc++.so.6: cannot open shared object file: No such file or directory user@ubuntu:~/path$ ldd blackbox      linux-gate.so.1 =>  (0xf77af000)     libstdc++.so.6 => not found     libm.so.6 => /lib32/libm.so.6 (0xf774f000)     libgcc_s.so.1 => not found     libc.so.6 => /lib32/libc.so.6 (0xf75a4000)     /lib/ld-linux.so.2 (0xf77b0000)

I've downloaded a game (Shank) but the bin file doesn't run. The error that is shown when I try to launch the executable is:  bash: ./shank-linux-120720110-1-bin: No such file or directory


I have been doing some reading of  which is considered to be an indication of animal's ability to learn...  Before this I considered insects to be machine like - devoid of any sort of 'thinking' just doing things that evolution 'made' them to do to survive...  However I have found that  and even  could be conditionally trained...   Which made me wonder What would be the least complex species that respond to classical conditioning?  I have also read this question about  and I don't think that this 'cuts it'... this is nothing more than chemical response... however classical conditioning is different and in my opinion certainly does indicate ability to learn...

What is the simplest organism that was observed to learn: change its behavior permanently in response to some event/stimuli in a way that this change persists even if the event does not happen again?


I would like to suppress this type of warning by pdftex:     PDF inclusion: multiple PDFs with page group   So one solution proposed  is to use this primitive:  \pdfsuppresswarningpagegroup=1   Where should I specify it? In the premable of the .tex document? Or elsewhere?

I am having an issue with PDFs generatied in Inkscape. If multiple files generated in this way are included on a single page I get the following error:  pdfTeX warning: pdflatex.exe (file <FILENAME>.pdf): PDF inclusion: multiple pdfs with page group included in a single page>]   This seems to be a known bug in TeX and has been discussed here:   Rather than running all my PDFs twice through ghostscript I would like to address this by using silence to surpress the warnings however I am unable to create a warning filter which works.  I have tried \WarningFilter{pdflatex}{PDF inclusion} and various permutations however this does not work. I believe this is due to the file name being placed at the start of the error.   The silence manual states that it is better to use the \WarningFilter* option and to find the process that generates the error message in the .sty files. Since pdfTeX is not a package it does not (to the best of my knowledge) have a .sty file. I cannot work out which file contains the scripts for generating the errors and thus have not been able to create a function filter.  Does anyone know which file (Windows MiKTeX based distribution) generates these errors or how to make a working filter in this case?


I tried to create a PC-BSD start up/install on my usb flash drive using dd to try dual booting with it, and now I am left with a USB with only 1GB available instead of 16GB.  The command I used was:  dd if=PCBSD10.1.1-RELEASE-01-31-2015-x64-DVD-USB.iso of=/dev/sdb bs=1M   I was advised on their forums to use bs=1M on linux instead of bs=1m in the PC-BSD manual.  Gparted only sees 1Gb now and there seems to be no way to re-format.  However, when I run startup disk creator on Ubuntu, it seems to see that it is a 16GB flash but has a red x indicating that I can't install to it, nor can I use the erase disk function.  Trying:  mkfs.vfat -I /dev/sdb   didn't help either.  Thanks.

I recently made my pen-drive bootable with Ubuntu 14.04. But I need to unboot my pen-drive now. I formatted my pen-drive once,But the size of the pen-drive still shows 2.25 MB. Whereas,this is an 8GB pen-drive. How can I get rid of this problem. I'm still using Windows 7.


I am so excited that I got a new personal laptop, and for the first time in my life it didn't bring Windows preinstalled (it's the new Dell XPS 13, with Ubuntu 16.04 preconfigured).  As I turned it on, I could just set the basic settings (language, locales, etc.) and I was able to encrypt my home folder, but I remember from past installations (and that's how I currently have it in my old computer) that there was a chance of encrypting the whole disk (I think in the partitioning step).  I've been reading here at SO and in Internet and I think it is not possible to do something like "reinstalling the whole Ubuntu" from factory without having to boot it from a USB, so here is my question:  Is there a way to encrypt the whole disk once Ubuntu has been installed? Is there a workaround? Or do I have to get an image, boot it from a USB and perform as usual.  Thank you very much in advance!

Is there a way to do full disk encryption after the install?  I have Ubuntu 11.10 installed with /home encrypted but really need the whole drive encrypted.  I would really like to do that with out a re-install.  Is there anyway to do that?


For example, for a dataset generated from lognormal distribution, I estimate a normal distribution from that data (using maximaum-likelyhood or whatever methods).   Then, can I perform K-S test to check the goodness-of-fit of data fit into  the estimated normal distribution?   I'm asking this, because from , it says:     Perhaps the most serious limitation is that the distribution must be   fully specified. That is, if location, scale, and shape parameters are   estimated from the data, the critical region of the K-S test is no   longer valid. It typically must be determined by simulation.   If this is true, then how can I test the goodness-of-fit with estimated model?

I want to use the Kolmogorov-Smirnov test to test if a sample is drawn from a Pareto distribution. Unfortunately, the only way to estimate the distribution's parameters is from the sample.  Does anybody know of the existence of tables with modified critical values or any other way to perform the test in this case?


I strictly have to stay in 14.04.1 version. I have already disabled the "New Ubuntu version notifications" (and willing to take any further actions that would make a possible accidental release upgrade impossible). I still get software upgrade notifications and I wonder if it may upgrade the release somehow. Is there a safe command to use for that situation? Regards.  Clarification: My version (or edition, or HWE as it is called) must stay at 14.04.1, I can't even use 14.04.2. I just want my software to be at their newest version for 14.04.1 only.

Because of  I'd like to prevent apt-get upgrade and Update Manager from updating the "libgtk2.0-0" package.   How can this be achieved?


I have 2 files: d and t. I would like to be able to combine these files so that the first line of file t is followed by a tab and then the first line of d. For shorter lines, paste t d seems to work fine. $ cat d t Highly reactive metals in group 1A of the periodic table. Fairly reactive metals in group 2A of the periodic table. alkali metals alkaline earth metals $ paste d t Highly reactive metals in group 1A of the periodic table.   alkali metals Fairly reactive metals in group 2A of the periodic table.   alkaline earth metals $ paste t d alkali mHighly reactive metals in group 1A of the periodic table. alkalineFairly reactive metals in group 2A of the periodic table.  Trying to paste full sentences seems to act strangely. As seen above, the terms get trimmed down to the first 8 characters. $ paste t d > temp $ gedit temp & $ vim temp  Opening gedit shows line breaks following each term. Vim shows this: alkali metals^M Highly reactive metals in group 1A of the periodic table. alkaline earth metals^M Fairly reactive metals in group 2A of the periodic table.  Well, that seems to be easy enough to fix. :%s/^V^M//g removes all of the carriage returns, and everything shows up correctly. But how did those carriage returns end up there in the first place? While my question does involve carriage returns in a text file from Windows making things act strangely in a Unix-like environment, it is not a duplicate of . The problems are similar, but the manifestations are very different. It took me around an hour to figure out that carriage returns were even the culprit because I could not find an instance of a similar enough problem through web searches. That is why I posted this after having solved it myself.

I have something odd.  I creates some directories using a very simple script :  ... create all directories ( running under a user that has the correct rights ) e.g :  mkdir -p /home/EAI003A/05_EDSNFE/ISU2EAI/VEA/tre   But I get the directories double !  When I do ls -lrt I get   uxel081c: wmb - /home/EAI003A/05_EDSNFE/EAI2ISU/VEA # ls -lrt total 0  drwxr-xr-x    2 wmb      mqbrkrs         256 Jan 28 15:25 tre drwxr-xr-x    2 wmb      mqbrkrs         256 Jan 28 15:25 err drwxr-xr-x    2 wmb      mqbrkrs         256 Jan 28 15:25 arc drwxr-xr-x    2 wmb      mqbrkrs         256 Jun 12 08:35 tre drwxr-xr-x    2 wmb      mqbrkrs         256 Jun 12 08:35 tbt drwxr-xr-x    2 wmb      mqbrkrs         256 Jun 12 08:35 err drwxr-xr-x    2 wmb      mqbrkrs         256 Jun 12 08:35 arc drwxr-xr-x    2 wmb      mqbrkrs         256 Jun 13 10:49 tbt   (notice the double tre, tbt , arc ... )  They double directories do point to the same data.  When you do a normal ls you get   uxel081c: wmb - /home/EAI003A/05_EDSNFE/EAI2ISU/VEA # ls     tre  tre   Thus only two directories !  What happens ?


How can we prove that $$\left\lfloor x\right\rfloor + \left\lfloor x + \frac{1}{n} \right\rfloor + \left\lfloor x + \frac{2}{n} \right\rfloor + \cdots + \left \lfloor x + \frac{(n-1)}{n} \right\rfloor = \left\lfloor nx \right \rfloor$$ Where $\lfloor x\rfloor$ denotes greatest integer less than or equal to $x$. I was able to prove it when $n = 2$ or $3$. Please see .  But I can't prove it generally. I tried it using Principle of mathematical Induction but couldn't. Can someone prove it using some other way using properties of greatest integer function?

Right, this is an exercise in Apostol, which I am not being able to solve. I was able to prove this result for a small case, that is the case when $n=2$, $[x] + \Bigl[x + \frac{1}{2}\Bigr]=[2x]$, but I am struggling with the generalization.  Prove that $$\sum\limits_{k=0}^{n-1} \Biggl[x + \frac{k}{n}\Biggr] = [nx],$$ where $[ \ ]$ denotes the greatest integer function.  Can this be proved via induction, I ask this because I have shown it to be already true for $n=2$.


Amy is the daughter of Bob and Carol. Bob and Carol, at some point in their lives, married Chelsey and Dan, respectively. Egbert is the son of Chelsey and Bob, while Fabio is the son of Carol and Dan.  Egbert is Fabio's _____.

This is probably best explained with an example.  Alice and Bob have a child, Erin. Bob and Carol have a child, Frank. Carol and Dan have a child, Grace. Clearly, Erin and Frank are half-siblings, because of their father, Bob. Similarly, Grace and Frank share their mother, Carol.  Erin and Grace have no parents in common, and are thus not half-siblings. However, is there a term for their relation?


Its easy to find all continuous function $f: \Bbb R \to \Bbb R $ satisfing the Jensen equation  $$f \left( \frac{x+y}{2}\right )=\frac{f(x)+f(y)}{2}$$  But I am finding difficulty in finding all function  continuous on $(a,b),a,b \in \Bbb R$, satisfying the Jensen equation.

Which functions $f:\mathbb{R} \to \mathbb{R}$ do satisfy $$f\left(\frac{x+y}{2}\right) = \frac{f(x)+f(y)}{2}$$ for all $x,y \in \mathbb{R}$  I think the only ones are of type $f(x) = c$ for some constant $c\in \mathbb{R}$ and the solutions of the Cauchy functional equation $f(x+y) = f(x)+f(y)$ and the sums and constant multiples of these functions. Are there other functions which are both midpoint convex and concave?


I am trying to prove the estimate for $a,b\in \mathbb{R^n}, p\geq 1$ $$|a+b|^p\leq C(|a|^p+|b|^p)$$ where $C$ is a constant depending only on $p$. I am able to do it when $p$ is a natural number. But, could you give me any hints on how to do it for any $p\geq 1$?

I have a small question that I think is very basic but I am unsure how to tackle since my background in computing inequalities is embarrassingly weak -   I would like to show that, for a real number $p \geq 1$ and complex numbers $\alpha, \beta$, I have \begin{equation} |\alpha + \beta|^p \leq 2^{p-1}(|\alpha|^p + |\beta|^p) \end{equation}  I thought it would be best to rewrite this as  \begin{equation} \left|\frac{\alpha + \beta}{2}\right|^p \leq \frac{|\alpha|^p + |\beta|^p}{2} \end{equation}  but then I am unsure what to do next - is this a sensible start anyways ? Any help would be great !  (P.S. this is not a homework question - I am currently trying to brush up my knowledge of $L^p$ spaces, and this inequality came up as a statement. I thought it might be worthwhile to  make sure I can fill in the gaps to improve my skills in computing inequalities.)


$$\sum_{k=0}^l \binom{n}{k}\binom{m}{l-k} = \binom{n+m}{l} $$ There was a hint saying apply binomial theorem to $(1+x)^n(1+x)^m$ From which I've got $(1+x)^n(1+x)^m=(1+x)^{m+n}$  $(1+x)^n(1+x)^m=\sum^n_{k=0}\binom{n}{k}x^k\cdot\sum^m_{j=0}\binom{m}{j}x^j$  $(1+x)^{m+n}=\sum^{m+n}_{l=0}\binom{m+n}{l}x^l$  $\sum^n_{k=0}\binom{n}{k}x^k\cdot\sum^m_{j=0}\binom{m}{j}x^j = \sum^{m+n}_{l=0}\binom{m+n}{l}x^l$   In (3) every power $l$ of $x$ on the RHS equals $k+j$ for some $k$ and $j$ from the LHS. Here I'm stuck. How to complete the proof?

4 . (a) Prove that   $$\sum_{k=0}^l \binom{n}{k} \binom{m}{l-k} = \binom{n+m}{l}.$$   Hint: Apply the binomial theorem to $(1+x)^n(1+x)^m$.   I'm having a hard time trying to solve the problem above. I've done all of the previous exercises of the 2nd chapter with little difficulty, so far. I think I might be missing a trivial point somewhere.    The answer I got from the Answer Book, and is not very helpful either... :(      4. (a) Since $(1+x)^n(1+x)^m = (1+x)^{n+m}$  we have  $$\sum_{k=0}^n \binom{n}{k}x^k\cdot\sum_{j=0}^m \binom{m}{j}x^j\cdot=\sum_{l=0}^{n+m} \binom{n+m}{l}x^l$$  But the coefficient of $x^l$ on the left is clearly $$\sum_{k=0}^l\binom{n}{k}\binom{m}{l-k}.$$  One term of the sum occurring for each pair $k$, $j = l-k$.     I couldn't get the last part of the answer: why is it that the "coefficient of $x^l$ on the left is clearly $\sum_{k=0}^l\binom{n}{k}\binom{m}{l-k}$."?


I am trying to program a custom command which uses tcolorbox and I can't seem to set two options for fonttitle. I tried it in two different ways and none seems to work. You will find the difference in all of these if you scroll all to the right - look at the very end of the longest line.  This command doesn't work:  \newcommand{\vprasanje}[4]{ \begin{tcolorbox}[breakable,left=5mm,right=5mm,top=5mm,bottom=5mm,toptitle=0mm,bottomtitle=0mm,lefttitle=0mm,righttitle=0mm,boxrule=0.15mm,arc=0.25mm,colback=headcolor!2!white,colframe=headcolor!100!white,title=\refstepcounter{zap_stevilka_vprasanja}\label{#1}{\underline{\makebox[\textwidth]{\textbf{\glava \faBookmark~\arabic{zap_stevilka_vprasanja}:}~\textit{"{#2}"}\hfill\vphantom{Žg}}}}\newline{\makebox[\textwidth]{\hfill{\scriptsize \glava \faGraduationCap \uppercase{\textbf{Viri}}:~~\textit{#3}}}},fonttitle=\hypersetup{linkcolor=white},fonttitle=\hypersetup{urlcolor=white}] #4 \end{tcolorbox} }   This one doesn't either:   \newcommand{\vprasanje}[4]{ \begin{tcolorbox}[breakable,left=5mm,right=5mm,top=5mm,bottom=5mm,toptitle=0mm,bottomtitle=0mm,lefttitle=0mm,righttitle=0mm,boxrule=0.15mm,arc=0.25mm,colback=headcolor!2!white,colframe=headcolor!100!white,title=\refstepcounter{zap_stevilka_vprasanja}\label{#1}{\underline{\makebox[\textwidth]{\textbf{\glava \faBookmark~\arabic{zap_stevilka_vprasanja}:}~\textit{"{#2}"}\hfill\vphantom{Žg}}}}\newline{\makebox[\textwidth]{\hfill{\scriptsize \glava \faGraduationCap \uppercase{\textbf{Viri}}:~~\textit{#3}}}},fonttitle=\hypersetup{linkcolor=white,urlcolor=white}] #4 \end{tcolorbox} }   But this one does!  \newcommand{\vprasanje}[4]{ \begin{tcolorbox}[breakable,left=5mm,right=5mm,top=5mm,bottom=5mm,toptitle=0mm,bottomtitle=0mm,lefttitle=0mm,righttitle=0mm,boxrule=0.15mm,arc=0.25mm,colback=headcolor!2!white,colframe=headcolor!100!white,title=\refstepcounter{zap_stevilka_vprasanja}\label{#1}{\underline{\makebox[\textwidth]{\textbf{\glava \faBookmark~\arabic{zap_stevilka_vprasanja}:}~\textit{"{#2}"}\hfill\vphantom{Žg}}}}\newline{\makebox[\textwidth]{\hfill{\scriptsize \glava \faGraduationCap \uppercase{\textbf{Viri}}:~~\textit{#3}}}},fonttitle=\hypersetup{linkcolor=white,urlcolor=white}] #4 \end{tcolorbox} }   So is it impossible to change colors of url's and links at the same time?

If I use  \usepackage[colorlinks]{hyperref}   I get colored links for \cite (not good for printing or even viewing) but table of content looks fine.  If I use  \usepackage[colorlinks=false]{hyperref}   I get \cite  links in black with a colored frame (this looks very good) but the table of content looks strange with extra long boxes.  What are my other options? Can you have two styles in different parts of a document?   How do you make the page numbers in TOC to be the links instead of the section headers?


Based on the suggested duplicate, let me reformulate my question:  If chmod 0660 path/to/folder is run, and user A isn't in the relevant group, could user A still read /path/to/folder/file.txt if that file has the appropriate octal?

In my CMS, I noticed that directories need the executable bit (+x) set for the user to open them. Why is the execute permission required to read a directory, and how do directory permissions in Linux work?


How can I elevate a open cmd window such that it has administrator rights as it would have if i would start it with "run as administrator"?

I always work on a non-administrator account on my Windows computer. Sometimes I need to install programs which requires administrator access. As I mostly use the Windows command prompt, is there a Windows command to escalate privileges, similar to the Linux terminal command sudo?


Just came into the 'feature' I had no idea will ever happen. We have two servers for development - S1 and S2. We most often use S2 and S1 went out of date. Let's assume that S1's database DB1 stays at C:\mssql\data\db1.mdf  What I did:   Drop database DB1 on S1 Scripted DB1 on S2 without data as CREATE DATABASE... and create tables, indexes, etc... Run script on S1, to create new DB1 as on S2.   although I didn't delete db1.mdf file, after dropping and recreating I expected my tables to have no data. What was my surprise after finding some tables filled!  What's the explanation for that?  Cheers.

This is a really weird problem. When I create a new DB from a script I'm getting extra tables added. These aren't system type tables but regular tables that look like they may have come from a past project. There are 3 of them, each with 2 columns, either ints or nchar(10) with no keys, constraints, triggers, or indices.   I have no idea where this is coming from or how I can fix it. Right now I just delete the tables but it's a bit annoying and I'd like to fix the issue.  Here is a script I wrote that reproduces the error:  CREATE DATABASE X; GO  USE X; GO  CREATE TABLE Y(   YId INT IDENTITY CONSTRAINT pk_yid PRIMARY KEY(YId)); GO  CREATE TABLE Z(   ZId INT IDENTITY CONSTRAINT pk_zid PRIMARY KEY(ZId)); GO   After I run this script my DB is created, but it has 5 tables instead of 2.   Running SELECT * FROM INFORMATION_SCHEMA.TABLES just lists my extra tables as BASE TABLE, exactly the same as the ones I defined (all other columns are the same as well).  This is happening on SQL Server 2008 R2  (Microsoft SQL Server Management Studio 10.50.2500.0)


I am newbie to batch file script.I have created simple windows bat file.The problem is bat file run only if the user has admin privilege.But i want to run this batch file for all users like normal users,standard users and guest etc.I have used windows 7.  Access is denied. [2013-09-18 09:55:07] [error] Unable to open the Service Manager [2013-09-18 09:55:07] [error] Access is denied. [2013-09-18 09:55:07] [error] Access is denied. Access is denied. Failed to install service   Is possible run windows bat file  for all users?

I have a fairly simple batch file which does just one thing - "net start myservice". This batch file gets shortcut-ed in a program group by installer so that users can simply click on the icon and get things started (or stopped). All works well in XP for the users with admin rights. But things get hairy on Win7 as the batch need to be run "as administrator" explicitly and often users don't know this. So my question is how to make this friendly? Telling users to right click and run as admin on Win7 and simply click on XP is kind of weird twist. I need a smart automatic simple thingy.  I could probably use "runas/user:administrator" in the batch itself, but this "administrator" account might not be available on some machines. I'm looking for a universal solution for installing things like this on any Windows box.   Ideas? How would you do this?


Why do we have to use all this shortcut to quit the programs in terminal ?  For example :   ctrl+c in order to quit top ctrl+z in order to quit man ctrl+x in order to quit nano   ctrl+c isn't suppose to kill the program ?

Can anyone tell me the difference between ctrl+z and ctrl+c?  When I am in the terminal, both the combinations stop the current process, but what exactly is the difference between both?


The other day I was answering to a question by a very long text, it take me a long time to do it because I have done some research, but anyway it was on an interesting subject, so it was worth it.   Some minutes after I had post my answer, I've seen that the question has been deleted by the user and my long answer too. I was a bit angry because I feel that I had lost my time... I personnaly want to contribute to stack overflow because when I try to answer a question I often learn something by doing research on it. I think it can be also usefull to retrieve some old answers we have posted to remember how we have resolve something.  According to me, our answers and the questions should be always visible in our account page, even if the user decided to delete them. Do you think it's possible ?  Is there a concrete reason to delete answers when a question is deleted ?

I would really like to see all of my questions and answers on the profile page, even if some of them were deleted, and I don't have enough rep to see them on the site. (Note that some questions are  after 30 days or 1 year, and the author might be oblivious about what happened.)   , the "deleted recent [questions/answers]" links in one's own user profile now list all respective posts that were deleted in the past 60 days, rather than just those that were originally posted in the last 60 days. , users with the "access to moderator tools" privilege (10k+ on designed sites, 2k+ on beta and non-designed sites) can use the search operator deleted:1 to see all their own deleted posts. , deleted questions and answers that were posted in the past 60 days, can be seen using the "deleted recent questions" and "deleted recent answers" links on the questions and answers tabs (at the bottom of the tab) in your user profile. For older posts: as of 2013-04-23 you can  if you already have a link to them, but they still aren't linked from the user profiles (not even just for you). Nor do you see inbox notifications for comments on them if you come back a few hours later. You have to have thought to bookmark your question, or you have to go digging for it in your browser history.


I have a folder structure, like this:   forum   .htaccess [some more files]  forum_english   .htaccess [some more files]    forum/.htaccess looks like this:  RewriteEngine on  RewriteCond %{HTTP_HOST} \.(com|net)$ [NC] # just rewrite if the query comes from an english languaged domain RewriteRule ^(.*)$ ../forum_english/$1  #some more RewriteRules from another forum. I don't know, if I am allowed to show them. They should work well, side by side.   forum_english/.htaccess is the default .  Sadly this causes an infinite loop. To prevent this, I have to insert a [L]-Flag which skips the forum_english/.htaccess-file (but the rules in this file should be executed, too!). I also tried the [N=2]-Flag instead ... but still infinite loop.  I use Apache 2.2.17 and have no access to error_logs or the files in /etc/apache2/sites-enabled/.  Any ideas what I did wrong?

This is a  about Apache's mod_rewrite.   Changing a request URL or redirecting users to a different URL than the one they originally requested is done using mod_rewrite. This includes such things as:   Changing HTTP to HTTPS (or the other way around) Changing a request to a page which no longer exist to a new replacement. Modifying a URL format (such as ?id=3433 to /id/3433 ) Presenting a different page based on the browser, based on the referrer, based on anything possible under the moon and sun. Anything you want to mess around with URL   Everything You Ever Wanted to Know about Mod_Rewrite Rules but Were Afraid to Ask!  How can I become an expert at writing mod_rewrite rules?   What is the fundamental format and structure of mod_rewrite rules? What form/flavor of regular expressions do I need to have a solid grasp of? What are the most common mistakes/pitfalls when writing rewrite rules? What is a good method for testing and verifying mod_rewrite rules? Are there SEO or performance implications of mod_rewrite rules I should be aware of? Are there common situations where mod_rewrite might seem like the right tool for the job but isn't? What are some common examples?   A place to test your rules  The  web site is a great place to play around with your rules and test them. It even shows the debug output so you can see what matched and what did not.


My website was working till a few days ago. It suddenly stopped working and showing white screen on every page only when some users including administrator are logging in to it. I added the following line at the top of the index.php  error_reporting(E_ALL); ini_set('display_errors', TRUE); ini_set('display_startup_errors', TRUE);    The following error is displaying     Fatal error: Uncaught exception 'PDOException' with message 'SQLSTATE[HY000]: General error: 2006 MySQL server has gone away' in /home/******/public_html/includes/database/database.inc:2204 Stack trace: #0 /home/******/public_html/includes/database/database.inc(2204): PDOStatement->execute(Array) #1 /home/******/public_html/includes/database/database.inc(683): DatabaseStatementBase->execute(Array, Array) #2 /home/******/public_html/includes/database/database.inc(2383): DatabaseConnection->query('SELECT expire, ...', Array, Array) #3 /home/******/public_html/includes/lock.inc(167): db_query('SELECT expire, ...', Array) #4 /home/******/public_html/includes/lock.inc(146): lock_may_be_available('theme_registry:...') #5 /home/******/public_html/includes/theme.inc(449): lock_acquire('theme_registry:...') #6 /home/******/public_html/includes/bootstrap.inc(455): ThemeRegistry->set(Array) #7 [internal function]: DrupalCacheArray->__destruct() #8 {main} thrown in /home/******/public_html/includes/database/database.inc on line 2204   I really have no idea what to do. thanks in advance

Recently I started getting an error every time I try and add a content no matter what type.  This is the error that shows up in the browser:     Additional uncaught exception thrown while handling exception.        Original   PDOException: SQLSTATE[HY000]: General error: 2006 MySQL server has gone away: SELECT COUNT(cid) FROM {comment} WHERE status = :status; Array ( [:status] => 0 ) in comment_count_unpublished() (line 313 of /Applications/MAMP/htdocs/modules/comment/comment.module).        Additional      PDOException: SQLSTATE[HY000]: General error: 2006 MySQL server has gone away: INSERT INTO {watchdog} (uid, type, message, variables, severity, link, location, referer, hostname, timestamp) VALUES (:db_insert_placeholder_0, :db_insert_placeholder_1, :db_insert_placeholder_2, :db_insert_placeholder_3, :db_insert_placeholder_4, :db_insert_placeholder_5, :db_insert_placeholder_6, :db_insert_placeholder_7, :db_insert_placeholder_8, :db_insert_placeholder_9); Array ( [:db_insert_placeholder_0] => 1 [:db_insert_placeholder_1] => php [:db_insert_placeholder_2] => %type: !message in %function (line %line of %file). [:db_insert_placeholder_3] => a:6:{s:5:"%type";s:12:"PDOException";s:8:"!message";s:154:"SQLSTATE[HY000]: General error: 2006 MySQL server has gone away: SELECT COUNT(cid) FROM {comment} WHERE status = :status; Array ( [:status] =&gt; 0 ) ";s:9:"%function";s:27:"comment_count_unpublished()";s:5:"%file";s:56:"/Applications/MAMP/htdocs/modules/comment/comment.module";s:5:"%line";i:313;s:14:"severity_level";i:3;} [:db_insert_placeholder_4] => 3 [:db_insert_placeholder_5] => [:db_insert_placeholder_6] => ; [:db_insert_placeholder_7] =>  [:db_insert_placeholder_8] => 127.0.0.1 [:db_insert_placeholder_9] => 1338336955 ) in dblog_watchdog() (line 154 of /Applications/MAMP/htdocs/modules/dblog/dblog.module).   I also get the following error in my php error file:     PHP Fatal error:  Uncaught exception 'PDOException' with message 'SQLSTATE[HY000]: General error: 2006 MySQL server has gone away' in /Applications/MAMP/htdocs/includes/database/database.inc:2136        Stack trace:   0 /Applications/MAMP/htdocs/includes/database/database.inc(2136): PDOStatement->execute(Array)   1 /Applications/MAMP/htdocs/includes/database/database.inc(664): DatabaseStatementBase->execute(Array, Array)   2 /Applications/MAMP/htdocs/includes/database/database.inc(2315): DatabaseConnection->query('SELECT expire, ...', Array, Array)   3 /Applications/MAMP/htdocs/includes/lock.inc(167): db_query('SELECT expire, ...', Array)   4 /Applications/MAMP/htdocs/includes/lock.inc(146): lock_may_be_available('theme_registry:...')   5 /Applications/MAMP/htdocs/includes/theme.inc(447): lock_acquire('theme_registry:...')   6 /Applications/MAMP/htdocs/includes/bootstrap.inc(427): ThemeRegistry->set(Array)   7 [internal function]: DrupalCacheArray->__destruct()   8 {main}         thrown in /Applications/MAMP/htdocs/includes/database/database.inc on line 2136   I am having a little trouble deciphering these error messages. Could anyone help me understand what's going on here?


So I have a site I would prefer not to mention but when I search for my sitename on Google I get too many pages to count of hits. But if I look on the search console it tell me this   Does this mean I have only 11 pages viewable through organic search.... And how could something like this happen. Is this normal?  This is not a duplicate question because my site is quite old. It has many many search results on site:<website_name> but apparently I only have 11(!) indexed pages but on google I find many more which contradicts the information provided by the webmaster.

In Google webmaster tools it shows that I have 309 pages indexed, but when I search using "site:site.com" appear about 180 only (On the first page appears "about 608 results," something near the total number of posts).  I have also noticed that some pages that were indexed before have simply disappeared from Google. In Google webmaster tools there is no error message or anything to indicate any punishment by Google.  According to Google webmaster tools, daily new pages are indexed, but for some reason they are not displayed in the search.  Am I really affected by some punishment by Google or this is some kind of bug?  How can I solve this problem and have all pages indexed normally?


Some names are lowercase for example names of programs like grep, ls and vi. If any of these names starts a sentence, should the first letter be capitalised?     Linux has many nice programs. vi is a popular editor. grep is a system tool.

Possible Duplicates:             Many products these days have names that intentionally begin with lowercase letters.  The most common examples are of the Apple "iDevice" variety, but there are some others - inSSIDer is one.  When beginning a sentence with these names, should the name be capitalized?


$C_b^0(\mathbb{R})=\{f\in C(\mathbb{R}),\lim\limits_{|x|\to\infty}f(x)=0\}$  So can we construct an function in $C_b^0(\mathbb{R})$ such that it's Fourier transform is not in $L^1(\mathbb{R})$?  What kinds of sufficient property does it have?

I know that for every function $f\in L^1(R)$ its Fourier transform has the following properties: it is continuous, it's bounded, and we have the limit $$ \lim_{\omega\to\pm\infty} \hat f (\omega) = 0 $$ which is the Riemann-Lebesgue lemma. Now suppose the function $f$ also has these properties (and it is in $L_1$). Will its Fourier transform be also in L1? That is, if $$ f\in L^1(R),  \mbox{ f is continuous and  } \lim_{x\to\pm\infty}  f (x) = 0$$ does it mean that $$ \hat f(\omega)\in L^1(R)$$ or not? My first intuition is no, but I don't have a counter example.  Any ideas?


During , Captain America interrupts Thor and Iron Man in the middle of their fight after Loki escapes, Thor's immediate response is to attack Captain America.  Captain America survives thanks to his vibranium shield.  But did Thor know Cap could take the hit or did he really intend to murder this polite stranger for interrupting his fight?

Thor knew the tremendous and deadly force generated by pounding Mjölnir into something. It sure looks like he was bringing the hammer down on Cap with 'bad intentions'. He has killed many Frost Giants with it and who knows how many other foes have fallen to his onslaught. He even used it to destroy the Rainbow Bridge in the movie 'Thor'.   There's no indication that he knew about the energy/force dissipating quality of Cap's shield or its ability to survive such a powerful strike. He hit the shield hard enough that when the shield diverted the energy away from Cap, all the trees around them were leveled by the 'shockwave'.   Did Thor somehow pickup on Cap or the shield's abilities when Cap bounced his shield off of him and nimbly jumped to the ground from 20' up and was just going to show him who's boss, or was Thor intending to remove this new threat from the gene pool?


I have a Lenovo e330 notebook with broadcom bcm4313 802.11 bgn wireless adapter.  I have configured it for dual boot Windows 8/Ubuntu 14.04.  It has problem connecting to wireless, and this problem is the same in Windows or Ubuntu.  The wireless will not connect after many tries. Then after a restart (or two or more) the wireless will then connect.  I keep restarting the PC until it connects.   I found that if it connects in Windows, and I change to Ubuntu, it will connect in Ubuntu. If it won't connect in Windows, it won't connect in Ubuntu either.   I have already turned power management off.   Tried many things in Windows 8 such as disabling Lenovo software, n channel and ipv6. But same problem in Ubuntu I can't see how it can be a Lenovo problem.   dmesg output when not working:

I cannot connect to mixed b/g/n wifi Network. I am using wl drivers. Connection to other wifi networks is working well, but to this network I cannot connect from Ubuntu (from my android phone connection works)  Specifications of my wifi network are here:    I am on Ubuntu 14.04 LTS. And my Wifi adpater is BCM4313 802.11bgn Wireless Network Adapter ouput of :  sudo lshw -C network   is :  PCI (sysfs)       *-network                       description: Wireless interface        product: BCM4313 802.11bgn Wireless Network Adapter        vendor: Broadcom Corporation        physical id: 0        bus info: pci@0000:03:00.0        logical name: wlan0        version: 01        serial: 08:3e:8e:a4:03:6d        width: 64 bits        clock: 33MHz        capabilities: pm msi pciexpress bus_master cap_list ethernet physical wireless        configuration: broadcast=yes driver=wl0 driverversion=6.30.223.141 (r415941) latency=0 multicast=yes wireless=IEEE 802.11abg        resources: irq:17 memory:e4100000-e4103fff   *-network        description: Ethernet interface        product: RTL8111/8168/8411 PCI Express Gigabit Ethernet Controller        vendor: Realtek Semiconductor Co., Ltd.        physical id: 0        bus info: pci@0000:0c:00.0        logical name: eth0        version: 07        serial: b8:88:e3:e2:ff:f7        size: 1Gbit/s        capacity: 1Gbit/s        width: 64 bits        clock: 33MHz        capabilities: pm msi pciexpress msix vpd bus_master cap_list ethernet physical tp mii 10bt 10bt-fd 100bt 100bt-fd 1000bt 1000bt-fd autonegotiation        configuration: autonegotiation=on broadcast=yes driver=r8169 driverversion=2.3LK-NAPI duplex=full firmware=rtl8168e-3_0.0.4 03/27/12 ip=192.168.0.4 latency=0 link=yes multicast=yes port=MII speed=1Gbit/s        resources: irq:44 ioport:2000(size=256) memory:e2804000-e2804fff memory:e2800000-e2803fff   Where shold be a mistake? Thank you.


I'm developing a GIS mapping system and for that I am using pgSQL, however I am bounded to using mysql for the drupal install because we use Drupal 6 mulitsites using mysql already.  I know I can get around this problem by hard coding using php, html to create my forms that submit to this. I know from  this is not possible as standard. Is it possible via any other method to utilise the Form API and submit to an external DB in a different structure such as pgsql? or do i continue coding my forms by hand for each node?  The example below is exactly what I would like to do however it is clearly shown in the link above that this will not work.  // ... header of the settings.php file  $db_url = array ( "default" => "mysql://user:pass@host/db", "second" => "pgsql://user:pass@host/db" );   The code below is from the Form API getting started doc, however it doesnt specify the databse it is actually connecting to?   function test_myform_submit($form, &$form_state) {  db_query("INSERT INTO {table} (name, log, hidden) VALUES ('%s', %d, '%s')",    $form_state['values']['name'],    $form_state['values']['access']['log'],    $form_state['values']['hidden']); drupal_set_message(t('Your form has been saved.')); }

How can I execute a query that connects to different databases?  I have the following query, and I need to rewrite it for Drupal.  SELECT a.empid, b.empname FROM db1..empidmaster a, db2..emplist b WHERE a.empid = b.empid   How can I rewrite the query using db_query(), or db_select()?


I'm using Kubuntu 20.04 with KDE 5.68.0 and Plasma 5.18.5. I live in Argentina and like to have my OSs in English, but I own a Spanish keyboard. So, I naturally installed Kubuntu in English and then went to System Settings > Input Devices, and at the Layouts tab added a Spanish keyboard layout. Everything worked fine until I rebooted. Now my system is completely in Spanish. But if I go to System Settings > Regional Setting > Language the only shown item is "American English". Even more awkward, if I now add as a new system language "español de España", but not as default language, and reboot, the system returns to English, but some terminal messages and apps (like Crossover) appear in Spanish!! This is driving me nuts. Any ideas??? Edit: Just checked my /etc/default/locale and it has the following content: #  File generated by update-locale LANG="en_US.UTF-8" LC_NUMERIC="en_US.UTF-8" LC_TIME="en_US.UTF-8" LC_MONETARY="en_US.UTF-8" LC_PAPER="en_US.UTF-8" LC_NAME="en_US.UTF-8" LC_ADDRESS="en_US.UTF-8" LC_TELEPHONE="en_US.UTF-8" LC_MEASUREMENT="en_US.UTF-8" LC_IDENTIFICATION="en_US.UTF-8"  sudo locale show this output: LANG=es_AR.UTF-8 LANGUAGE=en_US:es LC_CTYPE="es_AR.UTF-8" LC_NUMERIC=en_US.UTF-8 LC_TIME=en_US.UTF-8 LC_COLLATE="es_AR.UTF-8" LC_MONETARY=en_US.UTF-8 LC_MESSAGES="es_AR.UTF-8" LC_PAPER=en_US.UTF-8 LC_NAME=en_US.UTF-8 LC_ADDRESS=en_US.UTF-8 LC_TELEPHONE=en_US.UTF-8 LC_MEASUREMENT=en_US.UTF-8 LC_IDENTIFICATION=en_US.UTF-8 LC_ALL=  There are some entries with es_AR, but don't know why is it so.

So ever since I installed Kubuntu on the computer I'm using right now I've had locale issues, which I'll admit is nothing new or unique to Ubuntu/Linux. I'm trying to set things up so that my keyboard and general locale (time, date, etc) settings are Swedish but the system language is otherwise English since that makes things so much easier. Right now my /etc/default/locale looks like this: LANG=en_US.UTF-8 LANGUAGE=en_US:sv LC_CTYPE="en_US.UTF-8" LC_NUMERIC=sv_SE.UTF-8 LC_TIME=sv_SE.UTF-8 LC_COLLATE="en_US.UTF-8" LC_MONETARY=sv_SE.UTF-8 LC_MESSAGES=en_US.UTF-8 LC_PAPER=sv_SE.UTF-8 LC_NAME=sv_SE.UTF-8 LC_ADDRESS=sv_SE.UTF-8 LC_TELEPHONE=sv_SE.UTF-8 LC_MEASUREMENT=sv_SE.UTF-8 LC_IDENTIFICATION=sv_SE.UTF-8 LC_ALL=  And I have set KDE Plasma translations (Regional Settings -> Language) to American English first and svenska[sic] second. Keyboard layout is also set to Swedish and works. Under Regional Settings -> Formats I've tried setting Region to United States - American English (en_US) with Detailed Settings on and everything set to Sverige - svenska (sv_SE) there. In Xorg everything seems to be in English as it should but in the terminal I keep running into programs that insist on Swedish output. For example: $ sudo apt-get update Bra:1 http://repository.spotify.com stable InRelease Bra:2 http://archive.ubuntu.com/ubuntu focal InRelease Bra:3 http://security.ubuntu.com/ubuntu focal-security InRelease Bra:4 http://archive.ubuntu.com/ubuntu focal-updates InRelease Bra:5 http://archive.ubuntu.com/ubuntu focal-backports InRelease Läser paketlistor… Färdig  Does anyone know what setting I'm missing here? Surely I should be able to force this system to default to American English for the language while still retaining sane formatting for date and time? Or is there some good alternative "en_SE" locale I can install that won't break horribly the next time I run a dist-upgrade?


Prove that $xy+yz+zx \leq  x^2+y^2+z^2$ . Hint: Use $\frac{a+b}{2}\geq\sqrt{ab}$   First I tried using the hint by setting $a=x$ and $b=y+z$, however this results in the inequality: $$x^2+y^2+z^2 \geq 2xy-2yz+2zx $$ which isn't quite the same thing.  Then I tried starting with what we're trying to prove (to hopefully end up with a true statement), but then I get to this: $$(x+y+z)^2 \geq 3(xy+yz+zx)$$ and then I can't see what to do next.  This question is supposed to be straight forward, which is why I'm thinking there might be something wrong with it. Or I'm dumb.  As you can see I tagged this with Proof-strategy, so please don't bother writing down a full proof, just a few observations or hints are enough.

How can the following inequation be proven?  $$a^2 + b^2 + c^2 \ge ab + bc + ca$$


I was trying to solve a simple problem regarding a particle being launched by an angle theta where it hits a rod, we have: a) System(Particle, Rod) b) System(Particle, Rod, Henge)  My question is when will the angular momentum in each of the systems is conserved and is the linear momentum in any system conserved? And why?  I'm taking this course online, so if anybody could give me a rigorous and an intuitive explanation of what's going on it eould really mean alot to me. Thank you alot for your time Image:

Suppose we have a situation like      A ball of some mass $m$ with some velocity collides with rod hinged at point $A$. Is momentum conserved in this situation? I know that hinge will give impulsive force on rod but that is internal force when we take ball and rod together as a system so that shouldn't stop us using conservation of momentum equation


I am a beginner with QGIS and I have been working on creating layers with LAStools and shapefiles of the city of Rio de Janeiro.  Both data are provided by the city, so shouldn't contain any error. My two first layers ("cobertura4618" & "Regiao Metropolitana") are aligning perfectly when I project them on the same system EPSG 4618 - SAD 69. But the last layer "output vector file" (created through lastools and projected on the same system) doesn't overlap with the others even if I have projected it on the same system like the others.          The on-the-fly CRS tranformation is disabled. "Prompt for crs" is selected. I have used always the same method to project the layer on EPSG 4618 - SAD 69 : right click on the layer "save as" > "selected CRS" > ok.  I have read a lot of posts about projection problem but none of them helped to solve my problem.

I put 4 different layers into my ArcMap document, but only one of them will show up on the map! I should be seeing the other 3 layers as well. When I do a Zoom to layer, I can see one layer, but I cannot figure out how to make the other 3 show up at once on top of each other.  Before I opened ArcMap, I used ArcCatalog where I right-clicked 3/4 of the shapefiles and  clicked Properties → Coordinate system → Import and then clicked on my Trees layer, which has the coordinate system I want the other 3 to have. But when I opened ArcMap the 4 layers did not overlap, nor could I move them above or below each other.


I have a 500 GB USB drive mounted as HPFS/NTFS and while copying files to the drive the copying process suddenly failed. After a unmount, unplug and reboot copying works fine again but files in one folder can't be accessed anymore:   ls: reading directory .: Input/output error   other folders work fine. badblocks found no errors on the external hard disk:  sudo badblocks -v /dev/sdd1 > bad-sectors.txt Checking blocks 0 to 487653042 Checking for bad blocks (read-only test): done                                                  Pass completed, 0 bad blocks found. (0/0/0 errors   mount reads thats fuseblk is used to  mount the the drive, i.e. ntfs-3g is used.  the last output of dmesg reads:  [63018.326130] usb 2-1: new SuperSpeed USB device number 3 using xhci_hcd [63018.384505] usb 2-1: New USB device found, idVendor=059b, idProduct=0070 [63018.384508] usb 2-1: New USB device strings: Mfr=1, Product=2, SerialNumber=3 [63018.384510] usb 2-1: Product: eGo USB [63018.384511] usb 2-1: Manufacturer: Iomega [63018.384513] usb 2-1: SerialNumber: 0300000000006D48 [63018.413770] usb 2-1: Set SEL for device-initiated U1 failed. [63018.416875] usb 2-1: Set SEL for device-initiated U2 failed. [63018.425905] usb 2-1: Set SEL for device-initiated U1 failed. [63018.428713] usb 2-1: Set SEL for device-initiated U2 failed. [63018.469541] scsi host8: uas [63018.472788] usb 2-1: Set SEL for device-initiated U1 failed. [63018.477256] usb 2-1: Set SEL for device-initiated U2 failed. [63018.482405] scsi 8:0:0:0: Direct-Access     OEM      Ext Hard Disk    0000 PQ: 0 ANSI: 5 [63018.664361] scsi 8:0:0:1: CD-ROM            Virtual  CDROM                 PQ: 0 ANSI: 0 [63018.664664] sd 8:0:0:0: Attached scsi generic sg2 type 0 [63018.697536] sd 8:0:0:0: [sdc] 975319088 512-byte logical blocks: (499 GB/465 GiB) [63018.705474] sr 8:0:0:1: [sr0] scsi-1 drive [63018.705675] sr 8:0:0:1: Attached scsi CD-ROM sr0 [63018.705797] sr 8:0:0:1: Attached scsi generic sg3 type 5 [63018.758482] sd 8:0:0:0: [sdc] Write Protect is off [63018.758487] sd 8:0:0:0: [sdc] Mode Sense: 10 00 00 00 [63018.774133] sd 8:0:0:0: [sdc] Cache data unavailable [63018.774138] sd 8:0:0:0: [sdc] Assuming drive cache: write through [63019.025475]  sdc: sdc1 [63019.583520] sd 8:0:0:0: [sdc] Attached SCSI disk

I want to list and remove the content of a directory on a removable hard drive. But I have experienced "Input/output error":  $ rm  pic -R rm: cannot remove `pic/60.jpg': Input/output error rm: cannot remove `pic/006.jpg': Input/output error rm: cannot remove `pic/008.jpg': Input/output error rm: cannot remove `pic/011.jpg': Input/output error  $ ls -la pic ls: cannot access pic/60.jpg: Input/output error -????????? ? ?    ?         ?            ? 006.jpg -????????? ? ?    ?         ?            ? 006.jpg -????????? ? ?    ?         ?            ? 011.jpg   I was wondering what the problem is?  How can I recover or remove the directory pic and all of its content?  My OS is Ubuntu 12.04, and the removable hard drive has ntfs filesystem. Other directories not containing or inside pic on the removable hard drive are working fine.    Added:   Last part of output of dmesg after I tried to list the content of the directory:  [19000.712070] usb 1-1: new high-speed USB device number 2 using ehci_hcd [19000.853167] usb-storage 1-1:1.0: Quirks match for vid 05e3 pid 0702: 520 [19000.853195] scsi5 : usb-storage 1-1:1.0 [19001.856687] scsi 5:0:0:0: Direct-Access     ST316002 1A               0811 PQ: 0 ANSI: 0 [19001.858821] sd 5:0:0:0: Attached scsi generic sg2 type 0 [19001.861733] sd 5:0:0:0: [sdb] 312581808 512-byte logical blocks: (160 GB/149 GiB) [19001.862969] sd 5:0:0:0: [sdb] Test WP failed, assume Write Enabled [19001.865223] sd 5:0:0:0: [sdb] Cache data unavailable [19001.865232] sd 5:0:0:0: [sdb] Assuming drive cache: write through [19001.867597] sd 5:0:0:0: [sdb] Test WP failed, assume Write Enabled [19001.869214] sd 5:0:0:0: [sdb] Cache data unavailable [19001.869218] sd 5:0:0:0: [sdb] Assuming drive cache: write through [19001.891946]  sdb: sdb1 [19001.894713] sd 5:0:0:0: [sdb] Test WP failed, assume Write Enabled [19001.895950] sd 5:0:0:0: [sdb] Cache data unavailable [19001.895953] sd 5:0:0:0: [sdb] Assuming drive cache: write through [19001.895958] sd 5:0:0:0: [sdb] Attached SCSI disk [19113.024123] usb 2-1: new high-speed USB device number 3 using ehci_hcd [19113.218157] scsi6 : usb-storage 2-1:1.0 [19114.232249] scsi 6:0:0:0: Direct-Access     USB 2.0  Storage Device   0100 PQ: 0 ANSI: 0 CCS [19114.233992] sd 6:0:0:0: Attached scsi generic sg3 type 0 [19114.242547] sd 6:0:0:0: [sdc] 312581808 512-byte logical blocks: (160 GB/149 GiB) [19114.243144] sd 6:0:0:0: [sdc] Write Protect is off [19114.243154] sd 6:0:0:0: [sdc] Mode Sense: 08 00 00 00 [19114.243770] sd 6:0:0:0: [sdc] No Caching mode page present [19114.243778] sd 6:0:0:0: [sdc] Assuming drive cache: write through [19114.252797] sd 6:0:0:0: [sdc] No Caching mode page present [19114.252807] sd 6:0:0:0: [sdc] Assuming drive cache: write through [19114.280407]  sdc: sdc1 < sdc5 > [19114.289774] sd 6:0:0:0: [sdc] No Caching mode page present [19114.289779] sd 6:0:0:0: [sdc] Assuming drive cache: write through [19114.289783] sd 6:0:0:0: [sdc] Attached SCSI disk


Stuck with this one and wondered if someone could point me in the right direction... we updated one of our wordpress sites a couple of weeks ago and only revisited it today and noticed that the Dashboard menu down the left hand side had a bit of a bug only affecting this one site...  The menu items when rolled over with the mouse move back up into place / or if I do a refresh to another page it will sometimes sort itself out.  I've removed/uploaded wp-includes & wp-admin folders from fresh download of Wordpress 4.2.2  I've disabled all plugins  There are no inspector errors or missing scripts..  Thanks in advance.

I'm having an issue with my admin menu in WordPress. As you can see in the image below the formatting of the menu is out of order. This happens whenever I first land on one of the admin pages but if I refresh the page the menu looks fine. I tried disabling my plugins but none of them seem to be causing the issue.


How is experience calculated in HearthStone? I understand you get more exp for playing against people, but i can't find how to work out the exp gained.

Sometimes I win handily and get a little experience, sometimes I squeak out a victory and get a lot.  How is experience earned?


Intellisense gives me an error 'myType' is variable but used like a type  var myType = myObject.GetType(); var result = MyMethod<myType>(param);   Where:  var myObject = new MyType(); // MyType extends MyBaseType  public static string MyMethod<TArgs>(string param)    where TArgs : MyBaseType {     // Do stuff... }   So at the runtime the myObject.GetType() is known (it's MyType in our case).   Question:   How could I in a right way pass myType "dynamically" (which in a runtime could be MyType) to public static string MyMethod<TArgs>(string param) method?

What's the best way to call a generic method when the type parameter isn't known at compile time, but instead is obtained dynamically at runtime?  Consider the following sample code - inside the Example() method, what's the most concise way to invoke GenericMethod<T>() using the Type stored in the myType variable?  public class Sample {     public void Example(string typeName)     {         Type myType = FindType(typeName);          // What goes here to call GenericMethod<T>()?         GenericMethod<myType>(); // This doesn't work          // What changes to call StaticMethod<T>()?         Sample.StaticMethod<myType>(); // This also doesn't work     }      public void GenericMethod<T>()     {         // ...     }      public static void StaticMethod<T>()     {         //...     } }


Suppose $N$ is a normal subgroup of a group $G$, with $N \neq \{e\}$. Can $G/N$ be isomorphic to $G$? My attempt: It is not possible in the case when $G$ is finite; a quick way to see this is to note that $o(G/N) = o(G)/o(N)$, so $G/N$ and $G$ do not have the same number of elements. For the general case, I suspect that it isn't possible as well, but I'm not sure. My intuition is that since $G$ is isomorphic to $G/\{e\}$, it shouldn't be isomorphic to another $G/N$, but I'm not sure if this is accurate.

Let $G$ be any group such that  $$G\cong G/H$$ where $H$ is a normal subgroup of $G$.  If $G$ is finite, then $H$ is the trivial subgroup $\{e\}$. Does the result still hold when $G$ is infinite ? In what kind of group could I search for a counterexample ?


When I write the following code:  \documentclass{article} \usepackage{siunitx} \begin{document}     Given the signal:     \[     v(t)=311\cdot\sin(9\cdot10^5t)     \]     We know that its period is $ T\approx7\si{\micro\second} $  \end{document}   The mu produced by \si{\micro\second} in detail:    Which is pixelated. Does anyone know why this happens?

When rendered the text in my pdf is not anti alised. Anyone knows how to do this?  The following example shows my text output compared with output from google docs pdf    Is it even possible with pdflatex?  Header file:  \usepackage[utf8]{inputenc} \usepackage[T1]{fontenc} \usepackage[english]{babel} \usepackage{amsmath} %\usepackage{icomma} %\usepackage{units} \usepackage{graphicx} \usepackage{epstopdf} \usepackage{color} \usepackage[hyphens]{url} \usepackage[breaklinks,pdfpagelabels=false]{hyperref} %\usepackage{lettrine} \usepackage[sort]{natbib} \usepackage{caption} \usepackage[final]{pdfpages}  %\usepackage{fancyhdr} %\usepackage{fncychap}   \newcommand{\degC}{\ensuremath{\,\unit{^\circ C}}} \newcommand{\mail}[1]{\href{mailto:#1}{\nolinkurl{#1}}}   Thanks!


Blocking Adobe Flash plugin, will not run items on various webpages. Does Adobe Flash support?

When I go to websites using Flash in Firefox, I get this warning:     This plugin is vulnerable and it should be updated.   Mozilla's  agrees:     Adobe Flash Player Shockwave Flash 11.2 r202 vulnerable 11.2.202.438   But if I follow the update link and download the Ubuntu version (opening with Software Center) I get     There isn’t a software package called “adobe-flashplugin” in your current software sources.   If I run  sudo apt-get update sudo apt-get install -y flashplugin-installer   I'm told     flashplugin-installer is already the newest version.   So how can I update?


I've got a HashMap that I need sorting by value and I'm trying to keep it concise, so I'm using Java 8. However various methods aren't working and I'm unsure why. I've tried this:  followLikeCount.values()   .stream()   .sorted(Map.Entry.comparingByValue())   .collect(Collectors.toList());   Which throws this compile time exception:  Main.java:65: error: no suitable method found for sorted(Comparator<Entry<Object,V#1>>)   .sorted(Map.Entry.comparingByValue())   I can't see why there is a mismatch from observation. I've also tried using the comparator:  Comparator<Map.Entry<Integer, Integer>> byValue =           Map.Entry.<Integer, Integer>comparingByValue();   Which yields a similar error. Please could you advise why the comparators aren't valid?

I am relatively new to Java, and often find that I need to sort a Map<Key, Value> on the values.  Since the values are not unique, I find myself converting the keySet into an array, and sorting that array through array sort with a custom comparator that sorts on the value associated with the key.  Is there an easier way?


Is it is possible to press the keyboard key by javascript code???? For Example I have a button and I want when a user press it some key automatically pressed of keyboard which I require.

Is it possible to simulate key press events programmatically in JavaScript?


Using apt list --installed one can get a list of packages installed by apt-get command. However, I would like to get a list of all packages installed in some other way e.g. by some script. Is this possible to get?

I'm contemplating writing a script that does this:   Goes through each file in /usr/lib Does a dpkg -s search on each file. Reports a list of "orphan" files not belonging to any .deb package.   The idea is that over time, I've installed a lot of make install software and I'd like to get a list of leftover files from manually installed software I've since deleted.


I have an error, and don't know what is cause, the error message which appeared undefined reference to int sqlite::bindParam<char const*>(char const*, char const*)  I have the following class     Class declaration: sqlite.h  class sqlite{  private: sqlite3 *db_Connection; sqlite3_stmt *sqlPrepare;  public:     sqlite();     int open(const char *db_fileName);     int close();     int query(const char *sql);     template <class T>     int bindParam(const char *parm_name, T parm_value);     ~sqlite(); };   The method which is the cause of the problem: sqlite.cpp  template <class T> int sqlite::bindParam(const char *parm_name, T parm_value){     const std::type_info &parameter_name = typeid(parm_name);     if(parameter_name == typeid(const char*) || parameter_name == typeid(char*)){         return sqlite3_bind_text(sqlPrepare, sqlite3_bind_parameter_index(sqlPrepare, parm_name) ,parm_value, 0, 0);     }else if(parameter_name == typeid(int)) {         return sqlite3_bind_int(sqlPrepare, sqlite3_bind_parameter_index(sqlPrepare, parm_name), parm_value);     }else if(parameter_name == typeid(double)){         return sqlite3_bind_double(sqlPrepare, sqlite3_bind_parameter_index(sqlPrepare, parm_name), parm_value);     } }   When usage:    int main(){     sqlite *sql = new sqlite();      if(sql->open("database.db") == SQLITE_OK){         cout << "Connected.";         sql->query("SELECT * FROM categories WHERE name=:name");         sql->bindParam<const char*>(":name", "Fruity");     }      delete sql;     return 0; }   I want to know what's wrong in my class specifically bindParam() method ?

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.)


Im developing the "features" section of a website and Im having trouble aligning text to an image.  I've tried setting the alignment to middle for the image in the css file like this:  vertical-align: middle;   And used <span> to place the text, but thats not working either.   What Im trying to acheive is very simple, but none of the solutions I've come across on here or through youtube have worked so I figured that I should just post the code, along with the image of how its supposed to look.  Heres a link to the folder containing the code:   Inside the folder, theres an image of how the website should look right below the index.html file  I would love any assistance on this. Thanks in advance!

Why won't vertical-align: middle work?  And yet, vertical-align: top does work.   span{   vertical-align: middle; }
      Doesn't work.


I have a button to select a tool and I want to make it look pressed after the user clicks it. I am using winforms and I do not want to use Check Box with Button Appearance. How can I achieve that?

Using VS2008, C#, .Net 2 and Winforms how can I make a regular Button look "pressed"? Imagine this button is an on/off switch.  ToolStripButton has the Checked property, but the regular Button does not.


How many fields are there (Up to isomorphism) with exactly 6 elements? In case of Group of order 6.. number of group( up to isomorphism )is 2..but what is it in case of field?

Let $F$ be a finite field. How do I prove that the order of $F$ is always of order $p^n$ where $p$ is prime?


grep might not be the solution to what I need. I'm trying to grab the MB/s info from this command dd if=/dev/zero of=tempfile bs=1M count=1024 which returns the following information  1024+0 records in 1024+0 records out xamount bytes(1.1GB) copied, 11.234 s, 30.5 MB/s  what I tried was dd if=/dev/zero of=tempfile bs=1M count=1024|grep -oP '.....MB/s but I'm fairly new to the grep command and I'm sure I'm doing it wrong. also this is on centOS

I'm trying to approximate the computer's write speed using dd:  dd if=/dev/urandom of=/dev/null bs=1K count=10000   which gives the following output  10000+0 records in 10000+0 records out 10240000 bytes (10 MB) copied, 0.746313 s, 13.7 MB/s   How can I get the '13.7 MB/s' into a bash variable? I've tried piping the output from dd to progs like awk, sed and grep to no avail.  Ultimately, I'm calling this via os.system(...) from within a python script. If anyone knows of a more direct way to get a similar result inside python I'd be interested in that also. I'm trying to predict how long a file copy will take, based on the file size.  Any help would be greatly appreciated.


I am reviewing for my upcoming Discrete Mathematics class and I'm clueless on the aforementioned question. I've tried expounding the XOR operator in hopes of transforming the problem but still I cannot find the solution to the problem.  The title is pretty self-explanatory, how do I prove their logical equivalence without using a truth table?  The truth table of the problem looks like this:  Problem truth table

I was assigned to prove the associative law on xor.  $(p \oplus q) \oplus r=p \oplus (q \oplus r)$  I'm sure   $(p\oplus q)=(p∧¬q)∨(¬p∧q)$  But I got stuck on  $(p \oplus q) \oplus r=[{(p∧¬q)∨(¬p∧q)}∧¬r]∨[¬{(p∧¬q)∨(¬p∧q)}]∧r$  What tatuologies (laws) would I need to prove the associative law for xor?  How do I relate those $p$ and $q$ to $r$ in order to prove it?  Any tips/advise would be appreciated.


I was on Stack Overflow just now editing someone else's question. When I submitted it, there was a queue on the edit, so my edit didn't go through. So I went back to leave the editing process. By doing that, I can't edit anyone's work. I finding that really annoying.

I edited some questions before, but now I get an error message when clicking the edit button. I thought there was a problem with the specific question, but I cannot click it on any question.  What's going on?


I need to determine whether the following function is tensor on $\Bbb R^4$ and express it in terms of elementary tensors. Can someone please help me with it? I do not know what elementary tensor means either.  $$f(x,y)=3x_1y_2+5x_2 x_3$$  Thanks in advance!

I am trying to solve question 4 in Munkres Analysis on Manifolds section 26.  The question is determine if the following is a tensor on $\mathbb{R}^4$ and express those that are in terms of the elementary tensors on $\mathbb{R}^4$.   $f(x,y) = 3 x_1 y_2 + 5 x_2 x_3$   I am trying to follow the definition of a tensor (which I don't think I fully understand) to show this. I know I must find a function $T: \mathbb{R}^4 \rightarrow \mathbb{R}$ that is linear on the $i^{th}$ variable. Since there are only 2, then I believe I have to somehow write $f$ as a projection. I'm just not sure where to  go from here.  Any hints would be great, thanks!


I have two monitors. Windows on one screen appear with a yellow background (instead of transparent/white).  When I move a window between the monitors it changes its background color.  Any idea how do I remove the yellow background?  I have tried all suggestions with color management - did not solve my problem.  I run Windows 7 Ultimate  Two monitors:   Samsung SyncMaster 226bw MAG ck2255af     This is not a duplicate question since it has nothing to do with Monitor Calibration Software.  The solution (by AFH) is adjusting the monitor itself by changing to warm temperature.

At work, I have two monitors.  Both of them are Dell E198WFPs, however, manufactured 8 months apart from one another, so they're not from the same lot.  I'm looking to calibrate them.  Currently, my secondary monitor (on the left) is the one I use for text reading, because it's easier to read.  Can someone suggest either a cheap calibration puck that works well, or a software solution that's relatively easy to work with?  I run Windows XP and have full admin access to my machine (I'm the domain administrator)  My graphics card in the machine is an nVidia Quadro NVS 285, if that makes much of a difference.


I am trying to learn memory allocation in c for union and having a problem trying to do so  #include <stdio.h> union abc {     int a;     char name[5]; };  int main() {     union abc hh;     printf("Enter two values\n");     scanf("%d%s",&hh.a,&hh.name);     printf("Values are\n");     printf("%d\n%s",hh.a,hh.name);      return 0; }   As seen in the above code i am trying to store two values in a union.But however the result i am getting after enter values as '23' and 'p' is  Enter two values                                                                                23                                                                                p                                                                                Values are                                                                                112                                                                                p      Can someone help me regarding above code

Is there any good example to give the difference between a struct and a union? Basically I know that struct uses all the memory of its member and union uses the largest members memory space. Is there any other OS level difference?


How do I use command blocks to make it so after an entity has had a tag for 1 minute/any given time, it will be taken away?

I found 11 questions like this on gamingSE already, but none of them have proper and up-to-date answers. So I'm creating this Q&A:  How do you either activate a command x seconds/minutes/hours/… in the future or every x seconds/minutes/… in a loop?  Repeating command blocks and ticking functions execute 20 times per second, redstone is  in many situations and most of the extremely fancy solutions, like falling blocks in cobwebs, have broken over time or are needlessly complicated.


I am just curious about the axioms of topology. In particular with regard to finite intersections. The way that I imagine the axioms of topology is that we give a set $X$ a way of arranging it's points. I was wondering why do we restrict ourself to only finite intersections. Does someone has any intuition about this?

I was wondering if there is a reason why in the definition of a topologic space, the reunion of any collection of open sets is also an open set but the intersection has to be finite to be a set.  Is there because of the definition of an open set itself ? I have always seen it as a definition, but now I want to know why.  Thanks for your help.


Where did the term “good-bye” come from and what does it originally mean?

I've heard that goodbye comes from God be with you.  Is that true?  If so how did it become good?  Did goodbye always have the same meaning it has now?


So I accidentally did sudo chmod -R 775 / when I meant to do sudo chmod -R 775 ./. I quickly realized and hit Ctrl^C, but not in time to save everything. I realize this is a really stupid mistake and all that but I'm aware of that and I would just like to fix my OS now.  Anyway, this completely broke my OS (Ubuntu 12.04). Currently, several functions of the shell, including tab completion prints the error      bash: cannot create temp file for here   And running any bash command that I have tried on any file in my home (/home/$USER) folder crashes the terminal. Several other random things don't work around the OS now.

I accidently ran  sudo chmod 755 -R /   instead of  sudo chmod 755 -R ./   I stopped it after few seconds, but now there is some problems such as  sudo: must be setuid root   How can I revert permissions back?


Is there any way to view the exact timestamp of a question asked on Stack Exchange? (ideally second precision)

When answers to a question are posted it is indicated (above the poster's ID) in-terms of the time difference between now and the time of the post.  In the early minutes after an answer, that time is rounded to the minute.  Just curious, but does it round up or down?  Or does it go to the closest minute?  The reason I ask, is because on  today Joe and I posted within a short time of each other.  His did not appear until after I posted mine.  Yet, in the comments someone comes-out and accuses me of poaching Joe's answer saying "there's 2 minutes between the answers."  I wanted to reply with something to the effect of it being a potential difference of 61 seconds or so, but I didn't want to assume that it rounds-up.


I saw the user  post a  when he had less than 10 rep. Was this a bug or was this posted as an answer and someone made it into a comment because it was helpful.

On this question on Super User …    … there is a comment:  Yes, it is possible. Check out this question: apple.stackexchange.com/questions/447/… –   The interesting thing is that:  The user has 1 reputation There was no migrated / deleted answer The question itself was not migrated The user is registered The user does not have any associated network account, therefore no network profile The mods .   Why were they able to post a comment?


I'm writing a class that does essentially the same type of calculation for each of the primitive numeric types in C#.  Though the real calculation is more complex, think of it as a method to compute the average of a number of values, e.g.  class Calc {     public int Count { get; private set; }     public int Total { get; private set; }     public int Average { get { return Count / Total; } }     public int AddDataPoint(int data)     {         Total += data;         Count++;     } }   Now to support that same operation for double, float and perhaps other classes that define operator + and operator /, my first thought was to simply use generics:  class Calc<T> {     public T Count { get; private set; }     public T Total { get; private set; }     public T Average { get { return Count / Total; } }     public T AddDataPoint(T data)     {         Total += data;         Count++;     } }   Unfortunately C# is unable to determine whether T supports operators + and / so does not compile the above snippet.  My next thought was to constrain T to types that support those operators, but my initial research indicates this cannot be done.  It's certainly possible to box each of the types I want to support in a class that implements a custom interface e.g. IMath and restrict T to that, but this code will be called a great number of times and I want to avoid boxing overhead.  Is there an elegant and efficient way to solve this without code duplication?

Can anyone tell me if there is a way with generics to limit a generic type argument T to only:   Int16 Int32 Int64 UInt16 UInt32 UInt64   I'm aware of the where keyword, but can't find an interface for only these types,  Something like:  static bool IntegerFunction<T>(T value) where T : INumeric


As a disabled vet I cannot switch hardware to something Ubuntu finds more agreeable due to cash restraints. Will there be an i386 Desktop version?

What is the difference between 32-bit and 64-bit Ubuntu? I've heard the 64-bit platform performs better and can detect more than 4GB of RAM. Also, while some apps haven't ported to 64-bit yet, ia32-libs lets a 64-bit machine run them.  If so, why not promote 64-bit over 32-bit?


I'm trying to add an image to a page with text over the bottom of the image. I've run into 3 issues however:   The image is not properly loading; it's either made up of a grid of the same image or is a crop of the original. The image is not positioning correctly, i can move it from top to bottom but cannot get it to move away from the left. The text is not properly loading on top of the image.   Here is my code:  HTML:   <!DOCTYPE html>               <title>Himalayas</title>          <link rel=stylesheet href="stylesheet.css">         <link rel="stylesheet" href="https://stackpath.bootstrapcdn.com/bootstrap/4.4.1/css/bootstrap.min.css" integrity="sha384-Vkoo8x4CGsO3+Hhxv8T/Q5PaXtkKtu6ug5TOeNV6gBiFeWPGFN9MuhOf23Q9Ifjh" crossorigin="anonymous">

                 Text Here

          SCSS:   $title-left:150px; .title-image{     color: red;     position:relative;     top:$title-top;     left:$title-left;     height:100px;     width:200px;     background-size:100%;     background-image: url(TitleMountain.png); } .title-text{     position:relative;     top:$title-top+70;     left:$title-left; }   Any help is greatly appreciated

I want to overlay one image with another using CSS. An example of this is the first image (the background if you like) will be a thumbnail link of a product, with the link opening a lightbox / popup showing a larger version of the image.   On top of this linked image I would like an image of a magnifying glass, to show people that the image can be clicked to enlarge it (apparently this isn't obvious without the magnifying glass).


I've heard that quantum mechanics is really hard to teach people how to fully understand. Maybe there are some statements that some people seem to be able to prove are true according to a certain quantum theory but those statements are not normal statements and other people can't ever be made to understand what those statements mean. I'm wondering if despite that, a formal system has been created by some of those who claim to fully understand a certain quantum theory and other people can be taught how to write a formal proof in that system and taught how to formalize the question of the density of water at any internal energy and pressure as a string of characters that represents a statement in that system and write a formal proof of the formalization of statement of its density as a function of pressure and internal energy without worrying about not being able to learn what the statement actually means.  More specifically, my question is whether a formal system has been created for a simplified theory of the universe electrons and nuclei are point charges with no nuclear chemistry and gravity, dark matter, and the cosmological constant don't exist. If so, has that system also been mathematically proven to be consistent. I'm pretty sure that if the system includes the second law of thermodynamics as an axiom, then it's inconsistent because according to , the second law of thermodynamics hasn't been proven to be an absolute law.  I read the first bit of the Wikipedia article  and it didn't say whether it was the type of formal system I described here. I don't really feel like reading more because I don't want to take the risk that after wasting a lot of my life doing a whole lot of reading on that topic, it will be all for nothing and I will still not understand what they're saying.

Everything from Quantum mechanics can be derived from six (?) postulates. Similarly classical electrodynamics can be reduced to Maxwell's equations and Lorentz force law, and special relativity is based on two postulates.   Are there similar sets of postulates for Newtonian mechanics/gravity or other fields of physics, like quantum field theory or string theory?


I tried to drag and drop a file from desktop to an opened folder (not to the folder icon), but it doesn't work. How can i fix it? Thank you in advance.

If I insert a flash drive and try to drag any files onto desktop - nothing happens.  Or from any other folder.  Drag 'n copy only works if you open desktop in nautilus ("show desktop in files").  I already ran the command:  gsettings set org.gnome.nautilus.preferences use-experimental-views false   It didn't help. How to fix this?


So one thing I don't understand, gravity moves 2 masses closer together. But to move something/to exert force on something you need to expend energy. But gravity has been moving stuff and keeping it closer together for like 14 billion years now....where does that "energy" come from which enables gravity to continually keep stuff together? Well..I know gravity is itself a force..but what is it fueled from?

I would like to know where gravity gets its energy to attract physical bodies?  I know that the law of conservation states that total energy of an isolated system cannot change. So gravity has to be getting its energy from somewhere, or else things like hydropower plants wouldn't be able to turn the power of the falling water into a spinning rotor.  Just to be clear, Lets create an example:  Lets say we have two objects with equal mass close to each other. So gravity does its job and it pulls each other closer, this gets turned into kinetic energy. This is where I'm lost. According to the law of conservation energy can't be created or destroyed and the kinetic energy comes from the gravitational pull so where does the gravitational pull gets its energy.  If that energy isn't being recycled from some where else then that means you have just created energy, therefore breaking the law of conservation.


According to  Zorn's Lemma says;  every partially ordered set containing upper bounds for every chain necessarily contains at least one maximal element.  According to  Zorn's Lemma says something slightly different;  Every preorder in which every sub-total order has an upper bound has a maximal element.  Are these different?  Is the nlab version stronger than the other? I can see how most of it corresponds;  sub-total order $\mapsto$ chain. at least one maximal $\mapsto$ a maximal  but I have to conclude with its weaker preorder condition, the nlab version is a stronger theorem.  Is this correct? Am I right in thinking that when there are multiple maximal elements, they might look like a cyclic set that fails antisymmtry such $a\preceq b\preceq c\preceq a$, and in this case every distinct element $a,b,$ and $c$ are maximal elements? I'm unclear whether it can be the case that there are separate distinct maximal chains e.g. $a\preceq a$ and $b\preceq b$ which do not satisfy $a\preceq b$.

What would happen if we would use pre-order (there is no weak-antisymmetry, only reflexivity and transitivity) in  Kuratowski-Zorn Lemma instead of partial order?      Suppose that we have set P which is preordered and  has the property   that every chain (i.e. totally ordered subset) has an upper bound in   P. Then the set P contains at least one maximal element.   Is this statement true in ZFC? If not, what can we postulate to make it true? I think it can be false, or at least we need to postulate something more (or not?), but I am just missing something and don't see it.  P.S.      I wanted to put tags with combination of words like: Kuratowski Zorn Lemma Pre-order Proset, but it seems that none of them exist and I need to have 300+ reputation to create new ones, thus I only typed (set-theory) :( If someone with bigger reputation could make this topics' tags more precise, I would be grateful :)


I've searched everywhere before asking this question but I couldn't find an answer to my specific question:  "In spite of all the problems in life—lack of education, poverty, unemployment— John always thinks that his own problems are bigger.  I've just made this sentence so I know it's kinda choppy and misleading. I want to know if the use of em dash here is correct and do I have to put " and " before the last option in the list, which is "unemployment"?

According to :     The em dash, m dash, m-rule, or "mutton" (—) often demarcates a break   of thought or some similar interpolation stronger than the   interpolation demarcated by parentheses   Okay, but what constitutes "stronger"? Does the length of the parenthetical phrase come into play? The distance of the diversion from the main thrust of the sentence? Some kind of qualitative gut feel? All of the above?


Today I installed Ubuntu alongside windows 8 (option was first, without making partition). Everything was Ok but when the system restart there was no option to choose Ubuntu. By default it always start with my existing OS 8. Please Help me.  Thnx Lalit Kumar

I installed Windows 7, which ate Ubuntu's boot file. When starting up the computer, it now goes straight to Windows, without giving me the option of booting Ubuntu.   How can I get Ubuntu back?


I am getting stuck at a purple screen when trying to boot Ubuntu using the GTX 1080ti.  There are literally dozens of questions describing the same problem but none of the answers are solving my problem.  The most common answer is to boot using the integrated graphics card, install the Nvidia drivers, and then reboot the system with SecureBoot off (and through the 1080 this time).  I tried that but still get the hanging purple screen. I've tried with both nvidia-375 (apt-get) and nvidia-384 (ppa), but neither seem to work. It's still just stuck at the purple screen.  Any ideas?  Video card: Nvidia GTX 1080ti  Motherboard: ASRock z270 K6  Ubuntu: 16.04.3

I am trying to boot Ubuntu on my computer.  When I boot Ubuntu, it boots to a black screen.  How can I fix this? Table of Contents:


I'm creating a program that uses two methods to print all the odd numbers in an array and then get the sum of the odd numbers. However, I'm getting an output that makes no sense. This is the code that I'm using: public class ArrayMethods1 {     public static int[] printOdds(int[]arrayExample) {         int i;         String oddNum = "";         int [] newArray = new int [3];         int x = 0;         for (i = 0; i < arrayExample.length; i++) {             if (arrayExample[i] % 2 != 0) {                 System.out.print(arrayExample[i] + " ");             }         }         int[] sumOfOdds = new int [1];         sumOfOdds = sumOdds(newArray);         return sumOfOdds;     }     public static int[] sumOdds(int[]arrayExample1) {         int i;         int[] oddsTotal = new int[1];         int total = 0;         for (i = 0; i < arrayExample1.length; i++) {             if (arrayExample1[i] % 2 != 0) {                 total = total + arrayExample1[i];             }         }         oddsTotal[0] = total;         return oddsTotal;     }     public static void main(String[] args) {         int [] mainArray = new int [5];         mainArray[0] = 17;         mainArray[1] = 92;         mainArray[2] = 21;         mainArray[3] = 984;         mainArray[4] = 75;       printOdds(mainArray);       int [] oddSum = new int[1];         oddSum = sumOdds(mainArray);         System.out.println(oddSum);     } }  And I'm getting this as output: 17 21 75 [I@51016012 I have absolutely no idea where that second part is coming from, so any help would be awesome. Thanks!

In Java, arrays don't override toString(), so if you try to print one directly, you get the className + '@' + the hex of the  of the array, as defined by Object.toString():  int[] intArray = new int[] {1, 2, 3, 4, 5}; System.out.println(intArray);     // prints something like '[I@3343c8b3'   But usually, we'd actually want something more like [1, 2, 3, 4, 5]. What's the simplest way of doing that? Here are some example inputs and outputs:  // Array of primitives: int[] intArray = new int[] {1, 2, 3, 4, 5}; //output: [1, 2, 3, 4, 5]  // Array of object references: String[] strArray = new String[] {"John", "Mary", "Bob"}; //output: [John, Mary, Bob]


The list item size is matchparent so each item is occupying the whole screen. Just a simple fix- use wrap content   App Version: 1.0.89 Device Manufacturer: LGE Device Model: Nexus 5   OS Version: 6.0.1 (3437181)

There is some unwanted extra spaces in between each site in the Your Sites section.  Steps to reproduce:   Touch the Nav Icon in the left top corner Touch the EDIT link in YOUR SITES Scroll the screen; there is unwanted spaces in between the each site   For reference I recorded the same:    Configurations:   App Version: 1.0.85 Device Manufacturer: Motorola Device Model: XT1033 OS Version: 5.1 (2)


How can I check whether a zip file is damaged? I know that with zip -F input.zip --out output.zip I can fix the file. But I could not find an option that only checks the file CRC.  I'm using Ubuntu 12.04.

There was a utility a long time ago called CFAtest that was doing this quite nicely, but it has disappeared.  Basically, I am looking for a similar tool (preferably graphical) that will traverse a given path (preferably including subfolders) and test all zip files that it finds.   Decent logging options would be a plus.