public static void main(String[] args) {     Scanner Input= new Scanner(System.in);     System.out.print("Enter String: ");     String s =Input.nextLine();     int index = s.length();     boolean isVowel= true;     isVowel = vowels(s,index);     if(isVowel==true)         System.out.println("Its Vowel"); } public static boolean vowels(String s,int index){     String small=s.toLowerCase();     String large = s.toUpperCase();     char z=s.charAt(s.length()-1);     if (s==small) {         large = s.toUpperCase();         if(s==large){         }         for (int i = 0; i < s.length(); i++) {             if (z=='A'||z=='E'||z=='I'||z=='O'||z=='U') {                 System.out.println("Character at " + s.charAt(s.length()-1) + " is a vowel");                 return true;             } else if(z!='A'||z!='E'||z!='I'||z!='O'||z!='U'){                 System.out.println("The String contains no Vowels");                     return false;             }         }     }     return true;     } }   It keeps returning the last printing statement, "The String contains no Vowels" Any suggestions?

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?


A professor has offered me a summer research project at his lab. The last we had talked was on a Zoom call during which I was offered the position. He had then asked me to send my academic records after which he would give the other documents like Offer Letter, Visa Forms, etc. I have mailed him my records and have asked to discuss the project dates. He is not responding to my emails. It's been almost 20 days. I have also sent follow-ups, the last one being sent this Monday. He still hasn't responded. Has he cancelled my project? If so, why hasn't he informed? What should I do next? Should I send another follow up this Monday?

I recently joined a research group as a postdoc. I wrote the professor an email to ask quick but important questions including asking him when when he wanted me to start. It's been over a week and I haven't received get an answer. Other emails I've sent previously have also gone unanswered for long periods as well.   With that background, my question is: do professors sometimes (intentionally or otherwise) not respond to emails in a timely manner?


I have two variables (which i'm getting from database):  $start = '07:14:10'; $end = '07:14:58';   I need to get the difference between these.  I think the answer could be 00:00:48.

How to calculate minute difference between two date-times in PHP?


I understand that the public key in RSA encryption may be computed using Euler's totient function or Carmichael's totient function.  I'm now trying to figure out how the choice of totient function affects the security of the public key, if any. Are there any ways in which a chosen totient function may make it easier or harder to compute the private key from the public key?  Edit for clarification: Are there any direct ways in which the choice of totient functions may affect the 'backtracking' process of figuring out the private key (d) from the public key (e)?

In textbook RSA, the Euler $\varphi$ function $$\varphi(pq) = (p-1)(q-1)$$ is used to define the private exponent $d$. On the other hand, real-world cryptographic specifications require the Carmichael lcm function $$\lambda(pq) = \operatorname{lcm}(p-1,q-1)$$ to define $d´$. It is clear that the $d´$ divides $d$, and therefore using $d´$ may be more efficient than using $d$. My question is: Are there any further reasons, e.g. regarding security, why one should not use $d$?


I'm fairly new to Ubuntu and the Linux world, but whenever I turn on the Night Light feature on my laptop running Ubuntu 18.10, my screen completely tint-flashes  with orange then goes back to normal as if I never turned on Night Light. Yet Ubuntu still says it's on.   It turns out that my issue was being caused by the extension I will as soon as I using.

I installed Ubuntu on a disk partition just two days ago and everything work like a charm. The only problem I'm having is with the screen temperature color. In Windows I use f.lux and I set the color temperature as red as possible (3500K) all-day-long. I want to do the same in Ubuntu but I faced many issues:   f.lux doesn't change the color at all Redshift changes the temperature for a couple of seconds, then it suddenly goes back to the normal color GNOME Night Light has the same problem of Redshift: the change is not permanent although I set the color temperature to be 3500K from 5AM to 3AM   Is anyone having the same problem? How can I fix it?    System info:   Ubuntu 18.04.1 LTS GNOME 3.28.2 External monitor HP 24" 60,00 Hz


We, as expats for example in Germany, face a lot situations which require asking questions and seeking answers. We do in private groups, on Facebook, or search on Google. However, I believe if we have a Stack Exchange or Stack Overflow-like one, it would be magnificent. Why does Stack Exchange not have an expat website?

I have an idea or subject that should have a Q&A, and want to propose a new site. How can I do this?  Related:


Is there any way to compilte a *.tex file to word instead of pdf?  Thank you very much.

Is there any way to produce doc/docx files from LaTeX?


Is there a way to create a single array out of two? E.g.  int[] array1 = {1,2,3}; int[] array2 = {4,5,6}; int[] array1and2 = array1 + array2;

I need to concatenate two String arrays in Java.  void f(String[] first, String[] second) {     String[] both = ??? }   What is the easiest way to do this?


I upgraded Ubuntu to 20.04 from 18.04. But after the upgrade I'm having trouble booting my system. I'm getting the following message displayed: **/lib/systemd/systemd-udevd: error while loading shared libraries: liblzma.so.5: cannot open shared object file: No such file or directory Gave up waiting for root file system device. Common problems: - Boot args (cat /proc/cmdline) - Check rootdelay= (did the system wait long enough?) - Missing modules (cat /proc/modules; ls /dev) ALERT! UUID=................................ does not exist. Dropping to a shell! BusyBox v1.30.1 (Ubuntu 1:1.30.1-4ubuntu6.3) built-in shell (ash) Enter 'help' for a list of built-in commands. (initramfs)**  I tried a few solutions from various forums that involved booting with a live USB stick, but nothing worked. Please somebody suggest how to rescue this. I'm really falling behind with my work. Ubuntu is installed on sdb4.

While installing the Ubuntu 20.04 updates during upgrade from 19.10 to 20.04, my screen suddenly went completely white and displayed a message saying  Please logout and try again.  But I could not locate my cursor and so I switched off my laptop. After restarting it again, it was showing an error message saying  Please update the microcode  Why did this happen? How can I solve this problem?


It renders correctly in posts ( *), but not above or below.

In my comment here:    I needed to have a : symbol with a leading space, but I couldn't figure out how to get it.  And for some reason it converts differently in this question to how it would in a comment - as you can see, in the comment box ` :` wasn't turned into code block at all.  Is it impossible, by design, to have leading or trailing space in a codeblock?


I know it works by blocking electric or magnetic component of wave while allowing other but what happens at the atomic level , do the atoms absorb the electric component e.g by excitation of electrons ? or do the bonds resonate at frequency of electric component of wave ?

(1) What happens at microscopic level when unpolarized light falls on a linear polarizer sheet ? i.e. Due to what thing inside polarizer sheet, only those EM waves are passed whose plane of vibration of electric field is parallel to transmission axis of polarizer sheet ?  (2) Consider experiment of measuring degree of linear polarization of light coming from an incandescent source of light. First light falls on linear polarizer and then analyzer (which is again a linear polarizer). Light blocked by polarizer is absorbed by polarizer and heats up the polarizer (some of the blocked light will be reflected). Does this affect the measurement of degree of linear polarization ?


I'm creating a game in a web page and I think it will be better, if when the user accidentally click back (in tablet or phone) then will appear a confirm box to stay.  I would like to use an own style confirm box (with more options) instead of the original. Well, now I use onbeforeunload JavaScript Event. Although I can't change the style, I can add more things to do when it happens. So I think if it can be hidden, then it's enough for me :D

I need to warn users about unsaved changes before they leave a page (a pretty common problem). window.onbeforeunload = handler  This works but it raises a default dialog with an irritating standard message that wraps my own text. I need to either completely replace the standard message, so my text is clear, or (even better) replace the entire dialog with a modal dialog using jQuery. So far I have failed and I haven't found anyone else who seems to have an answer. Is it even possible? Javascript in my page: <script type="text/javascript">        window.onbeforeunload = closeIt; </script>  The closeIt() function: function closeIt() {   if (changes == "true" || files == "true")   {       return "Here you can append a custom message to the default dialog.";   } }  Using jQuery and jqModal I have tried this kind of thing (using a custom confirm dialog): $(window).beforeunload(function () {     confirm('new message: ' + this.href + ' !', this.href);     return false; });  which also doesn't work - I cannot seem to bind to the beforeunload event.


Why can you not access the discussion zone via the stackexchange app? I understand the full page with proposals.  I think it would be very useful to add the discussion page to the app and also help promote new proposals.

I came across something rather interesting today. I was browsing Area 51 on Chrome when I happened to click on . To this, I was greeted with a prompt asking:    As , and fully expecting a crash, I clicked on SE. However, that didnt happen.     Now, since Area 51 Meta is working correctly as far as Q&A is concerned, I think it should be added to the All Sites list and if at all possible, made directly browsable from within the app.


What if there were 2 universes (completely disconnected - not part of the same multiverse) which were identical and a given point in time (say when they first began). Would these 2 universes evolve in exactly the same way?  My understanding of quantum uncertainty would lead me to be believe they would not evolve in the same way (in other words, reality is inherently non-deterministic), but I'd like to hear what others think. Also, just to check my understanding, if we say the universe were indeed "deterministic", the 2 universes would always evolve the same, correct?

I'm not sure if this is the right place to ask this question. I realise that this maybe a borderline philosophical question at this point in time, therefore feel free to close this question if you think that this is a duplicate or inappropriate for this forum. Anyway, I'm an electrical engineer and I have some basic knowledge of quantum mechanics. I know that Schrödinger's equation is deterministic. However, quantum mechanics is much deeper than that and I would like to learn more. If this question is not clearly answerable at this point than can anyone point out some recognized sources that try to answer this question. I would appreciate it if the source is scientific and more specifically, is related to quantum theory.


I am trying to create a latex class that allows sectioning below subparagraph. For doing that, I modified the article.cls class of the texlive distribution adding two more options \thesubsubsubsection and \thesubsubsubsubsection. So now, the sectioning tree goes as follows:  \thesection   \thesubsection   \thesubsubsection   \thesubsubsubsection   \thesubsubsubsubsection \theparagraph   \thesubparagraph   Please see below myarticle.cls, mysectioning.tex and the resulting mysectioning.pdf.  I achieved the wanted effects in terms of numbering, table of contents and section formatting. The only problem that I have is that in the new two headings, \thesubsubsubsection and \thesubsubsubsubsection, the heading title is repeated in the following paragraph as indented text (see Sections 1.1.1.1  and 1.1.1.1.1 below).  Do you know how can I avoid this behavior?  Many thanks in advance for your help and ideas! Sebastian

I am a novice in LaTeX and I have one question.  Can someone tell me what if you want more heading's in LaTeX. Like 5 or 10 or even 15. Is there a package for that?


Let $$ f(z) = \sum_n z^{n!} $$ I am trying to show that $f(z)$ is analytic on the open unit disk ${|z| <1}$. My thought is to find its radius of convergence $R$, but this series does not have a form of a power series (which I learned how to find $R$ from the various tests) so I am not sure if I am doing it correctly.

I have come across the following few questions on past exams papers.. I know how to solve these type when it is of the form $a_nz^n$ but don't have a clue what to do with these. Any help would be greatly appreciated!  (i) $\displaystyle\sum_{n=0}^\infty \bigg(\dfrac{1}{2n}\bigg)z^{3n}$.  (ii) $\displaystyle\sum_{n=0}^\infty(2^n+i)(z-i)^n$.  (iii) Show that the radius of convergence of $\displaystyle\sum_{n=0}^\infty z^{n!}$ is $1$ and that there are infinitely many $z \in \mathbb{C}$ with $|z|=1$ for which the series diverges.


I'm studying pendulums, and the units have me a bit confused.  In a pendulum, Iw^2=mgL.  Putting together the units of the left side of the equation, we get gm^2 (rads^-1)^2=g(m^2)(s^-2)(rad^2).   But the units of the right side of the equation equal g(m^2)(s^-2)  Where does the unit radian fit in? How do I deal with the unit radian when dealing with measures of linear speed?

The radian is defined as the ratio of the circumference and the radius. Both are measured in meters. So there should not be a unit for that. But we use 'rad' as the unit of the radian value.   The coefficient of static/kinetic friction also the same, it is a ratio of both forces. Therefore it doesn't have a unit.  So, is there a special reason to have a unit for the radian value?


My database has two log files. Their sizes are growing very fast.  My backup sizes are becoming massive. I know that when I take full backup of my database, the log files are emptied but it is not. I can't control it.How can I control log growth?

This one seems to be a common question in most forums and all over the web, it is asked here in many formats that typically sound like this:  In SQL Server -  What are some reasons the transaction log grows so large? Why is my log file so big? What are some ways to prevent this problem from occurring? What do I do when I get myself on track with the underlying cause and want to put my transaction log file to a healthy size?


First of all, Is it possible to install Ubuntu w/ dual boot without formatting my HDD? (Keep in mind partition already been made on HDD).  Also out of curiosity, I have Galaxy s8 and Galaxy Note 3, is it possible to port Ubuntu to these devices?   Any help would be appreciated with installing on Windows

I would like to port Ubuntu Touch to a device that is currently not supported. What are the requirements for doing this and where do I begin?


I got the storyline of this book series (I believe it was a series) told to me by a colleague at a former workplace but I can't remember the name of the author or of any of the books in the series. The first book is about a couple of college students who find a way to relatively easily open portals to pretty much wherever they want to go. One day, NASA(?) finally succeeds in sending astronauts to Mars(?). When they have just left the spaceship, one of them suddenly gets a tap on the shoulder, and when he/she turns around, these college students stand there in their homemade space suits, chuckling. I believe these students later also start a company that helps other organizations establish themselves on other planets, or perhaps even "conquers" and sells planets to other organizations. A later book in the series also describes a system that lets people upload their minds to the cloud. Some people choose to live solely in the cloud as virtual creatures, only deciding to "descend" into a "flesh" body when they need to perform some task that requires them to be in physical form. Some people also choose to live in physical form but as several entities, or clones, and sync their mind between the clones through this system, basically allowing them to, for example, run a one-man company with several "instances" of the same human who all share their knowledge and all know exactly what all other clones know in the same moment, effectively creating a super-efficient team of workers.

Desperate to locate and re-read exceptional book/series, but cannot remember the title. The high concept: The U.S. has just sent the first successful expedition to Mars, and it has just landed. As the astronauts make their initial exploration outside their ship, a tear in the fabric of space opens up right in front of them, and they look through to the insides of a laboratory (at a California university?) and two students who just figured out how to create arbitrary portals between two points in the Universe. The rest of the novel/series is a consequence of this breakthrough. But I can't remember the author and title(s). Surely someone reading this forum will remember it well! TIA.  (Reposted .)


In Gnome Classic in 14.04, I am running a program (it opens a chm file, but I forgot the name of the program and the window doesn't show the name of the porgram) in a window. It becomes non responsive, and even right clicking it and choosing close don't close it.   How can I find out its pid, and kill it from gnome terminal? Thanks.

All operating systems freeze sometimes, and Ubuntu is no exception. What should I do to regain control when...   just one program stops responding? nothing at all responds to mouse clicks or key presses? the mouse stops moving entirely? I have an    In what order should I try various solutions before deciding to pull the power plug?  What should I do when starting up Ubuntu fails?  Is there a diagnostic procedure I can follow?


I'm looking for a book/pdf/guide to quantitative finance that contains all of the necessary mathematical prerequisites, as well as modern quantitative finance topics. Preferably something written at the advanced undergraduate/beginning graduate level.   Any recommendations are greatly appreciated. I cannot seem to find a comprehensive text that is written in a reasonably rigorous way (makes use of theorems from lin alg, probability, analysis, etc).   Thanks!

While taking a course on introductory probability, I found out about stochastic calculus and differential equations, topics which I decided I would learn because they sounded very interesting. I found an  on Mathematical Finance that was perfect because it would use single and multivariable calculus, differential equations, linear algebra and probability, as well as develop the concepts of Itô Calculus and Stochastic processes.   Unfortunately, the course problems had no solutions (a problem I find very hindering when learning on my own because an integral part of the learning process is known when you are right, when you are not, and why you are not). Also, the lecture notes contained typos who managed to invade equations and formulas, making them false and confusing.   I have looked for similar courses on the internet that both reinforce and review topics I have already studied while also developing the aforementioned concepts that I wished to understand, however, my search has turned up nothing.   I would like to know if there are books or online courses with these characteristics, or at least a website or textbook I can use to learn stochastic calculus.


In the following code, I traced by using debugger I fail to understand 1. why B b2() is never called but skipped. 2. Why auto_ptr calls base (A) destructor only when object created is derived (B)?   class A { public:     A(int x_) : _x(x_) {cout << "A::A( " << _x << ")" << std::endl; }     A(const A& src) : _x(src._x) {cout << "A::A(copy " << _x << ")";}     ~A() { std::cout << "A::~A " << std::endl; }     int x() const { return _x; }; protected:     int _x; }; class B : public A { public:     B():A(0) {cout << "B::B( " << _x << ")";}     B(A a):A(a.x()) {cout << "B::B(A) ";}     ~B() { std::cout << "B::~B "; } }; int main() {     B b1(11); //which calls A(int) -> B(A a) -> {A::x() -> A(int)} -> ~A()}     B b2();   //It's never called, why?     std::auto_ptr<A> aptr(new B); //Calls A(0)->B()-> ~A() ==> why ~A() only but not ~B() ? } /*Actual Result: B b1(11) => It prints following         A::A(11)         A::A(11)         B::B(A)         A::~A /// Why B b2() is not called??? auto_ptr<A> aptr(new B) => It prints following. Why ~B() is not called?     A::A(0)     B::B(0)     A::~A B b1(11) destructors => It prints following     B::~B     A::~A */

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


I have tried to open a .accdb file on libreoffice and a few other ms access clones, but without any success. I saw some questions asked almost 10 years ago proposed installing something, but I am not sure if that is a safe or relevant option anymore.

I've received a Microsoft Access .accdb file (version 2010 I believe) that I need to get some data from.  How can I open it in Ubuntu? Is there any tool that would allow me to do so?  PS: Read-only is fine, if it has CSV exporting capabilities, the better.


I am using the glossaries package to generate a nice list of acronyms. For often used acronyms I defined some shortcuts, e.g. \newcommand{\myshortcut}{\acrshort{myacronym}}. The acronym myacronym has been defined before with \newacronym{myacronym}{myacronym}{myacronym is a dummy acronym used in this text}. The Problem is, when I use \acrshort{myacronym} everything works well, but if I use \myshortcut, the acronym link is generated and added to my glossary (as it should behave), but in addition to that if a space symbol follows in behind of the acronym at the position it is used in the text, this space symbol is lost!  At first I tried to workaround this problem by changing the shortcut Definition to \newcommand{\myshortcut}{\acrshort{myshortcut}\space}. This works but of course this will also generate an additional space when I don't want to have it in behind, e.g. at the end of a sentence.  Now my question is can I either find out if the next symbol is a space character and add it than to my shortcut definition or is there another (perhaps simplier) way to solve this problem.  Thanks to you in advance!

As scientific species names should be written in italic, I have adopted a shortcut to do this in LaTex by creating a definition in the preamble:  \def\GM{{\it Gadus morhua~}}    Then it's easy to call for \GM is a fish, which returns "Gadus morhua is a fish". Note that I have added ~ to the definition, so that I won't need to write \GM~. This works except, if I want to write The fish is called \GM., which would return "The fish is called Gadus morhua ." (with a space between morhua and period). In order to maximize my lazy writing style I would like to find a way to "eat away" that space I defined earlier. I know that a negative space exists in math mode, but writing $\GM\!$ does not lead to a right result. Is there a way adding a negative space to text mode?


I have small brain fade today and I believe it will be faster to get hint here than wondering for an hour.  I have list A of 100 elements. How can I create another list(B) basing on list A, that will have 10 elements, so that each element is mean of 10 elements from  list A?  Thank you in advance.  e.g.  A = [10,10,10,10,10,20,20,20,20,20,30,30,30,30,30,40,40,40,40,40] B = [15, 35]

I have a Python script which takes as input a list of integers, which I need to work with four integers at a time.  Unfortunately, I don't have control of the input, or I'd have it passed in as a list of four-element tuples.  Currently, I'm iterating over it this way: for i in range(0, len(ints), 4):     # dummy op for example code     foo += ints[i] * ints[i + 1] + ints[i + 2] * ints[i + 3]  It looks a lot like "C-think", though, which makes me suspect there's a more pythonic way of dealing with this situation.  The list is discarded after iterating, so it needn't be preserved.  Perhaps something like this would be better? while ints:     foo += ints[0] * ints[1] + ints[2] * ints[3]     ints[0:4] = []  Still doesn't quite "feel" right, though.  :-/ Related question:


First of all, I am not very intelligent, so the question I am about to ask would sound inane--but I am just curious, that's all.  We were always used to being attached to our calculators when it comes to utilizing the following three trig functions: Sin ($\theta$), cos ($\theta$), and tan ($\theta$).  Providing an example, we were always taught that using our calculators is the solution when it comes to solving Dot Products.  Students in the Asian countries are taught without the calculator even till this day -- unless, SAT is being involved, but that is a completely different story.  I am sure there is a way to solve them by hand -- though, it may not be as precise nor easy -- and if there is a chart that can be cited, or any specific methods that can be used, please feel free to answer them below.  Thanks for your help.

In school, we just started learning about trigonometry, and I was wondering: is there a way to find the sine, cosine, tangent, cosecant, secant, and cotangent of a single angle without using a calculator?  Sometimes I don't feel right when I can't do things out myself and let a machine do it when I can't.  Or, if you could redirect me to a place that explains how to do it, please do so.  My dad said there isn't, but I just had to make sure.  Thanks.


I tried to install ubuntu 19.04 in my friend laptop. His laptop is lenovo g580 with 4gb ram. I have created a free disk partition of 280gb.  But when i try to install ubuntu in his laptop i get to see no partition available for installing. So i got to check the gparted which shows as   I dont know what to do now. I have serched for the internet where i cannot find a reasonable solution. So what should i do ?

I've been trying to install 12.04 for a while now, I'm running on Windows 7 and I already made the partition (it's dynamic). I've tried booting from a disc and also the Windows installer. I haven't tried used any repair-boot programs or anything. Every time I tried to load from either, I get an error:  command=C:\windows\sysnative\bcdedit.exe /set {03f9077f-661f-11e1-845a-d08b36406c3d} device partition=U;  retval=1  stderr=An error has occured setting the element data. The request isn't supported  stdout=   Then after that, it makes a log file with information that I don't understand.  If it is simply due to the fact of it being a dynamic partition, someone please help. If it is more extensive, anyone with details on possible solutions or definite ones please express them.


So I am trying to make a building in Blender for my University Project. I have made the outside of the building and now I am trying to add windows with frames at the front. One side of my building has a window, which I created with no issues. Now I am trying to clone this on the other side of the building I am finding that the loop cut keeps skipping a face of my window for some reason, and I can't figure out why! I have a few screenshots () and hopefully, this shows what I mean. Any help would be appreciated.   Side note, this is my first ever time using Blender so I am not aware of many of the shortcuts etc.  EDIT: Here is my blend file: Removed, can be readded if needed. Don't want my work being flagged up when I upload it.   Thanks

Alright so I've seen some postings about loop cuts and done some research. I am very new to blender and modeling overall. I am trying to loop cut this concrete barrier. Now I'm following a tutorial and kind of did my own thing in some areas. I cleaned it up following some instructions in another answer here on stack exchange.  I can't for the life of me figure out why I can loop cut around the whole bottom:   ...but not the whole middle:   I see this marked as answered by another question. That question refers to ngons and inside faces. Now once again I'm totally new to this. I looked on the inside. I don't believe I have inside faces or any ngons by the terms I've read online in my research.  Here is a wireframe picture and the inside view:     Maybe I'm missing something the answers on other posts are saying. If so and you know what it is I'd be very appreciative of what it is.


so I've been trying for a while to configure those two programs, but I just can't get it to work. I always get the error: [ForwardSearch("%bm.pdf","%Wc",%l,0,0,...  Cannot execute the command.  My settings are:

Despite having gone through     and having looked at the , there seems to some little changes for TeXnicCenter version 2.0 as of May 2013.  How can I make TeXnicCenter 2.0 to work with Sumatra?


I'm trying to correctly partition my hard-drive to facilitate a dual-boot setup Windows 10/Linux Mint 18.3  I'm using a brand new laptop and completed the out-of-box-experience so Windows 10 was installed. I then inserted the Gparted live CD and rebooted.   I shrinked down /dev/sda3 which was the ntfs windows partition to 100GiB with the msftdata flag. This process left me with approximately 350GiB unallocated space.  I selected the un-allocated space and created 3 primary partitions (the other options were grayed out):  One of these partition with Fat16 Filesystem of 150MiB I gave the boot, esp flags. The other two partitions were linux-swap and ext4 based partition for general storage.  The question that is bothering me is:  Is it ok to have two separate partitions on the one hard drive with the boot,esp flags? One partition for windows boot and one partition for Linux boot?

Is the "bootable flag" needed in today's distributions? If not, then why is it still in the installers? What is it exactly?


I wish to save some Double to an array, and I just need to have 2 decimal places Double. So I rounded the origin double to 2 decimal places, and when I print the rounded Double, the result is correct. However when I save these Double to an array and print the Double, the result becomes many decimal place.   What should I do to force only 2 decimal Double in the array?  For example:  Double -> 2.344563343534   // Original value   rounded -> 2.35            // Rounded value I want   After I save the rounded Double to array and print:  Double in array -> 2.34444444444444   // I hope this value only in 2 decimal place.

Consider the following code:   0.1 + 0.2 == 0.3  ->  false   0.1 + 0.2         ->  0.30000000000000004   Why do these inaccuracies happen?


So I may just be completely overcomplicating this for myself but I am trying to get the index of an array in a multidimensional array.  Hopefully showing it makes more sense.  Array (     [1234] => Array         (             [Name]  => Test         )     [5435]  => Array         (             [Name]  => Test         ) )   I have a large array with different numbers as the index and I need to do a foreach through them, but I need that index number. (1234,5435)  Is there any easy way of doing this?

Is it possible to find the foreach index?  in a for loop as follows:  for ($i = 0; $i < 10; ++$i) {    echo $i . ' '; }   $i will give you the index.  Do I have to use the for loop or is there some way to get the index in the foreach loop?


I want to write a query that select some records like below query but @reseller is of type nvarchar and an error occurs that it can't convert nvarchar to int. How can I solve it?  select * from Factor where code in (@reseller)  @reseller is '1,2,3'

How do I parameterize a query containing an IN clause with a variable number of arguments, like this one?  SELECT * FROM Tags  WHERE Name IN ('ruby','rails','scruffy','rubyonrails') ORDER BY Count DESC   In this query, the number of arguments could be anywhere from 1 to 5.  I would prefer not to use a dedicated stored procedure for this (or XML), but if there is some elegant way specific to , I am open to that.


Given the following definitions:   Disjoint means if event A occur ,B cannot possibly occur. Draw in the Venn Diagram, it should not contain any intersection. Hence, mathematically,   P(A,B) = 0. However, for independence, it says if we know that A occurs, it tells us nothing whatsoever about what B occurs. Does it mean it does have intersection?? Come to think of it. If A and B are independent,   P(A n B) = P(A)P(B).    Mathematically speaking, if A and B are disjoint, then   P(AnB) = 0 /= P(A)P(B)   If      P(AnB) = P(A)P(B),  then      it means there should be an intersection???

I'm taking a class in Probability Theory, and I was asked this question in class today:     Given disjoint events $A$ and $B$ for which $$ P(A)>0\\ P(B)>0 $$ Can $A$   and $B$ be independent?   My answer was:     $A$ and $B$ are disjoint, so $P(A\cap B)=0$.   $P(A)>0$ and $P(B)>0$, so $P(A)P(B)>0$.   $P(A\cap B)\not =P(A)P(B)$, so $A$ and $B$ are not independent.   However, I was told that I am wrong and we cannot know whether or not $A$ and $B$ are independent from the given information, but I did not receive a satisfactory explanation. Is my argument valid? If not, where do I go wrong?


I've encountered the following sentence:  order a helmet  Shouldn't it be "order an helmet" instead?

A basic grammar rule is to use an instead of a before a vowel sound. Given that historic is not pronounced with a silent h, I use “a historic”. Is this correct? What about heroic? Should be “It was a heroic act” or “It was an heroic act”?  I remember reading somewhere that the h is sometimes silent, in which case it’s an, and when the h is pronounced, it’s a. But then I also remember reading that it depends on which syllable is stressed. And I also think I read somewhere that it might differ between British and American English.  Personally, I pronounce the h, and believe that a is correct. I find that it sounds incorrect to use an and pronounce heroic without the h.  So how do I know when to use a and when to use an with a word beginning with the letter h? Are both acceptable or is there one that is correct?


On Meta sites we can close a question as a duplicate of another question which has no answers.    Which makes the current duplicate message incorrect:       marked as duplicate by USER X hours ago      This question has been asked before and already has an answer. If   those answers do not fully address your question, please ask a new   question.   At the time of writing,  is closed as a dupe of  which has no answers, but the close reason is as above (stating "already has answers").    This is for Meta sites only, main sites are different as you cannot close as duplicate if the supposed dupe question has no answers.

This request was sparked . The vote to close as a duplicate on meta, in contrast to the main site, does not require for the duplicate to have an answer. Yet, the closure message still says:     This question has been asked before and already has an answer.    ...even when this is not the case. Perhaps we should either only show this particular sentence if there is indeed an answer, or remove this altogether for meta.   Note: I fear this might be a duplicate request, but I was unable to find one. (Not even one without an answer :) )


It's been asked already in many places but all the answers literally everywhere are out of date, eg.   Here's how it looks like today, I have a video and I want to share it with one and only person on YouTube, the others should not be able to access it even if they guess the link (so "Unlisted" is not an option).  I must admit that YouTube's UI is a nightmare for me, I've been using Google's products for many years now and even stuff like Google Analytics is more obvious than this, for example, my video is not listed on My Channel (I know it's private but shouldn't I see it?) so I have to access it through YouTube Studio and even there "Dashboard" is empty, but when I click on "Videos" I can finally see it but I can't allow anyone to watch it (check the screenshot), have they stopped allowing it? What's the purpose of private videos then if I can't share it at all?

I have uploaded a YouTube video and marked it as private.  Now I want to share it with someone. I have tried to share it a few times, but they have not received any email notification.  What is the proper way of sharing the video?


Recently, I activated a bounty of 100 on one of my questions. The bounty grace period has now ended. Here is a link to my question: . The notification of bounty appears as given below:    My question still not has received any kind of answer from anyone. Then why does this message or notification appear?  Award this bounty to the best answer as soon as possible.    This question is entirely different from the suggested answers. This notification is clearly a bug that is to be fixed according to this answer .

The bounty I offered on  is now in its grace period and the information box tells me:     you must award this bounty as soon as possible   But there are no answers - what do I do?


This is a step on the way to proving  $$ \lim_{n \to \infty}\left(1 + \frac{z}{n}\right)^{n} = e^{z}.$$  I'm looking for an answer without  1) a summation or  2) a logarithmic function.   So far, I have that  $$ \lim_{n \to \infty} |z_{n}| = \lim_{n \to \infty} \vert\left(1+\frac{z}{n}\right)^{n}\vert = \lim_{n \to \infty} \left(\sqrt{\left(1+\frac{x}{n}\right)^{2} +\left( \frac{y}{n}\right)^{2} }\right)^{n} = \lim_{n \to \infty}\left(\left( 1+\frac{x}{n}\right)^{2} + \left(\frac{y}{n} \right)^{2} \right)^{n/2} = \lim_{n \to \infty} \left( 1 + \frac{2x}{n} + \left(\frac{x}{n}\right)^{2} + \left( \frac{y}{n}\right)^{2}\right)^{n/2}. $$ Now, I was given the following hint, and I would like to use it, but I don't know how:     Hint: Argue that you can discard terms with $1/n^{2}$; for example, by showing that the limit $\displaystyle \lim_{n \to \infty} \frac{\left(\left( 1 + \frac{x}{n}\right)^{2} + \left(\frac{y}{n}\right)^{2}\right)^{n/2}}{\left(1 + \frac{2x}{n}\right)^{n/2}} = 1$.   How would I show this ($\epsilon$-definition?), and how would it help me here with what I've already done?

We are dealing with $z \in \mathbb{C}$. I know that $$ \left(1+ \frac{z}{n} \right)^n \to e^{z} $$ as $n \to \infty$. So intuitively if $z_n \to z$ then we should have $$ \left(1+ \frac{z_n}{n} \right)^n \to e^{z}. $$ If $z_n \in \mathbb{R}$ I would be happy writing $$ \exp \left(n \log\left(1+ \frac{z_n}{n} \right) \right) = \exp \left(z_n \frac{\log\left(1+ \frac{z_n}{n} \right)-\log(1+0)}{\frac{z_n}{n}-0} \right) \to \exp(z \cdot 1) $$ where here we are using the definition of derivative. But if $z \in \mathbb{C}$ the logarithm is multivalued and I'm not sure that the same calculation is allowed. Is there a different way to show this for complex $z$?


Once a site has reached a certain point, tag creation is no longer really necessary. Most of the new tags created on Physics.SE are crap (synonyms, localized, metatag, etc). Looking at the number of tag blacklist requests on MSO, it seems that SO has a similar problem.  Unfortunately, sorting tags by newest doesn't quite cut it. The newest sort doesn't show all tags, just a page or two of the recent ones.  Could we get full pagination here? There are a bunch of tags that probably ought to be burninated on (the nonexistant) page 3 onwards.  I think this will greatly help tag cleanup by helping us nip bad tags in the bud.

The /tools route shows you a list of the 30 (?) newest tags on the site, including how often they've been used.  Now, this is nice information to have, and occasionally I check the route to kill off meaningless tags before they're getting used too much. However, it seems I'm only one of the very few people on Super User who do that.    Since the list only shows 30 tags, it's a little hard to analyze properly. You can't see when the tag was created and who created it. (Let's face it: There are some people who have a passion for creating meaningless tags.) Also, you have to remove a tag in that list before the next one shows up, which is a little tedious.  For example. in the above list, I had to kill ,  and  before I even saw  and .  Could moderators (and 10k users?) please get a table of the newest tags that'd allow them to see more than 30 at once, and also including the information who created the tag?  This would allow for much easier maintenance, even when you forget to do it for the last 30 days and have no way to check tags that were created, say 31 days ago.


I know these questions have been asked and I have searched for it on stackoverflow but my problem didn't get solved. I am getting error while setting actionlistener to a button but i am always getting errors:  Talk.java:25: error: <identifier> expected                 button.addActionListener(new ActionListener());                                         ^  Talk.java:25: error: illegal start of type                     button.addActionListener(new ActionListener());                                          ^   THE CODE:  import java.util.Scanner; import java.awt.*; import java.awt.event.ActionListener; import java.awt.event.ActionEvent;  import javax.swing.JFrame; import javax.swing.*; import java.io.BufferedReader; class Talk extends javax.swing.JFrame    { public  void main(String args[]) {             JFrame frame = new JFrame("LET'S TALK");             frame.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);             frame.setExtendedState(Frame.MAXIMIZED_BOTH);             JLabel textLabel=new JLabel("What's up.",SwingConstants.CENTER);             textLabel.setPreferredSize(new Dimension(530,100));             frame.getContentPane().add(textLabel, BorderLayout.CENTER);             frame.setLocationRelativeTo(null);             frame.pack();             frame.setVisible(true);             JButton button=new JButton("OK");             JPanel panel1=new JPanel();             panel1.add(button);             frame.add(panel1, BorderLayout.SOUTH);}             private class ActionListener {             button.addActionListener(new ActionListener());                     public void actionPerformed(ActionEvent e){                     final TextField tf=new TextField();                     tf.setText("welcome");                   }              } }

What is the use of anonymous classes in Java? Can we say that usage of anonymous class is one of the advantages of Java?


We knows that $sin(x)$ and $cos(x)$ are two function with value in the closed set $[-1,1]$. How can I prove that $X=({sin(n)|n\in\mathbb{N}})$ and $Y=({cos(n)|n\in\mathbb{N}})$ are or not dense in $[-1,1]$.

We know that the sine function takes it values between $[-1,1]$. So is the set $$A = \{ \sin{n} \ : \ n \in \mathbb{N}\}$$ dense in $[-1,1]$. Generally, for showing the set is dense, one proceeds, by finding out what is $\overline{A}$ of this given set. And if $\overline{A} = [-1,1]$, we are through with the proof, but i having trouble here!  Similarly can one do this with cosine function also, that is proving $B= \{ \cos{n} \ : \ n \in \mathbb{N}\}$ being dense in $[-1,1]$


I have been reading and heard Google Pixel owner get unlimited free storage, but how? How Google Pixel owner register the unlimited free storage? I want to know if is register automatically when you buy the phone, or there is some code you can enter.

Google offers Pixel-Phone customers "Unlimited Full resolution photo and video backup".  Does anyone know how Google handle this?      I can imagine 3 options - but does anyone know which one matches or how it will be handled exactly?  Three thoughts:     For instance, someone is buying the phone via the Playstore online with his google account and he wants to give it away as a gift. Does the unlock only counts for the user who bought the phone? or will it be activated for the person who activates/registers the phone the first time with a Google account? or does this always counts for any further user of the Pixel-Phone? Let's say Google Drive excludes the space-calculation for any picture/video which was taken with a Pixel-Phone?


I have a few of the problems like the one below to solve this week for homework. If someone could give me some help on this one, it would greatly help in getting me started on knowing how to solve the rest of them. Thanks for any help in advance. Love this site.     When throwing a softball directly upward from a height of $5$ ft with an initial velocity of $50$ ft/sec, the height of the softball after $t$ seconds is given by $h(t) = -16t^2+50t+5$ (until the ball hits the ground).   A) Using the limit definition of the derivative, find the velocity $h'(t)$.  B) When is $h'(t) > 0$ and when is $h'(t) < 0$?

A skydiver jumps out of a plane from a height of $2200$m. The skydiver's height, $h$ meters above the ground, can be modeled by the function $$s = 2200 - 4.9t^2$$ How fast is the skydiver falling at $t = 4$s?  If the skydiver is approaching a height of $2200$m, I reasoned that I could use the following definition to find the solution $${f(x+h)-f(x)\over h}$$ I entered the function into this definition and got stuck when I got to this$$f'(x) = \lim_{x\to 0} {2200-4.9t^2-9.8th-4.9h^2\over h}$$ Where can I go from here? Can I continue with this method or did I make a mistake a few steps back? New Solution  How does this look?


I have a java assignment that is asking for a code that tells the user to enter a point (row and column or x and y) and the program outputs all possible moves for the chess' knight.  package datastructureass1; import java.util.Scanner;  public class DataStructureAss1 {      public static void main(String[] args) {        Scanner cin = new Scanner (System.in);          int knight[][]= new int [7][7];                       System.out.println("Please enter the knight's position starting with rows followed by columns");                        int i=cin.nextInt();                              int j=cin.nextInt();                          i=i+2;                         j=j+1;                         if (i<=8&&j<=8)                             System.out.println( "{"+knight[i]+","+knight[j]+"}");                          i= i+2;                         j=j-1;                         if (i<=8&&j<=8);                             System.out.println( "{"+knight[i]+","+knight[j]+"}");                          i= i-2;                         j=j+1;                         if (i<=8&&j<=8);                             System.out.println( "{"+knight[i]+","+knight[j]+"}");                         i= i-2;                         j=j-1;                         if (i<=8&&j<=8);                             System.out.println( "{"+knight[i]+","+knight[j]+"}");                             i= i+1;                         j=j+2;                         if (i<=8&&j<=8);                             System.out.println( "{"+knight[i]+","+knight[j]+"}");                         i= i+1;                         j=j-2;                         if (i<=8&&j<=8);                             System.out.println( "{"+knight[i]+","+knight[j]+"}");                         i= i-1;                         j=j+2;                         if (i<=8&&j<=8);                             System.out.println( "{"+knight[i]+","+knight[j]+"}");                             i= i-1;                         j=j-2;                         if (i<=8&&j<=8);                             System.out.println( "{"+knight[i]+","+knight[j]+"}");      }                   }   when i run this in netbeans it gives me this kind of output:  {[I@6ac1abcf,[I@6ac1abcf}  {[I@50f6d9ca,[I@7e54864c}  {[I@6ac1abcf,[I@6ac1abcf}  {[I@5f3d285f,[I@7e54864c}  {[I@7e54864c,[I@2825a5d2}  {[I@6ac1abcf,[I@7e54864c}  {[I@7e54864c,[I@2825a5d2}   it doesnt make sense and i dont know what i did wrong in my code!

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


There is a problem with this code and I can't understand it. It seems the problem happens within the linking phase as I've googled, but in my case I think there is something wrong with my code, not in toolchains, but I just couldn't solve it after hours and hours of trying. I'd be happy if you help me correcting it. I'm using Code::Blocks, and the latest version of MinGW.  main.cpp  #include <iostream> #include <string> #include "threadsafequeue.hpp" using namespace std;  int main(){     threadsafe_queue<string> Q;     threadsafe_queue<string> X;     X.empty();     try{         string s;     }catch(empty_queue ex){         cout << ex.what() << endl;     }     return 0; }   threadsafe_queue.cpp  #include "threadsafe_queue.hpp"  template <typename T> threadsafe_queue<T>::threadsafe_queue(const threadsafe_queue& other){     std::lock_guard<std::mutex> lock(other.m);     threadsafe_queue<T>::data = other.data; }  template <typename T> void threadsafe_queue<T>::push(T new_value){     std::lock_guard<std::mutex> lock(threadsafe_queue<T>::m);     threadsafe_queue::data.push(new_value); }  template <typename T> std::shared_ptr<T> threadsafe_queue<T>::pop(){     std::lock_guard<std::mutex> lock(threadsafe_queue<T>::m);     if(data.empty()) throw empty_queue();     std::shared_ptr<T> const res(std::make_shared<T>(threadsafe_queue<T>::data.front()));     threadsafe_queue<T>::data.pop();     return res; }  template <typename T> void threadsafe_queue<T>::pop(T& value){     std::lock_guard<std::mutex> lock(threadsafe_queue::m);     if(data.empty()) throw empty_queue();     value = threadsafe_queue::data.front();     threadsafe_queue::data.pop(); }  template <typename T> bool threadsafe_queue<T>::empty(){     std::lock_guard<std::mutex> lock(threadsafe_queue<T>::m);     return threadsafe_queue<T>::data.empty(); }   threadsafe_queue.hpp  #include <exception> #include <memory> #include <mutex> #include <queue>  #ifndef THREADSAFE_QUEUE_HPP_INCLUDED #define THREADSAFE_QUEUE_HPP_INCLUDED  struct empty_queue : std::exception {     virtual const char * what() const throw()     {         return "The Queue is Empty.";     }; };  template <typename T> class threadsafe_queue { private:     std::queue<T> data;     mutable std::mutex m; public:     threadsafe_queue() {};     threadsafe_queue(const threadsafe_queue& other);      threadsafe_queue& operator= (const threadsafe_queue&) = delete;      void push(T new_value);      std::shared_ptr<T> pop();      void pop(T& value);      bool empty(); };  #endif // THREADSAFE_QUEUE_HPP_INCLUDED   And the error is :     ...\ThreadSafeQueue\main.cpp|9|undefined reference to   `threadsafe_queue::empty()'|

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


I am a Linux guy, and I have to provide support for about 15 Mac users. I need to install this OSX 10.8.x and I got the license codes all sent to me. But I can't figure out how to get whatever file on mine, so I can re-use it. How do I do that?  Do I really have to go through this whole registration info where I have to enter a credit card and everything else about me before I can get access to anything?

Is it possible to create custom image of the Mountain Lion with the certain third party applications (Chrome , Adium , Firefox) pre-installed with the operating system. This will not require me to separately download and install these software. This should be similar to installation of the iLife along with the OS installation from the DVDs which came with Macbooks.


My furnace pilot light keeps going out.  The furnace will come on and heat up to the degree set on my thermostat, then the pilot goes out and the furnace will not come back on. Could the thermostat be bad and cause the pilot light to go out? Is there anyway for me to check the problem myself?

My furnace pilot light keeps going out so I changed the thermocouple. Now the furnace will come on and heat up to the degree set on my thermostat, then the pilot light will go out and the furnace will not come back on.    Could the thermostat be bad and cause the pilot light to go out?


This is not a big deal, just a minor UI complaint that I have about the process of awarding a bounty.   Currently, whenever a user tries to award a bounty, the very first thing that happens is a notification that pops up saying "Are you sure you want to award your bounty to this answer? THIS CANNOT BE UNDONE!" As far as I can tell, this kind of confirmation dialog was first suggested in the answer here: () and it makes sense to show it sometimes, since we currently don't allow unaccepting an answer.  However, it's unnecessary in situations where the system already doesn't allow the bounty to be awarded, such as before the 24 hour wait period is up or when trying to award it to deleted answers. (Actually, another odd thing is that I can try to award a bounty on a deleted answer, even though I can't try on my own. I guess it was thought to be too obvious to require comment that you can't give a bounty to yourself, but not obvious enough that you can't award it to deleted answers?)   So, in situations like these, there should be no confirmation dialogue, since it is not possible to complete the action in the first place. The confirmation dialogue should be a step that occurs AFTER the system checks to make sure that the user is mechanically capable of awarding the bounty.

This    appears before this    Please can the order be changed, so I don't get the popup before the notice.


I am creating an entity programatically, I want to set a file in entity, I have tried following method.  $file_path = '/sites/default/files/abc123.pdf'; $values = array(       'type' => 'review',       'uid' => $user->uid,       'status' => 1,       'comment' => 0,       'promote' => 0,     );   $tenant_review_entity = entity_create('node', $values);   $tenant_review = entity_metadata_wrapper('node', $tenant_review_entity);   $tenant_review->title->set($_POST['field_tenant_review_ref']['und']['form']['title']);    // adding file here   $tenant_review->field_tenancy_document->file->set($file_path);    $tenant_review->save();   If I am adding file path then getting following error  EntityMetadataWrapperException: Invalid data value given. Be sure it matches the required data type and format. in EntityDrupalWrapper->set() (line 737 of /var/www/html/rentspeak/sites/all/modules/entity/includes/entity.wrapper.inc).   If The file attaching code commented then entity is saving properly. Please suggest me where is the mistake. Thanks.

How do you set the value of a file field when using the entity_metadata_wrapper?  I've tried doing this in code:  $file = new stdClass(); $file->uid = 1; $file->uri = $file_path; $file->filename = basename($file_path); $file->filemime = file_get_mimetype($file_path); $file->filesize = filesize($file_path); $file->status = FILE_STATUS_PERMANENT; $file->display = '1'; file_save($file); // I also tried: $file = file_save($file);  $node = array(   'type' => 'news_item',   'uid' => 1,   'status' => 1,   'comment' => 0,   'promote' => 0,   'language' => 'en', );  $entity = entity_create('node', $node);  $ewrapper = entity_metadata_wrapper('node', $entity);  $ewrapper->field_document->set((array) $file); // I also tried: $ewrapper->field_document->set($file);  $ewrapper->save(true); entity_save('node', $entity);   But I get this exception:  EntityMetadataWrapperException: Invalid data value given. Be sure it matches the required data type and format. in EntityMetadataWrapper->set() (line 122 of C:\wamp\www\drupal\sites\all\modules\entity\includes\entity.wrapper.inc).   Any help is very mych appreciated.


I'm adding a singleton logging class that everyone will use in our current project. However we're facing a problem - the singleton global object has to be destructed VERY LAST because any other object can log in their destructor. If the singleton gets destroyed first, and some other global object calls the log function, it will lead to segmentation fault as logger has been destructed. Does anyone know if it's somehow possible to destruct an object very last int he program? I think that is not possible, so does anyone know a workaround in my particular case?

Can I control the order static objects are being destructed? Is there any way to enforce my desired order? For example to specify in some way that I would like a certain object to be destroyed last, or at least after another static object?


Prove that $$\left( \frac{bc+ac+ab}{a+b+c} \right)^{a+b+c} \ge \sqrt{(bc)^a(ac)^b(ab)^c}$$   where $a,b,c>0$   My attempt:    I couldn't proceed after that.  Please help me in this regard, thanks!

Prove that $(\frac{bc+ac+ab}{a+b+c})^{a+b+c} \ge \sqrt{(bc)^a(ac)^b(ab)^c}$  I tried it to do using $AM \ge GM$ but don't know how to proceed.  Please help.


I know that I can use larger soul stones to increase the amount, but it only goes so far. How do I get more? I do not have any DLC other than Hearthfire.

I have level 100 smithing, enchanting and alchemy. I also have some nice enchanted gear, fortify smithing and alchemy.   How high should I be able to get my fortified equipment?  Currently I'm around 29% for alchemy and smithing.  How high can I get fortify smithing and fortify enchanting potions without using the console (cheating)? And how? Currently I get +147% and +32% respectively.  Is something like this possible without using the console(or photoshop)?


I understand this is a very complicated question to answer as no one really knows. However if gravity exerts an infinite force in the singularity of a black hole, then can't it travel faster than the speed of light?  I mean, wouldn't it also have to have infinite mass? I was thinking that if gravity exerts a force that eventually puts an accelerating object at terminal velocity - what if the gravity was infinite? Such as in the singularity of a black hole. It was just an abstract thought but wondered any one else's take on it.

Most of you if not everybody will agree that the stronger the gravitational pull, the faster an object will fall. For example, on a planet with 50 times the gravity of Earth, any object will hit the ground on that planet much quicker than it would on Earth. So taking all of these into the equation, does it mean that at a blackhole, an object will fall at an infinite speed because of the infinitely strong gravitational pull of the blackhole?


All is in the question, we can duplicate object with SHIFT+D but also with ALT+D, which is quite handy, because as you know every changes done on a linked duplicate object will be repeated on others linked objects ("same objects").  I've used it as example to create all the UVs of a box, all at once.. But now I would like to break it, to stop it... And I don't know how to do that...

I duplicated a few objects with Alt+D and now I want to apply some modifiers to them, however I can't, because they are multi-user objects.  I tried U > Objects but I still can't apply the modifier.  How to make multi user objects single user?


I have seen the following questions: ,  or  In all of them, the plural of in the extended form goes in the end:  One compact disk, two compact disks One automated teller machines, two automated teller machines  My question is, what about acronyms (or initialisms...) such as  One rotation per hour: 1 RPH Two rotations per hour: 2 ???  (Note that RPH is a home-made acronym.) Obviously RsPH is not an appropriate choice, but RPHs seems a bit strange (I would be fine for rotation per hours, but maybe not for rotations per hour). Any piece of advice?

For abbreviations - both acronyms and initialisms - where the last word in the abbreviation is the noun, I'm accustomed to adding an 's' with no apostrophe (e.g. ATMs), as described in the answer to this question:   But how do you pluralize abbreviations where the noun is not the last word? E.g. 'Point of Presence' (POP)  I can see how 'POPs' could read 'Point of Presences', when the intention is 'Points of Presence.'


So I have this method for the AVL Tree class that inserts a new element into the tree. I thought I had the code for it down, but it keeps wanting to throw a NullPointerException. It starts at the if condition for when integer e is less than the root data. Any ideas for what's causing this? I'm not sure at all.   Edit 1: Alright, updated it with else blocks. Not getting the error anymore, but it doesn't seem to be inserting anything into the tree. Feel like I might have missed a step here or there.   Edit 2: Alright, I realized a couple things. First, I was too stupid to realize that for my root == null I had to set the root to a new AVLNode with that element, foolish of me. I also realized that, after that, it'll want to infinitely insert into the right side of the tree, at least I think it does.   Edit 3: Turns out, it was my rebalance() method that was causing the infinite loop. That solved my problem.    public void insert(int e) {     if (root == null) {          root = new AVLNode(e);     }     else if (e < root.getData()) {         root.getLeft().insert(e);         this.rebalance();         this.setHeight();     }      else if (e > root.getData()) {         root.getRight().insert(e);         this.rebalance();         this.setHeight();     } }

What are Null Pointer Exceptions (java.lang.NullPointerException) and what causes them?  What methods/tools can be used to determine the cause so that you stop the exception from causing the program to terminate prematurely?


A short story, probably from the 60s, where rather than go through the mess of fighting an interstellar war, champions fought in an arena. I think these battles between champions happened regularly. I know this plot is almost a cliche, but what made it memorable to me was at the end the earth guy wins and he comes home disillusioned and says he could do anything he wants and no one would care, so he goes into a house and murders a young girl.

I'm trying to help a teacher friend of mine with finding a short story he read when he was a teenager and has not been able to find since.  He described the story in the following way:  In a post-war world there is a setup in which Soviet/Russian soldiers are required to fight against American soldiers in an arena in which both sides have equal setup: a forest, a lake, etc. The winner of the 'game' has the right to govern for the next several years.  It's told from a first person point of view like you're watching the Olympic games and one American soldier gets shot, but is not killed.  He falls and other bodies fall on top of him so it seems the soviets win, however their last two soldiers happen upon him and he kills them first, rendering the United States victorious.  Given that he was the only survivor he has a sort of political amnesty in which he can do no wrong legally. He returns home and he essentially suffers from a form of PTSD.  The story ends with him watching a young girl next door get off the school bus; he walks to the neighbor's home, goes inside and, in front of the girl's parents follows the girl into her room and shuts the door, leaving the reader to assume whatever happens behind the door.  He's been looking for this story in different anthologies for some time.  Can anyone help?  Thanks so much! :)


After updating from 16.10 to 17.04, Wi-FI no longer works. I use the  APPUSB150NAV2 adapter, which worked fine in 16.10.  I also tested with Ubuntu Gnome; it made no difference.  How can I get my Wi-FI working?

My Panda USB wi-fi adapter works just fine on 16.10, but when I try to connect to my wi-fi router in 17.04, GNOME network manager reports "Connection failed." I did some tinkering, and noticed that my MAC address for my wifi adapter, according to GNOME, is DIFFERENT every time I make it forget my wifi settings and try to reconnect. Any leads on a possible fix or work-around?   I'm running Ubuntu GNOME 17.04, kernel 4.10.0-19-generic, GNOME 3.24.0.


What is the difference between invoking the help using a --help key compared to invoking a "man command"?   When should I choose one over another.

Wouldn't it be more consistent if one of these always worked?


I have an IEnumerable called day.  I am trying to get all the elements from the IEnumerable and convert them to a string.  Using   string day = day.First().ToString()   I am able to get the first element.  I have tried using .ToList() and .ToArray() both do not print out the elements.

Is there a way to convert a List(of Object) to a List(of String) in c# or vb.net without iterating through all the items? (Behind the scenes iteration is fine – I just want concise code)  Update: The best way is probably just to do a new select  myList.Select(function(i) i.ToString()).ToList();   or  myList.Select(i => i.ToString()).ToList();


I was thinking in use the fundamental morphism theorem. But in that case I would need the kernel were $\langle2x-1\rangle$ is that possible?

Suppose it asks to show $\mathbb{Z}[x]/(2x-1) \cong \mathbb{Z}[\frac{1}{2}]$  Cand I do like this ? First of all elements of $\mathbb{Z}[x]/(2x-1)$ is of form $\frac{m}{2^n}+(2x-1)$ and also all elements of $\mathbb{Z}[\frac{1}{2}]$ are of form $\frac{m}{2^n}$. Now define a normal projection $\mathbb{Z}[\frac{1}{2}] \to \mathbb{Z}[x]/(2x-1)$ where $a \to a+(2x-1)$ for all $a\in \mathbb{Z}[\frac{1}{2}]$. So kernal is srt of all $a$ such that $2x-1|a \implies a=0$ so both are isomorphic.


I'm DMing a campaign and one of my players is a monk with 40ft of movement. He got hit by a slow spell reducing his speed to 20ft and was knocked prone. To get up would he have to use his full 20ft as its half his max speed or only 10ft as that's half his current speed?

Suppose my speed is normally 30 feet. I get hit with a Slow spell, reducing my speed to 15 feet, and then I get knocked prone. How many feet of movement do I need to spend in order to stand back up from prone? How many feet of movement do I have left over once I've stood up?  What if I am also hit with a Ray of Frost spell while slowed, reducing my speed to 5 feet for 1 round? Am I able to stand up at all?


I am using Ubuntu 18.04.3 LTS (Bionic Beaver) and I installed patroni using command sudo apt-get install patroni.  The version of patroni that got installed is 1.61 but I found that this version has a bug and therefore wanted to upgrade to the latest version of the patroni but through apt  So I looked here  and found that the latest stable version that I could install is Patroni 1.6.4  My question is how can I install this latest version of patroni ?  When I try to look for available versions of patroni I get the following output:  sudo apt list -a patroni Listing... Done patroni/bionic-pgdg,bionic-pgdg,now 1.6.1-1.pgdg18.04+1 all [installed] patroni/bionic,bionic 1.4.2-2ubuntu1 all

Why are packages in the official Ubuntu repositories older than the latest (upstream) versions from Debian Sid, PPAs, the authors, etc.?


I have come across an interesting property of the number 9, which some people call it casting out nines.   This is the property: If any number is divisible by 9, then you can keep adding the digits until you get a 9. For example 9117 is divisible by 9, because 9+1+1+7=18, then from the 18 we can see that 1+8=9. But 9113 is not divisible by 9, because 9+1+1+3=14, and then from the 14 we deduce 1+4=5 which is the remainder when this number, 9113, is divided by 9.  My question is: Is there a theorem that summarises this concept? If the theorem exists, then what is its proof?   Thanks in anticipation.

I don't know if this is a well-known fact, but I have observed that every number, no matter how large, that is equally divided by $9$, will equal $9$ if you add all the numbers it is made from until there is $1$ digit. A quick example of what I mean:  $9*99 = 891$ $8+9+1 = 18$ $1+8 = 9$  This works even with really long numbers like $4376331$ Why is that? This doesn't work with any other number. Similarly for $11$ and alternating digits sums.


I have a class Animal with several properties like:   class Animal(object):     def __init__(self):         self.legs = 2         self.name = 'Dog'         self.color= 'Spotted'         self.smell= 'Alot'         self.age  = 10         self.kids = 0         #many more...   I now want to print all these properties to a text file. The ugly way I'm doing it now is like:   animal=Animal() output = 'legs:%d, name:%s, color:%s, smell:%s, age:%d, kids:%d' % (animal.legs, animal.name, animal.color, animal.smell, animal.age, animal.kids,)   Is there a better Pythonic way to do this?

So what I'm looking for here is something like PHP's  function.  This is so I can debug my scripts by seeing what's the state of the object in question.


Recently I have added few favorite tags as my friend suggested and after some time, I can see a list of values next to it.  When I click on , I can count a total of 10 votes (adding up-votes and subtracting down-votes).  13 + (-2) = 11??   But in my profile summary I see   7 html × 23   I cannot get my head around how this works.

I'm a tad confused about the number that appears next to the tag score and tag in my profile. It says I'm at 202 (which would be eligible for the badge), but when I hover over it, I see the following information:    Unless math has changed recently, 31 and 158 do not add up to 202. So where did this number even come from? The only thing I can think of is that deleted posts are being included in that count, but why? Why would my questions even be included in that count?  Considering that the tag score at the left only includes your score from answers, why does the count at the right not also only include answers? Consistency here is out of whack. I like being able to hover over it to see the full details, but the number there should be 158, because my score of 1k is from those 158 answers, not from the questions or the deleted posts (I presume).  Note: This is not a caching issue since I have had no reputation changes on my account since the tag score recalculations at 03:00 UTC, at the time of taking that screenshot.


In  it was explained that the blast of the knife reaches a 2x2 area.   As the description of the spell Mirror Image makes mention of 4 targets next to each other, could it hit the actual target and make the illusions disappear?

I have two questions concerning the  spell.   If I am under the effect of mirror image and was targeted by a spell like , do I roll a 1d20 to determine whether myself or an image was targeted? It doesn't make an actual attack, but common sense suggests that casting a spell still requires a solid target which has to be determined between me and my illusory images.  The same question, but about . I googled it and found nothing but theories. Does Magic Missile hit and destroy all images at once or just one? Rules say that you can choose several targets, but according to the mirror image description you cannot target the image exclusively.


I have many individual datasets of $(x,y,z)$ coordinates. I'd like to see if the coordinates form a plane (and if they do, I'd then like to compute a unit normal to the plane). My original method was to simply fit to $z=ax+by+c$ via least-squares minimization. However, some of my data is nearly vertical in $z$ such that this breaks down. What is the best way to address this without specifically checking every dataset to see if the data forms a vertical plane?  Here is a toy dataset: coords = [3.64811 7.61531 9.05108; 3.53604 4.82801 9.05108; 3.53604 4.82801 6.34192; 3.64811 7.61531 6.34192]

I have a correlation matrix of security returns whose determinant is zero. (This is a bit surprising since the sample correlation matrix and the corresponding covariance matrix should theoretically be positive definite.)  My hypothesis is that at least one security is linearly dependent on other securities. Is there a function in R that sequentially tests each column a matrix for linear dependence?  For example, one approach would be to build up a correlation matrix one security at a time and calculate the determinant at each step. When the determinant = 0 then stop as you have identified the security who is a linear combination of other securities.  Any other techniques to identify linear dependence in such a matrix are appreciated.


I ran a script from the command line today (php, not sure that matters) which has output I wanted to watch but I had to go home before it finished and I couldn't figure out how to exit without killing the script. Normally I just close the laptop (hibernate) but it doesn't appear the script finished.  Is there some keyboard combination I can hit to exit the terminal and leave the script running? It prints a log file too so I can just check it later.

I sometimes have long running processes that I want to kick off before going home, so I create a SSH session to the server to start the process, but then I want to close my laptop and go home and later, after dinner, I want to check on the process that I started before leaving work. How can I do that with SSH? My understanding is that if you break your SSH connection you will also break your login session on the server, therefore killing the long running process.


I know that $1+2+\dots+n=\dfrac{n(n+1)}{2}$ and $1^3+2^3+\dots+n^3=\dfrac{n^2(n+1)^2}{4}$ and can show by algebraic calculation. But I am wondering if there is any logical argument or any intuitive argument to show that:     $(1+2+\dots+n)^2=1^3+2^3+\dots+n^3$   Thanks.

I recently proved that  $$\sum_{k=1}^n k^3 = \left(\sum_{k=1}^n k \right)^2$$  using mathematical induction.  I'm interested if there's an intuitive explanation, or even a combinatorial interpretation of this property. I would also like to see any other proofs.


California issues license plates in numeric order (if we turn the letters into numbers).  I have fun noticing the latest plate I have seen.  I am interested in what you can derive from a series of these observations.  I understand that sampling from $\{1,2,3...n\}$ the only useful data is the highest value you have seen.  Let's oversimplify the problem.  Assume the highest plate issued is $N_0+n*t$, $n$ in plates/day and $t$ in days.  Assume a similar number of low valued plates come off the road each day.  I don't observe a consistent number of plates each day, but it averages out.  Over a long time, the increase in highest plate seen should give a measure of $n$.  The only other data I have is how frequently I see a new highest plate.  Does that give some measure of how far my highest plate is from the highest issued?  As we are asked to cite the source of a question, I made it up.  You probably guessed.

Suppose that I observe $k=4$ tanks with serial numbers $2,6,7,14$.   What is the best estimate for the total number of tanks $n$?   I assume the observations are drawn from a discrete uniform distribution with the interval $[1,n]$. I know that for a $[0,1]$ interval the expected maximum draw $m$ for $k$ draws is  $1 - (1/(1+k))$. So I estimate $\frac {k}{k+1}$$(n-1)≈$ $m$, rearranged so $n≈$ $\frac {k+1 }{k}$$m+1$.  But the frequentist estimate from  is defined as:  $n ≈ m-1 + $$\frac {m}{k}$  I suspect there is some flaw in the way I have extrapolated from one interval to another, but I would welcome an explanation of why I have gone wrong!


I am performing few inserts and updates on my database using tool provided by app supplier. I want to compare the updated database and backup after running the tool.  But my database size is around 250GB, that takes long time to compare. Rather than full database compare I want to compare the tables which are modified after running the tool.  How can I get all the table names those are modified after specified date like 2015-04-14?  Can someone help me with this please?

I'm maintaining a database that is being shared by a few systems. Over the years a few of those systems have been deprecated and lots of the tables are actually orphaned. Is there a query I can run to find out which tables have not been used since a certain date?  Thanks.


After moving from 12.04 to 13.10 (with unity), the majority of my applications no longer have panel indicators. e.g: - xchat - sonata  xchat gets a link in the mail menu, but this is useless because it opens a new xchat instance each time it's clicked, rather than bringing up the existing one.  I understand that this is a change from 13.04 to 'tidy up' the notification area, but it's super frustrating. Is there any way to force the old behaviour so that all of my applications can have status indicators?

Unfortunately in Ubuntu 13.10 there is no tray icon and whitelisting is removed.  The older solutions do not work for me, e.g. I get the message: No such schema 'com.canonical.Unity.Panel' when I try to use the command:  gsettings set com.canonical.Unity.Panel systray-whitelist "['all']"     How can I get tray icons back (for applications that put an icon in the tray (like TrueCrypt, Pidgin, Aqualung, gnome-system-monitor and so many more) in Unity?  The most annoying thing is that the user loses control over applications which cannot themselves detect that they have no tray icon (e.g.: gnome-system-monitor, TrueCrypt...). At least Aqualung sends a message about being unable to put an icon in the system tray!


On the Wikipedia page below, it says "a non-zero non-unit element in an integral domain is said to be irreducible if it is not a product of two non-units."   On this Wolfram page it says, "An element $a$ of a ring which is nonzero, not a unit, and whose only divisors are the trivial ones."   Can someone explain the discrepancy between these two definitions of Wikipedia and Wolfram?  They are not the same definition, right? Is there actually a difference in definition of irreducible element of a general ring (i.e. no multiplicative identity, inverses, or commutativity) and that of a an integral domain?  And, if so, what is the difference(s)?  What is meant by "trivial ones", units?  I am being asked to explain how this question is different from a question asking about irreducible polynomials.  Irreducible polynomials are not a part of this question, clearly..

Edit:  I foolishly changed my example right before posting this. The following is what I meant to ask.  On the wikipedia page below, it says "a non-zero non-unit element in an integral domain is said to be irreducible if it is not a product of two non-units."   Then, on the wikipedia page below, it says "an irreducible polynomial is, roughly speaking, a non-constant polynomial that cannot be factored into the product of two non-constant polynomials."   The page then gives an example of a polynomial that is irreducible "over the rationals" (I assume it is implied that "the integers" is referring to the ring of polynomials over the field of rationals, right?)  $p(x) = x^2 + 2 = (x+\sqrt{2})(x-\sqrt{2})$  On the Wofram page below, it says "the irreducible polynomials are examples of irreducible elements."   If irreducible polynomials are a subset of irreducible elements, how is $x+\sqrt{2}$ a unit?  What can it be multiplied by to equal the multiplicative identity?  I think I have it right this time (sorry. long day)  ====================================================================  The following is the original post (for those who already responded and those looking at the corresponding responses)  On the wikipedia page below, it says "a non-zero non-unit element in an integral domain is said to be irreducible if it is not a product of two non-units."   Then, on the wikipedia page below, it says "an irreducible polynomial is, roughly speaking, a non-constant polynomial that cannot be factored into the product of two non-constant polynomials."   The page then gives an example of a polynomial that is reducible "over the integers" (I assume it is implied that "the integers" is referring to some sort of ring, right? due to the claim below)  $p(x) = x^2 + 4x + 4 = (x+2)(x+2)$  On the Wofram page below, it says "the irreducible polynomials are examples of irreducible elements."   If irreducible polynomials are a subset of irreducible elements, how is $x+2$ a unit?  What can it be multiplied by to equal the multiplicative identity?


Every Bentley, Lamborghini, and Porsche (is/are) owned by Volkswagen   I had some difficulties with this because I thought that the answer would have to be "are" because  a) There are different objects that are being listed out  b)"every" signifies multiple things so I thought that it would entail that I ought to choose "are"  But the answer key dictates that the answer is "is" and I don't understand why that is.  I was wondering if it has to do anything with the word "every"?

I am reading a book that contains the following text.      A square matrix P is said to be a permutation matrix if each row and each column of P contains a single element 1, and the remaining elements are zero.   My questions are:     why is "contains" used? why not "contain"? Since there is a "and" before "contains".   why not "zeros" for the last word in the sentence?


Calculate  $\sum_{k=1}^n (-1)^{k+1} \binom{n}{k}\frac{1}{k}$, I do not know hot get rid of that $k$, for me it is similar like  $\binom{n}{k}=\frac{k}{n} \binom{n-1}{k-1}$, do you have some idea?

I found interesting task: Calculate $$\sum_{k=1}^n (-1)^{k+1} \binom{n}{k}\frac{1}{k}$$ I have calculated some first values and I see that it is $H_n$. I found  tip that it can be solved by induction or by "integral" trick by considering $\sum_{k=1}^n(-1)^k{n\choose k}x^{k-1}$ I don't know what is that trick so I decided to solve it by induction.  Let $S_n = \sum_{k=1}^n (-1)^{k+1} \binom{n}{k}\frac{1}{k} $ $$ S_1 = 1 = H_1 \text{ ok.} $$ $$S_{n+1} =  \sum_{k=1}^{n+1} (-1)^{k+1} \binom{n+1}{k}\frac{1}{k}  = \\ -\sum_{k=0}^{n} (-1)^{k+1} \binom{n+1}{k+1}\frac{1}{k+1}$$ but I have problem with use induction assumption. $$-\sum_{k=0}^{n} (-1)^{k+1} \binom{n}{k}\frac{n+1}{(k+1)^2} = \\ -(n+1)\sum_{k=0}^{n} (-1)^{k+1} \binom{n}{k}\frac{1}{(k+1)^2}$$ but know I have $\frac{1}{(k+1)^2} $ instead of something like $\frac{1}{k}$


I am going to be in the US for 100 days. As a european i am allowed by ESTA visa to be in the US during 90 days. For these extra 10 days is it possible to do an extension or to do another application through the ESTA visa without leaving the US?

My husband and I are planning a 6 months road trip in USA and Canada. We both hold passports that allow for VWP for 90 days.   If we entered on VWP, I have read that we cannot extend beyond the 90 days granted by VWP and must leave by the 90 days. Is this true? Should we apply for a B2 visa before we leave?


Good day everyone.  As the title above, I can print out everything perfectly but the Chinese Characters alien-ed me :(   I tested a few solution which is below:  <?php  //Some Database code //header("Content-Type: text/csv; charset=UTF-8"); *TESTED*  header("Content-Type: text/csv"); header("Content-Disposition: attachment; filename=pru90th_shoutout_messages.csv");  while($row = mysqli_fetch_assoc($result)) {     outputCSV(array($row)); }  function outputCSV($data) {   $output = fopen("php://output", "w");      foreach ($data as $rows) {     //fprintf($output, chr(0xEF).chr(0xBB).chr(0xBF)); *TESTED*     fputcsv($output,$rows); } fclose($output); } ?>   but miracle doesn't work on my side.  Again, I'm using MAC Excel 2011.  Please do let me know if there is other solution, I would willing to explore anything. Thanks in advance.

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 just finished watching Fullmetal Alchemist 2003 series. I would like to read/watch the manga/Brotherhood anime now. Does anyone know at what chapter the story of FMA2003 and the story of the manga/Brotherhood anime go their separate ways?

I haven't watched Anime in many years, but recently I've had time to get back into it. I've seen that one of my favorite series, Fullmetal Alchemist, has done a series reboot.  What I'm wondering is:  Does it present a lot of deep variations (plot-wise, character-wise or otherwise), or is it just the same series with updated art?


I want to change the icons for a specific file type (*.py to be specific) on Ubuntu 18.04.  What's the simplest way to do it?  I'm using Ubuntu-mono-Dark as the icon theme.

I'm trying to change the icon for application/x-hwp files. I've added the icons to the proper places, and checked it with assoGiate (after reading ). It shows that my desired icon is associated with the file type. Nevertheless, Nautilus is still showing the old icon. How can I make Nautilus show the correct icon?


Let φ : $\mathbb{R}^n → \mathbb{R}$ be a $C^1$ function such that $∀t ∈ \mathbb{R}$ we have $φ(tx) = t^{42}φ(x)$. Prove that $∀x ∈ R^n$,   $x·∇φ(x) = 42φ(x)$.  If someone could help me out with this problem that'd be great.

Assume that $f: \mathbb{R}^2-\{0\} \rightarrow \mathbb{R}$ is continuously differentiable and $f(\alpha x) = \alpha^2f(x)$ for all $x\neq 0$ and $\alpha > 0$. Then I want to prove that $x \cdot \nabla f(x) = 2 f(x)$ when $x$ is nonzero.  I applied Mean value theorem in several variables and tried some linearity tricks but I could not prove it.


I'm planning on doing these during a lecture so the quickest method is the best for me. Any suggestions are welcome!

Does anybody know how to set the background-color of a framed element?    \begin{framed}            Let me have a background :(  \end{framed}


How do I make it so that smoke only fits a specific object like a cube or sphere so the smoke makes the shape of the object.  Let's say I have a single object of a hat and what I want to do is make the smoke in the shape of the hat.  Help

I created this Smoke domain.    Then When I added smoke, it didn't stay within the domain, it went through the hole.


I thought it doesn't include the company's matching, or does the $19.5k actually include the part that the company will match?

I realized I don't fully understand something. It almost embarrassing to admit.  In 2016 we have 18k max contribution limit for 401k. Does this mean that employee can contribute at most 18k or that total contributions made on behalf of employee should not exceed 18k (company match)  To make is simple, if you make 100k, by contributing 18% you got your limit. But if your company matches 5%, actual contributions will be 18.9k. In the above example, if one wants to maximize benefit should one contribute 18% or less?


Let $X$ and $Y$ be sets with $n$ and $m$ elements, respectively. Prove that if $X\cap Y=\emptyset$, then $X\cup Y$ has $n+m$ elements.  It's clear to me intuitively how this is true. I understand that if two sets have no elements in common, then there is no 'repetition' in the union and the number of elements of the union is the sum of the number of elements in each set. How could I formalize this? Is there a way to do it by induction? I am not sure.

I'm working through a real analysis textbook, so I don't want the full answer. I'm only looking for a  on this problem.  The book starts the proof like this: let $f$ be a bijection of $\mathbb{N}_m$ onto $A$, and let $g$ be a bijection of $\mathbb{N}_n$ onto $B$. Define $h$ on $\mathbb{N}_{m+n}$ as $h(i):=f(i)$ for $i=1, ..., m$, and $h(i):=g(i)$ for $i=m+1,...,m+n$. Show that $h$ is a bijection from $\mathbb{N}_{m+n}$ onto $A \cup B$.  Ok, so with that, I started out proving that $h$ is an injection into $A \cup B$. The usual method for this is to prove that if $h(i)=h(j)$, where $i,j=1,...,m+n$, then $i=j$. I think I proved this by looking at four cases.   $1 \leq i,j \leq m$. In this case, $h(i)=f(i)$ and $h(j)=f(j)$, so because $f$ is a bijection, we know that $f(i)=f(j)$ implies that $i=j$. $ 1 \leq i \leq m$ and $m+1 \leq j \leq m+n$. We know that $i \neq j$ (obviously), so we want to prove that in this case, $h(i) \neq h(j)$. By definition, $h(i)=f(i)$ and $h(j)=g(j-m)$. Because $f$ is a bijection into $A$ and $g$ is a bijection into $B$, and $A \cap B = \emptyset$, we know that $f(i) \neq g(j-m)$, so $h(i) \neq h(j)$. This case is identical to case 2, except that $m+1 \leq i \leq m+n$ and $1 \leq j \leq m$, so the logic is reversed.  The final case, where $m+1 \leq i,j \leq m+n$, is similar to case 1, because since $h(i)=g(i)$ and $h(j)=g(j)$, we can use the fact that $g$ is a bijection to prove that $g(i)=g(j)$ implies that $i=j$.   This is where I got stuck. I know I need to prove that $h$ is surjective, but am I on the right track for proving that it's injective? I think proving that $h$ is a surjection shouldn't be too hard, but I don't know if I'm approaching this part of the proof correctly.


When I leave wet clothes in the open air, they will get dry over time by themselves even at room temperature. I know that somehow the water becomes vaporized; it's not "disappearing". For that, it needs to get energy from its environment and probably it's getting this energy from heat. But since it is at the same temperature with the clothes or its environment, I don't understand how an energy transfer can occur. Doesn't this violate the definition of temperature, which is only defined to determine where heat will flow?   So the question can also be expressed as: How can water get heat (if not heat, what?) from its environment when there is no temperature difference so that it can evaporate?

When the sun is out after a rain, I can see what appears to be steam rising off a wooden bridge nearby. I'm pretty sure this is water turning into a gas.  However, I thought water had to reach 100 degrees C to be able to turn into a gas.  Is there an edge case, for small amounts of water perhaps, that allows it to evaporate?


For example, non-conformance is abbreviated as NC.  If I am referring to a non-conformance, I may pronounce the whole word or I may literally say the letters "NC"; in my industry, they are used interchangeably.  So if I am writing it in context, it can be "an NC" or "a NC" depending on whether I orally pronounce it as "NC" or "non-conformance".  Is there a rule that dictates whether to use "a" or "an" when written on paper?

99% of the time, I'm clear on when I should use "a" versus "an." There's one case, though, where people & references I respect disagree.  Which of the following would you precede with "a" or "an," and why?   FAQ FUBAR SCUBA   [Note: I've read the questions  and , but the rules given there don't necessarily apply here.]    [Edited to add]  Here's a shorter (and hopefully clearer) version of the question…  In written English, which is correct (and why): "a FAQ" or "an FAQ"?  Some references with differing opinions:   an: the  and  a: the Microsoft Manual of Style for Tech Publications, 3e either: the  and


I would imagine there is no limit to how small space can get. Is this correct? I am aware of planck's constant, but cannot objects be closer than Planck's constant is short?  Perhaps this question is simpler than I am making it to be. Regardless, an answer is appreciated.

On a quantum scale the smallest unit is the , which is a discrete measure.  There several question that come to mind:   Does that mean that particles can only live in a discrete grid-like structure,  i.e. have to "magically" jump from one pocket to the next? But where are they in between? Does that even give rise to the old paradox that movement as such is impossible (e.g. )? Does the same hold true  for time (i.e. that it is discrete) - with all the ensuing paradoxes? Mathematically does it mean that you have to use difference equations instead of differential equations? (And sums instead of integrals?) From the point of view of the space metric do you have to use a discrete metric (e.g. the ) instead of good old Pythagoras?   Thank you for giving me some answers and/or references where I can turn to.  Update: I just saw this call for papers - it seems to be quite a topic after all: Is Reality Digital or Analog? FQXi Essay Contest, 2011. , , . One can find some pretty amazing papers over there.


Let $K ⊂ L$ be an extension. Let $α ∈ L$ algebraic over $K$. Show that $α^2$ is algebraic over $K$.  Let $n$ be the degree of the minimal polynomial $p(x)$ of $α$ over $L$ and $m$ be the degree of the minimal polynomial $q(x)$ of $α^2$ over $L$.  Since $α^2 ∈ L(α)$, we have $L(α^2) ⊂ L(α)$, then $m\leq n$.  I have trouble understanding the last statement. How do I know that $α^2 ∈ L(α)$ and why is $L(α^2) ⊂ L(α)$

Let $E$ be an extension field of $F$. If $a \in E$ has a minimal polynomial of odd degree over $F$, show that $F(a)=F(a^2)$.  let $n$ be the degree of the minimal polynomial $p(x)$ of $a$ over $F$ and $k$ be the degree of the minimal polynomial $q(x)$ of $a^2$ over $F$.   Since $a^2 \in F(a)$, We have $F(a^2) \subset F(a)$, then $k\le n$  In order to prove the converse:  $q(a^2)=b_0+b_1a^2+b_2(a^2)^2\ldots+b_k(a^2)^k=0$   implies   $q(a)=b_0+b_1a^2+b_2a^4\ldots+b_ka^{2k}=0$ Then   $p(x)|q(x)$, because $p(x)$ is the minimal polynomial of $a$ over $F$.  If I prove that $n|2k$ we done, since $k$ is odd, we have $n|k$ and $n\le k$ and finally $n=k$.  So I almost finished the question I only need to know how to prove that $n|2k$ It should be only a detail, but I can't see, someone can help me please?  Thanks


Does the "system gain" (i.e. electrons/ADU) change when one changes the ISO of a digital camera? To put this another way is there an analog amplifier between the sensor and the ADC whose gain is programmed to change when the ISO setting is changed?

If I change the ISO settings on my camera, obviously the gain of the system is increased, amplifying the signal from the sensor. What's not clear to me is where the amplification takes place. I see several possibilities:   In the sensor, by increasing voltage or some other mechanism Via an analog amplifier outside of the sensor Digitally, after the signal has been digitized, but before storing data in the RAW file As a parameter applied solely in creating an image from RAW   If #4 is true, then you could take a 4-stop overexposed RAW picture at ISO 1600, and then in post processing produce a JPEG at ISO 100 that would be the same as if the original photo had been shot at ISO 100.  If #1 or #2 is true, then a RAW file shot at ISO 1600 would actually contain more information about shadows, and an ISO 100 RAW would contain more information about highlights.


Could anyone help me to show that $\sum {\sin(nz)\over n}$ diverges if  $Im(z)\ne 0$?  Thank you

We have to show that$\displaystyle\sum_{n=1}^\infty\frac{sin( nz)}{n}$ diverges if $Im\,(z)\neq0$  My try:$$\sin (nz) = \mathfrak{Im}(e^{nzi})$$  $$\sum_{n=1}^{\infty} \frac{\sin nz}{n} = \mathfrak{Im} \sum_{n=1}^{\infty} \frac{(e^{zi})^n}{n} = - \mathfrak{Im} \ln\left(1-e^{zi}\right). $$ Then how to proceed?


I try to add angular velocity to my GameObject with this command:  rigidbody2D.angularVelocity = Random.value * tumble;   All works, but I want center of velocity be in the center of my rigidbody, but center is outside my GameObject and looks like every time in different place. How can I set rotation center to the center of my rigidbody?  IMPORTANT: when my GameObject is stay on place (no movement) then all works fine, when I add linear movement it begin rotate around some outside center.  Thanks!

I am experiencing difficulties trying to figure out the correct multiplication order for a final transform matrix. I always get either strange movement or distorted geometry. My current model is explained below:  For a single node my multiplication order is:     L = S * R * T   where     L = local transformation matrix      S = local scale matrix      R = local rotation matrix      T = local translate matrix   For a node's world transformation:     W = P.W * L   where     W = world transformation matrix      P.W = parent world transformation matrix      L = the local transformation matrix calculated above   When rendering, for each node I calculate the matrix :      MV = Inv(C) * N.W   where     MV = the model view transformation matrix for a particular node      Inv(C) = the inverse camera transformation matrix      N.W = the node's world transformation matrix calculated above.   Finally, in the shader I have the fallowing transformation:     TVP = PRP * MV * VP   where     TVP = final transformed vertex position      PRP = perspective matrix      MV = the node's world transformation matrix calculated above      VP = untransformed vertex position.   With the current model, child nodes which have local rotation, rotate strangely when transforming the camera. Where did I go wrong with the multiplication order?