My issue is a little bit different than anything I've found so far on the forums. I had successfully installed Ubuntu on my Windows 8.1 hp laptop using the manual partitioning method (not the "install alongside windows 8" way). Today my Ubuntu was being weird and the mouse was blinking and all the text was resizing over and over again, and my shutdown button actually popped up the "lock" and "log out" options instead of the "shutdown" and "restart" options.   So I rebooted Ubuntu using LiveUSB and installed it again, and a message showed up saying "Ubuntu 14.04 detected", and the 2 options were "install Ubuntu 14.04 alongside Ubuntu 14.04" and "erase Ubuntu 14.04 and do a clean installation of it (or something like that)". I thought the second option would only affect my Ubuntu partition, so I selected it. Then I restarted my computer and found that my entire hardrive now was taken up by Ubuntu.   Is there a way for me to get back my windows partition? Would installing windows with LiveUSB and then restoring it with the backup I created work?

I have a Toshiba satellite A-200 laptop with a Vista OS on it with 4 NTFS partitions  (C:) Vista  (D:) Entertainment  (E:) Work  (F:) Sources   and I wanted to start using Ubuntu instead. So I tried it first from the live CD and everything was OK and all the partitions were shown and working and so I decided to install Ubuntu to replace Vista on the (C:) drive. After I did that I can no longer find my folders and files on the (D:), (E:), (F:) partitions and the only file system that is shown is one 198 GB although my HDD is 320 GB.  I can't access the lost data on the remaining 120 GB which I hope is still there and not totally lost  I am now working from the live CD but I am unable to install testdisk. Can I recover the Vista partitions by the product recovery CD to get my laptop back to the factory settings? Can I recover the NTFS partitions using a recovery program for Windows or will that make the problem worse?   I need these data badly as I don't have a backup for them.


Can anyone tell me why $$1/2+\cos x+\cos 2x+\cdots+\cos nx=\frac{\sin((n+1/2)x)}{2\sin (x/2)}\text{ ?}$$

How can we sum up $\sin$ and $\cos$ series when the angles are in arithmetic progression? For example here is the sum of $\cos$ series:  $$\sum_{k=0}^{n-1}\cos (a+k \cdot d) =\frac{\sin(n \times \frac{d}{2})}{\sin ( \frac{d}{2} )} \times \cos \biggl( \frac{ 2 a + (n-1)\cdot d}{2}\biggr)$$  There is a slight difference in case of $\sin$, which is: $$\sum_{k=0}^{n-1}\sin (a+k \cdot d) =\frac{\sin(n \times \frac{d}{2})}{\sin ( \frac{d}{2} )} \times \sin\biggl( \frac{2  a + (n-1)\cdot d}{2}\biggr)$$   How do we prove the above two identities?


I got an assignment to change some things on vb.net project. Since I'm working with C# most of the time, I'm having some issues with some things.   What I want to know is how can I create a method which will return list of integers, something in C# like private List<int> NameOfMethod().  So I'm trying something like:  Private Sub GetSourcesInfo() As   And this method will need to return list of integers, how can I achieve that in VB.net?

In order to return a value from a VB.NET function one can assign a value to the "Functions Name" or use "return value."  I sometimes see these inter-mixed in the same function.  Personally, I prefer the return.  My question is, what is the internal difference, if any, between the two?


On some sites, several searches that I tried after after choosing active tab or newest tab, the search only show questions at least 2 days old.   If I search for some extremely common word - for example limit on Mathematics site - at the top of the  and the  questions with last activity/creation day at least two days ago are shown.  Below are screenshots from Mathematics. I have noticed the same behavior on several other sites. (Although on  and  the search worked as expected - some relatively new questions were shown among the results.)  This is what I get in the active tab.    And this is the newest tab.    Browsing among questions tagged limits you can see many question that should have been displayed in the  and  of the above searches (and are newer than 2 days).

Using search for new questions returns yesterday's and older posts for many sites. Tested for localized Stack Overflow...            and other sites such as , , , etc.  English Stack Overflow . So does   Possibly related to my previous bug report:   Seems this happens again. Now for SO and MSE too.


Suppose $f(x)$ is continuous function $$f:[0,+\infty)\mapsto\mathbb{R}$$ and $$\lim_{x\to \infty}f(x)=1$$ how to find $$\lim_{n\to \infty}\int_{1385}^{2017}f(nx)\,dx $$  Honestly, I have no idea for a start. can someone help me? thanks in advance.

Suppose $f\colon [0, +\infty) \to \mathbb{R}$ is a continuous function and $\displaystyle \lim \limits_{x \to +\infty} f(x) = 1$. Find the following limit:  $$\large\displaystyle \lim \limits_{n \to \infty} \int \limits^{2006}_{1385}f(nx)\, \mathrm dx$$


I have a document with several equations that fit the text width, so the tag is below the equation in those long formulas. I don't want to use splitting enviroments but in some cases, specially in cases environment with \frac{}{}, I would like more distance between the tag and the equation. I know it is possible to manually add this space with \raisetag command. Is it possible to automatically increment this vertical spacing only for those equations that fit the line width?  Thanks in advance.  \documentclass[a4paper]{article} \usepackage{amsmath} \begin{document} \begin{equation}  a+a+a+a+a+a+a+a+a+a+a+a+a+a+a+a+a+a+a+a+a+a+a+a+a  \begin{cases}   \frac{1}{2}\\   \frac{1}{3}  \end{cases} \end{equation} \end{document}

My equation number is being placed directly below my equation, so close they're almost touching and it looks really bad. Is there any way that I can get it to move down a little bit? Here's a picture.    My code   \documentclass{report}  \usepackage{amsmath}  \begin{document}  \chapter{A chapter} \section{A section} \subsection{A subsection}  The elementary solution is  \begin{equation} f(\cosh(\rho_{H}(z,w))=k(z,w)=% \frac{% e^{-t/4}\sqrt{2}}{(4\pi{}t)^{3/2}}\int_{\rho_{H}(z,w)}^{\infty}{\frac{be^{-b^{-2}/4t}db}{% \sqrt{\cosh(b)-\cosh(\rho_{H}(z,w))}}}. \end{equation}  Further text.  \end{document}


I am planning to make a pasta dish and would like to know if adding 1Tb spoon of olive oil while boiling 500 gram of pasta make it sticky. What are the other advantages and disadvantages of this approach?

Many people (at least in Germany) think that Italians add olive oil to the boiling water for spaghetti. However, Italians tend to tell the opposite (from my experience).  So, can you please state objective reasons for or against adding olive oil to the boiling water for spaghetti?


My friends told me that the sophisticated way to use display math in LaTeX is \[ instead of $$. Reading about the issue here on tex.stackexchange and in the l2tabu, it seems like the consensus reason why is that $$ is a TeX primitive, and thus deprecated at least since 1994 (the year I was born) with the release of LaTeX2e. Meanwhile, \[ is part of LaTeX, not TeX, so using it doesn't muck around too much in the source, it's easier to detect errors when using it, the vertical spacing is better, and it works really well with the amsmath package. (Although it does have the slight disadvantage that it is not supported by MathJax.)  My question: To what extent does all of this reasoning carry over to the decision to use either $ or \( for inline math?  The single dollar sign $ is also a TeX primitive, so seemingly it should also be deprecated for the same reason the double dollar sign $$ is.   supports the position that \( should be used instead of $, in spite of the author of l2tabu's assertion to the contrary.  However,  only mentions facilitating error correction and detection as an advantage of \( over $.  Who is right?

Along the lines of , what reasons are there (if any) to favor \( ... \) over $ ... $?


I am a Philippine citizen currently UK resident. I wanted to take a 1 week holiday in Spain. Will they allow me entry with my UK biometric residence permit + Philippine passport or do I need a visa?

Me and my friends are planning on inter railing from the UK. They all have a British Citizen but I do not. I only have a PR and I have been a resident in the UK for 10 years. The question is do I still need a schengen visa? (BTW I think I do but want to make sure).  EDIT: I have an Indian Passport


I dont want to mess any thing ,hence asking the question for clarification .  Thanks

Question is about Ubuntu release process. Are migrations from n to n+1 releases expected?  Assuming we have server with installed Ubuntu 14.04 LTS. Will it be smoothly upgradable to Ubuntu 16.04 LTS via apt-get upgrade ?  Assumptions:   scope is software therefore we assume that given hardware is supported on both releases (upgrading from and to) that's why, always before upgrade you are asked to make backup to be able to revert in case of failure


How would you describe the bolded words here? They don't intuitively seem like  to me, but I might be wrong.       List X can be created by appending the contents of List B to List A.         List Y is the result of sorting List X.

Examples:   Savings Shavings Drippings   Are these gerunds?  I found some resources (below) that don't seem to provide definitive answers.


I've just got a new computer monitor, and I've added it to my previous one, and I have some questions I need answers to:   Is there any way to make the windows taskbar go on both monitors? I tried using DispleyFusion (5.1), but after installation it didn't work and after a few reinstalls it just gave a BSoD. Is there a way to make a shortcut button on my mouse/keyboard to make the mouse pointer jump to the other monitor?

I can't for the life of me get the vista taskbar to span multiple monitors.  I've searched and looked far and wide, and alas the only pseudo-solution i can find is Ultra-Mon, but a) it doesn't quite look the same  and b) i don't want to have to pay for something that Windows really ought to be able to do out of the box.   Does anyone have a solution for this?  Will this get addressed in Windows 7?


I've looked at all the relevant topics on the site and this particular gotcha does not seem to be covered  I exported a Word 2016 document (in French) as filtered HTML ( filtered= no office specific stuff included). If I show the file in my browser as html, everything is fine - all the accents show correctly. ( Charset is utf-8 and it's not coming from a database). But when I change the extension to .php and run it, all the french characters are shown as black diamonds with a question mark inside.  If I express the french characters as html entities, they show correctly, but I don't want to do this as the fix - there are hundreds of them in there, and I don't want to edit the text - it's not mine and the author would have to proof read it all again just to check the accents.  So I figured it's a PHP (5.5.26) issue - but I can't see anything in the ini file which might affect this - it looks like UTF-8 is the default charset if you don't change anything,  What's the fix ??

I'm setting up a new server and want to support UTF-8 fully in my web application. I have tried this in the past on existing servers and always seem to end up having to fall back to ISO-8859-1.  Where exactly do I need to set the encoding/charsets? I'm aware that I need to configure Apache, MySQL, and PHP to do this — is there some standard checklist I can follow, or perhaps troubleshoot where the mismatches occur?  This is for a new Linux server, running MySQL 5, PHP, 5 and Apache 2.


I have my first question here. I'm writing a code in Python. I have following list  X = [0.2,0.3,0.2,0.3,0.2,0.3,0.2,0.3,0.2,0.3]   I would like to create a new list made by tuples of two or a different number of elements of the first list as follows.  newList = [(0.2,0.3),(0.2,0.3),(0.2,0.3),(0.2,0.3),(0.2,0.3)]   I'm looking for a function of the lists or tuples. or maybe something easy, without the use of a big "For"

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


The problem is in the title. Here is a detailed description:  Let's say we have list $[x_i]_{i=1}^{i=n}$ where $x_i\in\Bbb{N}$. I want to pick such $m\in\Bbb{N}$ which minimises the sum $\sum_{i=1}^{i=n} |x_i-m|$.  In my computer science class we had a problem which was equivalent to the upper one. And apparently the answer was that the $m$ we should choose is the median of the list. But no one has proven it, and I have a hard time seeing why that is the case and not for example arithmetic mean of the list.   What strategy should I use in order to prove that?

Suppose we have a set $S$ of real numbers. Show that   $$\sum_{s\in S}|s-x| $$   is minimal if $x$ is equal to the median.    This is a sample exam question of one of the exams that I need to take and I don't know how to proceed.


I want to create a 2D array of functions. The method I used worked for 1D array of functions, however it doesn't work for 2D array of functions.  import numpy as np r=2 c=2  f1D=  [None]*r f2D= [ [None] * c ] * r  def f1():     return 1 def f2():     return 2  f1D[0]=f1 f1D[1]=f2  f2D[0][0]=f1 f2D[0][1]=f1 f2D[1][0]=f2 f2D[1][1]=f2  print('f1D') for i in np.arange(r):     print(f1D[i]())  print('f2D') for i in np.arange(r):     for j in np.arange(c):         print(f2D[i][j]())   The output is:  f1D 1 2 f2D 2 2 2 2   Clearly incorrect for what I want on f2D.

I needed to create a list of lists in Python, so I typed the following: my_list = [[1] * 4] * 3  The list looked like this: [[1, 1, 1, 1], [1, 1, 1, 1], [1, 1, 1, 1]]    Then I changed one of the innermost values: my_list[0][0] = 5  Now my list looks like this: [[5, 1, 1, 1], [5, 1, 1, 1], [5, 1, 1, 1]]    which is not what I wanted or expected. Can someone please explain what's going on, and how to get around it?


I have a class   public final class GGGGG {      private final String str;      public GGGGG(final String str) {         this.str = str;     }      public void showElement(final String test){         System.out.println(this.str+test);     }      public static void main(String[] args) {         GGGGG hello = new GGGGG("hello");         final Test2 test2 = new Test2(hello::showElement);         test2.test();         hello = null;         test2.test();      }      static class Test2{         private final Consumer<String> consumer;          Test2(final Consumer<String> consumer) {             this.consumer = consumer;         }          public void test(){             this.consumer.accept(" world");         }     } }   What I don't understand, in class GGGG I have String str(state)  I create a consumer with method reference to the method showElement And now this consumer has reference to the GGGGG instance. Does consumer keep a reference to the original object or create a new instance, if it the same reference when it will be garbage collected?

I always thought Java uses pass-by-reference. However, I've seen a couple of blog posts (for example, ) that claim that it isn't (the blog post says that Java uses pass-by-value). I don't think I understand the distinction they're making. What is the explanation?


I would like to use an align environment with a single equation number but with multiple equations per line. For example, the following two pieces of code work:  begin{align} a&= 1 & b&= 2 + 3\\ c&= 4 + 5 & d&= 6\ \end{align}  begin{align}\begin{split} a&= 1\\ c&= 4 + 5 \end{split}\end{align}   The second example succeeds in having one equation reference in the middle, and the first succeeds in having multiple equations per line. How might I have multiple equations per line with one equation reference? Thanks!

What I have are two equations with align and I want one single equation number to refer to this system of equations. To illustrate, I have  \begin{align}   dr_t &= \kappa ( \theta - r_t ) dt + \sigma_r r^{\xi} dW_t \\   dA_t &= \mu A_t dt + \sigma_A^{\alpha} dZ_t, \end{align}    and I want neither  \begin{align}   dr_t &= \kappa ( \theta - r_t ) dt + \sigma_r r^{\xi} dW_t \nonumber \\   dA_t &= \mu A_t dt + \sigma_A^{\alpha} dZ_t, \end{align}    nor   \begin{align}   dr_t &= \kappa ( \theta - r_t ) dt + \sigma_r r^{\xi} dW_t \\   dA_t &= \mu A_t dt + \sigma_A^{\alpha} dZ_t, \nonumber \end{align}     but having a single number in the middle. I know this can be achieved by nesting an array inside of an equation but then some symbols (sums, etc.) look differently and I thought there had to be a better way of doing this.


Using Lenovo Legion Y540 With 256 SSD+1TB HDD: There is 160gb Free Storage available in SSD , but i'm not able to shrink the drive(Only 25GB is getting shrinked). So how can I install Ubuntu on SSD? Will it be better to Install on HDD? Please help me out , I tried a lot but can't figure it out ALSO , how to install it on HDD I'm a first time Installer of linux* Laptop: Lenovo Legion Y540 RAM : 8GB SSD : 256GB HDD : 1 TB BIOS : UEFI

first of all thank you for answering.  I have a 120GB SSD and a 1TB HDD and I want to dual boot with Windows 10. I tried with this configuration:  SSD  / (ext4 20GB) /usr (ext4 15GB) /boot/efi (ext4 250MB)  HDD  /var (ext4 3GB) /tmp (ext4 8GB) /home (ext4 50GB) swap (none 24GB) (RAM 16GB)  I don't know if I am doing OK, as I tried to install it but installation gets stuck at "Saving installed packages..." and it doesn't continue. I wonder if it could be cause I didn't  partitioned as I had to. I don't find any post where this happens so I ask here.  Thanks!


My laptop uses an Intel Atom Z3735F processor, which the CPU specs on the Intel website indicate is 64-bit but only supports a maximum of 2 GiB of RAM. (The laptop came with Windows 10 32-bit pre-installed.) What is the point of having a 64-bit CPU which only supports 2 GiB of RAM? Does a 64-bit processor have any advantage beyond more conveniently supporting more memory?

I have an Acer Aspire Switch 10 SW5-012 detachable notebook which has 2GB of RAM based on an x64 based processor. I got it with a 32 bit version of windows 8 but upgraded to windows 10 recently. But before I do anything else, I was considering if I'd be having Better performance with the 64 bit version of windows 10. Would it make my notebook perform better since it's based on an x64 based Intel Atom Z3735F? Or should I just stick to the 32 bit version of windows 10?


There are many articles about quantum computers describing how powerful they are in computing and that they can solve very complicated equations in a short time. One of the biggest security measures that provide safety for computer security is that sometimes it takes years to break a piece of encrypted data.  Will this safety remain after a quantum computing revolution? The question is:   Can they do such complicated computing? Is it possible quantum computers put computer security in jeopardy?

The cryptographic world has been buzzing the word "quantum" for a while now (even the NSA is currently preparing itself for a post-quantum crypto world) and quantum-related hardware engineering is evolving constantly. For example: the 5-qubit quantum computer created at MIT by using the technique of ion traps succeeded in prime-factorizing 15. Does that mean that since it succesfully managed that, that it is a all-purpose quantum computer which could be used for cryptanalysis and/or cryptographic attacks?   If that's not the case, what exactly would a "real" quantum computer need (think: rough description of expected technical abilities, aka specs) to enable its users to use it for cryptanalysis and/or cryptographic attack purposes? And - ignoring rumours about potentially existing but confidential governmental projects - does any such system already exist today?


I know how to check whether required arguments are given on the command line. But how do I check whether the given argument on the command line actually refers to an existing file in the folder I'm running the code in?  I'm trying to incorporate this verification in order to save time by skipping parts of my code in case the file cannot be referenced to.

How do I check whether a file exists or not, without using the  statement?


During Fantastic Beasts and Where To Find Them, plenty of Muggles come to learn "a lot" about the wizarding world. This was solved when Frank the Thunderbird dispersed Swooping Evil venom over New York.  However, this fell as rainfall and umbrellas seemed to be able to stop it (magical ones at least). It also shows that it apparently   as the bank manager is inside showering but appears to have had his memory "wiped".  There would have been people inside or even not in New York anymore. It would make sense that some of these wouldn't have come into contact with the rainfall. So what happened to these people?  Were their memories wiped some other way? Were they hunted down by the Ministry and wiped? Or did some even manage to live on with the memory of it all?

Did the Thunderbird and rain and Obliviate spell at the end of Fantastic Beasts affect everyone in New York City? Or just those who were standing in the rain?  This video seems to imply anybody who was indoors was also affected, but I would prefer an explanation from a canon source.                                  If the Thunderbird's rainstorm was the key to spreading the Obliviate spell across the entire city, I don't see how that would affect people indoors. Or maybe not even those under an umbrella.  Hmmm, maybe that is why Queenie made a magical umbrella when she kissed Jacob as she obliviated his memories. Perhaps that's why he seems to remember some details.                                  An answer to a related question says,     The rain water contaminates the water in the pipelines and/or overhead storage tanks of the buildings in the city. As you mentioned, a guy in the shower loses his memory. There is also a shot of a woman drinking from a tap who also loses her memory. (emphasis mine)   So if the rainwater is the key to the forgetfulness, then what about all the people who were indoors and did not sip water that day?


I have been trying to run my code on IBM's quantum computers, so I used the following commands to associate a quantum computer to the component qcomp:  provider = IBMQ.get_provider('ibm-q') qcomp = provider.get_backend('ibmq-16-melbourne')   But the queue is endless. I live in Southern Europe.

What is the best option for South America Brazil to configure: provider.get_backend (''), because melbourne_16 is very slow.


Photons are described as packets of energy and photon with a frequency has mass, momentum and kinetic energy. If they are particles, how can they have frequency? If they are waves with a frequency, how can they have mass?

Consider the question, .  The answers say, "an elementary particle" and not much else. They don't actually answer the question. Moreover, the question is flagged as a duplicate of,  – the answers there don't tell me what a photon is either. Nor do any of the answers to  mentioned in the comments. When I search on , I can't find anything useful. Questions such as,  look promising, but bear no fruit.  say things like, "the photon is an excitation of the photon field." That tells me  nothing. Nor does the , which says:     The photon is the quantum of the electromagnetic four-potential, and therefore the massless bosonic particle associated with the electromagnetic force, commonly also called the 'particle of light'...   I'd say that's less than helpful because it gives the impression that photons are forever popping into existence and flying back and forth exerting force. This same concept is in the  too - but it isn't true. As , "Virtual particles only exist in the mathematics of the model." So, who can tell me what a real photon is, or refer me to some kind of authoritative informative definition that is accepted and trusted by particle physicists? I say all this because I think it's of paramount importance. If we have no clear idea of what a photon actually is, we lack foundation. It's like what :     Photons seem to be one of the foundation ideas of quantum mechanics, so I am concerned that without a clear definition or set of concrete examples, the basis for understanding quantum experiments is a little fuzzy.   I second that, only more so. How can we understand pair production if we don't understand what the photon is? Or the electron? Or the electromagnetic field? Or everything else? It all starts with the photon.   I will give a 400-point bounty to the least-worst answer to the question. One answer will get the bounty, even if I don't like it. And the question is this:    What exactly is a photon?


I am implementing TLS 1.2 and using ECDHE_RSA_AES_128_GCM_SHA256 cipher suit.  According to RFC 5246 finished messages have {verify_data[verify_data_length]} and verify_data = PRF(master_secret, finished_label, hash(handshake_messages)  Some people said client finished contain Authentication tag and nonce along whit verify data. Can anyone tell me the structure of finished message in this cipher suit and exactly the size of verify data, authentication tag and nonce.  Below is my Client Finished message @Makif can you tell me how may bytes are encrypted and where is authentication tag in this message?    @Makif, Got it.  -8 byte nonce  -16 byte ciphertext  -16 byte authentication tag  Total is 40 byte but my finished message contain 48 bytes. What is about last 8 byte?

I am implementing TLS 1.2 and I'm stuck on the client finished message.   My question is: what is the size and structure of a clients finished message in TLS 1.2 when using the ECDHE_RSA_AES_128_GCM_SHA256 cipher suite.   I searched for this question and someone somewhere stated its size is 48 bytes; more specifically:   12 byte verify data 1 byte handshake type 3 byte verify data length and 32 byte MAC   Is that really correct?   I mean: according to  finished messages have {verify_data[verify_data_length]} and verify_data = PRF(master_secret, finished_label, hash(handshake_messages). Also, according to RFC 5246 section 5 PRF(secret, label, seed) = P_<hash>(secret, label+seed) and P_hash(secret, seed) = HMAC_hash(secret, A(1) + seed). So, when I compute HMAC using SHA256 for verify_data its size is 32 byte.   As a result, I'm a bit confused in relation to the verify_data size and the finished message structure. Can anyone help me to understand this and/or maybe put me on the right track somehow?


Let $G$ be a group, let $F$ be a normal subgroup of $G$, and let $E$ be a normal subgroup of $F$. That is, let $E$ be a normal subgroup of $F$, and let $F$ in turn be a normal subgroup of $G$. Is $E$ normal in $G$? If not necessarily, then what example illustrates this situation?

Suppose $G$ is a group and $K\lhd H\lhd G$ are normal subgroups of $G$. Is $K$ a normal subgroup of $G$, i.e. $K\lhd G$? If not, what extra conditions on $G$ or $H$ make this possible?  Applying the definitions, we know $\{ghg^{-1}\mid h\in H\}=H$ and $\{hkh^{-1}\mid k\in K\}=K$, and want $\{gkg^{-1}\mid k\in K\}=K$. Clearly, the best avenue for a counterexample is if $gkg^{-1}\not\in K$ for some $k\in K$ and $g\in G-H$.  If no such element exists, $\{gkg^{-1}\mid k\in K\}\subseteq K$ implies $\{gkg^{-1}\mid k\in K\}=K$ because if $k'\in K$, $gk'g^{-1}=k\in K\Rightarrow k'=g^{-1}kg\in\{gkg^{-1}\mid k\in K\}$.


Currently running Ubuntu 18.04 and i am trying to shrink its partition size and am receiving an error code im not sure what i should do.  error unmounting/dev/sda1:target is busy (udisks-error-quark,14)

I have a dual boot setup with Ubuntu and Windows 7. I need to shrink my root Ubuntu volume in order to get some free space to create a new partition. Are there any Windows based tools that will do this for me? I tried booting up in gparted to do this but I cannot tell which partition is which since I cannot find the size (it displays everything in blocks).


The following is from a textbook, and I don't know why it works. In the main method, several objects of an abstract class are created, which shouldn't be possible.  The explanation the book gives is: "This is an example of polymorphism: The correct value of volume is selected at runtime."  How does it select the correct value if the volume() method cannot be called on the object in question?  Is it the case that sol, sph, and rec are not of class Solid? If so, why not? ClassA x = new ClassB(); creates an object of ClassA when ClassB extends ClassA.  public abstract class Solid {     private String name;     public Solid(String solidName) {name = solidName;}     public String getName() {return name;}     public abstract double volume(); } public class Sphere extends Solid {     private double radius;     public Sphere(String sphereName, double sphereRadius) {         super(sphereName);         radius = sphereRadius;     }     public double volume() {         return (4.0/3.0) * Math.PI * radius * radius * radius;     } public class RectangularPrism extends Solid {     private double length;     private double width;     private double height;     public RectangularPrism(String prismName, double l, double w, double h) {         super(prismName);         length = l;         width = w;         height = h;     }     public double volume() {         return length * width * height;     } public class SolidMain {     public static void printVolume(Solid s) {         System.out.println("Volume = " + s.volume() + " cubic units.");     }     public static void main(String[] args) {         Solid sol;         Solid sph = new Sphere("sphere", 4); //is sph an object of type Solid?         Solid rec = new RectangularPrism("box", 3, 6, 9);         int flipCoin = (int) (Math.random()*2); //random 0 or 1         if (flipcoin == 0) {            sol = sph;        } else {            sol = rec;        } printVolume(sol);

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


I read about SQLite. I found information about making database in Android but I am wondering about opening existing database written somewhere else. Is there a possibility to open and read database from .sql file which I prepared earlier?

If your application requires a database and it comes with built in data, what is the best way to ship that application? Should I:   Precreate the SQLite database and include it in the .apk? Include the SQL commands with the application and have it create the database and insert the data on first use?   The drawbacks I see are:   Possible SQLite version mismatches might cause problems and I currently don't know where the database should go and how to access it. It may take a really long time to create and populate the database on the device.   Any suggestions? Pointers to the documentation regarding any issues would be greatly appreciated.


I am trying to download ubuntu 14.04 from the ubuntu site. Though my internet speed is fairly good, it becomes too small <14kb/sec when the ubuntu download starts and the download never completes. I have downloaded ubuntu many times before too but sucha  problem never came. What should I do?

I am trying to download the 64-bit Ubuntu 12.10 ISO over an extremely unreliable connection. By unreliable, I mean that every time I finish downloading the ISO and compare the MD5 hashes, I end up with an error about a mismatch.  I am using Ubuntu 12.04 to perform the download. Is there a tool that can somehow work around a very unreliable connection?


There are many posts, questions, comments and excellent answers on this website pertaining to cosmology, expansion, universe, spacetime et cetera. Yet, the following question was not asked or answered, so here it goes.  This question deals with - trying to 'force' an analogy between spacetime metrics and the underlying manifold and it's topological properties. (Due to my lack of mathematical knowledge, I will shamelessly abuse some language and notation here.)  Premise  We know the following very well:   The dynamics of spacetime metric is excellently described by Einstein's Field eqns:  $$G_{\mu\nu} = k\ T_{\mu \nu}$$  The expansion of spacetime metric on a collosal scale is described by: $$ ds^2 = dt^2 - a^2(t) \gamma_{i j} dx^i dx^j$$ The rate of change of this scale factor $a(t)$, in the form of the Hubble parameter, then characterizes expansion of spacetime metric as: $$ H \equiv \frac{\dot{a}}{a}$$ Experiments have measured this parameter and roughly we have [1]: $$H \approx 67.80\pm0.77 \ \frac{Km}{s \ Mpc}$$   Given the above two information and the central role that the metric plays in Riemann Geometry and GR, a colossal amount of information can be extracted about our cosmos.  NOTE -  metric tensor, like any other tensor on a manifold, is a bi-linear map from a certain space to $\mathbb{R}$. It is also an added physical structure on the Riemannian Manifold, which relates our cherished notions from Geometry to the real world (metric defines physical distances).    Question  There is so much wonderful cosmology that has been done and continues to be studied using the metric. But due to their inherent nature, these studies are limited to the geometrical aspects only. My questions are:    What subject, if any, studies the topological aspect of spacetime (topological cosmology, for example)?  What is our current understanding from such studies? Any references or links will be appreciated. Since only the physical space-time metric undergoes physical processes, is the topology of the underlying manifold an unchanging static constant?  More specifically: For the last 13.8 billions of years, the physical distance between two objects has increased (from the metric related physics) which is the expansion of universe. Has the coordinate distance between two objects on an appropriate scale changed? Is it even measurable? Does this question make any scientific sense?  (appropriate meaning the same scale on which the universe is homogeneous and isotropic)    Finally, any general perspective on such a topic is welcome. Thanks in advance!  Reference  [1] arXiv-1303.5062

General relativity says that spacetime is a Lorentzian 4-manifold $M$ whose metric satisfies Einstein's field equations.  I have two questions:   What topological restrictions do Einstein's equations put on the manifold?  For instance, the existence of a Lorentz metric implies some topological things, like the Euler characteristic vanishing. Are there any experiments being done or even any hypothetical experiments that can give information on the topology?  E.g. is there a group of graduate students out there trying to contract loops to discover the fundamental group of the universe?


Below are the residuals plot of a linear model in R.   For me, the top left plot is to see if the homoskedasticity hypothesis is verified. The QQ-plot in the top-right location is to check if the normality of the errors is verified.  However, I don't really understand the use of the two bottom plots, what is their use?

I had a question about interpreting the graphs generated by plot(lm) in R.  I was wondering if you guys could tell me how to interpret the scale-location and leverage-residual plots?  Any comments would be appreciated.  Assume basic knowledge of statistics, regression and econometrics.


I have been searching for a way to upload a document manually to a SharePoint document library using Jquery. i have done it in C#, but i want to do the same in Jquery. Still i couldn't find the way, but i am trying. Please anyone would help me to get this stuff done. Any guide is appreciated.    Basic logic what i did in C# is shown below, how would i do the same thing in Jquery. I am using SharePoint 2010 and my browser is IE9  string filename = fileBrowser.FileName;    Stream fstream = fileBrowser.FileContent;  SPFile spfile = myLibrary.Files.Add(filename, fstream, replaceExistingFiles);

I built a custom form that saves the data to multiple lists with on click; it works pretty well for its intended use (keeping the data related). Thing is I am totally new at jQuery and SPServices, but am learning.   I would like to know if SPService/jQuery will allow me to use the aspx control to upload a single document to a library? I have seen plugins out there for multiple file uploads so I assume this is possible, but all of these seem way to much for what I am trying to do, and I would like to learn how to do it.  Does anyone know if this is possible? Could provide simple example or explanation or reference?  Appreciate it as always!


Is there a specific word that covers 24-hour time period between 0:00 and 23:59 on a single date? Is there anything more specific than a "day" (which is usually opposite of night, and its primary meaning does not cover entire 24 hours, except maybe within Arctic Circle)?

Suppose I want to refer to a 24-hour period (from midnight till midnight). The word "day" can in fact mean "24 hours" (as in ), however it's somewhat ambiguous. I believe that if I say something like "just wait a day", most people will understand it in a common meaning. I could also say "just wait 24 hours", but that sounds a little weird to me, about as much as saying "I want 127.5 grams of cheese, please" in a store.  So how would a native speaker refer to the 24-hour period to avoid ambiguity (and being concise in the same time)? Maybe there is a fancy scientific word for it?


For last two days I see random moderator's flags review count at top bar:        When refresh the page it shows some numbers. When I click on that number it redirects me to Tools -> flags. But I don't see any pending flags there.        Is this a bug or I am missing something?  Notes:    There is no userscript running in my browser for flags like .  I also see this from my Android mobile (Fullsite view)

It looks as if the 10k-tools flagged post list is b0rken.  Next to the review link in the toolbar there is a flag counter showing there are 10 flags to be reviewed:    Clicking on that flag counter leads to an empty page:        The moment I visit that page (through clicking on the flags counter, or by going to the review queue first then clicking on Tools, selecting the flags tab if not already selected), the flags counter disappears from the toolbar:    but after a while (half an hour, an hour?) the flag count re-appears in the toolbar.  Either the counter is wrong (presumably taken from a Redis cache somewhere) or the 10k flag review page is falling over every time someone tries to load it.  This at first appeared to happen only on Meta, on Stack Overflow the flags page has plenty to review. However, there are now  on Stack Overflow.


Hi guys I have a problem. I want to project logo bumped texture on other shadder within the same material. But in the end my background material (concrete) becomes transparent (cus of alpha chanel of the logo texture?). My logo texture is a black picture with transparency and bump map is a black background and white logo with some blur.

I'm designing this animal-type creature, and want to add a transparent .png image to its face with the face features (object has a subsurf). On the left is the image with the features, on the right is the part of the object where I want it to be.    I tried to import the image as a plane, but matching the shape of the plane with the face didn't work, and the lines of the face left shadows on the head, and could be seen as a different object from some angles (although it's the closest I've gotten yet). It looked like this:    So , I tried selecting the faces of the head that the features should go over, and create a new material for it. Unfortunately, since the .png is transparent, the result produced was this:    (where it's impossible to tell the transparency from a black background default color, and where I wouldn't know where to start to adjust size and position).  I also tried UV mapping, but then the whole object became black with the features repeated all over.   Is it something I have to go into Nodes for? I'm kind of stuck here. Creating a new material and applying it is simple, but applying a material that is an image is a bit more complex it seems... Ideally, I would reproduce the same technique for the adhesive bandage on its arm (seen on the right of image 1).


I have been using windows 10 without any problem until i installed a third party app from a specific site and installed.  After that, Task manager does't opens up when i press ctrl+alt+del   Many options in controll panel wont open until i got to their system folder and opening it from its folder location and right click and choose run as administrator.  I think the software containing some malware almost changed everything related to permissions in windows registry.  If so,Where can i modify that stuff to default, I mean there a lot of stuffs like HKEY_CLASS and all like that. I dont know where excactly there configurations are... Let me know so that i can play around and tweak them back to normal if i am in right place... Thank you

What should I do if my Windows computer seems to be infected with a virus or malware?  What are the symptoms of an infection? What should I do after noticing an infection? What can I do to get rid of it? how to prevent from infection by malware?   This question comes up frequently, and the suggested solutions are usually the same. This community wiki is an attempt to serve as the definitive, most comprehensive answer possible. Feel free to add your contributions via edits.


What is this problem in Ubuntu 16.04? I have had this problem for 2 months now and I can't seem to be able to delete partitions loop0,  loop1, or loop3.

I just realized using gnome-disk-utility (3.18.3.1) that my 16.04 installation is featuring several small loop devices.  In detail:   78 MB Loop Device (/var/lib/snapd/sn_ntu-core_352.snap -> /dev/loop0) 76 MB Loop Device (/var/lib/snapd/sn_ntu-core_216.snap -> /dev/loop1) 79 MB Loop Device (/var/lib/snapd/sn_ntu-core_423.snap -> /dev/loop2) 705 KB Loop Device (/var/lib/snapd/snaps/tpad_12.snap -> /dev/loop3) 684 KB Loop Device (/var/lib/snapd/snaps/tpad_11.snap -> /dev/loop5) 705 KB Loop Device (/var/lib/snapd/snaps/tpad_13.snap -> /dev/loop6)   Image showing gnome-disk-utility    My questions are as follows:   What are those loop devices used for? Is that an expected behaviour in 16.04? Can  I remove them? And if so - how (just by unmounting)? Is there any risk in removing the 2 installed snaps mentioned below (tpad and ubuntu-core)   UPDATE  Installed snaps  According to snap list I do have   tpad (1.8.1) ubuntu-core (16.04.1)   installed. I remember I did tinker with snaps for a short time when  I realized this option - but am pretty unsure if  I  installed those 2 snaps - or if they are pre-/auto-installed.  tpad is a Terminal text editor with GUI-like user interface  I  did install manually, as  I don't use it  I removed it now via sudo snap remove tpad. As a result the 2 loop devices pointing to tpad are gone in gnome-disk-utility.  So - at the current point  I am still having 1 snap installed called ubuntu-core and I don't know what it is used for. The summary of this particular snap is   The ubuntu-core OS snap


I submitted paper in a elseiver journal.It first asked for major revision. After a month of submitting revised manuscript it asked for minor revision.I adressed all the points submitted. Now it is again showing reviewers invited since last 10 days. Should I be worried.

I submitted a paper in Physics background journal. At the 1st review, the referees' have written positive statement. One of the referee suggested minor revision, while the other suggested major revision. I have revised the paper according to the referees' comments. Recently. I have received minor comments (only a few text corrections) from the referee who suggested major revision at the 1st review. I have revised again the paper according to the referee comments and submitted to the journal about 2 weeks ago. However, I have received any decision letter yet. Does a minor revision after a major revision lead to acceptance ?


This may sound like a repeated question yet I would like to be sure on the answer.  I am currently working in US. I do occasional transfer from my US account to my Indian NRE account (ICICI Bank) which I believe is not taxable as per the clause. Also I do have a Home Loan account (with IDBI Bank) in India. Now been at onsite I can afford transferring some additional funds so that I can close my Home Loan as early as feasible.   I usually transfer my monthly EMI's along with some additional cash from my ICICI NRE account to IDBI account. Now the question is, Is the amount transfer to my IDBI account taxable as per the Indian policies?

I have an NRI status. If I open NRE account(Yes BAnk) and transfer euros to this account from my overseas account. I understand its non taxable.   My question is, if I transfer money from my NRE account to my Indian salary account (ICICI Bank) do I need to pay tax on this money.   I am getting basic salary in my India salary account and getting allowances in Austria in Euros.


I am interested in how to achieve this coffee cream/powder effect using Photoshop.  I have spent quite some time trying to figure this out, but wasn't successful. Using a clipping mask to apply texture works on very simple logos or text, but not on photos or anything that requires detail.

Today I would like to create a coffee cup with the cream floral on it as a text by using Photoshop. It looks like you order a cup of hot cappuccino and the bartender will draw a flower with cream on the surface of coffee but now I want to make it like a text to present a tittle.     I just need to do the cream text effect, no need to draw the whole cup of coffee since i can't use some images. So anyone can tell me how to do this cream effect on Photoshop.  Thanks in advance for any feedback!


How can I install poolshot for Windows in Ubuntu 16.04?  Poolshot can be downloaded from

Can .exe and .msi files (Windows software) be installed in Ubuntu?


Suppose I have a matrix say $A$ with integer elements. I want to have the elements of $A^{-1}$ to be integers . Here $A^{-1}$ stands for inverse matrix of $A$ . How can I prove that this is achievable iff the determinant value of $A$ is unimodular?

If all entries of an invertible matrix $A$ are rational, then all the entries of $A^{-1}$ are also rational. Now suppose that all entries of an invertible matrix $A$ are integers. Then it's not necessary that all the entries of $A^{-1}$ are integers. My question is:  What are all the invertible integer matrices such that their inverses are also integer matrices?


I have following scenario and want to install Ubuntu 14.10.  1 TB Hard Drive   150GB Win 8.1 Partition   200GB NTFS   200GB NTFS  200GB NTFS   120GB NTFS   68GB Unallocated   I want to install Ubuntu 14.10 as dual boot with Windows 8.1 on 68GB partition. Can anyone let me know process and step need to be take care for this?  I have fresh installation of Windows 8.1 so no need for data backup.  Note : I have installed Win 8.1 on Legacy Boot mode. So I think I have to install Ubuntu in Legacy mode as well.

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


I have an existing blob column in DB which has documents uploaded into it. While retrieving them in another part of the application (new requirement) I would need to find the mimetype of the document that was uploaded before making it available on the front - end.  How would i be able to find the mime type of the document stored in the columns.  Am using Java with Mysql for the application  Regards

How do you get a Media Type (MIME type) from a file using Java?  So far I've tried JMimeMagic & Mime-Util. The first gave me memory exceptions, the second doesn't close its streams properly. How would you probe the file to determine its actual type (not merely based on the extension)?


When you make a link to a folder in Ubuntu, one cannot navigate to the directory above that link. Is there any way to get around?

I created a shortcut via "make link" option. When I enter to this shortcut's folder I can't see any folders above it so I can't easily navigate to them.  Is there a way to go one folder up in the GUI? Maybe a hotkey? (Can't do cd .. this time ^__^ ).      In Windows for example I am indeed able to navigate in the way I describe, here is a Win10 image that explains it:


Suppose $G$ is a cyclic group that has exactly three different subgroups: The trivial one, a subgroup of order $7$ and $G$ itself. What is the order of $G$?   What is the idea here?

Suppose a cyclic group has exactly three subgroups: $G$ itself, $\{e\}$, and a subgroup of order $7$. What is $|G|$? What can you say if $7$ is replaced with $p$ where $p$ is a prime?   Well, I see a contradiction: the order should be $7$, but that is only possible if there are only two subgroups. Isn't it impossible to have three subgroups that fit this description?  If G is cyclic of order n, then $\frac{n}{k} = 7$. But if there are only three subgroups, and one is of order 1, then 7 is the only factor of n, and $n = 7$. But then there are only two subgroups.  Is this like a trick question?  edit: nevermind. The order is $7^2$ right?


A student has 5 weeks to prepare for their midterm test. The student's friend has volunteered to tutor them for either 15min or 30min every day until the test but not for more than 15 hours total. Show that during some period of consecutive days, the student and their tutor will study for exactly $8 \frac{3}{4}$ hours.  I believe that questions of this sort have been asked before on this forum but, I still do not seem to understand how the answers were derived and how they were able to come up with the functions they used.   I understand what the question is asking for but am really struggling to come up with what the pigeons are and what the pigeonholes are in this scenario. If anyone could please give a simple explanation as to what they are it would be much appreciated. I feel like if I understand where they come from then I will be able to complete this question.  Thank you for any help in advance!  Yours Truly,  A struggling student in need of help

Bobby has 5 weeks to prepare for his exam. His friend volunteered to tutor for either 15min or 30min periods every day until the test but not for more than 15 hours total.   Show that during some period of consecutive days, Bobby and his tutor will study for exactly 8.75 hours.


Integer i = new Integer(10);     Integer j =10;     System.out.println(i==j); // false      String a1 = new String("abc");     String a2 = "abc";     System.out.println(a1==a2); // false   But to make Java more memory efficient, the JVM sets aside a special area of memory called the "String constant pool." When the compiler encounters a String literal, it checks the pool to see if an identical String already exists. If a match is found, the reference to the new literal is directed to the existing String, and no new String literal object is created. (The existing String simply has an additional reference.) So String literals are immutable. So, both a1 and a2 will have two reference pointing to same memory location then why "==" doesn't return true?

I've been using the == operator in my program to compare all my strings so far. However, I ran into a bug, changed one of them into .equals() instead, and it fixed the bug.  Is == bad? When should it and should it not be used? What's the difference?


I'm trying to setup a image decal in cycles, and I can't figure how to setup the nodes to work fine. Does anyone know the solution?

I'm trying to apply the logo onto the glossy part and cycles render ignores the transparency and just makes it black.     I've tried both png and tga using the multiple builds of blender. And it looks weird in texture mode even though the uv map shows transparency.


I'm wiring 5V from a power supply directly to a micro USB cable. I'm only using the +5V and GND connectors, and leaving Data+ and Data-. While I only plan to use the cable for power, do I need to do anything with that D+ and D- cables, or can I leave them disconnected from both ends?  UPDATE I should clarify that the USB cable is connected to a Raspberry Pi, not a basic circuit.

I'm making a small project which will take +5v from USB, What should I do with the D+ and D-, keep it open or short them to ground or do I have to add some components?  I want to run ATMEGA168 and 16x2 LCD with back light.


Prove any integer greater than 1 is divisible by a prime number(strong induction)  Let P(n) be an integer divisible by a prime number, where n>=2.  Base Case:  Show true for $P(2)$  $P(2)$ is true because 2 is a prime number itself.   Inductive Case:  Show that for integers $k>2$, if true for all $i$ with $2<=i<k$, then it's true for k.  Suppose that for all integers i with $2<=i<k$, i is divisible by a prime number (inductive hypothesis)  If someone could explain how the inductive case above works that would be appreciated

Use  strong mathematical induction to prove that any integer $n\ge2$ is either a prime or a product of primes.    I know the steps of weak mathematical induction... Basis step: $p(n)$ for $n=1$ or any arbitrary $n_0$ ... show that it is true Inductive hypothesis: $p(n)$ for $n=k$ ... Assume that it is true for $n=k$ Inductive step: $P(n)$ for $n=k+1$ ... Show that this is true for $n=k+1$


Examples of such use of Big O notation can be found for instance on Wolfram Alpha . More details on the .  The idea, as I understand it, is that the term between parenthesis in Big O bounds the rest of the series asymptotically (as $x$ goes to zero or infinity) giving and elegant way of writing the series (if you don't like "$+ \dots$" or "etc") while also providing an error approximation. Taking the example of $e^x$:  $$ e^x=1+x+\frac{x^2}{2!}+\frac{x^3}{3!}+\frac{x^4}{4!}+O(x^5) $$  When we write $O(x^5)$ we mean that all the rest of the terms (like $(x^6)/6!+(x^7)/7!+(x^8)/8!+\dots$) are bounded by $x^5$ as $x$ goes to $0$. Giving a more concrete example if we take $e^2.42$ then this is more or less $1 + 2.42 + (1/2)(2.42)^2 + (1/6)(2.42)^3 + (1/24)(2.42)^4$ and the error between the approximation and the actual value is no larger than $2.42^5$.  The question is how do we know this?  Certainly $x^5$ bounds, as $x$ goes to $0$, each term individually ($Cx^n=O(x^5)$ as $x\rightarrow 0$ as long as $n>5$, $C$ constant) but how do we prove the sum of all the individual terms is bounded? We have to show that:  $$ O(x^5)=\frac{x^6}{6!}+\frac{x^7}{7!}+\frac{x^8}{8!}+\frac{x^9}{9!}+\frac{x^{10}}{10!}+\frac{x^{11}}{11!}+...),x\rightarrow 0 $$  Falling back on the previous example, maybe the infinite sum will actually be slightly larger than $2.42^5$. How do we prove this is actually not the case? While I have used the example of $e^x$, feel free to give a more general proof, and not one for this particular function only.  Your help with this issue will be greatly appreciated.  Thank you for taking the time to read this and have a good day.

Examples of such use of Big O notation can be found for instance on Wolfram Alpha . More details on the .  The idea, as I understand it, is that the term between parenthesis in Big O bounds the rest of the series asymptotically (as $x$ goes to $0$ or $\infty$) giving and elegant way of writing the series (if you don't like "+ ..." or "etc") while also providing an error approximation. Taking the example of $e^x$:  $$ e^x=1+x+\frac{x^2}{2!}+\frac{x^3}{3!}+\frac{x^4}{4!}+O(x^5) $$  When we write $O(x^5)$ we mean that all the rest of the terms (like $\frac{x^6}{6!}+\frac{(x^7)}{7!}+\frac{x^8}{8!}+\cdots+\frac{x^y}{y!}$) are bounded by $x^5$ as $x$ goes to $0$. Giving a more concrete example if we take $e^{2.42}$ then this is more or less $1 + 2.42 + (\frac12)(2.42)^2 + (\frac16)(2.42)^3 + (\frac{1}{24})(2.42)^4$ and the error between the approximation and the actual value is no larger than $2.42^5$.  The question is how do we know this?  Certainly $x^5$ bounds, as $x$ goes to $0$, each term individually ($Cx^n=O(x^5)$ as $\lim_{x\to\infty}$ as long as $n>5, C$ constant) but how do we prove the sum of all the individual terms is bounded? We have to show that:  $$ O(x^5)=\frac{x^6}{6!}+\frac{x^7}{7!}+\frac{x^8}{8!}+\frac{x^9}{9!}+\frac{x^{10}}{10!}+\frac{x^{11}}{11!}+...),x\rightarrow 0 $$  Falling back on the previous example, maybe the infinite sum will actually be slightly larger than $2.42^5$. How do we prove this is actually not the case? While I have used the example of $e^x$, feel free to give a more general proof, and not one for this particular function only.  Your help with this issue will be greatly appreciated.  Thank you for taking the time to read this and have a good day.  Note: I wrongly asked this on Math Overflow and copied it here. I'm not sure whether the other question gets transferred or if I made the right choice in reasking here.


It's mentioned on a number of occasions that Odo's appearance is due to his lack of skill in imitating specific humanoid forms. We also know that other Changelings have no difficulty in assuming convincing humanoid forms as they have infiltrated and replaced a number of humanoids in the Alpha quadrant (one example is , when Admiral Leyton is replaced by a Changeling, who also mentions Odo's inability to mimic humans).  Knowing all of this—why do the founders (all other Changelings?) look similar to Odo in their "normal" (i.e. not imitating any specific person or species) humanoid form?

It is mentioned in  (S1E17) that when he first took humanoid form, Odo mimicked the hairstyle of Dr Mora, the Bajoran scientist who was studying him. In a later episode,  (S2E12), we get to actually see the doctor, and indeed the resemblance is very obvious:    Note that this is before we find out who the Dominion and the Founders are, and what they look like.  So why do other Changelings, when in humanoid form, so often have the same distinctive hairstyle? I'm thinking first and foremost of the Female Changeling, but several others qualify as well.     What's the point? Are they imitating Odo? Is there any explanation in canon, or did the writers just forget where Odo's hairstyle came from?


On Ubuntu 18.04.5 I've got three machines. One Region Controller fresh installed manually - 2.8.1 Two Rack controllers fresh installed manually - 2.4.2 Now I've got two warnings for the rack controllers, that they are running an older version of MAAS. Now: How could I upgrade the rack controller. An "apt update" or s.e. doesn't work.

There seems like a lot of fixes and also network tests in 2.7 that I would like to take advantage of.  I see the Snap install for 2.7 but I'm trying to understand the upgrade path.  I don't want to destroy the existing db in MaaS 2.6.2 with all of the machines.    Do you do a snap install... and maas init and just don't reinitialize the db?    Any help in the right direction would be greatly appreciated.


My network adapter:  Bluetooth driver:  My laptop specifications:  HP 15 bw088ax AMD A9-9420 processor 2C+3G currently running on Windows  Do I need to be connected to internet to install Ubuntu 20.04 LTS? Please redirect me to the already answered questions if there are any.

I have a device on which I would like to install Ubuntu. How do I find out if Ubuntu will work on it?


I have been searching on here and other sites and I can't find the answer. If i were to take Magic Initiate on my sorcerer would I be able to use metamagic on the spells?

Can a multiclass sorcerer/cleric use the Metamagic class ability with non-sorcerer spells? For example, using Twinned Spell when casting cure wounds to heal two creatures instead of just one?


I'm coding a simple project but i face a very small problem here. To be honest I don't know the right logic for my problem  I have a while condition there so that it will not stop recieveing inputs. I want to stop the input just by typing 'compute' but it gives me errors because I really don't know how to insert that 'compute' thingy after that output of System.out.println(bla bla)      int discreteNum;     double prob;     boolean condition = true;     String forComput;     Scanner input = new Scanner(System.in);     Scanner str = new Scanner(System.in);      //These are just outputs, they're harmless     System.out.println("Mean of Discrete Random Variable \n");     System.out.print("Instructions:\n");     System.out.print("Please enter a discrete random variable with its      probability\n type 'compute' for the expected value\n");       while(condition = true ){     discreteNum = input.nextInt();     prob = input.nextDouble();     System.out.println("( " + discreteNum + "," + prob + " )");   }         //This code below, I just put it here.          //It's just my insight. I tried it but it did not  work.          //It's worthy to be deleted here but I just want to show you       forComput = str.nextLine();      if(forComput == "compute"){       condition = false;       System.out.println("End!"); }   This is how my code works  first input preview:    now , my second input:   now, I am attempting to end my input by typing compute , which is i don't know how. pardon   in case you are intereseted with the errors, here they are:   I really don't know the logic for it. i just tried

I've been using the == operator in my program to compare all my strings so far. However, I ran into a bug, changed one of them into .equals() instead, and it fixed the bug.  Is == bad? When should it and should it not be used? What's the difference?


I have a big .tex that runs well without errors  I´m trying to put 2 images in a row,   I tried subcaption packaes and only adding to my code  \usepackage{subcaption} gives me this errors     and then readin this post    I use this  \usepackage[caption=false]{subfig}   and.... ERROR too.  so,... how can I put 2 images in a row?

I'm an on and off user of LaTeX so I'm not familiar with every package out there. Having said that, whenever I use LaTeX and need to accomplish a certain goal (i.e. ), I search around and find some kind of solution that involves a package that I didn't know about. I think that's great, I learn something new, and it goes in my template file.  Every now and then, though, my search comes up with a package that, after much wrangling, I find out that it's obsolete. An example of this is just recently I came across the subfigure package and wanted to try it out. Soon after I found out from here that it has become . I usually keep my TeX up-to-date because I like keeping up with new XeLaTeX features.   My question is, is there a map or timeline of what TeX packages should be avoided because there are better ways of doing things? An idea I have is some kind of list of all packages split by what they accomplish, then cancelling out packages whose features are incorporated into and improved upon by newer packages.  Edit: another example is lscape versus pdflscape. The latter implements rotating pages in the final PDF not just for pdftex but also for other drivers such as xetex. The only way I found out about this was Googling latex lscape rotate xelatex, for which the second link leads to the  (PDF).  Great answers so far. I'll check them out and see which one works best for me.  Edit 2: Turns out that my question is a bit of a dupe in the sense that a great answer came up on an unrelated question. The nag package . Gotta try it!


QUESTION:  Let $f : \Bbb{R} → \Bbb{R}$. Answer whether the following are true (T) or false (F).    $(a)$ There is no continuous function $f$ for which $$\int_{0}^{1} f(x)(1 − f(x))dx < \frac{1}4$$      $(b)$ There is only one continuous function $f$ for which $$\int_{0}^{1} f(x)(1 − f(x))dx = \frac{1}4$$      $(c)$ There are infinitely many continuous functions $f$ for which $$\int_{0}^{1} f(x)(1−f(x))dx = \frac{1}4$$    MY WORKING: For the first one I have observed that if we put $f(x)=x^n$ for any $n\in \Bbb{N}$ then the definite integral reduces to $\frac{1}6$. Therefore there are infinitely many functions which satisfy the first statement, which makes it false (F). Now from the second one onwards, I could not do much.. I was just wondering about a general way to solve these kind of problems.. What I did for $(a)$ is just assume a function, but I know, that is not a rigorous proof. Can anyone tell me some good method to solve these problems without assuming functions.. And also, there are infinite number of functions all around, so that method is a very very tiresome and illogical thing to do.. Thank you so much for your kind help and support :)

How many continuous function $f(x)$ exist such that $$\int_{0}^{1}f(x)\big(1-f(x)\big)\mathrm dx = \frac{1}{4}\text?$$ I want to find the number of such functions but I don't know how to proceed. It would be of great help if someone can tell me which theorem to apply or provide with any other hint. Any help is highly appreciated.


Let $(X,d_X)$ and $(Y,d_Y)$ be metric spaces. We say a function $f: X \rightarrow Y$ is bounded if $f(X)$ is a bounded set of $Y$. Consider   $$C_b(X,Y) = \left\{f: X \rightarrow Y \mid f \ \text{is continuous and bounded} \right\} $$ with the metric $d_{\infty}(f,g) =  \sup\left\{d_y(f(x),g(x)) \mid x \in X \right\}. $ Prove that   $(C_b(X,Y),d_{\infty})$ is complete if $(Y,d_Y)$ is complete.   Attempt: In my course, we already proved that if $(X,d_X)$ is a metric space, then $$C_b(X, \mathbb{R}) = \left\{f: X \rightarrow \mathbb{R} \mid f \ \text{is continuous and bounded} \right\}$$ is a complete space for the $d_{\infty}(f,g)= \sup\left\{|f(x) - g(x)| \mid x \in X \right\}$ metric. I want to use this result now. I know that if $Y$ is a complete metric space, and $X$ is a bounded subspace of $Y$, then $X$ is also complete.   So in this case I said $C_b(X,Y)$ is a subspace of the complete space $(C_b(X,\mathbb{R}),d_{\infty})$. So I need to prove that $C_b(X,Y)$ is closed in $C_b(X, \mathbb{R})$ ? Then let $f_n \in C_b(X,Y)$ be a convergent sequence. Denote the limit by $f \in C_b(X,\mathbb{R})$. I need to prove that $f \in C_b(X,Y)$.   I'm not sure how to prove the continuity of $f$. Also, I haven't used the fact yet that $(Y,d_Y)$ is complete so I'm not sure if this is the right direction. Any help is appreciated.

Let $(X,d_X)$ and $(Y,d_Y)$ be two metric spaces.   Let $(C_b(X,Y), d_C)$ be a function space with the metric $$d_C(f,g):=\sup\limits_{x\in X} d_Y(f(x), g(x)).$$  Prove that if $(Y,d_Y)$ is complete then $(C_b(X,Y), d_C)$ is complete.  Unfortunately, I have no idea how to approach this problem. I can think of something like this:  Let $(y_k)_k\subset Y$ be a Cauchy sequence converging to $y\in Y$. Then there exists some $f\in C_b(X,Y)$ such that $f(x_k)=y_k$ for all $k\in \mathbb N$. Since $f$ is continuous, $\lim\limits_{k\to\infty} d_Y(f(x_k), y)=0$.  But how do I go from here? As far as I understand, what needs to be proved is that any Cauchy sequence of functions in $C_b(X,Y)$ converges in $C_b(X,Y)$, that is, that the limit is bounded and continuous. But how do we devise such a sequence of functions?


I have a problem here, I'm working on a project here I have to limit the date value to not save the date if the value inserted was yesterday or so on.(e.g. from the beginning of the universe to Jan. 13 2016).   I'm using php and javascript. This is the code:     function date(){ var present = new Date(); var day = today.getDate(); var month = today.getMonth()+1; //January is 0! var year = today.getFullYear();  if(day<10) {     day='0'+day }   if(month<10) {     month='0'+month }  } today = month+'/'+day+'/'+year; document.write(today);

Can someone suggest a way to compare the values of two dates greater than, less than, and not in the past using JavaScript? The values will be coming from text boxes.


I want to rid this  of mine. Since it is put on hold, I can not delete it. No need of showing it, so I am suggesting that even if the questions are on hold, a user having the ability to delete his questions is more friendly.

Before you vote to close: there are a lot of questions with titles and/or bodies that are similar to this one. However, none of the ones I saw deal with this particular case.    I have an  that is appropriately closed as a duplicate of an FAQ entry. I just tried to delete it because it doesn't really add any useful search terms or overall value to MSO. I got the following message:     Sorry, this question has answers and cannot be deleted; flag it for moderator attention instead.   That's the same message that comes up when you try to delete your own unclosed answered questions. Since I'm a 10k user, I think the system should at least allow me to cast a regular, non-binding delete vote for that post, if not delete it unilaterally.  I also think that 20k users attempting to delete their own recently closed posts shouldn't have to wait through the 48-hour "possible reopening" period, but since my example question was closed over a year ago I don't know what the system actually does.


Which version of Debian is Ubuntu 18.04 LTS based on? Assuming I do not have access to verify this on an existing Ubuntu 18.04 instance.

My understanding is that Ubuntu is based on Debian. For example, on the Wikipedia page for Ubuntu it states "" How can I find out what version of Debian a particular version of Ubuntu is based on (if any)?  For example, the current stable release of Ubuntu is "" (17.10) which announces that it is based on the Linux 4.13 kernel, but does not seem to say anything about the Debian version.  The current stable release of Debian is code named "" (9.2) which advertises a 4.9 kernel (on the afore-linked Stretch page). How can I find out the details of the relationship between them? Is there a particular command that will reveal this information?


How to remove the name of the language? Use the module Language Icon, I want to make only the flags.

I would like to hide language names (like "English", "Español", "Magyar", etc.) in the "Language switcher" block, and display only country flags, because I have  module installed, and the flags are unambiguous enough for navigating between different languages.  I already set language elements to be displayed in an "inline" style and hide language switcher block's title in my stylesheet file (in a Zen sub-theme) like this:  #block-locale-0 li{     display:inline;     list-style-image: none; } #block-locale-0 .title{     display:none; }


Question asks to show that series $\sum\frac{x}{1+n^2x}$ is uniformly convergent on $[\alpha,1]$ for any $\alpha > 0$ but is not uniformly convergent on $[0,1]$  I could show that the above series is uniformly convergent on $[\alpha,1], \alpha > 0$ by using inequality $\frac{x}{1+n^2x} < \frac{x}{1+n^2\alpha} = u_{n}$, which is convergent by Raabe's test and hence the series is uniformly convergent on $[\alpha,1]$ by Weierstrass M-test   But i am clueless how to show it non uniformly convergent on $[0,1]$

Consider the series of function $$\sum_{n=1}^{\infty}\frac{x}{1+n^2x}.$$  Show that this series of function is NOT uniformly convergent in $[0,1]$.   I know only two methods to show a series of function to NOT uniformly convergent :  (i) Using definition of uniform convergent.  (ii) Showing that term by term integration is not possible.  i.e. showing that$$\int_0^1\sum_{n=1}^{\infty}f_n(x)\,dx\not =\sum_{n=1}^{\infty}\int_0^1f_n(x)\,dx.$$  But in each case we need to find out the finite sum $\sum_{k=1}^{n}f_k(x)$.  I am not able to find out this finite sum.  Please help on it....  Does there any other process or theorem to find that the series is not uniformly convergent ?


I realise there has been quite a lot of discussion on this topic and have already read through the suggestions on this forum of how to rectify this problem, but still nothing has worked.    I am trying to clip a merged hillshade raster using a vector mask to define the clipped area.  I have turned on-the-fly-projection off and both layers align to the same CRS.  I am still getting the error message "cannot compute bounding box of cutline".    I have tried all the suggestions in previous posts, but nothing works!  This is getting so frustrating!  Does anyone have any further suggestions on how to solve this problem.    I am using QGIS Lyon 2.12.3, but I also get the same issue in 2.8.6 LTR version.  A link to the zip files is given below:      Also, when I clip using extents, it works no problems

I've got a NDVI layer that I'm trying to clip with a vector file but when I try and use GDAL Tools clipper I get an error.  That shows up like this:  What am I doing wrong?  This is before I even pick the mask layer!  Traceback (most recent call last):   File "C:/PROGRA~1/QUANTU~1/apps/qgis/./python/plugins\GdalTools\tools\widgetPluginBase.py", line 28, in someValueChanged     self.emit(SIGNAL("valuesChanged(const QStringList &)"), self.getArguments())   File "C:/PROGRA~1/QUANTU~1/apps/qgis/./python/plugins\GdalTools\tools\doClipper.py", line 105, in getArguments     return self.getArgsModeMask()   File "C:/PROGRA~1/QUANTU~1/apps/qgis/./python/plugins\GdalTools\tools\doClipper.py", line 143, in getArgsModeMask     if self.alphaBandCheck.isChecked(): TypeError: 'sip.methoddescriptor' object is not callable  Python version: 2.5.2 (r252:60911, Feb 21 2008, 13:11:45) [MSC v.1310 32 bit (Intel)]  QGIS version: 1.7.3-Wroclaw Wroclaw, 00624b3  Python path: ['C:\Users\dean.walker\.qgis\python\plugins\GeoCoding', 'C:\Users\dean.walker\.qgis\python\plugins\GeoCoding', 'C:/PROGRA~1/QUANTU~1/apps/qgis/./python', 'C:/Users/dean.walker/.qgis/python', 'C:/Users/dean.walker/.qgis/python/plugins', 'C:/PROGRA~1/QUANTU~1/apps/qgis/./python/plugins', 'C:\PROGRA~1\QUANTU~1\bin\python25.zip', 'C:\PROGRA~1\QUANTU~1\apps\Python25\DLLs', 'C:\PROGRA~1\QUANTU~1\apps\Python25\lib', 'C:\PROGRA~1\QUANTU~1\apps\Python25\lib\plat-win', 'C:\PROGRA~1\QUANTU~1\apps\Python25\lib\lib-tk', 'C:\PROGRA~1\QUANTU~1\apps\qgis\bin', 'C:\PROGRA~1\QUANTU~1\apps\Python25', 'C:\PROGRA~1\QUANTU~1\apps\Python25\lib\site-packages', 'C:\PROGRA~1\QUANTU~1\apps\Python25\lib\site-packages\win32', 'C:\PROGRA~1\QUANTU~1\apps\Python25\lib\site-packages\win32\lib', 'C:\PROGRA~1\QUANTU~1\apps\Python25\lib\site-packages\Pythonwin', 'C:\PROGRA~1\QUANTU~1\apps\Python25\lib\site-packages\wx-2.8-msw-unicode', '/usr/share/qgis/python', 'C:\PROGRA~1\QUANTU~1\apps\qgis\python\plugins\fTools\tools']


In movies, mostly around military personnel, female officers are sometimes addressed as "Sir" (Sometimes also followed by a "Um, ma'am, sorry..."). What would be the correct usage here if not using military rank? Are both" sir" and "ma'am/madam" correct?

The use of the term sir as a form of address for men, especially those of higher rank or status, is discussed in several prior questions including . They all indicate that the term is reserved to males, and that there are a number of related terms for females, such as ma'am.  A review of the first dozen online dictionaries at onelook.com confirms that sir is strictly reserved for male addressees. For example  defines it as     used as a polite or respectful way of addressing a man, especially one in a position of authority: excuse me, sir   On several recent television shows in the US, the term sir has been used by a police officer to address his or her supervisor who was female. In the context, the use was sincere and was not objected to by the superior.  Has the use of sir when addressing a superior female in a military or quasi-military setting become acceptable, or is this merely literary license?


I have the following list in a table  Name Server1 Server2 Server3 Server4 Server5 Server6 Server7 Server8 Server9 Server10 Server11 Server12   only problem is my linq satement orderby Name ascending puts them like the below  Server1 Server10 Server11 Server12 Server2 Server3 Server4 Server5 Server6 Server7 Server8 Server9   is there anyway to stop this?  Thanks

Anyone have a good resource or provide a sample of a natural order sort in C# for an FileInfo array?  I am implementing the IComparer interface in my sorts.


How to upgrade from Ubuntu 18.04.1 LTS to Ubuntu 18.04.4? My server doesn't have accessibility to internet.

I have a friend who has got a computer that is not connected to the Internet. Is there any way to install software offline easily?


Why don’t hats seem to appear on Stack Exchange's flairs? Are they OK to appear or not? I did not try myself and saw other's. By flair I refer to the icon Stack Exchange provides to put on other websites.

Why doesn't my flair wears any of the Winter Bash caps which I wear and remains uncapped throughout?    Update: As pointed out this question about being a duplicate of  is a different question all together, where as this question is about why my flair doesn't wears the Winter Bash caps


We all know the popular  technique that gives objects a "miniature" look, making them appear much smaller than they actually are.  I'm wondering whether it's possible to achieve the opposite effect and if so, how? For example, making a photograph of a lawn appear as if it's a huge patch of grassland shot from a plane. Or making a rock look like it's a mountain.  Are there differences in focus and depth at play here that can be manipulated, or is it all down to other factors like familiar objects, dust, mist etc. that gives the human eye an idea of the scene's "vastness"?  In my specific case, I would like to make a photographic journey through a small creek appear like it was taken from a (miniature) plane. I have a .

I am very interested in the miniature effect widely used in photography. Which is to make large scenes such as if they were toys.   I wonder if the opposite effect was, of giving a tiny object the appearance of a huge object and where I could find information about it.  Regards.


i have some list with 5 numbers (exp. 1 2 3 4 5) i want to order them in random ordering each time (page refresh) examples: (2 4 3 1 5) (1 3 5 4 2) (5 1 2 3 4)... code in C#, Thanks  var loadcards = (from card in db.GameCards                      select card).Take(5).ToList();      foreach (var item in loadcards)     {         Response.Write("<script>alert('" + item.cardId + "');</script>");     }

What is the best way to randomize the order of a generic list in C#? I've got a finite set of 75 numbers in a list I would like to assign a random order to, in order to draw them for a lottery type application.


def initialize(context):     g.security = '000001.XSHE'     set_benchmark('000300.XSHG')  def handle_data(context,data):     security = g.security     order(security, 100)   I want operation this code at 10:00 o'clock, how can write the code?

I'm looking for a library in Python which will provide at and cron like functionality.  I'd quite like have a pure Python solution, rather than relying on tools installed on the box; this way I run on machines with no cron.  For those unfamiliar with cron: you can schedule tasks based upon an expression like:    0 2 * * 7 /usr/bin/run-backup # run the backups at 0200 on Every Sunday  0 9-17/2 * * 1-5 /usr/bin/purge-temps # run the purge temps command, every 2 hours between 9am and 5pm on Mondays to Fridays.   The cron time expression syntax is less important, but I would like to have something with this sort of flexibility.   If there isn't something that does this for me out-the-box, any suggestions for the building blocks to make something like this would be gratefully received.  Edit I'm not interested in launching processes, just "jobs" also written in Python - python functions. By necessity I think this would be a different thread, but not in a different process.  To this end, I'm looking for the expressivity of the cron time expression, but in Python.   Cron has been around for years, but I'm trying to be as portable as possible. I cannot rely on its presence.


Let $\omega = e^{\frac{2\pi i}{5}}$   prove that $K = \mathbb{Q}[\omega]$ is a splitting field for the polynomial $x^5-1$ over $\mathbb{Q}$ Determine the Galois group $G = Gal(K/\mathbb{Q})$ For each subgroup $H$ of $G$ (including $G$ and {Id}) describe explicitly the fixed field $K^H$ and determine $[K^H : \mathbb{Q}]$ and give a $\mathbb{Q}$-basis for $K^H$.   I have that all the fifth roots of unity are powers of $\omega$, thus $K = \mathbb{Q}[\omega]$ is a splitting field. Is this sufficient? As for the rest, I do not have much practice determining the Galois groups. Explicit direction would be much appreciated, as this is a guiding example for the rest of my work.

I have seen many textbooks state this result without proof.   $``$ If $E$ is the splitting field for the polynomial $f=x^p-1 \in \mathbb{Q}[X]$ where $p$ is prime, then the Galois group $Gal(E:Q)\simeq \mathbb{F}_{p}^{\times} \simeq\mathbb{Z}_{p-1} . "$  I would like to know how to prove this.  The things that I know from reading are that $E=Q(\zeta)$, where $\zeta$ is a root of the irreducible polynomial $x^{p-1} + x^{p-2} \dots + 1$. So $E$ a cyclotomic extension of Q of degree $p-1$ and that the roots of $x^p - 1$ are the $p^{th}$ roots of unity. Also that the Galois group is comprised of the automorphisms of $E$ that fix $\mathbb{Q}$ and permute the roots of $f$.  As a second question, if I am asked to prove that the Galois group $Gal(E/Q)$ is cyclic, when $E$ is the splitting field for some specific $f$ and $p$ is small, say $5$ or $7$, is there an easier way to prove this than first proving the more general statement above and then drawing the conclusion from that?   Any help will be much appreciated! Thanks.


Having installed the latest version of MikTeX (2.9) and TeXmaker (5.0.4) on a new Windows-based machine, it seems that some eps files can be converted into an pdf format, but they are shown as blank, both in the "eps-converted-to-pdf.pdf" file as well as in the article.   Surprisingly, the same document works perfectly fine on my old machine, saying that the converted figures appear properly in the document.  I searched for some answers around the web, but none of the solutions work. I also tried a different editor, but the problem won't disappear.   Here is a MWE. Importantly, in this document "testfigure2.eps" seems to work perfectly fine, while for "testfigure.eps" the error described above occurs.  \documentclass[12pt,a4paper]{article} \usepackage{graphicx} \usepackage{epstopdf}  \begin{document} \begin{figure} \centering \includegraphics[width=\textwidth]{testfigure.eps}  \end{figure}  \begin{figure} \centering \includegraphics[width=\textwidth]{testfigure2.eps}  \end{figure}  \end{document}   Ideally, I am looking for a simple solution that doesn't require fancy refinements in my preamble.  Attached, please find the log file (had to change the names and save it as pdf) as well as the "testfigure.eps".

I wish to  include eps images generated from Matlab plot (pdf is generated by Matlab as a whole page, that's why eps), however the conversion fails, leaving blank pdf image. The messaghe is:  MiKTeX GPL Ghostscript  9.25: Unrecoverable error, exit code 1    Sorry, but "MiKTeX EPS-to-PDF Converter" did not succeed. The log file hopefully contains the information to get MiKTeX going again: C:\Users\Andrey\AppData\Local\MiKTeX\2.9\miktex\log\epstopdf.log   The content of the log file  2019-12-03 06:29:05,797+0100 INFO  epstopdf - starting with command line: epstopdf --outfile=images/kkk-eps-converted-to.pdf images/kkk.eps 2019-12-03 06:29:06,456+0100 FATAL epstopdf - Invalid argument 2019-12-03 06:29:06,457+0100 FATAL epstopdf - Info:  2019-12-03 06:29:06,457+0100 FATAL epstopdf - Source: Libraries\MiKTeX\Core\Stream\FileStream.cpp 2019-12-03 06:29:06,457+0100 FATAL epstopdf - Line: 68   I have recently installed and updated Miktex and compile with LuaLatex.  Here is the  content of the eps, if needed   What is wrong with it? I have no idea what to do about it.  Update  First of all I'd like to that I do compile with --shell-ecape (from TexStudio)  Process started: lualatex.exe --shell-escape -synctex=1 -interaction=nonstopmode    I tried suggestion from Christian Shenk. The command is   mgs.exe -q -sDEVICE=pdfwrite -dSAFER -dAutoRotatePages=/None -dPDFSETTINGS=/prepress -dMaxSubsetPct=100 -dSubsetFonts=true -dEmbedAllFonts=true -sOutputFile=images/kkk-eps-converted-to.pdf - -c quit   I tried to execute it  in command processor. It creates a 0 byte pdf file and gets  stuck.  Update 2  I executed  epstopdf --outfile=images/kkk-eps-converted-to.pdf images/kkk.eps   And I did get additional information  Error: /invalidfont in /findfont Operand stack:    Helvetica-BoldOblique Execution stack:    %interp_exit   .runexec2   --nostringval--   --nostringval--   --nostringval- -   2   %stopped_push   --nostringval--   --nostringval--   --nostringval--   false   1   %stopped_push   2015   1   3   %oparray_pop   2014   1   3   %oparray_pop   --nostringval--   1998   1   3   %oparray_pop   1884   1   3   %oparray_pop   --nostringval--   %errorexec_pop   .runexec2   --nostringval--   --nostringval--   --nostringval--   2   %stopped_push   --nostringval--   1967   1   3   %oparray_pop Dictionary stack:    --dict:973/1684(ro)(G)--   --dict:0/20(G)--   --dict:123/200(L)-- Current allocation mode is local   I have no clue how I can fix it. It mentions something about "Helvetica-BoldOblique", but the images don't use it, but regular Helvetica.


In Spanish or in Catalan (not sure if also true in other Latin languages) we have a word for each letter in the alphabet. For example, letter "H" is written as "hache", in Spanish or "hac" in Catalan. Can you do that also in English? How would you write the name of "H"?

The English alphabet has a common pronunciation. For example, the letter b is pronounced like the word bee, the letter c like the word see, and the letter i like the word aye.  Is there a formal spelling for the letter names?


Having watched A New Hope again, I have just realised that the only people to meet Vader in person out of the main good characters are Leia and Obi-Wan. It's understandable why Han didn't interact with Vader but why doesn't our main hero do so like in all other movies?  Not a dupe of . I don't believe the answers in there actually answer my question.  I know there were plans for Luke to be told that Vader was his father but I find it odd that there was no pre-reveal meeting between the two of them such that both of them would have an initial impression as to who they were dealing with (that IMO would have made the reveal even deeper to Luke than what is actually portrayed). After all, Luke was told about Vader's reputation by Obi-Wan and Vader had sensed that Luke was somehow connected to the force.

I was watching the original series and got to "I am your father". I thought: is this something the author planned all along or thought of while writing The Empire Strikes Back?


This question is not a duplicate, as the other questions with the same issue do not have working solutions.  I installed steam onto my main hard drive, but I need to add a library because my main hard drive doesn't have enough space for games. When I try to create a new library, I get the error message:  New steam library folder must be on a filesystem mounted with execute permissions.   The drive I'm trying to install games onto is NTFS, and gets mounted by fstab on /media/reddragon/games. However, even when adding the options exec and rwx to the options area, I still have the same error.  The current workaround is to mount the drive through nautilus when I log in, but It's kind of annoying, since I shutdown my computer every time I walk away for more than a few minutes.  Does anyone know what I'm doing wrong here?  Also, making a symbolic link to the default directory won't work, I don't like symbolic links, they're very complicated to deal with, especially when unmounting and mounting drives.

I have a script that I need to execute on an NTFS partition. The script's permission is set to 600.  I attempted to modify the permissions by running chmod 755 script.sh, which doesn't report a failure or anything - but it also doesn't change the permissions on the file:  $ stat script.sh    File: `script.sh'   Size: 297070      Blocks: 584        IO Block: 4096   regular file Device: 811h/2065d  Inode: 35515       Links: 1 Access: (0600/-rw-------)  Uid: ( 1000/  xxxxxx)   Gid: ( 1000/  xxxxxx) Access: 2010-09-30 14:05:16.041621000 -0700 Modify: 2010-09-30 14:05:05.070157000 -0700 Change: 2010-09-30 14:05:05.070475000 -0700  $ chmod 755 script.sh $ stat script.sh    File: `script.sh'   Size: 297070      Blocks: 584        IO Block: 4096   regular file Device: 811h/2065d  Inode: 35515       Links: 1 Access: (0600/-rw-------)  Uid: ( 1000/  xxxxxx)   Gid: ( 1000/  xxxxxx) Access: 2010-09-30 14:05:16.041621000 -0700 Modify: 2010-09-30 14:05:05.070157000 -0700 Change: 2010-09-30 14:05:05.070475000 -0700   As you can see, it remains unchanged.


I am an extremely fresh Linux User. I recently dual booted my laptop with Ubuntu 18.04.3 LTS, but it doesn't connect to Wi-Fi. I tried various fixes from the internet, clean installed ubuntu several times, but none of them worked, unfortunately.  WiFi works perfectly fine on windows though.  Help me out, please. I want to slowly and permanently shift to Linux.

How do I install Wi-Fi drivers for Realtek RTL8723DE device in Ubuntu 16.04?  lspci -v | grep -i network 02:00.0 Network controller: Realtek Semiconductor Co., Ltd. Device d723


Let $[n]$ be a set with $n$ element. A permutation $\sigma$ of the symmetric group $S_n$  is called a derangement of $[n]$ if $\sigma(i)\neq i$ for each $i\in[n]$. Suppose that $\theta$ and $\gamma$ are two arbitrary permutations of $S_n$. We say that a permutation $\sigma$ is a double derangement with respect to $\theta$ and $\gamma$ if $\sigma(i)\neq \gamma(i)$ and $\sigma(i)\neq \theta(i)$ for each $i\in[n]$ and denoted by $D_n(\gamma,\theta)$. Could you please give explicit formula or recurrence relation for the number of such derangement ($|D_n(\gamma,\theta)|$?

Let $[n]$ be a set with $n$ elements. Two derangements of this set, $\sigma$ and $\psi$ satisfy the next condition.   $\forall i\in [n], \sigma(i)\neq \psi(i)$   This condition makes $\sigma$ also a derangement of $\psi$. A double derangement of $[n]$ is an (ordered) pair {$\sigma;\psi$} such that $\forall i\in[n], \sigma(i)\neq\psi(i)$. How many double derangements can there be?  I have been thinking about this problem since I learned about derangements. I tried to solve this problem by finding a recurrence formula and using inclusion–exclusion principle, but figured out that it is too complicated to solve by this method. Are there any better ideas to solve this problem?


"What's working around communication? What's not?"      "What's working for you around influence? What's not?"   Please tell me the meaning of these sentences. I have problem with the word "around" and so I can't understand the meaning of these sentences.  These questions were found in a :     Coaching Questions to Explore with Clients:           What's working around communication? What's not?       Thinking about your team, what are their preferences around communication? What are your preferences around communication?     What are the strengths you bring to communication?     What are your communication blindspots?     What difficult conversations need to happen?           Coaching Questions to Explore with Clients:         What does influence mean for you?   What does influence look like?   Where is influence most important to you in your role/team/department?   What's working for you around influence? What's not?

What's working around communication? What's not?      What's working for you around influence? What's not?   Please tell me the meaning of these sentences. I have problem with the word ((around)) and so I can't understand the meaning of these sentences.  These questions were found in a :     Coaching Questions to Explore with Clients:           What's working around communication? What's not?       Thinking about your team, what are their preferences around communication? What are your preferences around communication?     What are the strengths you bring to communication?     What are your communication blindspots?     What difficult conversations need to happen?           Coaching Questions to Explore with Clients:         What does influence mean for you?   What does influence look like?   Where is influence most important to you in your role/team/department?   What's working for you around influence? What's not?


I see App in my Apps section of settings which says App not installed for this user. It's completely greyed out and I cannot uninstall it. When I install the same from  it says incompatible version is already installed.  I just want to remove this App from my device.     Doesn't get uninstalled from adb either     C:\Users\athakur>adb uninstall com.osfg.rintonesetter.main   Failure [DELETE_FAILED_INTERNAL_ERROR]   and     C:\Users\athakur>adb shell pm uninstall -k com.osfg.rintonesetter.main   Failure [DELETE_FAILED_INTERNAL_ERROR]   Any suggestion is appreciated.

I am having a problem with uninstalling apps on Android 5.0 (Nexus 5). I am developing an Android app, so I debug/run the app directly on my device. For production, I exported the same app with my keystore, uninstalled the debug APK that I ran earlier, tried to install the signed APK, and I got this error:      An existing package by the same name with a conflicting signature is already installed.   Is it because the bytecodes are still in the ART runtime? Anyone has any idea how to solve this?


This is a code set I copied from Twentyeleven theme.                  <?php while ( have_posts() ) : the_post(); ?>          <?php get_template_part( 'content', get_post_format() ); ?>          <?php endwhile; ?>          <?php twentyeleven_content_nav( 'nav-below' ); ?>   Why do developers use many opening and closing PHP tags when developing WordPress themes?  Above code can be written like this.          <?php while ( have_posts() ) : the_post();          get_template_part( 'content', get_post_format() );          php endwhile;          twentyeleven_content_nav( 'nav-below' ); ?>   So what is the purpose of using opening and closing php tags for almost every line?

I've seen this convention pretty much everywhere, and, at times, it comes close to driving me nuts:  <?php //The loop ?> <?php while ( have_posts() ) : the_post(); ?>     <?php the_content(); ?> <?php endwhile; // end of the loop. ?>   Where the <?php and closing ?> are on every single line, even if there is no intervening HTML code.    My question is: Why?  Why include all these extra tags?      To me, it seems this convention adds a significant amount of clutter to code, is annoying to follow in the first place, and adds that many more places to accidentally leave out an opening or closing tag.  NOTE  This is code pulled from the Twenty-Twelve theme, the example given by WordPress.


I have a domain  (online dream interpreter) and I wish to expand the service to more languages.  The content will be different in each language, not just simple translation, since people will input different dreams in each language.  What should be my best practice in terms of SEO?   Use folder, e.g.:  for Spanish Use subdomain, e.g.  for Hebrew (I have made this already) Buy a totally different domain like  (the problem here is there are many different countries speaking Spanish and it's a general domain not country specific - but it might be better for SEO like that)

When I set up a site in multiple languages, how should I set up my URLs for search engines and usability?  Let's say my site is www.example.com, and I'm translating into French and Spanish. What is best for usability and SEO?  Directory option:  http://www.example.com/sample.html http://www.example.com/fr/sample.html http://www.example.com/es/sample.html   Subdomain option:  http://www.example.com/sample.html http://fr.example.com/sample.html http://es.example.com/sample.html   Filename option:  http://www.example.com/sample.html http://www.example.com/sample.fr.html http://www.example.com/sample.es.html   Accept-Language header:  Or should I simply parse the  header and generate content server-side to suit that header?  Is there another way to do this? If the different language versions don't have different urls, what do I do about the search engines?    UPDATE 2011-12-06  Google has new recommendations for meta tags for explicitly pointing to other language content: .  UPDATE 2012-05-25  Related but not precisely:   UPDATE 2013-06-12  includes discussion of several URL schemes directly relevant to the question.