What kernel will be installed with 18.04.3 next week?

I've checked both  and  wiki pages but they are both quite outdated, still showing TBD even for events that have already happened.    If 18.04.3 point release is issued next week as , what kernel will it include for linux-generic-hwe-18.04?


undefined reference to operator<< overload

I'm writing a simple complex number C++ implementation as practice for overloading operators. One of the operators I simply cannot get past is <<. I get an undefined reference error to it whenever I try to call it.  is a gist link to my code. I am compiling it with the following:  g++ -std=c++11 main.cpp complex.cpp -Wall -Wextra -o complex   In addition to the unused parameter warning in main(), I get the following:  /tmp/cc7qVwEF.o: In function `main': main.cpp:(.text+0x1c5): undefined reference to `std::basic_ostream<char, std::char_traits<char> >& rob::operator<< <char, std::char_traits<char> >(std::basic_ostream<char, std::char_traits<char> >&, rob::Complex const&)' collect2: error: ld returned 1 exit status


I've successfully compiled tmux from source and followed instructions. Now I want to installing it, alongside man pages & bash auto completion.  I cannot find the instructions to do so.   EDIT: instructions were followed from tmux github page:   that is:  $ git clone https://github.com/tmux/tmux.git $ cd tmux $ sh autogen.sh $ ./configure && make


Search and login overlap in the new topbar

When I tried StackOverflow.com in IE 8, this is what happened to me.    The log in and search text box overlap, but when using Chrome, it looks fine So I wonder why this is happening? Is it a coding bug that results to crossbrowser issues?


Similar to this , but specific to D&D 5e, how are players meant to find out the effects of items/potions/scrolls/weapons/armor?  Say, they find a potion in some chemist's chest. It is red and smells nice. Should they perform an investigation/perception check? Or an arcana/nature check? If I tell the players specifically to do an Arcana check, then I am already hinting at the fact that this potion will have some magical effect. It could just be a natural elixir concocted by Druids to help your health regen.  Same goes for weapons. They find the legendary bow of X, which has a +3 to hit and a 10% chance of striking other enemies near the target. I describe the bow as unique, glowing, made from dragon scales and hovering on air. Would they investigate their properties? Or just I just let them fire at a wall until something happens?   Our playstyle so far has been to use active checks for a quick understanding of the item (drink a little bit of Potion as an Investigation check to find whether it heals or not, sensing magical properties of the bow with Arcana checks). When time is available, and experimentation is necessary, allow the PCs to do some creative testing and, based on their ideas, "After Y time, you realize that the bow sometimes hits several points of the wall instead of just your target".  According to the RAW, is there a specific way of checking the stats/effects of such items?


How to prevent a Sharepoint 2010 application from Globally Deploying?

I have a Sharepoint 2010 application that consists of Sharepoint application pages and donot contain any web parts. So when I deploy the wsp of the application from the central administration the application will be globally deployed. I want avoid this and deploy the application on to a particular site. How do I accomplish this?


My nikon D3100 with 18-55 lense set to manual mode. How do i set the focus to 10.5 meters as required for a landscape photo using Hyperfocus calculation. The camera has a range setting for focus but does not show a distance scale.  Thanks


Prove that there's no ordered basis $E$ in which $T{x\choose y}={0\choose y}$ can be represented as $1\ 2\choose 2\ 4$

Let $T:\mathbb{R}^2\rightarrow \mathbb{R}^2$ such that:    $$T\begin{pmatrix} x \\ y\end{pmatrix} = \begin{pmatrix}0\\ y\end{pmatrix}$$  Show that there's no ordered-basis, $E$ such that:    $$[T]_E = \begin{pmatrix}    1 & 2\\    2 & 4\\   \end{pmatrix}$$  I didn't get how should I prove it. I tried some ways but end up with nothing. I guess I'm missing something.


Regression regularization penalty center at w0 instead of 0

How do I regress with regularization penalty term lambda * (w - w0)^2 instead of lambda * w^2? Is there any package to do it?  I produced coef w0 with some old data, now I have some new data, I want to regress again and I want the new coef close to w0.


What was the skeleton under bench in Harry Potter and the Deathly Hallows - Part 2

Spoilers for Deathly Hallows     When Voldemort killed Harry and went to the train station,   who or what was the skeleton under the white bench?


How to get name associated with open HANDLE

What's the easiest way to get the filename associated with an open HANDLE in Win32?


Example of function between monoids that preserves operations but does not preserve identity

A function $f$ between monoids is a homomorphism if $f$ preserves operations and the identity. Then, there is some function between monoids that preserves operations but does not preserve the identity. I've tried to get it thinking about $(\mathbb N,+)$, $(\mathbb N\backslash\{0\} ,\times)$ and other elementary monoids, but without success. Could someone help me with some hint? Thank you!


The number $e$ is characterized in calculus as:   $$e:=\lim_{n\to\infty}\left(1+\frac1n\right)^n$$  My question is this: As $n$ heads to infinity, $1/n$ gets closer and closer to zero. So what we're really doing is to add $1$ to a number that's getting closer and closer to zero and then raising that expression to an increasingly large number.   So, the limit as $n$ moves towards infinity is $1$. Why is it $e$?


Find the units in the ring $\mathbb Z_4\times\mathbb Z_6$

It is a review problem for abstract algebra, and I'm having trouble figuring it out.     Ring $R=\mathbb Z_4\times\mathbb Z_6$, which is a commutative ring with unity $(1,1)$. Find the units in this ring.   I know how to find units when $R=Z_4$ and $R=Z_6$ separately, but I don't know when it comes to $R=Z_4$ x $Z_6$. Should I list all the elements in $R$ first?  Thanks!


the volume boot has only 5.9mb disk space remaining

I have ubuntu 12.04 and I need to clear some space for my updates. I did a procedure that a tech showed me where I purchased my computer where you go to fur and copy-paste a line beginning with dpkg and it pretty much did the rest.This time though it wont work. I think it was a one time thing. So can someone show me a procedure to fix this in basic non computer nerd language cause I'm not very computer savy? Thanx


This is my configuration: 1. Ubuntu 14.04 LAMPP server (localhost). 2. WiFi Access Point on ubuntu server. 3. Android device connected to WiFi access point.  I can access localhost from android device by typing IP address of my localhost.  How can I access just typing the name instead of IP address? (for example myserver directly in browser bar)?


How to connect Ubuntu 16.04 Workstation to Samsung Smart TV through Screen Mirroring?

Is there an equivalent Linux/Ubuntu procedure to the screen mirroring procedure described in this  for a Samsung Smart TV with Windows10?


How to create graphics for notes of vectorial calculus?

I'm kinda new in this thing of Latex's Graphics, recently I'm trying to make lecture notes of multivarible calculus, but I'd like to iunclude the geometrical perpective and you better know ain't the best drawer, so I would like to complement it with some beamer-type of presentation.   Okay, too much information..., my real problem is: I still don't know how to "recreate" this kind of graphics to include them in the notes, I had had many problems with Ticks in the past, I'd like to have other options.   Graphics such as:     or     Sure any help is welcome, thanks.


Nonsigular curve of degree $3$ in $\mathbb P^2$ over a field of characteristic $3$

I am trying to do problem $1.5.5$ from Algebraic Geometry by Robin Hartshorne. The problem states:     For every degree $d>0$, and every $p=0$ or a prime number, give the equation of a nonsingular curve of degree $d$ in $\mathbb{P^{2}}$ over a field of characteristic $p$.   I have polynomials that work for every case except for the case where $p=d=3$ .I have tried several different polynomials of degree $3,$ but they always seems to have a singular point.Any help/ hint would be greatly appreciated.


How to theoretically fit and test for t-distribution

I'm trying to test some data for the best distribution fit, and am looking to try the t-dist (all theoretically, no R computations) I think the best way to do this is to assume the distribution is true, use MLE or MoM to estimate parameters and then conduct a goodness-of-fit test. Firstly, is this an appropriate way to do it? Secondly, what is the theoretical derivation for the parameters of the t-dist (using MLE or Mom) And thirdly, how do you estimate the degrees of freedom for a t-test?  Thanks


What happens if more than one boy/girl volunteers as tribute?

The Career Tributes from Districts 1, 2, and 4 volunteer for the right to compete in the Hunger Games. What happens if more than one boy or girl volunteers to compete? Say four boys from District 1 all say at the same time "I volunteer as tribute". What happens then? Do they just have a drawing between those four?


Test if two binomial distributions are statistically different from each other

I have three groups of data, each with a binomial distribution (i.e. each group has elements that are either success or failure).  I do not have a predicted probability of success, but instead can only rely on the success rate of each as an approximation for the true success rate. I have only found this , which is close but does not seem to exactly deal with the this scenario.  To simplify down the test, let's just say that I have 2 groups (3 can be extended from this base case).   Group 1 trials: $n_1$ = 2455 Group 2 trials: $n_2$ = 2730      Group 1 success: $k_1$ = 1556 Group 2 success: $k_2$ = 1671   I don't have an expected success probability, only what I know from the samples. So my implied success rate for the two groups is:   Group 1 success rate: $p_1$ = 1556/2455 = 63.4%  Group 2 success rate: $p_2$ = 1671/2730 = 61.2%   The success rate of each of the sample is fairly close. However my sample sizes are also quite large. If I check the CDF of the binomial distribution to see how different it is from the first (where I'm assuming the first is the null test) I get a very small probability that the second could be achieved.  In Excel:     1-BINOM.DIST(1556,2455,61.2%,TRUE) = 0.012   However, this does not take into account any variance of the first result, it just assumes the first result is the test probability.  Is there a better way to test if these two samples of data are actually statistically different from one another?


When using the Template variant rule from Xanathar's Guide to Everything, do 5 foot wide Lines actually affect a 10 foot wide row of grid squares?

Xanathar's Guide to Everything has a few variant options for playing on a Grid. XGtE, Page 86:  ... Choose an intersection of squares as the point of origin of an area of effect ... ... If any part of a square is under the template, that square is included in the area of effect. ...  Diagrams 2.1 & 2.2 show this, with the Cone's origin being on the intersection. Its shadow clearly covers small sections of both squares just after the intersection. PHB, Page 205:  A line extends from its point of origin in a straight path up to its length and covers an area defined by its width.  My interpretation is that this means using templates on grids increases the average Area of Effect size notably for Cones & Lines particularly. Does that seem correct? Visual example:  Which would affect all 4 enemies labeled 1 if the caster is the one labeled 2.


How to partition harddisk for Ubuntu 18.04

I want to partition my hard disk, but I don't have any other software running(like dual booted).  And I do not know how to do it. Can you send the instructions?


I made a violin plot for the first time. But I am not sure how to interpret it. I have three categories: hard, soft, and neutral and for each of the category I have a corresponding summary statistics (pi). Can someone help understand the violin plot. Basically I expect to see that in hard category, pi would be lowest, for soft category pi would be higher than hard and for neutral pi would be the highest.  And I am not sure if I see that here. Can someone help me understand this violin plot. Help would be appreciated.


If $f$ is continuous with $f(x) = f(2x),f(1) = 3$, then what is $ \int_{-1}^{1}f(f(x))\,dx$?

If $f(x)$ is a continuous function such that $f(x) = f(2x)$ and $f(1) = 3\;,$ Then $\displaystyle \int_{-1}^{1}f(f(x))\,dx$   $\bf{My\; Try::}$ Here $-\infty <x<\infty$ and Given $f(x) = f(2x)$  So Using Recursively $$\displaystyle f(x) = f(2^1x)=f(2^2x)=..........=\lim_{n\rightarrow \infty}f\left(2^{n-1}x\right)$$   OR we can write it as $$f(x) = f\left(\frac{x}{2}\right)=f\left(\frac{x}{2^2}\right)=........=\lim_{n\rightarrow \infty}f\left(\frac{x}{2^{n-1}}\right)$$  Now How can i prove that $f(x)$ is a constant function.  Help me  Thanks


I've noticed over the past year, more speakers are using the word 'so' to preface their answer, rather than the usual 'well' or even 'uh.' Where did this originate, and why is it happening?


Can I clean install Ubuntu over top of existing Ubuntu install partition on a Windows dual-boot drive without reformatting whole drive?

I have Windows 7 and Ubuntu dual-booted on my hard drive. My Ubuntu installation became kind of messed up and I don't know how to fix it. So it would just be easier for me to just do a fresh install of Ubuntu over the existing partition. Is there a way for me to do this without reformatting the whole drive and having to reinstall Windows?


I have an array of Foo objects. How do I remove the second element of the array?  I need something similar to RemoveAt() but for a regular array.


Unable to run sudo apt update or sudo apt-get update due to hash sum mismatch

I am running Ubuntu on a VM and am trying to download some packages, but every time I run sudo apt update or sudo apt-get update, I get a hash mismatch error. On looking up posts related to this, I even reset my sources list as was mentioned, but the error persists. Is there any other solution you might recommend? Is there something wrong with the installation itself? This is what I get: E: Some index files failed to download. They have been ignored, or old ones used instead.


Are there tax benefits in the U.S. for buying a first house?

Does a mortgaged home purchase impact your federal U.S. tax return in any way?


What color are Nissa, Worldwaker's lands?

turns lands into 4/4 Elemental creatures. My question is...  what color are these tokens? Are they green, the color that the land in question produces, or are they colorless since the card doesn't specify?


How to recover data from a USB-connected hard disk that shows no partition?

Is there a possible way to recover data on my Western Digital 2TB drive?  I have tried different ways like using gparted and fdisk etc.. but nothing helped. The error I get is that it cannot find a partition table. I can create one but then it will remove all data on the disk which is not what I want.  See printscreen what gparted says.    Any solution?   I thank you.


How to test the weak solution to hyperbolic conservation law?

Consider an inviscid Burgers equation:  $u_t + u u_x = 0.$  With the initial data:  $ u(x,0) = \left\{ \begin{array}{ll}              0  \quad  & \text{if} \quad x < 0, \\[0.5em]              1  & \text{if} \quad x > 0.\end{array} \right. $  Possible weak solutions to this problem include, for example:  $ u_1(x,t) = \left\{ \begin{array}{ll}              0  \quad  & \text{if} \quad x < t/2, \\[0.5em]              1  & \text{if} \quad x > t/2.\end{array} \right. \hspace{10mm} $   $ u_2(x,t) = \left\{ \begin{array}{lll}              0  \quad  & \text{if} \quad x < 0, \\[0.5em]                      x/t & 0 < x < t,\\[0.5em]              1  & \text{if} \quad x > t.\end{array} \right. $  Every material that provides such examples states that it is easy to check that these are both solutions of our problem. I do not see how that is done.  I know how to obtain the equation:  $ \int_{0}^\infty \int_{-\infty}^\infty [ q \phi_t + f(q) \phi_x ] dx dt + \int_{-\infty}^\infty q(x,0) \phi(x,0) dx = 0,  $  But I do not see how to "test" if the weak solutions provided above satisfy this. I tried writing the solutions as Heavside functions and integrating them, but I am not sure how to handle an arbitrary test function.  I assume there are some solution I could construct that would not be the weak solution to our initial data, how to check that?


TeX Code  \documentclass{standalone} \usepackage{tikz}  \begin{document}  \begin{tikzpicture}    \coordinate (A) at (0, 0);   \coordinate (B) at (2, 3);    \node[draw,minimum width=10mm] at (A) {};   \node[draw,minimum width=10mm] at (B) {}; \end{tikzpicture}  \end{document}   How such path can be drawn using Tikz?


I think it's safe to say that Bruce Wayne (being the secret identity of Batman) is a master in numerous skills and abilities, just to name a few:   Martial Arts Intelligence Stealth & disguise Scientific/technological know-how etc.   Brilliant stuff. But is he actually certified in anything? Did he go to college/university and graduate?


I'm writing up some notes that will be displayed on an overhead projector. The standard time-derivative \dot{x} produces a dot that is hard to see. Does anyone know of a package or have a macro that produces a (nice looking) larger dot? Similarly with \ddot{x}.  At the moment, I've been supplied with some ugly code that produces an ugly output:  \def\dt#1{{\buildrel  {\hbox{\LARGE . }} \over {#1}}}    % dot-over  \def\ddt#1{{\buildrel {\hbox{\LARGE ..}} \over {#1}}}    % double dot


Trivial zeros of the Riemann Zeta function

A question that has been puzzling me for quite some time now:  Why is the value of the Riemann Zeta function equal to $0$ for every even negative number?  I assume that even negative refers to the real part of the number, while its imaginary part is $0$.  So consider $-2$ for example:  $f(-2) =  \sum_{n=1}^{\infty}\frac{1}{n^{-2}} =  \frac{1}{1^{-2}}+\frac{1}{2^{-2}}+\frac{1}{3^{-2}}+\dots =  1^2+2^2+3^2+\dots =  \infty$  What am I missing here?


Get HTML string from asp.net MVC ActionResult in controller

I am implementing an offline html to pdf printing function.  I want to get the html that would be returned by a view and save it to a file on the server side.      public JsonResult MyReportOfflinePrint(MyParameters p)     {         ActionResult res = MyReportPrintMethod(p);         using (StreamWriter sw = new StreamWriter("myreport.html")) {             sw.Write(res.GetTheHtmlString???)          }          return Json("it worked");   I could use http as a web service and call self, but since this view is already available in the same controller that seems like a waste.  I have seen questions about calling a different controller, and returning a raw string as a view, but I want to capture the html string produced by razor engine.


It is possible to filter questions by user reputation ? I.e. if you mind to solve today more difficult questions and not ordinary (i know about featured questions but it is not same i mean).  Or you just want answer today on questions for users which reputation>100, because not feel good to filter newbie info.  Say it may be implemented as minimum asker's reputation in filter, may be minimum asker rating should be not more than half of your own.  Other case - you want learn a theme, and got guru info, so you can filter by tag and by minimum answerer reputation.  .


trying to install Astromenace on my linux mint 14 cinnamon pc

so i am following this tutorial as it is the only one i can find and any that i can find are the same as this one:    but when i type in the first command i gives me this  myname@myname-System-Product-Name ~ $ sudo wget -q -O- http://archive.getdeb.net/getdeb-archive.key | apt-key add - [sudo] password for myname: ERROR: This command can only be used by root.


Move an inline tikz node vertically to align with baseline of surrounding text

I'm trying to incorporate tikz nodes within running text, but have them align nicely with the text surrounding them. My MWE is:  % !TEX program = xelatex  \documentclass{scrbook}  \usepackage{tikz}  \begin{document}  Some text \tikz \node[rectangle,rounded corners=0.5mm,text=white,fill=black!65,inner sep=2pt] {\scriptsize{}foo}; more text.  \end{document}   This produces:    I would like to shift the node down so that the baseline of "foo" aligns with the baseline of the surrounding text. There's quite a bit of information on aligning relative to other nodes, but really all I need to do is shift it down vertically by a set amount, but I can't figure out how.  What is the easiest/best way for me to shift the entire node down so that baselines align?


Why did they not know that a soul was needed for the Soul Stone?

In Avengers: Engame, Nat and Clint were the ones assigned to get the Soul Stone. However, they seem to not know how to get the Soul Stone and even get to the point where Clint doubted what the Red Skull said.   How did they not know?   Because Nebula was with them and she was there when Thanos went to Titan. She was even the one who concluded and told Quill, indirectly, that Thanos probably sacrificed Gamora in exchange for the Soul Stone, or at least that's how I understood it based on their conversation in the previous movie.   Did I miss something here? Or did I just misinterpret something?


Reinstalling Windows 8 with the existing product key

I recently purchased an ASUS laptop with Windows 8 installed. The hard disk capacity is 750 GB. I checked the C drive and could see that they have used almost 40/50 GB for installing Windows 8, including all the graphics drivers and other drivers.   I would like to format my machine and reinstall Windows 8 from scratch. I don't want to use the recovery drive or any other means. Is it possible to install only Windows 8 with the existing product key?   The rest of the software or drivers for my computer will be installed manually.


Let's say I have 200 employees with a mean wage of 34 dollars and standard deviation 17 dollars, with maximum wage \$89 and minimum wage \$13.   How do I describe the standard deviation in words in term of the wage?


Where to get the drivers that are used in the developer edition of the Dell XPS 13 7390 (Fall 2019)?

I'm trying to install a dual boot Windows 10/Ubuntu 18.04 on my XPS 7390 Developer Edition. Initially Ubuntu 18.04 was installed by Dell. Wifi worked flawlessly on this version.  Today I installed Windows and then a dual boot with the standard Ubuntu 18.04 distribution. This worked, but the Wifi-Card was not being identified in this Ubuntu version.  Now I used the Dell Recovery ISO to get back to the inital state. Wifi is working again. But I still want the dual boot. Is there any way to get the drivers that Dell put in their custom Ubuntu? While they offer windows drivers for the Killer Wifi Card on their website I can't seem to find any ubuntu drivers.   As requested by @Pilot6:  ~$ lspci -knn | grep Net -A3; rfkill list 02:00.0 Network controller [0280]: Intel Corporation Device [8086:2723] (rev 1a)     Subsystem: Bigfoot Networks, Inc. Device [1a56:1653]     Kernel driver in use: iwlwifi     Kernel modules: iwlwifi 03:00.0 PCI bridge [0604]: Intel Corporation JHL6540 Thunderbolt 3 Bridge (C step) [Alpine Ridge 4C 2016] [8086:15d3] (rev 02) 0: phy0: Wireless LAN     Soft blocked: no     Hard blocked: no 1: hci0: Bluetooth     Soft blocked: no     Hard blocked: no


So apparently I have a ghost following me now that makes really annoying noises every time I enter a new area. Ulira just tells me to take it where it wants to go, but that is NO HELP because as far as I can see, I have no way to actually get the ghost to tell me where he/she/it wants to be.   Please help me! I am tired of being haunted!


Does getting hit interupt a movement (specifically in regards to Booming Blade)?

I came across a situation where one of my PCs were fighting against a caster that had readied booming blade for if they provoked an Attack of Opportunity.  they decided to try and break the casters concentration with an attack action, but ended up missing. Being on low health they decided to risk running away without disengaging. The caster hit them and they dropped to exactly one hit point.  the dilemma is that if they moved like they are supposed to they will trigger the thunder damage and drop to 0-hit points; however they were already moving since the AOO was triggered. So the question is whether PC's have momentum or are they able to stop on a dime in complete disregard for physics because they just got stabbed?


Calculating a coordinate based on approximate distances from known locations

My goal is to calculate a position based on approximate distances from known nearby locations.  The distance observations include inherent error.  The number of known locations is often 12 or more.    Is there a approach for calculating a position that decreases the impact of the distance errors?


How to open a found file with vi? Piping 'find' output to vi

I have a file, /home/user/important.txt. To find it, I use:  find /home/user -type f -name 'important'   Then, I want to open the file in the  editor using a pipe.  How can I do this?  Something like   find /home/user -type f -name 'important' | vi


What is the maximum possible area of a triangle with perimeter 6? Which triangle has this area?

I started by listing all the possible values of the sides with regard to the Triangle Inequality. To me, there are only 2 possible triangles: 222 and 231. Finding the area of 222 is easy, but how would I find the area of 231?


Does anyone understand what is going on here.  I have the following LaTeX document:  \documentclass[fontsize=8pt,a5paper,twoside,DIV=14,BCOR=10mm,chapterprefix=off]{scrreprt}  %\usepackage[utf8]{inputenc}  \usepackage[default,regular,black]{sourceserifpro} %\usepackage[T1]{fontenc}  \title{Strange non-embedded fonts}  \begin{document}  \maketitle Test  \end{document}     When compiling on overleaf I get the following:    What is wrong with my Tex Installation?


Can I copy (myself) an app purchased through the Mac App Store to another of my licensed computers?

I have some applications purchased through the Mac App Store, and I have two Macs.  Presently, if I buy an application on my Mac mini, I just go and launch the App Store on my MacBook Air, and then download the application again from "Purchases".  And vice-versa if I bought on the Air first.  Similarly, I apply updates for each computer separately. I expect this is how most people do it.  However, this practice consumes bandwidth. For small applications, it isn't a problem.  But what about big ones?  Say, the new Xcode, or a large game?  What I'm getting at:  Is it legal and is there a way to copy an application, myself, from one of my licensed computers to another of my licensed computers?  By "licensed", I mean both of my Macs access the Mac App Store with the same iTunes account, and therefore have access to the same apps, anyway.  I'm looking at reducing Internet bandwidth consumed, not circumvent license restrictions.  Might a simple file copy of the application folder work?  Or, is something like this not supported and I just need to accept that buying apps this way will necessarily consume N * download size worth of bandwidth for each purchase and update?  Consider, with iOS devices this isn't an issue, as long as you update one device, sync to iTunes, and then sync the other devices to iTunes– they'll get the updates without re-downloading.  How to do something like this for Macs?


His degree was hard earned.     His degree was hardly earned.    Which is right?


End Regex pattern on first occurrence in multiline

Hello have have this string    <20170503-18:19:09, FIXT.1.1:BANZAI->EXEC, event> (Initiated logon request)   <20170503-18:19:09, FIX.4.4:BANZAI->EXEC, incoming> (8=FIX.4.4☺9=67☺35=A☺   34=177☺49=EXEC☺52=20170503-18:19:09.298☺56=BANZAI☺98=0☺108=30☺10=092☺)   <20170503-18:19:09, FIX.4.4:BANZAI->EXEC, event>    (Received logon) fdsfhffghgfhgjgf  177☺49=EXEC☺52=20170503-18:19:09.298☺   56=BANZAI☺98 (Received logon) more stuff after this....   I want to find if after keyword "Initiated logon request" there is a following response "Received logon" when I write my regex pattern like this to accommodate for multi-line and any character in between   Initiated logon request.*[\S\s]*Received logon    I get everything up the the last keyword in the string  result    Initiated logon request)   <20170503-18:19:09, FIX.4.4:BANZAI->EXEC, incoming> (8=FIX.4.4☺9=67☺35=A☺   34=177☺49=EXEC☺52=20170503-18:19:09.298☺56=BANZAI☺98=0☺108=30☺10=092☺)   <20170503-18:19:09, FIX.4.4:BANZAI->EXEC, event>    (Received logon) fdsfhffghgfhgjgf  177☺49=EXEC☺52=20170503-18:19:09.298☺   56=BANZAI☺98 (Received logon   what I want to do is to stop the regex when first keyword is found,    Initiated logon request)   <20170503-18:19:09, FIX.4.4:BANZAI->EXEC, incoming> (8=FIX.4.4☺9=67☺35=A☺   34=177☺49=EXEC☺52=20170503-18:19:09.298☺56=BANZAI☺98=0☺108=30☺10=092☺)   <20170503-18:19:09, FIX.4.4:BANZAI->EXEC, event>    (Received logon   Is there a way to do this thank you for the help.


What is the correspondence between the conserved canonical energy-momentum tensor, which is $$ T^{\mu\nu}_{can} := \sum_{i=1}^N\frac{\delta\mathcal{L}_{Matter}}{\delta(\partial_\mu f_i)}\partial^\nu f_i - \eta^{\mu\nu}\mathcal{L}$$ (the four conserved Noether currents corresponding to four possible spacetime translations)  where $\{f_i\}_{i=1}^N$ are the $N$ matter fields in the theory, and we assume $f_i\mapsto\alpha^\nu\partial_\nu f_i$ for translations,  and stress-energy tensor from the Einstein-Hilbert action, which is: $$ T_{\mu\nu}\equiv-\frac{2}{\sqrt{-g}}\frac{\delta\mathcal{L}_{Matter}}{\delta g^{\mu\nu}} $$   In particular, how do you get that the two are equal (are they?) for Minkowski space, for which there is no variation in the metric?


Short story, possibly a Bradbury one: adventurers find a weapon cache of dead Martian civilization, and unleash a blob

This is a short story, I think by Ray Bradbury or Sheckley.  Two (?) adventurers/archaelogists are inside of the weapon cache left by Martian civilization which was destroyed by war. Eventually they find a chamber marked "Absolute weapon" (or ultimate weapon). They fight over who will get it, and only one of them survives. He opens the lock, releasing sentient blob that eats his fallen companions and then him, as well.


What is the name of the volume delimited by two parallel planes?

How do you call the volume region delimited by two parallel planes? I know the 2-dimensional analogue is called a strip. Apologies for this sort of naive question, but I can't seem to get an answer from any popular search engine.


In SharePoint how do you get the ID value from the url of the page you are on using javascript( Jquery,ajax, Rest..),  e.g. I have the url like so: http:// ddd/mypage?ID=xx   I tried before to retrieve the full url but it didn't get the ID and its value. so I have to get the ID value directly with the get method


Do you use curly braces for additional scoping?

I mean other than using it when required for functions, classes, if, while, switch, try-catch.  I didn't know that it could be done like .  In the above link, Eli mentioned that "They use it to fold up their code in logical sections that don't fall into a function, class, loop, etc. that would usually be folded up."  What other uses are there besides those mentioned?   Is it a good idea to use curly braces to limit the scope of your variables and expand the scope only if required (working on a "need-to-access" basis)? Or is it actually silly?   How about using scopes just so that you can use the same variable names in different scopes but in the same bigger scope? Or is it a better practise to reuse the same variable (if you want to use the same variable name) and save on deallocating and allocating (I think some compilers can optimise on this?)? Or is it better to use different variable names altogether?


Suppose $\sqrt6 = \frac pq$ where $p$ and $q$ have no common factors.  $$6 = \frac {p^2}{q^2}$$  $$6p^2 = q^2$$  So $q^2$ and therefore $q$ is divisible by $6$.   $$p^2 = \frac {q^2}{6}$$  So $p^2$ and therefore $p$ is divisible by $6$.   S0, $p$ and $q$ have a common factor $6$. Contradiction.  Therefore $\sqrt6$ is irrational.  Does the proof work?


I defined a new class SafeQueue but when I import it and link it to my program, I get undefined reference error. safe_queue.h: #pragma once #include <queue> #include <mutex> #include <condition_variable> using namespace std;  template<class T> class SafeQueue {   public:     SafeQueue();     ~SafeQueue();     void enqueue(T t);     T dequeue();   private:     queue<T> q;     mutable mutex m;     condition_variable c; };  safe_queue.cc: #include <queue> #include <mutex> #include <condition_variable> #include "safe_queue.h"  using namespace std;  // A threadsafe-queue. template <class T> SafeQueue<T>::SafeQueue() : q(), m(), c() {}  template <class T> SafeQueue<T>::~SafeQueue() {}  // Add an element to the queue. template <class T> void SafeQueue<T>::enqueue(T t) {   lock_guard<mutex> lock(m);   q.push(t);   c.notify_one(); }  // Get the "front"-element. // If the queue is empty, wait till a element is avaiable. template <class T> T SafeQueue<T>::dequeue() {   unique_lock<mutex> lock(m);   while(q.empty()) {     // release lock as long as the wait and reaquire it afterwards.     c.wait(lock);   }   T val = q.front();   q.pop();   return val; }  Error: g++ ../logger/logger.o ../protos/backend.grpc.pb.o ../protos/keyvaluestore.grpc.pb.o ../protos/backend.pb.o ../protos/console.grpc.pb.o ../protos/keyvaluestore.pb.o ../protos/console.pb.o globals/globals.o grpc/backend_client.o grpc/console_client.o grpc/backend_server.o grpc/keyvaluestore_server.o grpc/console_server.o file_reader_functions/password_reader.o file_reader_functions/file_writer.o file_reader_functions/queries_writer.o pack_addrs/pack_addrs.o safe_queue/safe_queue.o master_node.o master_helper_functions/startup.o -L/usr/local/lib `pkg-config --libs protobuf grpc++` -lpthread -Wl,--no-as-needed -lgrpc++_reflection -Wl,--as-needed -ldl -lz -o master_node /usr/bin/ld: globals/globals.o: in function `__static_initialization_and_destruction_0(int, int)': globals.cc:(.text+0x185): undefined reference to `SafeQueue<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > >::SafeQueue()' /usr/bin/ld: globals.cc:(.text+0x19a): undefined reference to `SafeQueue<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > >::~SafeQueue()' /usr/bin/ld: grpc/console_server.o: in function `ConsoleServiceImpl::JoinNetwork(grpc::ServerContext*, keyvaluestore::Request const*, console::ClusterInfo*)': console_server.cc:(.text+0x428): undefined reference to `SafeQueue<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > >::enqueue(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >)' /usr/bin/ld: master_helper_functions/startup.o: in function `RunHealthChecks()': startup.cc:(.text+0x483): undefined reference to `SafeQueue<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > >::dequeue()' collect2: error: ld returned 1 exit status


Let $R$ be a commutative, unital ring and let $I$ be an ideal of $R.$ Prove that if $I$ is maximal then $R/I$ is a field.   This problem is probably trivial for most of you abstract algebra fans out there, but remember that I'm new to the field, so please don't use some next-level math that I can't understand at all. I think this problem could be solved using next-level math very quickly though.   For this problem, I know that fields are commutative, unital, and every nonzero element is a unit/invertible. Also, $I$ is maximal wrt subset, so if there is an ideal that contains $I,$ then it must be $R.$


Prove that $\displaystyle \lim_{x \to \infty} f'(x) = 0$

Prove that if $\displaystyle \lim_{x \to \infty} f(x)$ and $\displaystyle \lim_{x \to \infty} f'(x)$ are both real numbers, then $\displaystyle \lim_{x \to \infty} f'(x) = 0$.   Attempt  Intuitively this makes sense to me. Take $y = x$. This slope is constant but it increases arbitrarily, and it seems that we can't make both the slope and value of $f(x)$ to be real numbers without "flattening" out the graph. I tried first saying $\displaystyle \lim_{x \to \infty} f(x) = a$ and $\displaystyle \lim_{x \to \infty} f'(x) = b$. Then we might be able to do something with the L'Hospital's rule.


When editor does not respond to the request for withdrawal

I submitted a manuscript to a journal, but due to some issue with that I asked the Editor-in-Chief and Associate Editor to withdraw the manuscript from further consideration. Despite several emails, they are not still responding me nor ended the process.  Now, what should I do? Can I submit the manuscript to another journal?


So I may or may not have created a command block that repeatedly kills the closest player on a minecraft realm. how do I fix this problem


By what amount does the Masuda method increase the chance of breeding a Shiny?

Right now, in the daycare, I have a JPN Ditto and a SPN Eevee, and I am breeding them for hopes at a Shiny Eevee. To what amount does this change the original 1/8000 (Around there) to?


If a point (lat long) lies within any polygon of a shapefile

i checked different places to finally come up with a code which used ray casting method to check if the given lat, long was inside one of the many polygons of my shapefile. this code worked fine when i tested with a lat long inside the polygon but when when the point was not in any of polygon  it still printed TRUE  from shapely.geometry import Polygon, Point, MultiPolygon  import shapefile as shp  import matplotlib.pyplot as plt  polygon = shp.Reader("D:/New folder1/21_8_2016.shp")   polygon = polygon.shapes()    shpfilePoints = [ shape.points for shape in polygon ]  print shpfilePoints  polygons = shpfilePoints  for polygon in polygons:     poly = Polygon(polygon)     print poly   lat=15.139078 lon=120.763779  def point_in_poly(x,y,poly):      n = len(poly)     inside = True      p1x,p1y = poly[0]     for i in range(n+1):         p2x,p2y = poly[i % n]         if y > min(p1y,p2y):             if y <= max(p1y,p2y):                 if x <= max(p1x,p2x):                     if p1y != p2y:                         xints = (y-p1y)*(p2x-p1x)/(p2y-p1y)+p1x                     if p1x == p2x or x <= xints:                         inside = not inside         p1x,p1y = p2x,p2y      return inside  print point_in_poly(lon,lat,polygon)   the lat lon given in the code dont lie in any of the polygon where the following lie inside of the polygon  lat: 15.094997 lon: 120.836563


I am reading Greene's textbook Econometric Analysis where he says that, if there's multicollinearity, then:   Small changes in data lead to large swings in parameter estimates. Coefficients have high standard errors even though they're jointly significant. Coefficients have the "wrong" sign or implausible magnitudes.   I have three question:   What are the consequences for the unbiasedness and consistency of the OLS estimators in the presence of multicollinearity? Is the efficiency of the estimators reduced in the presence of multicollinearity? Do Greene's points hold (yet to a lesser extent) for slightly correlated independent variables? For example, would all three points hold (to a small extent) if the correlation between the regressors is $\rho = 0.1$, for example?


What is the solution of general relativity for our universe?

So I just finished off learning quantum mechanics and special relativity. I just realized that in general relativity, there is Einstein field equation which must be solved in order to talk about physical movements.   But I see several solutions. So is there a thing as a solution that describes our universe perfectly at astronomical scales/macroscopic level (not quantum level)?   Or do we have to solve the equation for different cases occurring in our reality?


canonical representation of three skew lines in $\mathbb{P}^3$

Consider three skew (non-intersecting) lines $L,M,N$ in $\mathbb{P}^3$. Each line is given by two equations of the form $\alpha_{i,j}^\top z = 0, \, i=1,2,3, j = 1,2$, where $z=(z_0,z_1,z_2,z_3)$ are the homogeneous coordinates of $\mathbb{P}^3$ and $\alpha_{i,j} \in \mathbb{P}^3$.  What i want is to show that up to projective equivalence the equations for the three lines can be written as (this is possible according to the hint of exercise 2.12 in Harris, Algebraic Geometry - a first course)  $L: \, z_0=z_1=0 \\ M: \, z_2=z_3 = 0 \\ N: \, z_0=z_3, \, z_1=z_2.$  Since say $L, M$ are non-intersecting, this implies that $\alpha_{i,j}$ for every $i=1,2, j=1,2$ are in general position. So they are projectively equivalent to $(1,0,0,0), (0,1,0,0),(0,0,1,0),(0,0,0,1)$. This gives us  the description that we want for $L$ and $M$. But how about $N$?  Note here that the most general result that we have is projective equivalence between two sets of 5 points in general position. In the context of the present question, i am concerned about two things:  1) The fact that the lines $L,M,N$ are skew does not imply in general that  every group of 5 points among the $\alpha_{i,j}$ will be in general position.   2) The $\alpha_{i,j}$ are six!  Question: What am i missing here? How can the above two issues be addressed?


Howto determine the size of a string give the current font in wxWidgets

Is there a way to determine the display length of a given string (in pixels) based on the currently selected font in (C++) wxWidgets?  For example if I print out the string "Speed:" and want to put 10 pixels between the ':' and the value about to follow, I need to know how long the "Speed:" string was.  Is there a way to determine this?  I can't seem to find anything in the API documentation but I may be missing something.


I wonder if there is a way to calculate the  $$S_n=\sin x + \sin 2x + … + \sin nx$$   but using only derivatives ?


ubuntu 16.04 gives "X Error of failed request: BadValue (integer parameter out of range for operation)" when running OpenGL programs

I have two two graphic card on board, one is the integrating in Intel cpu, one is the nvidia card.  I want use the integrating one to render desktop, the NV card to calculate with cuda. I switch to use the integrating one in "NVIDIA X Server settings", after I installed the "nvidia-modprobe" it's worked as i want.  but where is a issue with glx, when i run glxinfo.  name of display: :0 X Error of failed request:  BadValue (integer parameter out of range for operation) Major opcode of failed request:  154 (GLX) Minor opcode of failed request:  24 (X_GLXCreateNewContext) Value in failed request:  0x0 Serial number of failed request:  37 Current serial number in output stream:  38   In the xorg log it libglx.so in   [     3.597] (II) "glx" will be loaded by default. [     3.597] (II) LoadModule: "glx" [     3.599] (II) Loading /usr/lib/xorg/modules/extensions/libglx.so [     3.612] (II) Module glx: vendor="X.Org Foundation"   Is there a way i can get the glx runing correctly?


For field extensions $F\subsetneq K \subset F(x)$, $x$ is algebraic over $K$

Let $x$ be an element not algebraic over $F$, and $K \subset F(x)$ a subfield that strictly contains $F$. Why is $x$ algebraic over $K$?  Thanks a lot!


Asymptotic behaviour of a multiple integral on the unit hypercube

A few days ago I found an interesting limit on the "problems blackboard" of my University: $$\lim_{n\to +\infty}\int_{(0,1)^n}\frac{\sum_{j=1}^n x_j^2}{\sum_{j=1}^n x_j}d\mu = 1.$$ The correct claim, however, is: $$\lim_{n\to +\infty}\int_{(0,1)^n}\frac{\sum_{j=1}^n x_j^2}{\sum_{j=1}^n x_j}d\mu = \frac{2}{3}.$$ In fact, following @Tetis' approach we have: $$I_n = \int_{(0,1)^n}\frac{\sum_{j=1}^n y_j^2}{\sum_{j=1}^{n}y_j}d\mu = \int_{(-1/2,1/2)^n}\frac{\frac{1}{2}+\frac{2}{n}\sum_{j=1}^n x_j^2+\frac{2}{n}\sum_{j=1}^n x_j}{1+\frac{2}{n}\sum_{j=1}^n x_j}d\mu,$$ now setting $x_j=-z_j$ and summing the two integrals $$I_n = \int_{(-1/2,1/2)^n}\frac{\frac{1}{2}+\frac{2}{n}\sum_{j=1}^n x_j^2+\frac{4}{n^2}\left(\sum_{j=1}^n x_j\right)^2}{1-\frac{4}{n^2}\left(\sum_{j=1}^n x_j\right)^2}d\mu$$ follows, so: $$ I_n-\frac{2}{3}=\int_{(-1/2,1/2)^n} \left(-\frac{1}{2}+\frac{2}{n}\sum_{j=1}^n x_j^2\right)\frac{\frac{4}{n^2}\left(\sum_{j=1}^n x_j\right)^2}{1-\frac{4}{n^2}\left(\sum_{j=1}^n x_j\right)^2}d\mu < 0,$$ $$ \left| I_n-\frac{2}{3}\right|\leq\int_{\sum x_i^2\leq\frac{n}{4}}\left(\frac{1}{2}-\frac{2}{n}\sum_{j=1}^n x_j^2\right)\frac{\frac{4}{n^2}\left(\sum_{j=1}^n x_j\right)^2}{1-\frac{4}{n^2}\left(\sum_{j=1}^n x_j\right)^2}d\mu,$$ $$ \frac{2}{3}-I_n\leq \frac{n^{n/2}}{2^{n+1}} \int_{\sum x_i^2\leq 1}\left(1-\sum_{j=1}^{n}x_j^2\right)\frac{x_1^2}{1-x_1^2}d\mu.$$ The last bound, anyway, is too crude, since the RHS is $$ \Theta\left(\left(\sqrt{\frac{e\pi}{2}}\right)^n\frac{\log n}{n^{3/2}}\right).$$  My question now is: what is the asymptotic behaviour of $I_n$?  A second one is: can we prove $I_n\geq\frac{2}{3}-\frac{C}{n}$, for a suitable positive constant $C$, without the Central Limit Theorem?    UPDATE: After a few I came out with a  of my own. The challenge is now to give the first three terms of the asymptotics, and possibly a continued fraction expansion for $I_n$.


Which is correct:     A laser was used where the wavelength was 15 cm.   Or     A laser was used, where the wavelength was 15 cm.   (Note the comma before where)  More generally, do we use a comma before "where" and "in which"?   "In which" example:     X-ray diffraction uncovered an in-plane texture, in which gold preferentially aligned with sapphire.    or     X-ray diffraction uncovered an in-plane texture in which gold preferentially aligned with sapphire.


Why do I get "package not found" when trying to install jabref with apt-get?

I can find a particular application 'JabRef' at the ubuntu software centre. But whenever I type sudo apt-get install jabref in terminal, it says package not found. What's going wrong here? Do I have to capitalise the exact letters as in the application name or do I need some additional steps to make sure the terminal looks at the correct repository for the particular installer?


Finding the circles passing through two points and touching a circle

Given two points and a circle, construct a/the circle through the two points and touching the given circle.  I came across this problem in History of Numerical Analysis by H. Goldstein. I spent some time on this. I have a method of constructing it using radical axis. I am wondering if there is a more elementary construction.


Bibliography not appearing and undefined citations

I am writing my thesis and  really struggle with setting up bibliography. I read tons of similar issues here, but nothing seems to work for me.  I created bib file wth texlive and I am working with texmkaker. In preamble I have   \usepackage[backend=biber,style=authoryear,autocite=inline]{biblatex} \addbibresource{references.bib}   and   \printbibliography   under the chapters.   and an example of my bib reference   @article{tugrul2004effect,   title={The effect of weathering on pore geometry and compressive strength of selected rock types from Turkey},   author={Tuǧrul, Atiye},   journal={Engineering Geology},   volume={75},   number={3-4},   pages={215--227},   year={2004},   publisher={Elsevier} }   all the citations are undefined.   Does anyone know what I can do to get my citations right in the text and my reference list to actually appear in the text?


Probability of collecting all 5 buying 7 chocolates

I'm struggling to find where I made a mistake on the way to solving the following problem.  Problem description: A grocery sells chocolates bars. There are $5$ kinds of stickers. Each chocolate is sold with $1$ sticker of one of these $5$ kinds. The probability to find any kind of stickers in any chocolate bar is the same.   What's the probability of collecting all $5$ types of stickers if you buy $7$ chocolates at once?  My solution: since the order of chocolate bars that I've bought is irrelevant, the total number of 7-chocolate bar sets that I can buy equals   $$\left(\binom{5}{7}\right)=\binom{7+5-1}{7}=\binom{11}{7}=330$$  Now I'm solving the reverse problem: let's calculate the probability of failing to collect all $5$ kinds of stickers. To do that I need to calculate the number of 7-chocolate bar sets that have less than $5$ kinds of stickers, which means that I need sets with only $1$ kind of stickers, $2$, $3$ and $4$. Since, again, the order of chocolate bars doesn't matter, the number of such sets is   $$\left(\binom{4}{7}\right)=\binom{7+4-1}{7}=\binom{10}{7}=120$$  Finally, my answer to the initial problem should be  $P = 1 - \frac{120}{330}= 0.6363636364$  The answer key says it's $\approx 0.215$  Where's the flaw in my solution?  I appreciate any help.


How can I deal with "Low on Space" messages on my Android?

I keep getting the "Low on Space: Application data space is low. To free up" [the rest is cut off] message.  I've moved every app I can over to the SD card, cleared the cache, compacted my K9 mail cache.  Advanced Task Killer (ouch!) says I have 98M Available Memory  File Manager says I have 223M/748M (29%) free.  That's not so bad -- but I'm stuck in the no-updates scenario. The market downloads won't really start, gmail won't update, etc. I've rebooted several times, and nothing changes. Aaaargh.  What can be done, other than uninstalling everything ?


So I'm trying to render using my GPU (Intel HD Graphics 4000 1536 MB on MacOS), but every time it fails. I went to the system preferences, checked "CUDA" and it selected my graphics card (so it would seem it's supported), yet when I go to render it "fails to load the render kernel." and tells me to view the console for further information. But when I check the python console, there is absolutely nothing related to the subject—rendering hasn't even modified it.  What am I doing incorrectly? Am I wrong, and my graphics card really is incompatible with Cycles? Or is it something else?


Explain this python string operation s[:6][::-1]

I am new to python. Please anybody explain the following string operations  s="abcdefghijklmnop"   print s[:6][::-1]  #is it first calculating s[:6] and then operating the result with [::-1] ?


How can Rey and others understand BB-8 in the Force Awakens?

Spoilers regarding Rey and BB-8 from The Force Awakens below:  It seems like everyone can suddenly understand droid speak (from at least BB-8) in The Force Awakens. If I remember correctly, from the moment Rey comes in contact with BB-8, she seems to be able to comprehend the droid (more than just understanding intonation, but actually understanding specific “thoughts” the droid is communicating through bleeps and bloops).  How is this possible?   Wouldn’t a translator of some sort be needed unless there was deep familiarity between the droid/human, or only basic intonations or feelings were being communicated? (see  about understanding astromech droids, where all the answers seem to cite this sort of situation).


If $x_{n+1}\leq x_n + 1/n^2$ then $x_n$ converges

Let $x_n$ be a sequence of non-negative real numbers such that $\forall n, x_{n+1}\leq x_n+ \frac{1}{n^2}$ Prove that $x_n$ converges.  The problem is trivial whenever $x_{n}$ is an increasing sequence. In the general case I managed to prove that $(x_n)$ is bounded. It remains to prove that $(x_n)$ has only one accumulation point, but that seems difficult. Any hint is welcome.


I picked up some rootbeer extract at my local brewshop, and I've made a few batches in old soda bottles... but is it possible brew it with an alcohol content similar to that of beer?


Short story - "One man's meat is another man's poison"

I read this short story in about 1974 or 1975.  It was in a library book, definitely a hardcover collection of science fiction short stories.  Two men are marooned in space.  They gain access to an alien space station (or maybe some sort of emergency shelter).  They don't know anything about the aliens (there are none present; the station was either abandoned,  automated, or an emergency outpost).  The story is about them trying to figure out what the stuff in the station does, and whether any of it is food that they can eat.  The phrase "One man's meat is another man's poison" was used several times; it's the first time I ever encountered it (I was about 8-9 at the time).


Distinct subrings of cardinality $p$ of the field $\mathbb F_{p^2} $

This particular question was asked in masters entrance of a university for which I am preparing.  Question Let $p$ be a prime number. How many distinct subrings ( with unity) of cardinality $p$ does the field $\mathbb F_{p^2}$ have?   $0$  $1$  $p$  $p^{2} $   Unfortunately, I am unable to even start this question as such kind of questions were not done during Abstract Algebra course. So, I am unable to show any attempt. Also, this question was asked before here:  But I had some questions in proof of Answer, so I asked user who answered to supply the proof. But as he didn't supplied the proof, so I have no option other than asking it here.  Question in the answer of User who answered the question in link are : 1.why subring will always be a vector space over prime field?  2.Can you please prove it. Also, how does dimension of $F_{p^2}$ over prime field must be 2.  Also if someone wants to answer with a different approach, that also would be really appreciated.  But kindly  give a proof of a result which you are assuming.


I Tried  DELETE FROM installments WHERE EXISTS (SELECT * FROM `installments`               JOIN student               ON installments.s_id=student.s_id               WHERE installments.curr_sem=3                    AND student.bat_id=10 AND student.p_id=170 AND student.DeleteStatus=0);   but show error     #1093 - You can't specify target table 'installments' for update in FROM clause   Please help me


Having dropped game performance when running my Elgato HD60s from my laptops HDMI out port to its USB 3.0 port

Before I go into details here is my specs  CPU: Intel Core i5-9300H @ 2.40GHz  GPU: NVIDIA GeForce GTX 1650 GDDR5 @ 4GB (128-bit)  RAM: 8.00 GB (7.85 GB usable)  Storage: 133 GB free out of 500 GB  OS: Windows 10 64-bit   I'm trying to figure out why my Elgato HD60s is giving me dropped game performance. I believe the weakest part in my specs is the CPU, but according to a twitch streamer I know, he said that the Elgato system uses the GPU when ran from an HDMI signal to the USB 3.0 port on my computer, however I'm only having issues when it is ran from the HDMI output on my gaming Laptop back into the same laptop through the USB port. I'm trying to set up an adequate game recording system where preferably I can use OBS to record my games without worrying about bottlenecking my weak CPU or having to lower my settings to an unreasonable percent (I prefer at least being able to encode and record at 720p60 including having a Logitech c922 Pro stream camera plugged in). Is there a setting I can change to make the entire Elgato system work through my GPU since its the laptop's strongest resource? Or is this even possible according to my specs? Even when OBS is closed and there is not recording going on. Simply having the Elgato plugged into the HDMI port on the laptop drops the FPS Until I unplug it entirely. However when it is not plugged into the HDMI port on the laptop and its plugged into the USB 3.0 port on the laptop as if it was going to record another device (Playstation or any console device) that doesn't drop the performance of the laptop. Only when the laptop is feeding its screen to the Elgato card is when it gives a performance drop.


I am using HTMLAgilityPack to get some classes and then from the innerText of the classes I want to get a collection of a Regex matches.  My string looks like this:   somestringTest:
 EUR/USD - &quot;Expect for PRICE BREAKOUT&quot;
 Sell : 1.06809
 Target : 1.06309
 Stop Loss : 1.07309
rest of html   and my Regex looks like this  MatchCollection matches = Regex.Matches(sString, @"(.*?)");   However there is not a match. Normally in the text there should be 5 results(the string above repeats itself with slightly changes). There must be something with the special characters that I am missing but I cant seem to figure it out.  Please lend me a hand here. I know its a noobie question but its a bit tricky for me.  Thank you in advance


I have simple code:  \documentclass{article}  \usepackage{algorithm}  \usepackage{algpseudocode}  \begin{document}  \begin{algorithm}   \caption{Examples}\label{alg:Examples}   \begin{algorithmic}[1]   \State $X=45$   \State $X=45$   \State $X=45$   \State $X=45$   \State $X=45$    \end{algorithmic} \end{algorithm}          \end{document}     How to put a point after the number of the algorithm? I use chapters in report:  \documentclass[a4paper,12pt]{report}  \usepackage{algorithm}  \usepackage{algpseudocode}  \begin{document}  \chapter{Chapter 1}  \begin{equation} X_2=4 \end{equation}  \begin{algorithm}   \caption{Examples}\label{alg:Examples}   \begin{algorithmic}[1]   \State $X=45$   \State $X=45$   \State $X=45$   \State $X=45$   \State $X=45$    \end{algorithmic} \end{algorithm}  \end{document}     How to change the numbering to take into account the chapters?


Prove that the orbit of an iterated rotation of 0 (by (A)(Pi), A irrational) around a circle centered at the origin is dense in the circle.

I think the title of the question says it all. I unfortunately did not seem to conclude anything. Some ideas I had:  It is easy to show that (given $T$ is the rotation) $\{T^n(\theta)\}$ is a set of distinct points. Furthermore, given that the circle is a compact metric, it must have a limit point $x$. By continuity of the rotation function, $T^n(x)$ is a limit as well since taking $T$ of every term yields the same sequence (with only the first term removed). By induction, we have infinitely many distinct limit points $\{T^n(x)\}$.  That's all I could come up with! It was also easy to show that the orbit is infinite. I still don't seem to be able to get close to the required result however.


Let  $f: C \longrightarrow D$ be a morphism in an abelian category $\mathfrak{A}$ with kernel and cokernel both zero. How can I show that it is an isomorphism? I am not able to find it's inverse.   Let $g: C \longrightarrow D$ be a morphism in the abelian category $\mathfrak{A}$. Let $i: K \hookrightarrow C$ be the kernel of $g$. How can I prove that the induced map $\text{coker}\ i \rightarrow D$ is a monic?   I don't want to use Mitchell's embedding theorem.


"Top n% overall" label appears to be blank

The  appears to be blank for .        Code:     Not sure why that happens.


Why did the Community user delete a question?

It's regarding   It does not fit under any guidelines listed by    I agree it's a poor question but IMO it could be solved.  Any ideas why the Community user decided to delete it?


Is the boundary of the unit sphere in every normed vector space compact?

I wanted to ask whether the boundary of the unit sphere in every normed vector space is compact?  I know that this is true for simple examples, but how is it in general?


I am trying to center a listing horizontally within a page.  So far I have tried defining the following macro:  \lstnewenvironment{snippet}[1][]     {\centering \lstset{float=htpb,#1}}      {}   But it did not work.  I have read , but I would prefer a solution that does not rely in figures or tables.


find the list of all libraries has been used in a C program (.exe)

I am wondering if there is any tools, or even GCC options which one can check and find the list of all required and used libraries in a C program.There is a code and it should be check against all of its required (used) libraries and dependencies. Also I want to check whether any non-standard (user-defined) libraries has been used in the code or not.


I am facing a problem related to the shell change, when I change the shell from bash to csh and type the comand echo $SHELL, I expect the shell to print:  /bin/csh   But instead it prints:  /bin/bash   What is the reason for that? How do I print the path to the currently running shell instead?


How do I reset a lost administrative password?

I'm working on a Ubuntu system, and my client has completely forgotten his administrative password. He doesn't even remember entering one; however it is there.  I've tried the suggestions on the website, and I have been unsuccessful in deleting the password so that I can download applets required for running some files. Is there a solution?


I was messing around with pistons today, and I cam across this weird senario whhere they are not working as expected.  I took some screenshots, they are  and are in order.  I have three pistons on top of each other (A, B and C) with A on top. I have a redstone repeater aiming at a wood block that is next to A  .RXA XXXB XXXC   Where X is wood, . is wire and R is a redstone repeater.   Starting from off, if I turn power on at A, only A goes out. If I then turn on power to C, B and C go out. If I remove power to C, only C retracts. Once I remove power to A, A and B retract.   If I toggle power the other way:   If I turn power on to C, then C goes out. If I turn power on to A, only A goes out, not B. If I remove power to C, then C goes in and B goes out.  This is madness. If I remove power to A then A and B retract.   This is really odd behavior.  Can someone explain the logic behind it so I can work around it?


How many users use browser's text search within a page?

Do any significant number of users Ctrl + f windows or ⌘ + f macOS to activate browsers' text search?  I'm trying to find some usage numbers, but I can't find anything.  Background  I'm working on a page that has "hijacked" scroll events, which interferes with all native browser features that rely on scroll. This includes keyboard navigation, scrolling to anchors and page text search (and thus needs to be re-implemented, else have support dropped).  Note: As some astute commenters guessed, I am not advocating this technique. I merely encountered it, felt it a poor risk/reward (for the same reasons mentioned below) and was seeking to help quantify the downsides.


Ring of formal power series over a principal ideal domain is a unique factorisation domain

An exercise in my algebra course book asks to prove that if $R$ is a , then $R[[x]]$ is a , where $R[[x]]$ is the ring of formal power series over $R$. After some failed attempts at  proving the  I visited Wikipedia, which :     If $R$ is Noetherian, then so is $R[[x]]$; this is a version of the Hilbert basis theorem.   This is very useful, as $R$ is a PID and hence Noetherian. Unfortunately we only saw (without proof) Hilbert's basis theorem in the form     If $R$ is Noetherian, then so is $R[x]$.   I'm not sure how to conclude the Noetherianity of $R[[x]]$ from this. I know that $R[x]$ is a UFD because $R$ is (we saw this without proof), and have been trying to conclude the ACC in $R[[x]]$ from the ACC in $R[x]$, without success. I can prove the ACC if $R$ is a field, because then every $a_kx^k+a_{k+1}x^{k+1}+\cdots$ with $a_k\neq0$ is associate with $x^k$, hence every ideal is of the form $(x^k)$. (In fact this readily proves that $R[[x]]$ is a UFD.) If $R$ is not a field, say it has some non-invertible element $r$, then there are many more ideals such as $(r)$ or $(r+x)$.   I'm also facing difficulties at identifying the irreducible elements of $R[[x]]$. (I wish to prove that they are all primes in order to conclude the uniqueness of factorisation.) I have figured that they either take the form $ux+Px^2$ for some unit $u\in R^\times$ and some $P\in R[[x]]$ or have a non-zero constant term which is not invertible in $R$. The elements of the form $ux+Px^2$ are indeed primes, the difficulty lies in those with non-zero constant term.  Any hints at proving $R[[x]]$ is a UFD?


If the limit does not converge, can the sum? Or, how could the sum converge?

Alright, I thought I had seen everything but last night I saw this identity (`twas attributed to Ramanujan), $$ 1 + 2 + 3 + 4 + \cdots = -\frac{1}{12} $$ Then I saw a proof that was seemingly correct. So alright, I believe it, hey it is no crazier than having infinities of different sizes and I finally have some closure with that fact. But then, I recalled the benchmark induction proof everyone learns, $$ \sum_{i=1}^{n} i = \frac{n(n+1)}{2} $$ Then kicks in the remains of all those calculus courses I once took, making me thing that, hey wait! We have this, $$ \lim_{n\rightarrow\infty} \frac{n(n+1)}{2} = \infty $$ I think in this case we said the limit does not exist or the function diverges (correct me if I am wrong!) But... but... according to the identity above, $$ \sum_{i=1}^{n=\infty} i = -\frac{1}{12} $$ But then shouldn't, $$ \lim_{n\rightarrow\infty} \frac{n(n+1)}{2} \stackrel{?}{=} -\frac{1}{12} $$ So what I am seeing here is that even if the limit does not converge, the sum does. Also, a long time ago I remember being told that the sum of two positive integers is always positive. Furthermore, addition is suppose to be closed under integers right? Here we not only have a negative number as a result of the sum of positive integers but a negative non-integer at that.


Compatibility for ASUS ZenBook Pro UX550VE

I'm looking at buying a new laptop and I want to run Linux full time. I was looking at  and I wanted to know if it's hardware would be compatible and if the finger print sensor would work.


How do I print text in colour? (Python 3)

print("this text is blue")  How could I make the text blue? I have: print('\033[94m' + "this text is blue")  and print("\033[94mthistextisblue")  However, nothing has worked so far.


Trying to figure out current age based on birthday and current date down to the day

I am designing a practice visual c# program that has you pick your birth date from a dateTimePicker and comparing it to the current date to display in a textBox what your current age is.   I would like to factor in which day of the month you picked to refine the age result rather than just assuming you're a certain age because you were born in that particular month.   This is what I have so far:   public void button1_Click(object sender, EventArgs e)         {              var birthdayYear = dateTimePicker1.Value.Year;             var birthdayMonth = dateTimePicker1.Value.Month;             var birthdayDay = dateTimePicker1.Value.Day;             var currentYear = DateTime.Now.Year;             var currentMonth = DateTime.Now.Month;             var currentDay = DateTime.Now.Day;              int currentAge = DateTime.Now.Year - dateTimePicker1.Value.Year;              if (birthdayMonth >= currentMonth)             {                  currentAge--;              }               string currentResult = Convert.ToString(currentAge);              ageResult.Text = currentResult; }


I was trying to recompile and rebuild libevent2 source from oneiric on my natty server and I had a small error with gpg not being able to check signature  # dpkg-source -x libevent_2.0.12-stable-1.dsc gpgv: Signature made Fri Jun 17 07:12:50 2011 PDT using DSA key ID 7ADF9466 gpgv: Can't check signature: public key not found dpkg-source: warning: failed to verify signature on ./libevent_2.0.12-stable-1.dsc   Any idea how to fix this warning?


I tried using $\liminf_{n\to\infty} \frac{a_{n+1}}{a_n} \leq \liminf_{n\to\infty} \sqrt[n]{a_n} \leq \limsup_{n\to\infty} \sqrt[n]{a_n} \leq \limsup_{n\to\infty} \frac{a_{n+1}}{a_n}$ for $a_n\geq 0$.  So i started like this:  $$\frac{\frac{n+1}{\sqrt[n+1]{(n+1)!}}}{\frac{n}{\sqrt[n]{n!}}}=\frac{(n+1)\cdot \sqrt[n]{n!}}{\sqrt[n+1]{(n+1)!}\cdot n}=\frac{(n+1)\cdot \sqrt[n]{n!}}{\sqrt[n]{n!(n+1)}\cdot \sqrt{n!(n+1)}\cdot n}=\frac{(n+1)\cdot \sqrt[n]{n!}}{\sqrt[n]{n!}\cdot \sqrt[n]{n+1}\cdot \sqrt{n!}\cdot \sqrt{n+1}\cdot n}=\frac{n+1}{\sqrt[n]{n+1}\cdot \sqrt{n!}\cdot \sqrt{n+1}\cdot n}$$ I don't see how this would help me - any ideas?


subject-verb agreement, which sentence is correct?

Which is correct and why? Thank you  "Every male and female voter who holds the Tunisian nationality"  "Every male and female voter who hold the Tunisian nationality"


LaTeX traditional Chinese doesn't support for some letter like ‘爲’

I want to print out some traditional Chinese phrase “因爲所以”, but the letter “爲” is missing, what can I do? Linux with pdflatex. %!TeX program = pdfLaTeX \documentclass{article} \usepackage{CJKutf8} \begin{document}  \begin{CJK*}{UTF8}{bsmi} 因爲所以，我愛中華 \end{CJK*}  \begin{CJK*}{UTF8}{bkai} 因爲所以，我愛中華 \end{CJK*}  \begin{CJK*}{UTF8}{gbsn} 因爲所以，我愛中華 \end{CJK*}  \begin{CJK*}{UTF8}{gkai} 因爲所以，我愛中華 \end{CJK*}  \end{document}


How to launch application as root from Unity Launcher?

Mainly I am looking for a way to pin an application to the Unity launch bar, and run it as root.  Currently, even if I start the application with sudo, and pin it after it starts, it will start as current user next time.  Sad, but there is no context menu option "run as ...".  Update: I switched to gnome3 and now I'm happy, I'm missing only the search.


Gamerules in Minecraft "Unknown Command"

I'm a newbie to Minecraft, and not a computer whiz, so I fully expect I'm going something wrong here.   I've been trying to use the keepInventory cheat in Minecraft but it always says "Unknown Command" and no options come up when I put in /gamerules (all that comes up is /gamemode). I've been having a streak of getting killed with some awesome stuff in my inventory and I desperately want to keep this from happening again!   I have cheats enabled. Is there something I'm missing? How so I solve this?


You have the sequence $(x_{n})_{n\in\mathbb{N}}$, so that for every $n \in \mathbb{N}$, you have to  $$x_ {n}:= \ln\frac{n + 1}{n}$$  Find an explicit formula for the partial sums of the series generated by $(x_{n})_{n \in\mathbb{N}}$ and determine if the series converges.  My development I'm supposed to find a formula that generalizes the sum, so what I did is \begin{align*} S_{n}&=a_{1}+a_{2}+a_{3}+\cdot+a_{n-1}+a_{n}\\&=S_{n-1}+a_{n} \end{align*} thus, \begin{align*} a_{n}&=S_{n}-S_{n-1}\\&=\ln\frac{n+1}{n}-\ln\frac{n}{n-1}\\&=\ln\frac{(n+1)(n-1)}{n^{2}} \end{align*} and you should determine if $ \sum\limits_{n=2}^{\infty}\ln\dfrac{(n-1)(n + 1)}{n ^ {2}} $ is convergent, right?


How to extract users input and check if it matches the pre-made username and password

I am working on a JPanel that has a username textbox and a password textbox. I felt like the code i have should check if the input equals the preset user and pass but it keeps saying I am wrong. Could someone please help fix this. Also, do not just link another question I have searched for hours upon hours and i cannot seem to get this to work. Furthermore, i would like when the continue button is pressed and inputs are right for a new JFrame to come up and dispose of this panel(totally optional). Please consider I am new to programming so there might be stuff below that can be simplified or just unnecessary.  import java.awt.event.ActionEvent; import java.awt.event.ActionListener; import javax.swing.*; import java.awt.*; import java.util.Scanner;    public class EnterButtonListener implements ActionListener {   String USERNAME = "user";  String PASSWORD = "pass"; String userText, passwordText;   public JFrame authFrame;  public void actionPerformed(ActionEvent arg0) {     JFrame authFrame = new JFrame();     authFrame.setSize(400, 300);     authFrame.setLocationRelativeTo(null);     authFrame.setDefaultCloseOperation(authFrame.DISPOSE_ON_CLOSE);      JPanel panel = new JPanel();     authFrame.add(panel);     placeComponents(panel);      authFrame.setVisible(true); //make new JFrame appear  }  public void placeComponents(JPanel panel) {  panel.setLayout(null);  JLabel atlasIcon = new JLabel(); atlasIcon.setIcon(new ImageIcon("/users/mfyhr/Pictures/Atlas2.png")); atlasIcon.setBounds(50, 5, 400, 100); panel.add(atlasIcon);  JLabel authLabel = new JLabel("Authentication Required"); authLabel.setBounds(90, 85, 400, 25); authLabel.setFont(new Font("Bank Gothic", Font.TRUETYPE_FONT, 16)); panel.add(authLabel);  JLabel infoLabel = new JLabel("Please enter your credentials to continue."); infoLabel.setBounds(27, 112, 400, 25); infoLabel.setFont(new Font("Bank Gothic", Font.TRUETYPE_FONT, 14)); panel.add(infoLabel);  JLabel userLabel = new JLabel("Username"); userLabel.setBounds(80, 150, 100, 25); userLabel.setFont(new Font("Bank Gothic", Font.TRUETYPE_FONT, 12)); panel.add(userLabel);  JTextField userText = new JTextField(20); userText.setBounds(170, 150, 150, 25); userText.setFont(new Font("Bank Gothic", Font.TRUETYPE_FONT, 12)); panel.add(userText);  JLabel passwordLabel = new JLabel("Password"); passwordLabel.setBounds(80, 180, 100, 25); passwordLabel.setFont(new Font("Bank Gothic", Font.TRUETYPE_FONT, 12)); panel.add(passwordLabel);  JPasswordField passwordText = new JPasswordField(20); passwordText.setBounds(170, 180, 150, 25); passwordText.setFont(new Font("Bank Gothic", Font.TRUETYPE_FONT, 12)); panel.add(passwordText);  JButton continueButton = new JButton("Continue"); continueButton.setBounds(185, 223, 85, 33); continueButton.setFont(new Font("Bank Gothic", Font.TRUETYPE_FONT, 12)); panel.add(continueButton);  JButton cancelButton = new JButton("Cancel"); cancelButton.setBounds(290, 223, 85, 33); cancelButton.setFont(new Font("Bank Gothic", Font.TRUETYPE_FONT, 12)); panel.add(cancelButton);  final String username = userText.getText(); final String password = passwordText.getText();  continueButton.addActionListener(new ActionListener() {   public void actionPerformed(ActionEvent ae)   {     if ((username == USERNAME) & (password == PASSWORD)) { JOptionPane.showMessageDialog(null,"Access Granted"); } else { JOptionPane.showMessageDialog(null,"Access Denied"); }   } });        //continueButton.addActionListener(new ActionListener(){  //public void actionPerformed(ActionEvent ae)  //{   //check user and password textboxes   //if both = myuser and pass  //hide Menu and close enterbuttonlistener  //open new JFrame  //   }   //ActionListener continueButtonListener = new ContinueButtonListener();  //continueButton.addActionListener(continueButtonListener);   //ActionListener cancelButtonListener = new CancelButtonListener();  //cancelButton.addActionListener(cancelButtonListener);    }  }


How to isolate or separate mesh from duplicate?

I duplicated a mesh and I want to make it a different object than the original, how do you do that?


Expression for the sigma function in terms of $d^2$.

I am having trouble deciding on how to proceed with this problem:  Find an expression for $\Sigma_{d\mid n} d^2$ in terms of the prime decomposition $n=p_{1}^{\alpha_1}*p_{2}^{\alpha_2}*...*p_{t}^{\alpha_t}$ of n


What makes the inside of a shape the inside?

A question occurred to me when browsing SE this evening, just curious.  What specifies the inside of a 3D construct? If I have a hollow sphere, what's to say that the world isn't the inside, and the center of the sphere isn't the outside. Picture the Asylum in the Hitchhiker's Guide to the Galaxy series, if you have read that.  Additionally, if the inside of a 3D object is defined as what is smaller than the outside, what happens when there is a a sphere with a volume equivalent to 51% of the universe?


Why am I getting "Permission denied: make_sock: could not bind to address" when starting Apache2?

I can stop it using  /etc/init.d/apache2 stop   But when I want to start it again using:  /etc/init.d/apache2 start   I get this error:  Starting web server apache2                                                  /usr/sbin/apache2ctl: 87: ulimit: error setting limit (Operation not permitted) apache2: Could not reliably determine the server's fully qualified domain name, using 127.0.1.1 for ServerName (13)Permission denied: make_sock: could not bind to address [::]:80 (13)Permission denied: make_sock: could not bind to address 0.0.0.0:80 no listening sockets available, shutting down Unable to open logs Action 'start' failed. The Apache error log may have more information.                                                                          [fail]


WP - Best way to store theme colors to use in SASS/SCSS, JSX (blocks) and PHP

I want to have a way to change theme colors once and use them in SCSS, JSX and PHP. Right now I have the theme colors in my variables.scss like: $theme-colors: (   base: #fff,   primary: #5bb57a,   secondary: #f39708,   tertiary: #ed7aad, );  Now, I want to mainly use it in combination with JSX to create custom blocks and access the colors as an object in the block editor. (to use it with an color pallet and to store the object key to an attribute) How can I change the colors once and access them cross language?


I am doing some self-study on $\mathbb{Z}$-modules and the notes I am following propose the following problem:  Let $f : \mathbb{Z}^2 \rightarrow \mathbb{Z}^2$ be defined as $f((x; y)) = (28x + 38y; 12x + 16y)$. Find the index of $\text{Im} (f)$ in $\mathbb{Z}^2$ and describe $\mathbb{Z}^2/\text{Im} (f)$.  I am not sure where to begin - can anyone help me?


What is the phase (state of matter) of a single particle?

Compressing a gas (or reducing its temperature) can form "agglomerations" in the form of liquid drops and solid grains.  But if there's only one particle in the system, can it be assigned with a phase (based on the given temperature and pressure), or is phase meaningless (i.e. arbitrary) in this case? In particular, in colloids of nanoparticles, is there any purpose in specifying the phase of the nanoparticles in the colloid?


My partition table is facing limitations; having problems creating more partitions

I first noticed an issue when trying to install Linux Mint 14 as a third OS alongside Ubuntu 12.10 and Windows 7 - I was unable to create another partition to install Mint to.  Poking around, I realised that I had reached the limit of primary partitions: (from left to right of the table) 1) a ~100 MB primary partition that I meant to use for storing Grub files but never got down to, 2) a 25 GB extended partition, with the entire partition containing an ext4 Ubuntu partition, 3) a ~513 GB partition containing Windows 7, 4) some ~50 GB of unallocated space, and finally 5) a 4 GB swap partition.   I decided to wipe off the first ~100 MB partition, which I didn't need anyway. This brought me to a dilemma, however: as Ubuntu, during initial installation, had created an extended partition for itself, which meant that I could not create any more. Having an extended partition for Ubuntu is virtually useless as there is only enough space to contain Ubuntu itself, and the benefits of extended are worthless here. And if I go ahead and install Mint now, I would face the same issue of too many primary partitions in the future should I want to create any more.  What I'd really like to do is this: convert the current extended partition into a normal primary partition, and create a new extended partition in the unallocated space for all future partitions. Is this possible, and if so how? Thanks in advance!


Reference books for classical mechanics with good number of solved examples

I am looking for some classical mechanics reference book with a good number of solved problems.


Using Wilcoxon Ranksum text with Equal sample medians

We have two independent samples, with skewed distribution from two different populations x, and y. When we compute the summary for these numeric vectors, we get following output,  summary(x)  Min. 1st Qu.  Median    Mean 3rd Qu.    Max.  1.000   1.000   1.000   2.219   3.000 116.000  length(x)=25312 summary(y)  Min. 1st Qu.  Median    Mean 3rd Qu.    Max.  1.000   1.000   1.000   1.129   1.000  19.000  length(y)=49832   As seen, they have equal sample medians with this data. But the intuition is that median for population1(from which sample x is taken) should be greater than median for population2(from which sample y is taken). Though sample medians are same, will it be worthwhile running Wilcoxon Ranksum test for this example? And, can I also get help with the syntax for one-sided Wilcoxon(in R). To be more precise, when we write   wilcox.test(x,y,alternative="greater",paired = FALSE)   Does this mean that median of x is greater than median of y or the other way around? Help is appreciated.


Consider the following simplified code.   \documentclass[pstricks,border=2cm]{standalone}  \usepackage{pst-eucl} \psset{saveNodeCoors}  %\def\xy#1{!\psGetNodeCenter{#1} #1.x #1.y}% cannot  be reflected! \def\xy#1{!N-#1.x N-#1.y}  \begin{document} \begin{pspicture}[showgrid](-3,-1)(3,3)     \pstGeonode         (2,0){A}         (2,2){B}     \nodexn{.25(A)+.25(B)+(0,2.5)}{C'}     \pstGeonode(C'){C}     \def\common{\psline(\xy{A})(\xy{B})(\xy{C})}%     \pscustom     {         \common         \reversepath         \scale{-1 1}         \common         \closepath     } \end{pspicture} \end{document}     Why can't the abscissa and ordinate obtained from \psGetNodeCenter be reflected?


Email application with notifications only for specified contacts (standard SMTP/POP3/IMAP)

I have a lot of mail traffic on my phone. But I want to be notified only for mail from certain contacts like my family, colleagues/boss, critical automated systems or at least any contact in my phone contact list (with email typed in).  Are there such applications which can access email on my personal/corporate server? Standard IMAP (or at least POP3) + SMTP, not some proprietary protocols like Exchange/Gmail.


How can I (easily) take a string such as "sin(x)*x^2" which might be entered by a user at runtime and produce a Python function that could be evaluated for any value of x?


What is an example of pairwise independent random variables which are not independent?

I've just read in a stochastics textbook:     Let $(\Omega, P)$ be a discrete probability space.      (a) The events $A_i \subseteq \Omega, i=1,2, \dots$ are called independent, if   $$P(A_{i_1} \cap A_{i_2} \cap \dots \cap A_{i_k}) = P(A_{i_1}) \cdot \dots \cdot A_{i_k}$$   for all finite sets $\{i_1, \dots, i_k\} \subsetneq \{1,2, \dots\}$ and all $k \geq 2$.      (b) The events $A_i \subseteq \Omega, i=1,2,\dots$ are called pairwise independent, if   $$P(A_{i_1} \cap A_{i_2}) = P(A_{i_1}) \cdot P(A_{i_2})$$   for all pairs $\{i_1, i_2\} \subsetneq \{1,2,\dots\}$.   After these two definitions it states that pairwise independent events are not always independent.  Do you have an example?


When to use One Hot Encoding vs LabelEncoder vs DictVectorizor?

I have been building models with categorical data for a while now and when in this situation I basically default to using scikit-learn's LabelEncoder function to transform this data prior to building a model.  I understand the difference between OHE, LabelEncoder and DictVectorizor in terms of what they are doing to the data, but what is not clear to me is when you might choose to employ one technique over another.    Are there certain algorithms or situations in which one has advantages/disadvantages with respect to the others?


Why is that when I open up my file in blender, the reference picture is gone

When you are using a reference picture in blender, do you have to keep it? Do the pictures have to stay in your computer? I sometimes delete my reference images, because I'm on my mother's computer and any file I download has to go away. When opening my blender file the pictures are gone. How can I get my reference images to stay in my blender file even if the original file is deleted?


Transpose inverse automorphism is not inner

Consider the transpose inverse automorphism on $GL_n(\mathbb F)$ where $n\geq2$ and $|\mathbb F|>2$. (i.e. $\mathbb F$ is a field, possibly infinite, with three or more elements). I want to show this automorphism is not inner. I was told to consider $\det(BAB^{-1}) = \det(A)$ and $\det(\,^TA^{-1})=\det(A)^{-1}$ and derive a contradiction.  However, in some fields (where the result holds) I fail to see the contradiction. What about $\mathbb F_3$? An element of $GL_2(\mathbb F_3)$ either has determinant $1$ or $2$, both of which are their own multiplicative inverses in $\mathbb F_3$. I'm not sure if my knowledge of fields and determinants is flawed or the hint is.


ord$(h)|\max\{\text{ord}(g)|g\in G\}$ for all $h\in G$.

Let $G$ be a finite abelian group and $n:=\max\{\text{ord}(g)|g\in G\}$. Now I have to proof that ord$(h)|n$ for all $h\in G$.  My idea was:  Let $g\in G$ with ord$(g)=m<n$. Then because of the euclidean divsion in $\mathbb{Z}$ one can write $n=km+r$ for $k,r\in\mathbb{Z}$ and $r<m$. So what I have to show now is $g^n = g^m = e$. From that follows $m|n$ by the definition of ord, right?  So this gives me $$g^n=g^{km+r}=g^{km}g^r=(g^m)^kg^r=e^kg^r=g^r$$  But from here on I dont know where to go next.


Gerunds - Should they be a word class of their own?

I'm a bit astonished about the long discussions in the post How can I prove a word is a noun? I admit that there a certain problems, especially with gerunds.   Smoking cigarettes is unhealty.   In this example, containing a gerund with an object, it is indeed a bit difficult to say to which word class "smoking" belongs. Is it a noun or a verb?  Traditionally the gerund is seen as a verb form with a double nature. It can behave as a noun and as a verb.  I think it would be practical to see the gerund also as a special word class, a noun-verb thing. In this way we could avoid a lot of problems that arise about the word class noun when we come across gerunds with objects.  My question: Would it be practical to see gerunds as a word class of its own?


I need some help on how to make a camera separately for a phone model step by step. Like for example: a Samsung galaxy s8 camera.  And also just one more question: How do you put a phone screen image on the phone model? I just started blender.


how do make an Archimedean spiral of words decreasing in font size every 3 characters?

I am attempting to do a logo where the phrase starts at the top of a spiral and continues throughout the spiral decreasing in size until the very middle of the spiral.    Tried the Spiral tool but not close enough and manually decreased font every three characters but the spiral did not continue to the very middle.  I think i need to use an Archimedean spiral?


In episode 4 of season 7 Daenerys with Drogon attacks some of the Lannister soldiers, but then goes on the burn the whole supply line. This may make sense if you expect to lose the batte and you want to destroy your enemy's supplies. However, I think she was fairly confident she would win, so why not save the grain and take it for her own army?   Alternatively, she could have distributed it to the commonfolk and gain major points. Given that she wants the people to believe in her, which is why she did not attack the castles with her dragons, why burn food when winter has arrived? The people will probably not be happy about that.


What is the difference between the terms smooth, analytical and continuous?

I saw the following (“roughly speaking”, like the author says) definition of a Lie group in ‘Group theory in Physics’, by Wu-Ki Tung:  “Roughly speaking, a Lie group is an infinite group whose elements can be parametrized smoothly and analytically.” After this, I was asking myself if I really already know the difference between these terms.  Because, what I know about 1 - analytic: if we say that a function is analytic at a point it means that its derivative is defined at this point and at the points of its neighborhood; 2 – continuous: a function is continuous at a point if you can write a neighborhood of this point where this function is still defined (and this is why those three conditions we learn in Calculus, including that one with the limit); 3 – smooth: I am not sure, but I think it is related to the differentiability of the function.  I think this may be a silly question, but I would thank you for answering


Steam will not run. Every time I try to start it it immediately crashes. I tried to launch it from the terminal and I got this message. Can anyone help?  caden@Ubuntu-16-Machine:~$ steam Running Steam on ubuntu 16.10 64-bit STEAM_RUNTIME is enabled automatically /bin/bash: /home/caden/.local/share/Steam/ubuntu12_32/steam-runtime/amd64/lib/x86_64-linux-gnu/libtinfo.so.5: no version information available (required by /bin/bash) grep: symbol lookup error: grep: undefined symbol: pcre_jit_stack_alloc grep: symbol lookup error: grep: undefined symbol: pcre_jit_stack_alloc grep: symbol lookup error: grep: undefined symbol: pcre_jit_stack_alloc Installing breakpad exception handler for appid(steam)/version(1476379980) libGL error: unable to load driver: i965_dri.so libGL error: driver pointer missing libGL error: failed to load driver: i965 libGL error: unable to load driver: i965_dri.so libGL error: driver pointer missing libGL error: failed to load driver: i965 libGL error: unable to load driver: swrast_dri.so libGL error: failed to load driver: swrast


Proof for bivariate conditional mean of Gaussian dist

I see that a lot of questions are answered here for multivariate and bivariate conditional distributions. But I did not find the proof of these equations (I need just for bivariate case).      to get this    I appreciate your help


Irreducible polynomial in field extension

I have this problem      Let $L/K$ be a finite field extension and $|L:K|=m$. Let $f(x)$ be an irreducible polynomial of degree $n$ in $K[x]$ and $\gcd(m,n)=1$. Prove that $f$ is irreducible over $L$.   I'm just a beginner so I'm really confused with the $\gcd(m,n)=1$, I don't know how to use it. So help me with this problem. Thank you


Self-scrolling formulas and text in Beamer?

For a presentation with Beamer, I would like to have a slide where a long list of formulas (maybe mixed with text) scrolls automatically within a certain part of the slide. This should look like e.g. closing credits in movies.   I have tried the idea from  based on animateinline from the , but whenever I use environments like \begin{equation} ... \end{equation} or commands like \textcolor{red}{...} I get an error:  TeX capacity exceeded, sorry [main memory size=3000000]. \end{frame}   Ideally, the formulas/the text should be given within the document itself, but if a solution with an external PDF works fine, I'll take it!  Any ideas how that might work?


Prove: If S is countably infinite set, all finite subsets of S are also countably infinite

Question: Prove that if S is a countably infinite set then all the finite subsets of S are also countably infinite.   Where would I start?


I have an enum like this  public enum People {     OUT("People out"),     IN("People in");      private final String name;     // **StageName**(String name) {    People(String name) {         this.name = name;     }      public String getName() {         return name;     }  }   An I want to get the Enum type given a value, something like :  People.getEnumValueOf("People out")   And that should return an enum People.OUT  How do I do that?


Why is it a unicorn instead of an unicorn. Unicorn starts with a vowel and so shouldn't it be an?


I use XeLaTeX and normally do not use the fontenc package.  But now I want to use a specific symbol which according to the  needs T4 encoding which is provided by the fc package.  Compiling the code below ended in       ERROR: LaTeX Error: Command \m unavailable in encoding TU.  --- TeX said ---  See the LaTeX manual or LaTeX Companion for explanation. Type  H <return>  for immediate help.  ...                                                l.16 Given a data matrix $D$ (database $\m                                           {D}$)   This is what I have tried:  \documentclass[12pt,a4paper]{article} \usepackage{fontspec} \usepackage[T4,T1]{fontenc} \usepackage{fclfont} \usepackage{t4phonet} \usepackage{amssymb} \usepackage{fontspec} % Gebruik met xelatex \setmainfont[Ligatures=TeX]{Linux Libertine O}  \begin{document}             % End of preamble and beginning of text.  Given a data matrix $D$ (database $\m{D}$)   \end{document}    How do I get this to work?


A positive integer (in decimal notation) is divisible by 11 $ \iff $ ...

(I am aware there are similar questions on the forum)  What is the Question?  A positive integer (in decimal notation) is divisible by $11$ if and only if the difference of the sum of the digits in even-numbered positions and the sum of digits in odd-numbered positions is divisible by $11$.     For example consider the integer 7096276.       The sum of the even positioned digits is $0+7+6=13.$ The sum of the odd positioned   digits is $7+9+2+6=24.$ The difference is $24-13=11$, which is divisible by 11.      Hence 7096276 is divisible by 11.   (a)  Check that the numbers 77, 121, 10857 are divisible using this fact, and that 24 and 256 are not divisible by 11.  (b)  Show that divisibility statement is true for three-digit integers $abc$. Hint: $100 = 99+1$.  What I've Done?  I've done some research and have found some good explanations of divisibility proofs. Whether that be 3,9 or even 11. But...the question lets me take it as fact so I don't need to prove the odd/even divisible by 11 thing.   I need some help on the modular arithmetic on these.   For example... Is 77 divisible by 11? $$7+7 = 14 \equiv ...$$  I don't know what to do next.  Thanks very much, and I need help on both (a) and (b).


Where can we see the list of members who got a specific hat during Winterbash, like we can see in a specific ? Is it possible? If it is, can we filter by country or by specific information?


Does two-weapon fighting give any penalties to the offhand attack?

I understand that you have to use the two weapon fighting style to add your ability modifier to damage, but I was wondering if there were any penalties to the offhand attack modifier?


I have been needing to import anywhere between a few to 10's of text layers into a project per day for my job.    The text files are in a .log format (Space Delimited) The X, Y, and CRS designations are the same for all of the files    Is there a plug-in or python command that would help me import these files more efficiently?


CSS multiple backgrounds + a radial gradient

.header_background{         background: url("../images/Layer-251.png"), url("../images/Vector-Smart-Object-copy-4.png");         background-repeat: no-repeat, no-repeat;         background-position: center left, bottom right;            background-size: auto 100%, auto 100%; }   Here I tried background: radial-gradient(#2a4053 5%, #283c4d 15%,  #1e262d 60%);, but it doesn't work as it displaces all the backgrounds.  Would appreciate it if anyone helps. :)


Disproving an Operator Identity; Completing a Set of Rotationally Invariant Operators

I came across the following statement:     If $A$ and $B$ commute and $B$ and $C$, do $A$ and $C$ necessarily commute. Prove or disprove.   I think it's generally untrue. Consider $A = X$, $B = P_y$ and $C = Ly$, where $X$ is the position operator, $P_y$ is the momentum operator in the $y$ direction and $L_y$ is the angular momentum operator in the $y$ direction.  If the statement is generally untrue, by virtue of the counterexample, I have the following question:  Don't we implicitly use the argument in the statement to assert for instance, adding an operator to a list of operators to complete a set of commuting observables. For example, assume $H$ is a rotationally invariant scalar operator (Hamiltonian). We know that it commutes with $L_z$. We also know that $L_z$ commutes with $L^2$ and we then assert that $H$ and $L^2$ must also commute as well and we then looking for the simultaneous eigenbasis of th two angular operator momentum operators to get the spherical harmonics.  Am I missing out on something here?


Why should the substitution be injective when integrating by substitution?

I made a silly mistake in evaluating some integral by using a non-injective $u$-substitution.  But why should $u$-substitutions be injective in the first place?  I reasoned in the following way: the formula $$ \int_{\phi(a)}^{\phi(b)}g(x)\ dx = \int_a^b g(\phi(t))\phi^\prime(t)\ dt $$ holds for a general $C^1$ function $\phi$, even if it is not injective.  When you calculate an integral of the form $\int_a^b f(\phi(t))\ dt$, to use the formula above from right to left, you should find a function $f$ such that $$ f(\phi(t)) = g(\phi(t))\phi^\prime(t), $$ which do not exist if $\phi$ is not injective, i.e., $\phi(t) = 0$ for some $t$. This is why substitutions should be injective.  Is my reasoning correct?  If so, I believe that if $\phi^\prime(t) = 0 \Rightarrow f(\phi(t)) = 0$, a function $g$ that satisfies the formula above may exist and $\phi$ should not necessarily be injective.  Is this right?  I am often confused about the fact $\phi$ should be injective.  Is there an intuitive way to interpret this fact, so that I always remember to take a $\phi$ that is injective?  I would be grateful if you could help me understand this matter.


I recently asked my graphics designer to create an SVG image for the background of the homepage of my website (to be used via the background-image css property).  I asked her to just write gibberish (eg: Lorem ipsum...) in a particular Google Font on an entire page and then just "cut out" a circle in the middle which will be blank. I asked for this as an SVG file.  A general schematic of the layout:    This file size turned out to be quite large (1.7 Mb and 900 Kb after running through SVGO).  Using illustrator, are there any instructions I can give to my graphics designer to have her reduce the file size?   I suspect that the text is being treated as an image and this (because of the many paths/points involved) is causing the file size to rise. Since we're using a Google Font, is there any way we can define it as a text within Illustrator so that Illustrator will do some sort of optimization to the font when converting it to an SVG?  I am not well versed in these matters but, since we're just creating a background image of some script text, I feel like we should be able to reduce the file size. Any suggestions are welcome.