Proof of the existence of a unique linear transformation

I want to prove the following lemma:  Let $B$ be a basis for $V$ and let $T_B: B \rightarrow W$ be a map. Then there exists a unique linear map $T_V: V \rightarrow W$ which extends $f,$ that is, such that $T_V(b)=T_B(b)$ for all $b \in B$  My attempt:  Any vector $v\in V$ can be written as a linear combination of the basis elements: $$v=\sum_{i}^{n} \alpha_{i} b_{i}, \quad b_{i} \in B$$  Where $\alpha_i$ are the coordinates of $v$ with respect to $B$. We can therefore write the transformation of $v$ under $T_V$ as: $$T_{V}(v)=T_{V}\left(\sum_{i}^{n} \alpha_{i} b_{i}\right)=\sum_{i}^{n} \alpha_{i} T_{V}\left(b_{i}\right)$$  Where in the last step I exploited the assumed linearity of A. This means that if $T_V(b_i)=T_B(b_i)\ \forall\ b_i\in B$ then the map $T_B$ has been 'extended' to $T_V$. To prove that $T_V$ is unique we consider another map: $T^{'}_V:V\rightarrow W$ defined over the basis elements $T_V^{'}(b_i)=T_V(b_i)=f(b_i)\ \forall\ b_i \in B$: $$ T_{V}^{'}(v)=\sum_{i}^{n} \alpha_{i} T^{'}_{V}\left(b_{i}\right)=T_V(v) $$ Is this sufficient to prove the Lemma? Is something missing/unclear/incorrect in my intend of a proof?


I need to have a real map like the one attached, and I do some writing on it ??  Any suggestions please


Getting strange error with MiKTeX when trying to use "kpfonts" package

I'm getting the following error when trying to compile the following very minimal example with MiKTeX:  \documentclass{article}  \usepackage[T1]{fontenc} \usepackage{kpfonts}  \begin{document} test \end{document}   The error I get is  hb/AppData/Local/MiKTeX/2.9/pdftex/config/pdftex.map}] (D:\dump\tex\tmp\test.aux) )Trying to make PK font jkpmn8r at 600 DPI... Running miktex-makemf.exe... miktex-makemf: The jkpmn8r source file could not be found. Running ttf2pk.exe... miktex-makepk: PK font jkpmn8r could not be created.  !pdfTeX error: pdflatex (file jkpmn8r): Font jkpmn8r at 600 not found  ==> Fatal error occurred, no output PDF file produced!  It compiles perfectly on my Ubuntu machine with TeX Live 2011, but not on my Windows machine with MiKTeX 2.9 (just updated all packages as well).  I detected this when trying to compile my thesis on my Windows machine, which produced the following error:  [5 ! pdfTeX error (font expansion): auto expansion is only possible with scalable fonts. \@EveryShipout@Output ...@Org@Shipout \box \@cclv  l.47  !  ==> Fatal error occurred, no output PDF file produced!   It appears it has something to do with the kpfonts package since the minimal example compiles when I comment it out, but why does it work on my Ubuntu machine then?


Question:  $$ f_1 (x) = \sqrt {1+\sqrt {x} } $$ $$ f_2 (x) = \sqrt{1+ \sqrt {1+2 \sqrt {x} } } $$ $$ f_3 (x) = \sqrt {1+ \sqrt {1+2 \sqrt {1+3 \sqrt {x} } } } $$ ... and so on to $$ f_n (x) = \sqrt {1+\sqrt{1+2 \sqrt {1+3 \sqrt {\ldots \sqrt {1+n \sqrt {x} } } } } } $$ Evaluate this function as n tends to infinity.  Or logically: Find $ \displaystyle{\lim_{n \to \infty}} f_n (x) $ .  MyProblem: Ramanujan discovered $$ x+n+a=\sqrt{ax + (n+a)^2 +x \sqrt{a(x+n)+(n+a)^2 +(x+n) \sqrt{\ldots}}} $$ which gives the special cases $$ x+1=\sqrt{1+x \sqrt{1 + (x+1) \sqrt{1 + (x+2) \sqrt{1 + (x+2) \sqrt{\ldots}}}}}$$ for x=2 , n=1 and a=0 $$3= \sqrt{1+2 \sqrt{1+3 \sqrt{1+ 4 \sqrt{1+\cdots}}}}$$  Is there any proof of this discovery?Without proof I don’t think that the problem should be solved in this way.And if there is a proof please share it and also tell your approach to solve it.


I have a question about this circuit. What is the transfer function for this circuit?


I am looking for the maximum likelihood estimator (MLE) for the .  I understand the derivation of the MLE for a  and a , but I am unable to derive the MLE equation for the Poisson-binomial distribution.


Every finite commutative ring with no zero divisors contains a multiplicative identity?

There is an easy argument which shows that a finite integral domain (commutative unital ring with no zero divisors) is a field. Here I wonder whether this result still stands if the term "unital" is dropped.   In other words, can a finite commutative ring with no zero divisors always contain a multiplicative identity? More generally, if this is true, can we even generalize Wedderburn's little theorem: every finite ring with no zero divisors is a field?


Easiest way to determine the index of a child element relative to its parent?

I have some HTML markup, similar to:

   I am attaching an event handler to each child element with jQuery:  $( "div.child" ).on( "click", someFunction );   Is there an easy way for me to figure out which child element was triggered/clicked from the event object?   For example, I'd like to be able to determine if the user clicked on the 3rd child
 versus one of the other child
.


I am having an issue with one of the websites.  Google is reporting that I am having duplicate meta descriptions for few pages. What we did is that we used URL rewrite to rewrite the pages to be more seo friendly. Here is one example with one of our product pages:  Old format:  www.mysite.com/Product.aspx?ProductID=12345&SKU=44412-2212A   New format:  www.mysite.com/Products/12345-44412-2212a.aspx   What we are doing now, when someone will ask for www.mysite.com/Products/12345-44412-2212a.aspx they are taken to www.mysite.com/Product.aspx?ProductID=12345&SKU=44412-2212A but the URL still remains www.mysite.com/Products/12345-44412-2212a.aspx.  But if someone type in www.mysite.com/Product.aspx?ProductID=12345&SKU=44412-2212A, they will see exactly the same page as www.mysite.com/Products/12345-44412-2212a.aspx since the data on the page is same.  What I was thinking is to block product.aspx pages in robots.txt file, but I don't know if that automatically will block Google bots from crawling this page too www.mysite.com/Products/12345-44412-2212a.aspx, since that one is only URL rewritted page from the other page format, www.mysite.com/Product.aspx?ProductID=12345&SKU=44412-2212A.  What do you guys think, how can we tackle this problem, any advice, because GWT is reporting that I have duplicate meta description issue, and those are the pages reported as duplicate, I want to have only one page per product?


Dynamic LINQ OrderBy on IEnumerable / IQueryable

I found an example in the  for Dynamic LINQ that allows you to use a sql-like string (e.g. OrderBy("Name, Age DESC")) for ordering. Unfortunately, the method included only works on IQueryable<T>. Is there any way to get this functionality on IEnumerable<T>?


Whenever I am given a system type with a certain transfer function, I am always asked to proceed to find out the 1. impulse response and 2. step response of the system. My question is, what is so special about these two response types that other responses, like for example parabolic response, is not what I am asked to find out?


vector space dimension of linear varieties

Suppose $Y=Z(f_1,\cdots ,f_r)\subseteq \mathbb{A}^n_k$ where each $f_i$'s are linear homogeneous polynomials which are $k$-linear independent. Then $Y$ is also a vector space over $k$. My question: Is the vector space dimension of $Y$ is same as the dimension of $Y$ as an affine variety? If yes how?    Thank you.


What am I doing wrong in this attempt to solve this integral?

The correct solution:   My attempt:  $$\int_{\sqrt{y}}^{1}y\ln x \, dx\\=y\int_{\sqrt{y}}^{1}\ln x \, dx\\=y\cdot\left.\frac{1}{x}\right|_{\sqrt{y}}^{1}\\=y-\sqrt{y}$$


I'm using Blender 2.70. How do I apply the same modifier to multiple objects? None of the answers I searched for work, listed below:   Apply modifier to one object, then select all, make applied object active, ctrl+c -> modifiers. The only choice I get from ctrl+c is "copy selection to buffer" Same as above, except alt+c -> mesh from curves/meta/surface/text. Nothing happens   Also, is there a better way to reduce polygon count on simple objects (rings, cylinders, etc) than decimate? That's what I'm using right now, but can't figure out how to apply it to all the objects in the scene.


Let $x=(x_1,x_2,...x_n)∈\{0,1\}^n$ for $n∈\mathbb N$. Prove that if one-way functions (OWFs) exist, then there exists a one-way function f such that for every bit $i∈[1, n]$ there exists an algorithm $A_i$ such that: $$\Pr[A_i(f(x))=x_i]≥\frac12+\frac1{2n}$$ I find some information from this post , but its in power


\left and \right not working on parentheses within the same line when internal fractions are changed

I'm trying to show the product of two Legendre symbols. When I compile the following  \documentclass{article} \begin{document} $$\left(\frac{x}{p}\right) \left(\frac{x}{p}\right)$$ \end{document}   it yields     as expected. However, when I switch the variables, i.e.  \documentclass{article} \begin{document} $$\left(\frac{x}{p}\right)\left(\frac{p}{x}\right)$$ \end{document}   it yields     How do I resolve this? Why do the values within the fractions matter?


I'm writing a book chapter for publication and the publisher accepts Latex.  I like to use equation macros  \newcommand{\funof}[1]{\ensuremath\left(#1\right)}   that I can then use in an equation  $i\funof{t}$   I assume the publisher is not going to want to have to deal with these macros.  Is there a way to unroll equations so that I can give the publisher the final expression with my macros substituted?  Edit: This is a Springer-Verlag publication, so if anyone has experience with a similar issue.  Please let me know.


At what point do quantum wave functions collapse? Let me give you two examples to make that question more clear:   Let us think of the double slit experiment. We humans see the light at certain positions. That means the wave function has to collapse somewhere between having passed the slits and being registered by our brain. At which point does this collapse occur? Let us think of Schrodinger's famous cat. As far as I understood, the decay process of the radioactive particle can be described as a wave function. When we open the box, we see either a living or a dead cat. At which point does the wave function actually collapse?   I asked this question to many people, but the answers were not very satisfactory. The most common answer is that a measurement makes the wave functions collapse, but nobody could ever give me a clean definition of what such a measurement actually is. Others say that this is still not very well understood and an open problem. I would be happy about any comments, suggestions, or even pointers to literature.


Redirect to the original page after authorization on SEDE

After authorization,  redirects to the main page.  Could you redirect to the original page (from which I've tried to log in)?


What is the difference between "found" and "establish"?

In the sentences below:  Quora was established in 2009. Quora was founded in 2009.  They seem interchangeable in the sentences above. I was told that 'found' was informal form of 'establish', is that correct? How do you differentiate them? Edit:  considering these two words are put into specific sentences in comparion to each other and;  more importantly, the answer of the other related question seemed didn't have a explaination and conclusion regarding their difference.  their synonym causing many confusion in English usage and it's so hard that even my English teacher couldn't find any difference in usage, if this question regarding their difference is closed again, its confusion might never be solved.   Therefore, please give this question a chance so the difference of their synonym could be clear up , thanks.


An infinite subset of a countable set is countable

In my book, it proves that an infinite subset of a coutnable set is countable. But not all the details are filled in, and I've tried to fill in all the details below. Could someone tell me if what I wrote below is valid?  Let $S$ be an infinite subset of a countable set $T$. Since $T$ is countable, there exists a bijection $f: \mathbb{N} \rightarrow T$. And $S \subseteq T = \{ f(n) \ | \ n \in \mathbb{N} \}$. Let $n_{1}$ be the smallest positive integer such that $f(n_{1}) \in S$. And continue where $n_{k}$ is the smallest positive integer greater than $n_{k-1}$ such that $f(n_{k}) \in S$. And because $S$ is infinite, we continue forever. Now consider the function $\beta : \mathbb{N} \rightarrow S$ which sends $k \rightarrow f(n_{k})$.   So in order for $S$ to be countable, $\beta$ would have to be a bijection. $\beta$ is injective since if $f(n_{k}) = f(n_{j})$, then $n_{k} = n_{j}$ because $f$ is injective. We also can conclude $k = j$ because the various $n_{i}$ chosen were strictly increasing.   Edit: $\beta$ also needs to be surjective. So for every $r \in S$ there exists a $q \in \mathbb{N}$ such that $\beta(q) = f(n_{q}) = r$. We know that $f^{-1}(r) \in \{n_{1}, n_{2}, ..., n_{k} ... \}$, so we can let $f^{-1}(r) = n_{d}$. Thus $\beta(d) = f(n_{d}) = r$.


Will lubuntu remind me to upgrade after 3 years?

Will lubuntu remind me to upgrade after 3 years or will it happen after 5 years ?


Convergence of $\big ( 1 -\frac{1}{\sqrt{n}} \big )^n$.

I am trying to investigate the convergence of the series: \begin{equation} \sum_{n=1}^{\infty} \bigg ( 1 -\frac{1}{\sqrt{n}} \bigg )^n. \end{equation} According to the Mathematica, the series converges, but I am unable to come up with a series with which I can compare the series above etc. Any leads would be appreciated.


Simple effects of categorical interaction

I have two two-level categorical variables, IV1 and IV2. I want to fit a linear model in R and find out the simple effect of IV1 on the DV at each level of IV2, separately. I'm not interested in the overall effect of IV1.  Is it correct to sum-code IV1, dummy-code IV2, and fit this model:  lm(DV ~ IV1 * IV2, data=dat)   Then interpret the main effect of IV1 as the effect of IV1 on DV at the reference level of IV2.


Remove .SE sites from Hot Network Questions

I have deep issues with the 'Hot Network Questions' containing questions from the religion sub-sites. This is not because I dislike questions about religion, nor because I think these sites have no place on the network in theory - they do. The reason I am annoyed by these Q&A's is that the quality of highly upvoted questions is often extremely low, and questions that are out of scope (since they are about reality) are not deleted.  Obligatory examples: All answers have been upvoted and are popular, I did not rotten-cherry pick:   Q    A +0 accepted   Q    A +10   Q    A +36     Q    A +4   Q    A +8   Q    A +9     I imagine questions, and answers such as these would be deleted on any other StackExchange site. Would I not be told 'reality' was not in scope if I asked a question on scifi.stackexchange.com like .   The level of answers at the sub-sites specifically for religion is very low, especially the answers that turn up in the 'Hot Network Questions' list. I propose removal of these sites from the network, as they do not fit the quality standards for SE. Alternatively, I would like to filter out these sites from the 'Hot Network Questions' list.  Addendum There is a related question under , a denied feature request for personalizing a filter for hot network questions. While that would have solved my issue, the fact that it wasn't implemented means my issue is unsolved, and my wish for a resolution to jarring questions on the Hot Network Question list remains (and in this case it's not just the low-quality floating up as usual, but actually especially jarring for the non-'experts' of religion.SE).


Word for the occurence of people talking over one another

I am evaluating lessons that take place over video conferencing platforms. One frequent problem is multiple students talking at the same time. I want a word to describe this phenomenon in my reports:  "a lot of [x]"  So far, I am settling for coining the term 'overtalk'  "a lot of [overtalk]"  A search for this term suggests that it is used to refer to the act of talking uncontrollably as a function of anxiety. This is not a problem, as that use is also somewhat uncommon and field-specific, so I'm comfortable coopting the term for this new context. However, is there a better word already in use for this? I don't want 'interrupting' as this suggests awareness and disregard on the part of the interrupter that somebody is already talking. I am looking to describe the occurence when multiple speakers happen, unintentionally, to be speaking at the same time.


How to prove in a concise way that $\{f(kz):k \in \mathbb{C}\}$ is a normal family?

I am trying to prove the following statement:  If $f(z)$ is entire, show that the family formed by all the functions $f(kz)$ with constant k is normal in the annulus $r_1 < |z|<r_2$ If and only if $f$ Is a polynomial.  I have been trying to write, unsuccessfully, a concise proof of this fact just using Arzela-Ascoli, Montel’s theorem, Marty’s theorem or results in this line.  Thank you for your help.


Device requires 2.5V at 1500mA. The closest charger I have to that is 4.2V at 1500mA

How should I calculate the required resistor to make sure the device doesn't get damaged?


I am reading from a txt file and populating a core data entity.  At some point I have read the value form the TXT file and the value is @"0.9".  Now I assign it to a CGFloat.  CGFloat value = (CGFloat)[stringValue floatValue];   debugger shows value as 0.89999997615814208 !!!!!!?????  why? bug? Even if it things [stringValue floatValue] is a double, casting it to CGFloat should not produce that abnormality.


Creating a rectangle with TikZ using "\draw ... rectangle ..." how can I add relativ labels to edges and corners?

I use the following expression to create a rectangle in TikZ (even so there exist probably a million ways to do it):      \draw[draw=black] (-1.75,-2.5) rectangle ++(5.5,5.5);   but using "node" with "midway", "left", "below" ... to add labels at certain areas of the rectangle to name them seem not to work properly so I would like to ask which one the correct way is?  Thank you very much in advance!


Show that: $\inf(A+B) = \inf(A)+ \inf(B)$

Let $A,B$ be non-empty, bounded subsets of $R$ and $A+B=\{a+b:a \in A,b \in B\}$. Show that: $$\inf(A+B)=\inf(A)+\inf(B)$$   This is what I have tried:  Suppose that $x \in A+B \Rightarrow x=a+b, \ a \in A, \ b \in B$. We know that $a\geq \inf A \text{ and } b\geq \inf(B)$ . So $x \geq \inf(A)+\inf(B) \Rightarrow\inf(A+B) \geq \inf(A)+\inf(B)$  If $x\in A \Rightarrow x \in A+B, \text{ so we conclude that } \inf(A) \leq  \inf(A+B)$ and if $x \in B \Rightarrow x \in A+B,\text{ so we conclude that } \inf(B) \leq  \inf(A+B)$. Therefore, we have that $\displaystyle \frac{\inf(A)+\inf(B)}{2} \leq \inf(A)+\inf(B) \leq \inf(A+B)$.  Could you tell me if it is right?


Proof: $\exists z\in \mathbb{C}$ such that every sub-sequence of $(z_n)_n$ has a convergent sub-sequence with the limit $z$.

Claim:   Let $(z_n)_n$ be a sequence in $\mathbb C$ such that the subsequences $(z_{2n})_n$, $(z_{2n+1})_n$ and $(z_{3n})_n$ are convergent. Then there $\exists z\in \mathbb{C}$ such that every sub-sequence of $(z_n)_n$ has a convergent sub-sequence with the limit $z$.  My attempt:  Let $z_{{n_k}_k}$ be a sub-sub-sequence of $(z_n)_n$. It is $n_{k_k}\geq k$ for every $k$. Its easy to prove via induction, since $n_1\geq 1$ and$n_{k_k}\geq k$ imply that $n_{{k}_{k+1}}> n_{k_k} \geq k$ and hence $n_{{k}_{k+1}}\geq k+1$.   What do you think?


Splitting .tif image into several tiles?

I have an image of size 1GB (.tif), with the width and height 94000x71680. I would like to chunk this image into 20000X20000 tiles so that I can process them.   How can I do this?


reducing noise in semi gloss metal - is there a material specific option to reduce noise?

I'm a total nube to Blender just starting to learn the basics.  I wanted to know if there any material specific settings to reduce noise of a particular material.  Like the semiglossy metallic material on the left of this Cycles render:    The semiglossy red sphere on right does not bother me as much as the noisy metallic sphere on left - and would like to increase the quality of that specific metallic material.


One to many relationship query result in a single row and dynamic multiple columns

In a one-to-many relationship query, I would have a single row and dynamic multiple columns. In this example the expected result is to have for each owner all the associated phone numbers in a single row, starting from a multiple rows table. The goal is to get a json ready to be imported in a MongoDB database. SELECT o.id, p.numbers  FROM owner o INNER JOIN phones p ON o.id = p.owner_id  WHERE o.id=1   getting the following result o.id     p.numbers -----    ------  1        333-555-888      1        222-777-666   1        555-657-555 1        ....  The result should be: o.id     p.numbers1     p.numbers2     p.numbers3     p.numbers4 -----    -----------    ----------     ----------    ---------- 1        333-555-888     222-777-666   555-657-555     .......         This Q & A  doesn't resolve the issue since "Kode 1" or "Kode 2" are the different phone numbers for me. I am using MySQL 5.7.24. I want to get for each owner (t1) every phone number (t2) associated to him, in a single row with multiple columns. (Each phone number in a dedicated column) and they can be different. I want to export to csv. There can be around 10 phone numbers per owner.


What is a good and free static apex code review plugin for IDEA, eclipse and ANT?

Java has a number of useful and FREE tools for reviewing not just formatting and style but quality of code and bad coding habits.    and  could work but they are not free and open source.   works well for java but there are no official updates to support Apex.  What does static code analysis for apex that is free?


When a creature summoned through Find Steed is dismissed or killed what happens to its barding, saddle and saddlebags?

From page 240 of the Player's Handbook, find steed says, in part:     You summon a spirit that assumes the form of an unusually intelligent,   strong and loyal steed, creating a long lasting bond with it.   Appearing in an unoccupied space within range, the steed takes on the   form that you choose, such as warhorse, a pony, a camel, an elk, or a   mastiff....      When the steed drops to 0 hit points, it disappears, leaving behind no   physical form. You can dismiss your steed at any time as an action,   causing it to disappear. In either case, casting this spell again   summons the same steed, restored to its hit point maximum....   It seems convenient for it to show up with the regular attire of a mount, and to have that stick with it. However, this basically gives it the functionality of the "leomund's secret chest" (p254) which is a level 4 spell with a 5,050gp cost.  What's to stop a player from loading the summoned warhorse with luggage and dismissing it until they feel like accessing it again?  I am not looking for "it's up to the DM" type answers. Rules as intended are best, rules as written will substitute, and info from official WotC sources is great too.


What's the easiest way to mount Windows share as a local folder in home directory?

Via Gnome Nautilus I can easily mount Samba shares from my Ubuntu Server.  However, these "mounts" are kinda of fake.  Many applications I run do not recognize that Gnome has mounted these server folders and therefore cannot open files off my server.   In the past I created an /etc/fstab entry and mounted them globally, the /mnt folder, but this isn't going to work as other people share my Ubuntu laptop.  What's the easiest way to create a "real" samba mount in my (and other people's) home directory?  It's fine if its a command or a GUI application that can run when I log in.  These server folders don't have to be mounted all the time.


Bicycle counter-intuitive: in which direction it will move?

I saw this puzzle in a local newspaper:     Consider a normal bicycle set to stand in its upright position, and   its pedal is set to the position as shown in this figure. One man   slightly hold the seat to keep the bicycle from falling. (Actually   this is not important, there can be many ways to keep the bicycle from   falling without affecting the experiment result). A non-elastic string   is tied to the end of the pedal crank arm as in here. Another man then pulls the   string backward.      The question is: In which direction will the bicycle move? Forward,   backward, or standstill? Discuss possible cases.             Hint: The answer is   non trivial. The readers are encouraged to try this experiment before coming to a   hasty conclusion, since it's quite simple to carry out.   Despite the "Hint" part, and the "counter-intuitive" in the title, which is a quite clear suggestion that the bicycle will move in a counter-intuitive direction (backward instead of forward), many people still submitted answer such as "Forward, why not!!", or "Standstill" or "Forward, then as the crank move to 9 o'clock position, it will move backward". Of course they are not the correct answer.  Some people answered that it will move backward, but couldn't give a decent explanation.  My best guess is that this must have something to do with the size (radius) of the wheel, the radius of the crank arm, and the ratio of the crank gear and the wheel gear as well. If the bicycle moves forward, the crank bolt/shoulder will move as well, then the displacement of the crank does not simply equal to the displacement cause by the wheel rotating...  So what can be a simple, short explanation? And what can be a detail explanation with math and equations involved?


Failed to get D-Bus connection: connection refused

I'm having a hard issue on a server, and I get no clue of what is happening nor where to search to debug it.  Here is my problem : When I run any command such as :  systemctl start httpd.service   or  systemctl -a   or (apparently) any systemctl linked command, I get the following message :  Failed to get D-Bus connection: Connexion refusée   Running ps ax | grep dbus returns:  403   ?     Zs 33:44 [dbus-daemon] <defunct> 25673 pts/2 S+ 0:00  grep --color=auto dbus   If you have any clue on it, let me know ! thanks


I have a Ubuntu Server VPS and I want to use /bin/bash/ as my shell. How can I change my shell? I have root access but I don't work as root. So dash is my default shell now.  I have read  and chsh seams to be the preferred way to go. But when I type chsh /bin/bash I get this message: chsh: unknown user /bin/bash  And if I just type /bin/bash the Bash shell seams to work fine. How to change it?


I do not know much about fractional calculus, except what I have read in a few short posts at MSE and .  I know that order of a derivative can be extended from rational values to real values, but all I know is what is written .  So my question is, what is the simplest way to understand and/or define $\dfrac{d^n}{dx^n}f(x),$ for $n\in\mathbb{R}$?  For example what is $\dfrac{d^\pi}{dx^\pi}f(x)$?  Also, what about complex values?  What might we say about $\dfrac{d^{s}}{dz^s}f(z)$ for $s\in\mathbb{C}$?  And what are some uses for such derivatives?


Selecting most recent date between two columns

If I have a table that (among other columns) has two DATETIME columns, how would I select the most recent date from those two columns.  Example:  ID     Date1     Date2  1      1/1/2008   2/1/2008  2      2/1/2008   1/1/2008  3      1/10/2008  1/10/2008   If I wanted my results to look like   ID     MostRecentDate  1      2/1/2008  2      2/1/2008  3      1/10/2008   Is there a simple way of doing this that I am obviously overlooking? I know I can do subqueries and case statements or even write a function in sql server to handle it, but I had it in my head that there was a max-compare type function already built in that I am just forgetting about.


I am getting the following error in the top menu bar:  An error occurred. Please run the Package Manager from the right-click menu or apt-get in a terminal to see what is wrong. The error message was:'Error:BrokenCount>0'. This usually means that your installed packages have unmet dependencies.     How do I solve this problem?


Is there currently any way to change the path that a camera is following during an animation? I'd like to be able to snap the camera to a new path at a set frame after it finishes following the first path. Is this possible, or do I have to make a new camera entirely?


First install, Nvidia GeForce 4 4200, GPU lockup

I used my Wintel box to download Ubuntu 12.04 LTS. Burned an install DVD and installed on my laptop (Dell Inspiron 8500). When I try to boot the laptop from the hard drive I get a GPU Lockup message. If I let it sit, after a few minutes I get messages about a channel failing to idle. These repeat every few minutes. I have read some other posts and it sounds like I still ought to be able to do something, but I have no idea what. My GPU is an Nvida GeForce 4 4200. I am a total newbie at Linux. I have mark Sobell's Practical Guide to Ubuntu Linux. I will search it as well. Any help would be greatly appreciated.


Fatal Error: Allowed Memory Size of 134217728 Bytes Exhausted (CodeIgniter + XML-RPC)

I have a bunch of client point of sale (POS) systems that periodically send new sales data to one centralized database, which stores the data into one big database for report generation.  The client POS is based on PHPPOS, and I have implemented a module that uses the standard XML-RPC library to send sales data to the service. The server system is built on CodeIgniter, and uses the XML-RPC and XML-RPCS libraries for the webservice component. Whenever I send a lot of sales data (as little as 50 rows from the sales table, and individual rows from sales_items pertaining to each item within the sale) I get the following error:  Fatal error: Allowed memory size of 134217728 bytes exhausted (tried to allocate 54 bytes)   128M is the default value in php.ini, but I assume that is a huge number to break. In fact, I have even tried setting this value to 1024M, and all it does is take a longer time to error out.  As for steps I've taken, I've tried disabling all processing on the server-side, and have rigged it to return a canned response regardless of the input. However, I believe the problem lies in the actual sending of the data. I've even tried disabling the maximum script execution time for PHP, and it still errors out.


Change Terminal Name to be the Current folder Name

How to change the title of Terminal to be the Current folder Name?  for example i'm in the folder test then the terminal title should be test as well.  Note : i don't want the full path  that comes before the folder name(for example ../user/home..)


In what order do multiple readied actions with the same trigger resolve?

My players have been scheming with rapid entry tactics for the megadungeon I've recently started running. Unfortunately, the monsters are aware of the adventurers, and this has lead to a weird question of priority. Given the following situation (which I'm pretty sure is going to happen next session in some form or another) what happens?     Alice the adventurer readies an action; if her teammate Carlos opens   the door, she's going to throw the alchemists fire through the door,   which should do enough damage to kill any goblins hiding there.      Meanwhile, on the other side of the door, Bob the goblin is lying in   wait. He readies an action; if the door opens, he's going to hit the   switch to open the trapdoor in the next room, which should drop any    pesky adventurers into a pit with spikes at the bottom.      Carlos opens the door.   I know what happens when , but what happens when multiple readied actions get triggered at the same time? My guess would be an opposed reflex save or initiative check of some kind to see who goes first, but that's entirely just intuition speaking. The rulebook doesn't seem to speak to the issue.


Having read the books several times now, one thing that just jumped out at me as unclear is why did Sansa need the hair net she wore to Joff's wedding?      I know that the hairnet was holding a Strangler crystal, but my point is why did they need to use that means to get the poison into the wedding feast?     Possibilities I've considered but can't find clear evidence:  1) The conspirators were trying to frame Sansa. The problem with that is that I don't recall the Hairnet ever being notice as an attack vector.   2) The conspirators couldn't get the "tool" in place except by that means. The problem there is that there's no evidence that anyone was searched or otherwise prevented from bringing things other than obvious weapons into the wedding.   Overall, this approach seems to have increased the risk to the plan (maybe Sansa would decide not to wear it, maybe she would decide to mention the oddness to someone, it relied on bringing more folks into the conspiracy, etc), with little upside.  So why bother?  EDIT: please note this is a book question. There seems little evidence in the books so far that Littlefinger and Lady Olenna had any contact on this subject before she came to Kings Landing from Highgarden.  Littlefinger met Mace Tyrell in the field, not at his seat, while Margaery and Olenna came from Highgarden.  Dontos gave Sansa the hairnet well before Olenna was even introduced as a character, and her characterization of Mace gives strong impression that he’s not a subtle or devious person, which makes it unlikely that he’d enter the betrothal with the intent to kill.


In the moderator timeline for a post, flags are indicated on comments (a number, with drill-down to see the specific types).  This is helpful for figuring out what happened on a post.  I'd like to see something similar for the deleted-comments view for a user.  We can easily see all of a user's comments (deleted and not) already; I'm asking for this one additional bit of signal to be added to that view, to make it easier for mods investigating complaints about patterns of inappropriate comments.  This request is a subset of , where I asked for aggregate information and filters.  I understand that that might be hard; even having this subset, which the timeline already supports (so I hope it's not too hard), would be very helpful.  Something like this:


I'm trying to flatten and deep copy of an object.   Here's an example of how I try to do:    const data = {   firstObj: {     data: 'Hi!',     nestedArrayOfObject: [{       name: 'hey',       property: 'object'     }],   },   secondObj: {     name: 'second',     nestedArray: []   }, }  const object = {} const keys = Object.keys(data)  for (let i = 0; i < keys.length; i += 1) {   const items = Object.keys(data[keys[i]])    for (let j = 0; j < items.length; j += 1) {     object[items[j]] = data[keys[i]][items[j]]   } }  console.log(object)     As I understand, nested objects are being only linked to the new object, but not cloned.   How to do it correctly without additional libraries?


‘Due to’ vs ‘Because of’ — Which is correct in this sentence?

“Because of the graphic nature of this footage, viewer discretion is advised”, to me, is correct grammar with “because of”.  But you'll often see it written and used on TV as: “Due to the graphic nature of this footage, viewer discretion is advised.”  I thought due to was used only to mean attributable to, as in:The bad weather was due to [attributable to] the icy roads.  In the sentence below,  Because of the graphic nature of this footage, viewer discretion is advised,   we need because of. We wouldn't say Due to [Attributable to] the graphic nature of this footage, viewer discretion is advised.  Is because of the truly correct grammatical choice in that sentence?


On a property of a holomorphic function on a unit disk

Let $f$ be a holomorhic function on the open unit disk $D$. Suppose that there is an $r\in[0,1)$ such that restriction of $f$ to the annulus $$U=\left\{z\in C:r<\left|z\right|<1\right\}$$ is one-to-one. Prove that $f$ is one-to-one on $D$.  Firstly, $f$ is one-to-one if and only if derivative of $f(x)$ is not zero. So my aim is to use the boundary property of this function to prove the result. I tried Cauchy integral theorem. But it doesn't seem to work very well. Neither do the maximum and minimum principle.


Let's make a list of the best books that every game developer should read.  Each answer should have a single book (by title and optionally author), a link to buy the book, and a short synopsis of what the book is about.


For every $n \ge 1$ there exist uniquely determined integers $a \gt 0$ and $b \gt 0$ such that $n = a^2b$ where $b$ is square-free.

Possible Duplicate:          I am trying to prove that for every $n \ge 1$ there exist uniquely determined integers $a \gt 0$ and $b \gt 0$ such that $n = a^2b$ where $b$ is square-free.  The fact that such $a$ and $b$ exist is easy to prove.  From the fundamental theorem of arithmetic, $n$ can be uniquely represented as $p_1^{a_1} p_2^{a_2} \cdots p_s^{a_s}$ where $s$ is a positive integer. Thus  \begin{align*} n & = \prod_{i=1}^s p_i^{a_i} \\\\   & = \prod_{i=1}^s p_i^{\left(2 \left\lfloor \frac{a_i}{2} \right\rfloor + a_i \bmod{2}\right)} \\\\   & = \prod_{i=1}^s p_i^{\left(2 \left\lfloor \frac{a_i}{2} \right\rfloor\right)} \cdot \prod_{i=1}^s p_i^{a_i \bmod{2}} \\\\   & = \left(\prod_{i=1}^s p_i^{\left\lfloor \frac{a_i}{2} \right\rfloor}\right)^2 \cdot \prod_{i=1}^s p_i^{a_i \bmod{2}}. \end{align*}  Clearly, $\left(\prod_{i=1}^s p_i^{\left\lfloor \frac{a_i}{2} \right\rfloor}\right)^2$ is a perfect square and $\prod_{i=1}^s p_i^{a_i \bmod{2}}$ is square free. Hence, we have shown that such $a$ and $b$ exist.  Now, how do we show that such a pair of $a$ and $b$ is unique?  I know how to start proving such a theorem. Let us assume that $n = a^2b = a'^2b'$ such that $a' \ne a$ and $b' \ne b$. Now since this is not possible this should lead us to some contradiction. But, I'm unable to reach a contradiction from this assumption. Could you please help me?


Integrating $F(x,y,z)=\frac{(0,xz,-xy)}{(y^2+z^2)\sqrt{x^2+y^2+z^2}}$ along a circle

Let $F:\mathbb R^3 - \{0\}\to \mathbb R$ be given by $$F(x,y,z)=\frac{(0,xz,-xy)}{(y^2+z^2)\sqrt{x^2+y^2+z^2}}.$$ Compute $\int_C F\cdot ds$ where $C$ is the unit cirlce on the plane $x+y+z=3$ with the orientation from the point $$\left(1-\frac{1}{\sqrt{6}},1-\frac{1}{\sqrt{6}}, 1+\frac{2}{\sqrt{6}}\right)$$ to $$\left(1-\frac{1}{\sqrt{6}}, 1+\frac{2}{\sqrt{6}}, 1-\frac{1}{\sqrt{6}}\right)$$ to $$\left(1 + \frac{2}{\sqrt{6}}, 1-\frac{1}{\sqrt{6}}, 1-\frac{1}{\sqrt{6}}\right)$$ and back to $$\left(1-\frac{1}{\sqrt{6}},1-\frac{1}{\sqrt{6}}, 1+\frac{2}{\sqrt{6}}\right)$$   What I've done: By Green's theorem, the integral is $$\iint_D \operatorname{curl}(F)\cdot k\ dA$$ I got that the curl is $$\frac{(x,y,z)}{(x^2+y^2+z^2)^{3/2}}$$ so the integral is $$\int\int_D \frac{z}{(x^2+y^2+z^2)^{3/2}} \ dA$$ But I'm having difficulties with determining how to define the region $D$ to compute the last integral.


How do we show that no hidden variable theories can replace QM?

I've always hit two big stumbling blocks in conceiving of the proof or disproof of  as being even valid idea, let alone an answerable question... I feel I must be misunderstanding some very fundamental things.   Quantum mechanics is deterministic, ignoring the bit where we take our complex number and fudge it into a probability. We use computers to make calculations to provide the predictions of quantum mechanics - how is this not itself a hidden variable theory?   From what I understand the famous Bell theorem and work around it doesn't disprove hidden variable theories, just one specific flavour of them, and even then I am not convinced. I feel like I must be missing something again, because this result seems to me in no way profound... although it certainly fits into the picture of the EPR 'paradox' and is a good demonstration of the validity of QM.  I guess the crux of my problem is that this 'area' really addresses wave function collapse and the problems it causes, but I don't see the need for some collapse mechanism to begin with... again I feel like I am missing something really fundamental.  Apologies if this is a bad question. I have had a look around and there are similar questions, but I don't feel that either of my points are addressed...


How install 14.04 to virtualbox with live CD as guest on mint 17

I have a dedicated mint 17 partition as well as VB downloaded. I also have 14.04 live CD and just need a sequence to install


I am considering purchasing a Mac for my godson who will be using it to run Blender 2.8.  I know very little about this program.  All I can find are requirements for a Mac that will run earlier versions of Blender.  Would someone please recommend a list of requirements for a Mac (or a link to a list of requirements) that I could use to find a model that can run 2.8?  Thank you in advance for all your help! Sincerely, M. Lap


My LibreOffice is not showing images. They look like this:  Can someone help?


Can't find question immediately after posting

Just posted a question here via iOS app - immediately I get an error that the question can't be found, it has been posted but I can't view - it the screenshot shows the error, with the post title behind it:


Why are Rin's classmates afraid of him in the first episode of Kyoto Fujouou-hen?

The first season of Blue Exorcist ended with Rin lauded by his friends. Even in the movie, they are still on good terms.  What happened between these seasons to make everyone afraid of Rin? They already knew him to be Satan's spawn... Is it shown in anime media, or only in the manga?


For this question $x$ satisfies $0 \leq x < \pi/2$  Prove that:  $1 \leq \sec x \leq 1 + \tan x$  I'm not sure how to start this problem.  I tried changing $\sec x$ to $1/\cos x$ and $\tan x$ to $\sin x/\cos x$ to get: $1 \leq 1/\cos x \leq 1 + \sin x/\cos x$ And then multiplying by $\cos x$ to get: $\cos x \leq 1 \leq \cos x + \sin x$  I'm not sure if that is the correct way to solve this and if it is, I don't know where to go from here.


How to download from a direct link using batch files and Google Chrome?

I want to create a batch file which is capable of downloading any files from direct links.  I already tried this:   chrome start http://dl2.romhustler.net/download/MTOeeo3FWffukwoWvagsXw/1430069124/psx_full/Dino%20Crisis%20%5BU%5D%20%5BSLUS-00922%5D.rar   The commands are all in the same line and I tried with quotes and without quotes.  I always get a Forbidden 403 error.  However when I copy and past the link in search bar the file starts downloading without any issue.  Is there any way to make this work?  I am using Windows 7 Ultimate 32-bit.


Let $A$ be an $n \times n$ matrix and let $\Lambda$ be an $n \times n$ diagonal matrix. Is it always the case that $A\Lambda = \Lambda A$? If not, when is it the case that $A \Lambda = \Lambda A$?  If we restrict the diagonal entries of $\Lambda$ to being the equal (i.e. $\Lambda = \text{drag}(a, a, \dots, a)$), then it is clear that $A\Lambda = AaI = aIA = \Lambda A$. However, I can't seem to come up with an argument for the general case.


How can I check if a variable (an int) is even (that is, not odd) in C without using "%" operator? I am running on linux platform.  Thank you.


Accessing scientific research papers post university

As part of my coping mechanism for leaving university and accepting the inevitable loss of scientific knowledge post university, I am considering subscribing to a scientific journal so that I can continue to learn and not completely lose touch.  However, there is not much on how I should best approach this. How does one chose the best journal? There are many out there and the subscriptions are not that clear on how they work.  I’ve looked online and some websites quote figures of over £1000 a year which is not feasible.     So what is the best way to access scientific research (i) online and (ii) in hard-copy form as an individual with no affiliation to an institute.


I am making a new PC and I am going to see if steam works on ubuntu before installing windows 10. Because in the past, Steam hasn't worked on my ubuntu engines. So if it dosen't work, I want to wipe the SSD and replace ubuntu with windows 10. Like ubuntu, can you wipe the disk and install in the windows setup?


Can i check at a time multiple api in jMeter?

I have started the JMeter in the mobile Application can I test the Multiple API at a time in Jmeter if yes then how can I check the output?


How do I "Enable Wi-Fi" on my toolbar if the option disappeared?

Hi so yesterday I was trying to update my wifi drivers but when I rebooted, the option to "Enable wi-fi" disappeared on my toolbar? How do I make it show up again?  I have Qualcomm Atheros QC6174a btw.  Thanks.


In one dimension, a function $f: I:= [a,b] \to \mathbb{R}$ is said to be of bounded variation if $$\mathrm{Var}(f,I):= \sup_{P}\left \{ \sum_{i=1} ^n \|f(x_i) - f(x_{i-1})\| : \mathrm{for} \; P:=\{x_0,\dots, x_n\} \; \mathrm{partition \; of \;} I \right \} < \infty.$$  In many variables, we have that a function $u \in L_{loc}^1(\Omega, \mathbb{R})$ is said to be of bounded variation if  $$\mathrm{Var}(u,\Omega) := \sup\left\{ \int_{\Omega} u\,\mathrm{div}\varphi \, dx:\varphi\in C_c^1(\Omega,\mathbb{R}^N), \|\varphi\|_{\infty} \leq 1 \right\} < \infty.$$ Where $\Omega \subset \mathbb{R}^N$ is a bounded domain (open and connected in $\mathbb{R}^N$).  Question. In the case of one variable, if we set $\Omega = I$ and $u = f$. How are these definitions equivalent?  My thoughts:    Since $\varphi\in C_c^1(\Omega,\mathbb{R}^N)$, then $\varphi$ is of bounded variation. then use Riemann Stieltjes integral, but I may need my function $u$ to be in $(C(I), \|\cdot\|_{\infty})$. Is $u$ in $(C(I), \|\cdot\|_{\infty})$ to write $\int_{\Omega} u \, d\varphi$?  Second, how is supremum over the partitions equal to the supremum over functions in $C_c^1(\Omega,\mathbb{R}^N)$ with $\|\varphi\|_{\infty} \leq 1$  Many thanks


Command to print the number of *.pdf files in a chosen directory

I am currently not on a Linux machine. Would the following command produce my wanted result?  ls | grep ".pdf" | wc


Can there be a perfect square whose digits consist of exactly 4 ones, 4 twos and 4 zeros in any order?

Is there any perfect square whose digits consist of exactly 4 ones, 4 twos and 4 zeros in any order?


Short story where a man discovers he's living in a fake world

I may be conflating two separate short science-fiction stories here, so please bear with me. I definitely read this more than 10 years ago and it's likely to be older than that (60's, 70's?)    A man wakes up one day to discover that the world is subtly different. His wife acts strangely and there's a weird "groundhog day" vibe.    He discovers that his house is actually made entirely of painted metal, including things that should be wood (a boat that he made by hand, for example). He comments that in the real world, it's the fact that stuff doesn't work properly that shows you that you're living in reality (a wobbly doorhandle may have been mentioned?) He's constantly beset by advertising; brands of washing powder, political messages, etc. and people keep asking him what he thought about them. At one point, the advertisers start getting very aggressive, literally invading his house to dirty his clothes and driving around with megaphones to shout slurs about their political competitors. He finally breaks out of the town (with the assistance of his secretary?) and they discover that they're...      ...actually robots living in a simulated town used by advertisers to test slogans, etc.   The final twist is that...     ...the town fits onto a desktop and is encased in glass. Even if he could escape, he could never live in the real world since he's very tiny.


Change Pivot Point Rotation Relative to Flat Face

I'm trying to export this Icosphere into Unity, but I want to have each poly be separate, with its own pivot point on its surface, and with the blue arrow on the manipulator widget facing out at 90 degrees from each poly, as if originating from the centre of the planet and passing through the poly. Currently every poly has the pivot point in the right place, but the orientation is wrong. How can I change this?


Need help with a definite integral $\int_0^{\infty} \frac{x-1}{\sqrt{2^x-1}\ln(2^x-1)}\,dx$

Evaluate: $$\int_0^{\infty} \frac{x-1}{\sqrt{2^x-1}\ln(2^x-1)}\,dx$$    I am not sure where to start or what should be the best approach towards this problem. I tried the substitution $2^x-1=t^2$ but that seems to make things more worse. Using this substitution, I got: $$\int_0^{\infty} \frac{1}{\ln^2 2}\frac{\ln\left(\frac{1+t^2}{2}\right)}{(1+t^2)\ln t}\,dt$$ I don't see how to proceed after this. :(  Any help is appreciated. Thanks!


What is the common term to refer to  someone who answers a question (written or spoken)?  Is answerer a correct term? If so, is it common? If not, what is the correct term to refer to such person?


Complex series that diverges at three points of $|z|=1$

Does there exist a complex series that the radius of convergence is $R=1$ but the series diverges at exactly three points of a set $\{z \in \Bbb{C} : \space |z|=1 \}?$   I found this exercise and I wonder how should it be solved. I know that in real analysis there exist such series that the radius of convergence is $1$ in the interval $X$ but the same series diverges at the endpoints of $X$. But it has only two points of divergence.   Can anyone show me the way?


Sausage left to thaw more than 2 hours - is this safe to eat?

I have a package of sausage that I intended to use yesterday. It was taken out of the freezer to thaw at about 4 o' clock. At 9 o' clock it felt fully thawed but we ended up putting it back in the refrigerator where it sits as we speak. When used the sausage is going to be baked in the oven for half an hour. Are we safe to eat this?


Linear independence of $\{1,\sqrt2,\sqrt3,\sqrt6 \}$ over $\mathbb Q$

We want to prove that $a+b\sqrt2+c\sqrt3 +d\sqrt6 =0$ where $a,b,c,d \in \mathbb Q$ such that $a=b=c=d=0$.  Can we prove that    there exists no linear combination of $1, \sqrt3, \sqrt6$ that gives $\sqrt2$ there exists no linear combination of $1, \sqrt2, \sqrt6$ that gives $\sqrt3$ there exists no linear combination of $1, \sqrt3, \sqrt2$ that gives $\sqrt6$ there exists no linear combination of $\sqrt2, \sqrt3, \sqrt6$ that gives $1$   Which would mean they are all linearly independent?  So for the first one, I would do suppose there does exist $a,b,c \in \mathbb Q$ such that $\sqrt2=a+b\sqrt3 + c\sqrt6 $ but we can minus $a$ from both sides and then square both sides, then we would get after rearranging: $$\sqrt2 = \frac{2+a^2 -3b^2 - 6c^2}{2a+6bc}$$ which can't be true so there is no linear combination.  And then do similar for the rest of the 3 parts I named?  This question is very linked to  but I decided to make a new thread because asking this is very lengthy as you can see.


How can I reduce the size of figures and/or the size of the final PDF document?

I usually include .pdf figures (vector graphics) in LaTeX files. The problem is that when I compile everything, the resulting file, which also has .pdf extension, is too large.  The size of the final PDF document is approximately equal to the sum of the size of the PDF document without figures plus the total size of the .pdf figures that are to be included.


What potions actually grant fame or glory, or put a stopper in death? Are there any?

‘You are here to learn the subtle science and exact art of potionmaking,’ [Snape] began. He spoke in barely more than a whisper, but they caught every word – like Professor McGonagall, Snape had the gift of keeping a class silent without effort. ‘As there is little foolish wand-waving here, many of you will hardly believe this is magic. I don’t expect you will really understand the beauty of the softly simmering cauldron with its shimmering fumes, the delicate power of liquids that creep through human veins, bewitching the mind, ensnaring the senses ... I can teach you how to bottle fame, brew glory, even stopper death – if you aren’t as big a bunch of dunderheads as I usually have to teach.’¹   Philosopher's Stone - page 102 - Bloomsbury - chapter 8, The Potions Master   Are there any canon potions that actually grant fame or glory, or stopper death? I'm looking for specific canon-based answers from sources such as the Harry Potter books, interviews with J.K. Rowling, or information from Pottermore. Maybe because it's early I'm overlooking the obvious, but offhand I can't think of any canon potions that fit this criteria exactly.   ¹I edited in the entire paragraph that I can teach you how to bottle fame, brew glory, even stopper death comes from for clarity. Hopefully this will be helpful and provide a better context for the comment in question.


In C/C++, are global variables as bad as my professor thinks they are?


Prove that any polynomial with integer coefficients must have a composite number in its image.

Let  $f \in \mathbb{Z}[x]$ be a polynomial of degree at least $1$. Prove that there is $n \in \mathbb{Z} $ such that the corresponding polynomial function $f(n)$ is not a prime.    I think that the task is to show that there is always an $n$ for any degree polynomial, that would give me a non-prime output. I was thinking I could make a case distinction for even and odd $n$, but this argument does not get me anywhere. Does anybody have small hint what would be a good direction to explore? the book gave the hint "Many ways to attack this. Think of something."  - which was really helpful, as you might imagine. $f(n)$ would have the form:  $$f(n)= a_0  + a_1 n + a_2 n^2 \dots $$


Let $\alpha,\gamma$ be ordinals and $A$ be a set of ordinals. Then $\gamma<\alpha+\sup_{\beta\in A}\beta\implies\exists\beta\in A:\gamma<\alpha+\beta$

Let $\alpha,\gamma$ be ordinals and $A$ be a set of ordinals. Then $$\gamma<\alpha+\sup\limits_{\beta\in A}\beta\implies\exists\beta\in A:\gamma<\alpha+\beta$$   This problem arises when I prove the theorem:     Let $\alpha,\beta$ be ordinals and $A$ be a set of ordinal. Then $\sup\limits_{\beta\in A}(\alpha+\beta)=\alpha+\sup\limits_{\beta\in A}(\beta)$   I'm almost done except for one minor point: $\gamma<\alpha+\sup_\limits{\beta\in A}\beta\implies\exists\beta\in A:\gamma<\alpha+\beta$. This result seems quite obvious, but I don't know how to prove in spite of several attempts.  Could you please shed me some lights on how to prove $\gamma<\alpha+\sup\limits_{\beta\in A}\beta\implies\exists\beta\in A:\gamma<\alpha+\beta$? Thank you very much!


I have problem using eclipse on Ubuntu 16.04 .It takes too much CPU and when I want to create or delete a project or a class , it takes a long time and eclipse goes not responding. This had never happened to me using windows or Ubuntu 15.10.


how to clone a specific subdirectory from git using eclipse

We have a git branch with huge number of java and SQL files (Approx. more than 50,000+ files). Cloning this branch to the local machine is taking too much time (Approx. more than 30 mins). Usually, we don't require the whole branch code, only need a sub-directory.   Please share some information, how to clone a specific sub directory from git using Eclipse.


Can I use an installed Xubuntu instance on two computers?

I want to install the latest LTS Xubuntu version (16.04) on an external SSD hard drive. This is what I'm planning to do:   Prepare a Xubuntu boot stick  Install the Xubuntu version on the new external hard drive   So now the question: Can I use this installed version as a boot stick on my laptop and on my tower PC as well?


Is it possible to write a label expression in qgis that displays the label at a given coordinate?

I am using the QGIS expression builder for the label properties of my data.  Is it possible to put different parts of the label in different coordinates on the map?  For instance I have a linestring and I would like to have "A" displayed in the beginning of the linestring and "B" in the end of it.


Can a 5e D&D character acquire multiple archetypes from the same class?

I have a player that wants to build a Dragonborn Outlander Ranger/Sorcerer, with Slaad as the first Favored Enemy.  The archetypes for the Sorcerer are Draconic Bloodline and Wild Magic. Being Dragonborn fits the Draconic Bloodline. And her backstory, in which she was used in a Slaadi ritual, fits rather well with the Wild Magic archetype. As such, the player would like both archetypes.  My thoughts are that I will simply let them Multiclass in Sorcerer twice, thus becoming Rang 3/Sorc (Dragon) 1/Sorc (Wild) 1. While I realize this goes against the standard rules, I can't see where it conflicts. So, my question is this: Are there any other guidelines for acquiring multiple archetypes within the D&D 5th edition class system that I am missing?


Nikkor 70-200 f2.8 VRII - Aperture not working?

My question is pretty straightforward: this lens' aperture stopped working for some reason. What could it be the cause?    Me and a friend of mine tried it in studio, attached to a D750, and when we selected f2.8, it didn't make any difference to f22. We tried other lenses and they all worked fine, and before you ask, yes we were shooting totally manual (time-priority or program modes).  1 month ago the lens worked perfectly fine on my D610 and the lens has never had problems of fungus, misuse, or whatsoever.


I have written some software which outputs .tex files and uses a custom .cls file. I have a makefile for this software but I don't know what to do with the .cls file.  Is ~/texmf/tex/latex/ the only location to store these files? I would prefer not to be creating directories in the users home directory. When I install other .cls files what location are they installed in? I can't find this information anywhere.


i am currently using win 7 and am planning on installing ubuntu alongside win7 but i have unable to do so. Previously i used to install ubuntu inside win using wubi but this time i wanted it as a native os . I have a 500 gb hd. c: win 7 (71gb capacity) d: some stuff (289gb capcaity ) e: (98 gb capcaity ) i want to install it in e drive. since it is having free space so it shrank the vol and created an un allocated space of 35gb for installing. while in ubuntu install process i choose something else and tried to choose 35gb partiton as to create root,boot and home partitions it wont select. all the drives c,d,f are in ntfs ...even while formatting wont show anyother option except ntfs


Why this nrf24l01 module has two VCC and two GND?

has two GND and VCC pins:    However,  and  only have one of each. Why is that?    EDIT: I know most MCU's have a lot of 3V3, 5V and GND pins. This is required for connecting the most varied peripherals simultaneously without exceeding max current output. But I have never seen a peripheral with this configuration. Since I never saw a MCU with only one GND and one VCC pin, and there is a lot of nrf24l01 modules with just one pin of each, I would like to know the purpose, since it's supposed that this module should be connected with only one MCU at a time.


De Broglie stated electrons can travel as particles and waves. Electrons show its waves properties when they can diffract through a carbon layer. So, I am not sure about his statement which human also can diffract through a gap.


I've come across the - more or less - following sentence in a book (American publisher):  "They have done it in the past"  I've always thought that "PAST" and "PRESENT PERFECT" can't go together. The proofreading for the book is generally rather poor so it might be a simple mistake. Or there's more to it, is there? Like the PresPerf is there to stress completion? Or - aware of the US tendency to replace PresPerf with Past Simple - the author tried too hard and ended up hypercorrect? Or am I reading too much into it?


Replace $ in terminal prompt with user@host when using SSH

I'm using Ubuntu Server over SSH, and I see $ instead of the name of the user (let's say test@desktop, for example).  How can I make the terminal display test@desktop instead of $?


Let be $u$ a numerical function defined over $\Omega$, with $u$ measurable, and let be $(O_i)_{i\in I}$ a family of all open sub-sets $O_i$ of $\Omega$, such that $u=0$ often in $O_i$. Let be $O = \cup_{i\in I}O_i$. Then $u=0$ often in $O$.  How I can be able to do this?.  I am beginning make ...  Let be $u$ defined than $0$ in $O_i\setminus M_i$ and $\neq$ $0$ in $M_i$, then   $O = \cup_{i\in I}O_i=\cup_{i\in I}[(O_i\setminus M_i)\cup M_i]$, ...  but I don't know how find the subset of $O$ such that have measure zero.


Is there a system for modeling insanity in d20 3.5?

I'm running a Dungeons and Dragons 3.5 (not Pathfinder) game, and I want to create a system by which players can use certain abilities, but at the cost of sanity and self-control.  Is there a system that models progressive, growing insanity through stat changes?  There would be other effects that are specific to the story, but those could be minor tweaks to the existing system.


When did '&' stop being taught alongside the alphabet?

I've just discovered that "&" was considered the 27th letter of the alphabet, being part of alphabet songs.  It was easy to discover its history (the information on the website  is repeated on many other websites), but nowhere have I found a reference to why and when it was dropped out of the alphabet.   I can only guess it was dropped out because it represents a whole word rather than a sound, but I still can find no references as to when that happened.    EDIT  This question isn't a duplicate of  because that question is about how '&' could have been considered a letter and become part of the alphabet.  Yes, the answers to that question (and the first answer to my own question) helped me understand that ampersend was never truly considered a letter, nor was it ever a true part of the alphabet (though I suspect children may have thought of it as its 27th letter). Just... something annexed to it?  Following that new knowledge, I adjusted the question: when did '&' stop being taught alongside the alphabet?


Can I put a road bike tyre on a mountain bike?

I am finding it difficult to ride a Mountain bike, I feel that it may be more comfortable to change the tyre to that of a road bike, which are thinner in size.  Please advise if I can do so.


Does the angular momentum always point along the axis of rotation for rotation of a rigid body about an arbitrary axis?

I'm looking to evaluate whether the following is true or false:     For rotation of a rigid body  about an arbitrary axis, the angular   momentum always points along the axis of rotation.   Let:  $$r = x \hat i + y \hat j + z \hat k$$ and  $$ v = v_x \hat i + v_y \hat j + v_z \hat k$$  Then, the angular momentum is defined as:  $$\vec L = \vec r \times  m\vec v$$  $$r \times v = (yv_z-zv_y)\hat i - (xv_z-zv_x)\hat j + (xv_y-yv_x) \hat k$$  $$L = m \left((yv_z-zv_y)\hat i - (xv_z-zv_x)\hat j + (xv_y-yv_x) \hat k\right)$$  Here, $L$ is not along a principle axis, but has $3$ components. If the particles rotating exhibit $v_x,v_y$ or $v_z = 0$, it is plain to see $L$ is now on one principle axis. However, it isn't clear to me that if $L$ has $3$ components that it doesn't still point along the axis of rotation. Maybe the axis of rotation has $3$ components as well?   Basically, I think my confusion boils down to whether angular momentum's vector determines the axis of rotation (which I think would make sense since it's proportional to $\omega$) which would make the statement true, however, it doesn't seem impossible to me that the axis of rotation and angular momentum can not necessarily be parallel.


What are my options when I see a way too minor suggested edit approved?

Obviously, this suggested edit should never have been approved. Because it's very, very minor.  Is it acceptable for me to "rollback" this edit? Does the suggested editor lose the +2 rep when I roll it back? Should I comment on one of his questions, explaining not to make too minor edits like this?  Is there anything I should do to notify the reviewers that approved  too minor suggested edit?


I am trying to move very big file from one host to another host. Also the file names are too large so I have to use xargs. Also all the sub directories need to be copied also  I am using the below command in the source host current directory  find . -name "*" -type f -print0 | xargs -0 scp -r UserName@host:/path/to/destination   but it is throwing below error  scp: /path/to/destination: not a regular file


asymptotic p values of standard normal distributed ? how to calculate them?

I do have an estimator which have an asymptotic standard normal distribution under the null hypothesis .How to calculate the asymptotic p values ?


Let $V$ be a finite dimensional vector space.  I'm trying to see if any subspace $A$ of $V^*$ must be an annihilator of some subspace in $U$ of $V$.  I.e. I'm trying to see if $A=U^0$ for some subspace $U\subseteq V$.  So first I let $A$ be a subspace of $V^*$.  Then I denote the set of all $v\in V$ such that $\phi(v)=0$ for every $\phi\in A$ by $U$.  Lemma: $U$ is a subspace. Proof: Clearly $0\in U$.  Let $u,v \in U$ and $\lambda \in \Bbb F$.  Then for every $\phi \in A$ $$\phi(u+\lambda v) = \phi(u) + \lambda\phi(v) = 0 \implies u+\lambda v\in U$$  So $U$ is indeed a subspace of $V$. $\square$  Because $V$ is finite dimensional, so is $V^*$ and thus $A$.  Let $\{\phi_1, \dots, \phi_k\}$ be a basis for $A$.  Let $u\in U$.  Then $\phi_i(u)=0$ by definition.  Thus $\phi_i\in U^0$ for all $i=1,\dots k$.  So $A\subseteq U^0$.  So the only part that I still need is to show the reverse inclusion or that $\dim A = \dim U^0$.  But I can't figure out how to do it.    Here are my problems with the duplicate question (or more specifically its answers):   user218931 uses the double dual which is introduced in a later exercise. Rafael Deiga uses $\dim(\operatorname{null}\phi_1 \cap \cdots \cap \operatorname{null}\phi_m) = \dim V-m$ which is proven in a later exercise. Aweygan uses some functional analysis theorem called the Hahn-Banach theorem.   So all of the answers use tools that I don't currently have in my mathematical toolkit.  And yes, I realize that there's nothing theoretically wrong with using a result from later in the problem set as long as the proof of that result doesn't rely on this one, but I feel like Axler wouldn't have written out the exercises so that you needed to do that.  So to me it feels sorta like cheating to do them out of order.  Does anyone see a way to finish this problem without using the above three results?


How do I prove this sum is not an integer

Assume that $k,n\in\mathbb{Z}^+$. Prove that the sum \begin{equation*} \dfrac{1}{k+1}+\dfrac{1}{k+2}+\dfrac{1}{k+3}+\ldots +\dfrac{1}{k+n-1}+\dfrac{1}{k+n} \end{equation*} is not an integer.   The case $k=0$ is proved in this question: ""


Extending a function $f$, from the border of a closed cell to the border to another closed cell, to $F$, from the closed cell to another closed cell

The question and my solution, where do I get from here? We can start with a


Is "We all know running has health benefits" correct English?

"We all know running has health benefits" isn't how I would write the sentence (I'd probably say "We all know that running offers many health benefits"), but is it formally incorrect?  I want to say that you really need the "that" after "we all know," but I'm not sure.


Accepting 2 postgraduate university offers

I have received a conditional offer from the University of Birmingham and an unconditional offer from the University of Leeds for a masters degree in marketing, both programs are great but I have a deadline to accept Birmingham's offer so I was wondering if I could accept both offers and then decline one of them.


What will happen if I flash the Pixel Android P Device image on my Nexus 6P?

I just finished watching the Google I/O 2018 keynote and boy did it get me hyped up about Android P! For the last half hour or so I've been scouring the internet looking for some way to flash the latest preview using the Pixel system images here:   Only problem? I don't own a Pixel device. All I've currently got on my hands is a Nexus 6P which Google recently dropped support for and made no mention of during the keynote.   Which leads me to my question: What will happen if I flash the Pixel Android P preview device image on my Nexus 6P? Will this brick my phone, or will everything still run ok? Now, realistically, I'm not trying to find out if someone has already tried this (duh), but I was hoping someone with a bit more knowledge could tell me if this is even remotely possible.


do quantum fields exist in superposition?

Wikipedia states in QFT all fields generally exist in superpostion. Is this correct? So my question is in quantum field theory, are the fields in quantum field theory existing persistently in superposition? or are there times they don't? If they do, would it prove Many worlds interpretation of quantum mechanics?


What is it called when you use quotation marks to signify repeating a word or phrase?

For example, let's say I'm copying instructions by hand. The original instructions say:        Multiply the first by the second   Integrate the third with the fourth   Integrate the third with the fifth      And on a page I write:        Multiply the first by the second   Integrate the third with the fourth   "" with the fifth      I know this example is silly, but hopefully it's clear what I mean.  What is this called?


Is there a way to print several PDF files at once?  I have a bunch of individual files that I want to print (about 42).  Printing each one is tedious.  Does anyone know a way to print a whole series at once?  Maybe something like a PDF reader with a "Print All" function?  I ask because this isn't the first time I've run into this problem and have never been able to find a good solution...


How can I add/remove the class of s that are generating dynamically?

I am creating a dynamically generated html
 in jquery which has some
 elements in it. I want an active class be added to any of the
 elements by hovering. I've tried some functions in jquery but it won't change
 elements, it will only work if I try it on
 element. Here is my html code:

    My Javascript code:   $.ajax({         url: myURL,         method: "GET",         headers: { "Accept": "application/json; odata=verbose" },         success: function (data) {             if (data.d.results.length > 0) {                 AllTask = data.d.results;                 html = '';                              for (var i = 0; i < Number(AllTask.length); i++) {                     html += '
';                     html += '

';                     html += '';                     html += '
' + AllTask[i].Title + '
';                     html += '
' + AllTask[i].meeting_place + '' + JDate + '

';                                      }  document.getElementsByClassName('meeting_lists')[0].innerHTML = html;    and my jquery function:   $(".all_session_section  ul > li").hover(   function () {     $(this).addClass("active");   },   function () {     $(this).removeClass("active");   } );    if anyone can help me with this, I would really appreciate that.


Place a bounty to reward an answer on a duplicate (closed) question

Proposal: Allow bounties on questions that are marked as duplicate, which may have valuable answers.  (or make duplicate questions not having the status 'on hold')    Motivation:  It regularly happens that a closed question has a really good answer. This particularly occurs with questions that are marked as duplicate (questions without intrinsic problems and that may have received good answers before being closed).  Therefore it might occur that a person wishes to place a bounty on the question to reward an existing answer or bring attention to it. However this is not possible under the current system. A duplicate question is a closed question.   This closed status has the undesirable side-effect that the answers given to that question are treated as second class content which can not receive bounties (but also the site does not direct to them, closed questions refer to the parent duplicate question but the other way around does not occur, there is a 'linked' and 'related' list but they are much less visible and in some interfaces, like phone, they do not appear).  Of course one might argue that questions can be merged (or get rid of the on hold status, or repost the answer on the duplicate). But merging would destroy the duplicate (and duplicates are also considered useful). In addition, duplicate questions may be different enough that you can not merge them, or at least it involves a lot of noisy bureaucracy and discussion.    Practical example case, sketch of situation:  I have searched for duplicate questions with bounties (). I found not so many but it did actually show up an answer of my own. .  I believe that this is a good example case where the closed question is still valuable and maybe shouldn't be closed for that reason (yet the 'duplicate link' is still useful). Also, the answer would not be suitable under the duplicate question and merging is not appropriate. The question is duplicate but asked in a very different way and with a different viewpoint angle in mind.


What is the difference between a gameplay programmer and a game designer/developer?

Gameplay programmers write game code, but so do game designers and developers. Where is the line drawn? What skills do gameplay programmers use that game designers or developers do not?


Why is there a shift between OpenLayers and vector layer in print?

Sorry for my poor english. I'm a very recent user of QGIS (QGIS 1.8; ubuntu 12.04). Does anybody knows why the .tif or .jpeg or .pdf files I generate with the QGIS composer have different layers completely shifted?  For example, 2 layers: 1 open street map landscape and 1 layer of my GPS points. In the composer window, the points are exactly at the right place, the map is nice and ready to be saved or printed...  But when I do export to pdf or .jpeg or .tif the picture that I obtain shows the map very small in a corner and the GPS point in the middle of a white picture. When I try to print, a white sheet of paper is produced.  Any ideas?  thank you very much


Netflix desktop doesn't launch when I click on it

I would like to be able to watch Netflix on Ubuntu, but on the website it doesn't let me do so. I also attempted to download netflix-desktop but when I click the icon it doesn't do anything.  Thank you.


"Not an answer" flag declined with "This is NOT spam. Use 'not an answer' for this."

This is the answer that was flagged:         Is this because of another user flagging this as spam, and the tool for community moderator doesn't allow for flexibility in declining flags?


How do I grant sudo privileges to an existing user?

I want to grant a newly created user sudo privileges in Ubuntu.  I tried  sudo adduser hduser admin   but it says no admin group exists. How can I do it?


i have to insert till 30000 record from delphi into MsAccess database using DAO. with normal insert into this take a lot of time > 10 minutes... I've read there is a procedure to insert directly from txt file (using adoCommand) but i don't understand how to made it.  Someone can help me?  Thank you for your help


Ubuntu 21.04 Unknown owner:group of /run/usr/1000/doc - Even root don't have permissions

While executing sudo updatedb, I stumbled upon: /usr/bin/find: '/run/user/1000/doc': Permission denied /usr/bin/find: '/run/user/1000/gvfs': Permission denied  So I did sudo su and tried to cd into it, but surprisingly even as root I couldn't access Here is the listing of the parent dir: root  PC  /run/user/1000  ls -lah ls: cannot access 'doc': Permission denied ls: cannot access 'gvfs': Permission denied total 8.0K drwx------ 13 kolimnared kolimnared 480 May  9 18:45 . drwxr-xr-x  3 root       root        60 May 10 07:35 .. srw-rw-rw-  1 kolimnared kolimnared   0 May  9 18:17 bus drwx------  3 kolimnared kolimnared  60 May  9 18:17 dbus-1 drwx------  2 kolimnared kolimnared  60 May 10 14:40 dconf d?????????  ? ?          ?            ?            ? doc prw-rw-r--  1 kolimnared kolimnared   0 May  9 18:17 gnome-session-leader-fifo drwx------  3 kolimnared kolimnared  60 May  9 18:17 gnome-shell drwx------  2 kolimnared kolimnared 140 May  9 18:17 gnupg d?????????  ? ?          ?            ?            ? gvfs drwx------  2 kolimnared kolimnared 260 May 10 14:35 gvfsd -rw-------  1 kolimnared kolimnared 302 May  9 18:17 ICEauthority drwx------  2 kolimnared kolimnared 120 May  9 19:35 keyring -rw-------  1 kolimnared kolimnared  92 May  9 18:17 .mutter-Xwaylandauth.SE7U20 srw-rw-rw-  1 kolimnared kolimnared   0 May  9 18:17 pipewire-0 -rw-rw----  1 kolimnared kolimnared   0 May  9 18:17 pipewire-0.lock srw-rw-rw-  1 kolimnared kolimnared   0 May  9 18:17 pk-debconf-socket drwx------  2 kolimnared kolimnared  80 May  9 18:17 pulse srw-rw-rw-  1 kolimnared kolimnared   0 May  9 18:17 snapd-session-agent.socket drwx------  3 kolimnared kolimnared  80 May  9 18:17 snap.snap-store drwxr-xr-x  6 kolimnared kolimnared 160 May  9 18:17 systemd -rw-------  1 kolimnared kolimnared   0 May  9 18:18 update-notifier.pid srwxrwxr-x  1 kolimnared kolimnared   0 May  9 18:17 wayland-0 -rw-rw----  1 kolimnared kolimnared   0 May  9 18:17 wayland-0.lock  My wild guess is, that this is bug in the newly released 21.04... Any Ides, what could cause it, or how to fix it?(I mean... except rm -rf /* :) )


Does a finally block always get executed in Java?

Considering this code, can I be absolutely sure that the finally block always executes, no matter what something() is?  try {       something();       return success;   }   catch (Exception e) {        return failure;   }   finally {       System.out.println("I don't know if this will get printed out"); }


Solving a transcendental equation using Lambert's W function

I found that transcendental equations with this structure:  $$\ e^{-cx}=a_0(x-r_1) $$  Have this kind of Lambert-W-based solutions:  $$\ x=r_1 + \frac1c\ W \left(\frac{\ ce^{-cr_1}}{a_0}\right) $$  What is the procedure to proof that this is true? I would be thankful if you may help me figure this out.  The formulae were retrieved from:


Can a power supply be too powerful for a device assuming that the power supply is at operating voltage of the device?

Let’s say a device’s operating voltage is 5V and maximum current that it can draw is 5A.  Is it possible for a 5V power supply to have very low internal resistance such that a device that operates at 5V turns down its resistance in attempt to draw 5A from the power supply , but instead accidentally draws greater than > 5A due to the power supply having very low internal resistance or being “too powerful” ?  Of course this is assuming that the way a basic electronic device draws current is first, it assumes that it is being supplied the correct voltage, and 2nd, it lowers down its resistance at some constant number base on the current it needs to draw  Is this how regular devices such as servo motors draw current? Or can they actually monitor how much current a power supply can give and lowers its resistance base on that?  I know that it is possible to be at operating voltage and still not supply enough current, but could it be possible to be at operating voltage, and supply too much current for a load?    Wait Unless of course, as long as the voltage across the load is less than or equal to the operating voltage, it can never accidentally draw too much current. ( I think I answered my own question, not sure if this is right )


This question:     I cannot remove tag because I get error "title must be at least 15 characters long." Then how was it posted in the first place?


How to make Sapling addon settings reappear?

The menu for settings disappears when I click on another menu. How do I make it visual again?  When modeling trees with the Sapling add-on, if I click Undo the settings disappear for the Sapling add-on.


Calculate exact value of and infinite sum

Im trying to find the exact value of the infinite sum :  3 + 1/3 + 1/27 + 1/243 + 1/2187 + ...  I can see that to generate new terms we take the previous term and divide by 9 or multiply by 9. Not exactly sure if one way or the other makes it any easier. This is what i have come up with to solve the series is this correct and where do i go from here?  $\sum_{k=3}^\infty= K_0 + K_n(1/9)\\ $


I'm using Google calendar, and I subscribe to my Google Calendar from multiple computers.  Whenever I set an event with (an) email reminder(s) on Google calendar, I'll get multiple emails because (1) Google calendar itself sends me the email reminder and (2) each computer that subscribes the calendar tries to send the email reminder (when the computer wakes up).  It's very annoying.


How to prove that $4^m + 5^m$ is divisible by 9 when m is an odd number

I am trying to use congruence theorems, specifically Euler's Theorem for a proof.


Connotations of trite, passé, and cliché

What are the differences between trite, cliché, and passé? They seem to all have a similar denotation, but what are the subtleties of their connotations?  The only difference I really see is that cliché is an expression that has become trite or passé, whereas trite and passé can be related to anything, e.g. ideas, words, fashion, etc.  I’d love to hear your thoughts.


On my friend's Ubuntu 12.10 (Unity) laptop, there is no longer an option to connect to a wireless network. It used to work. He doesn't know what caused it to go away, but does anyone know how to get it back?   More info:   See the screenshots below No wlan things show up when you run iwconfig Laptop is HP ProBook 6550b


Why does a positively correlated variable have a negative coefficient in a multiple regression?


Is it possible to pass properties as "out" or "ref" parameters?

Can I pass a property as an "out" or "ref" parameter if not then why not?   e.g.  Person p = new Person();    . . .  public void Test(out p.Name);


Is the sentence "I want to take a rest" wrong?

I heard that we should use "I want to rest" instead of "I want to take a rest."    I also heard that "I want to take a rest" is not a sentence a native speaker would use.  Is that correct? Should we prefer "I want to rest" to " I want to take a rest"?   Could you please confirm if this is true, and explain “why”.


Difference between creating a driver object using WebDriver driver = new FirefoxDriver() and FirefoxDriver driver = new FirefoxDriver()?

We can create a driver object using the following ways.  WebDriver driver = new FirefoxDriver();  FirefoxDriver driver = new FirefoxDriver();   FirefoxDriver is a class that is implementing WebDriver Interface.  In the first statement we are using the interface name and in the second one we are using class name. Is there any difference between the two like we can't access some methods etc.?  I looked for this question on stackoverflow and found that first one is dynamic binding and second one is static binding but is there any real difference between the two declarations above?  If we don't have any difference why we should have two declarations?  Can someone answer this please?  Thank you.


How do I pass in a variable with an exclamation mark in it? PHP

I'm working on a database login system in PHP but one of my users has an exclamation mark in his password which breaks it, The line where it says ($password = $_GET['p'];) is where the password gets passed in  $username = $_GET['u']; $password = $_GET["p"]; function userLoginIpb($username, $password) { //select the password information froms elected user           $query = mysqli_query($GLOBALS["___mysqli_ston"], "SELECT `members_pass_salt`, `members_pass_hash` FROM `members` WHERE `name` = '$username'");           $results = mysqli_fetch_assoc($query);           $password = md5(md5($results['members_pass_salt']).md5($password));           if ($password == $results['members_pass_hash']) {               return true;           } else {               return false;           }


I'm trying to find any kind of software that allows you to change the tint of your screen. I've seen redshift and f.lux, but they're not exactly what I'm looking for - both of them shift with the time of day and only offer a red colouration, whereas I'm looking for something that holds the colour permanently and which has a wide variety of colours.  A Windows example of what I'm looking for is , from the ClaroRead software bundle.  Is there anything like that that exists for linux?


Do I need a transit visa at Dubai International Airport (DXB) for an international connection

I am a Pakistani national and need to transit through Dubai International Airport (DXB).  I am not planning to leave the airport and both of my flights (arrival and departure) are from Terminal 3.  I am pretty sure that I do not need transit visa at the DXB, however it is no where mentioned on any of their official website.   Can anyone please provide me such a link stating that transiting without leaving the airport does not require visa at DXB, as I need to use this link as a proof for a visa application?  Thanks


I have a content which is text mixed with json  blablabla  bla bla  sdf sdfsdfsdf {     "glossary": [{         "title": "example glossary",         "GlossDiv": {             "title": "S",             "GlossList": {                 "GlossEntry": {                     "ID": "SGML",                     "SortAs": "SGML",                     "GlossTerm": "Standard Generalized Markup Language",                     "Acronym": "SGML",                     "Abbrev": "ISO 8879:1986",                     "GlossDef": {                         "para": "A meta-markup language, used to create markup languages such as DocBook.",                         "GlossSeeAlso": ["GML", "XML"]                     },                     "GlossSee": "markup"                 }             }         }     },     {         "val":2     }] } dd dfsdfsdf bla blablablabla   I want get json from the string, so I use this regexp  \{(.|\s)+\}   It gives me (checked it on ):    Full match with my correctly found json Empty group   I don't understand what causes the empty group to appear


Java TextField getText() give me a string that I can't compare

I would like to control when a string form my textfield is empty or not. Here there's the code with a simple Swing interface:  import java.awt.*; import java.awt.event.*; import javax.swing.*;  public class Try{  public static void main(String[] args) {     JFrame frame = new JFrame();     JPanel panel = new JPanel();     panel.setLayout(null);     JTextField text = new JTextField();     JButton button = new JButton("ok");     button.addActionListener(new ActionListener(){         public void actionPerformed(ActionEvent e){             String get = "";             get = text.getText();             if ( get == "" ) System.out.println("Is not empty");             else System.out.println("Is empty");         }     });      panel.add(text);     text.setBounds(0, 0, 50, 20);     panel.add(button);     button.setBounds(60, 0, 50, 20);      frame.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);     frame.setSize(100,100);     frame.getContentPane().add(panel);     frame.setVisible(true);   } }   but also if you fill something in the texfield and then push the ok button, the if goes always on "is empty" ... so, the if is always false  What's wrong?!


Is it correct to say "people having money" instead of "people who have money"? I.e. is it OK to use "having" as the opposite to "without"? In my opinion it is OK but a colleague of mine believes that it is wrong to use "have"+ing.


What will be the summation formula for the following series:  1+1/2+1/3+...............+1/n   Also, I am looking for a place online where I can get all list of such forumals, where I can get one please? Thanks.


Could you recommend a good source of presets for Lightroom?


Can we say that $\left(a+b\right)^{\alpha}>a^{\alpha}+b^{\alpha}$ for all $a,b>0$ and $\alpha>1$?

For $\alpha\in\mathbb{N}$ we can use the Binomial and get: $$\left(a+b\right)^{n}=\sum_{k=0}^{n}{n \choose k}a^{k}b^{n-k}=\sum_{k=1}^{n-1}{n \choose k}a^{k}b^{n-k}+a^{n}+b^{n}>a^{n}+b^{n} $$  But what about rational and irrational powers?  Respectively, can we also say that $\left(a+b\right)^{\alpha}<a^{\alpha}+b^{\alpha}$ for all $\alpha<1$?


How are quantum computers more powerful than classical computers?

I feel the answer to this question is just out of reach - I "understand" the implication that a quantum computer uses all combinations of bits simultaneously compared to a classic computer, and that clearly gives a huge boost to processing times, however I'm struggling to quite grasp how. I watched  on quantum computing in which the gentleman said that a 300 qubit QC would be more powerful than a regular PC with one bit of memory for every atom in the universe. They also mentioned that Google have created a QC with 53 qubits. So to try and get my head around it, I decided to compare this to my PC. Forgetting memory needed for anything other than storing combinations, if I have 16GB of RAM available, that's 217'179'869'184 possible combinations, or ~57 million lots of 53 bits (with each one in one specific combination). So for each cycle of combinations, my PC is able to hold ~57 million combinations of 53 bits, and if my PC is running at 4.1GHz, that's 7.0E+19, or in the region of 266 combinations per second. Now I have a good PC, but it seems to be reasonably on a par with Google's quantum computer, which just seems wrong. I know that I've not used an exact science to calculate things but I can't follow where I've screwed up the maths? The claim for the 300 qubit QC I also can't follow with the above logic. As excel won't work with stupidly large numbers I tried to do this on paper, so bear with me: There are 10E+80 atoms in the universe, so this number of bits would give 2(10E+80), or 2800 combinations. An unholy number that no-one could possibly comprehend. For the QC there are 300 qubits or ~28 therefore one could store 2792 combinations at any one time, which is already way above the 2300 combinations available to a 300 qubit QC..?


I know someone or the other has asked about disabling ⌘Q, but I like the shortcut, and I use it often. However, I use an email client called Airmail that unfortunately does not keep a service (for notifications) running in the background when it is quitted. However, if I press the close button a service runs in the background, allowing me to receive notifications.  But since I have a habit of pressing ⌘Q all the time to close apps, I was looking into a way I could disable it for only Airmail.  Anyone know of a what to do this?


Possible Duplicate:          I've coded something like this:  public bool IsDataChanged() {                T value1 = GetValue2;     T value2 = GetValue1();      return (valueInDB != valueFromView); }   Right now the function doesn't compile with the error "Operator '!=' cannot be applied to operands of type 'T' and 'T'". What do I have to do to make this function work ?


Prove by induction: Find a, and prove the postulate by mathematical induction.  $$\text{For all}~ n > a,~ n! > n^3$$  Where ! refers to factorial.  So far I've done a bit of it, I'll skip right to the inductive statement and assume that $k! > k^3$, then try to prove $(k+1)! > (k+1)^3$  Inductive statement: $(n+1)! > (n+1)^3$  $(n+1)^3= n^3 + 3n^2 + 3n + 1 < n! + 3n^2 + 3n + 1$ (By Induction Hypothesis)  ...But now I'm stuck. Does anyone know where to go next?


I'm trying to add basic materials to a low-poly model, and was curious if there was any way to cut in edges in a circle from a single point, so I could apply materials to faces like seen in my reference image to the right. I could go through with the knife and make cuts by hand, but that seems tricky and time consuming for likely sloppy results. Any tips on how to achieve the texture pictured would be greatly appreciated.  The OP wrote in a comment:  I'm looking for a way to add edges without changing the mesh, just so I can apply materials to faces to color.


i have this code:  try {         String mode = readFile("fullScreen" , "0");         if(mode == "fullScreen"){             fullScreenBox.setSelected(true);         }else{             fullScreenBox.setSelected(false);             System.out.println(mode);         }      } catch (URISyntaxException e) {       // TODO Auto-generated catch block       e.printStackTrace();      }   the code Reads a File with name "fullScreen" if its not exists returns "0" i set an if statement. The file inside right "fullScreen" and i have a println over there to check it and indeed i get the word "fullScreen" but the program do the nagitave action.  what should be the error.  The problem is that i'm using the readFile and also if statements with other files in the same folder and works fine.


how many ways can the letters in ARRANGEMENT can be arranged

Using all the letters of the word ARRANGEMENT how many different words using all letters at a time can be made such that both A, both E, both R both N occur together .


writing my research proposal, have trouble to define the reference section at the end of the my latex file, I export .bib file from JabRef, and the Latex upload the .bib file well, but when I run the Latex I don't see the Reference section at the end, however I haven't cited any reference in the passage. I have run the Latex several times haven'y seen the ref section yet. When I cite a ref in the passage, in the output pdf file it gives me the question mark.  This is how I call the *.bib file   \bibliographystyle{plain} \bibliography{Research Proposal}


Is it possible to launch Chrome in kiosk mode in Windows 10 without showing the desktop?

I cannot find a reliable solution to start chrome (in kiosk mode) in Windows 10 at system startup, without showing the desktop environment.  More precisely, i CAN start Chrome in kiosk mode, but it takes a lot of time on our target devices (Industrial tablets) so whenever the device get rebooted, end users can see the desktop environment for 10-11 seconds.  Is it worth to try playing with chrome flags? i tried to disable some unused features but startup time doesn't change that much.  Windows Kiosk mode seems to work only with other browsers (IE) and the app i need to launch requires chrome, so I don't have many choices...  I cannot run chrome with the Windows Kiosk Mode because chrome is not compatible (not UWP), so I am just auto logging in the user, starting chrome at startup with the following flags:  "C:\path\to\chrome.exe" --kiosk --incognito --disable-pinch "file:\\C:\path\to\app.html"


How to search based on part of file name in Google Drive

I'd like to be able to find all files in my Google drive that contain the string "_INSTRUCTION_" in the file name. Is there a way to do this?  EDIT 1: When I search for "RMA2013", I should get a dropdown with several options. As you can see, there are several Word and .pdf files with the phrase "RMA2013". Still I get no dropdown help:   And even if I click the search button, I get nothing:


canonical-livepatch, Doesn't seem to patch anything

When I ssh into the server it says:  11 packages can be updated. 11 updates are security updates.   Then I verify that everything is installed:  canonical-livepatch status --verbose   And this is what I get:  client-version: 9.3.0 machine-id: xxx machine-token: xxx architecture: x86_64 cpu-model: Intel(R) Xeon(R) CPU E3-1246 v3 @ 3.50GHz last-check: 2019-05-15T18:08:12Z boot-time: 2019-05-11T10:06:52Z uptime: 104h34m56s status: - kernel: 4.15.0-48.51-generic   running: true   livepatch:     checkState: checked     patchState: nothing-to-apply     version: ""     fixes: ""   So there is nothing to apply? How about those 11 security updates then?  UPDATE:  As requested this is the list of upgradeable:  apt list --upgradable    intel-microcode/bionic-security,bionic-updates,bionic-updates,bionic-security 3.20190514.0ubuntu0.18.04.2 amd64 [upgradable from: 3.20180807a.0ubuntu0.18.04.1] libwbclient0/bionic-security,bionic-updates,bionic-updates,bionic-security 2:4.7.6+dfsg~ubuntu-0ubuntu2.10 amd64 [upgradable from: 2:4.7.6+dfsg~ubuntu-0ubuntu2.9] linux-generic/bionic-security,bionic-updates,bionic-updates,bionic-security 4.15.0.50.52 amd64 [upgradable from: 4.15.0.48.50] linux-headers-generic/bionic-security,bionic-updates,bionic-updates,bionic-security 4.15.0.50.52 amd64 [upgradable from: 4.15.0.48.50] linux-image-generic/bionic-security,bionic-updates,bionic-updates,bionic-security 4.15.0.50.52 amd64 [upgradable from: 4.15.0.48.50] linux-libc-dev/bionic-security,bionic-updates,bionic-updates,bionic-security 4.15.0-50.54 amd64 [upgradable from: 4.15.0-48.51] python3-distupgrade/bionic-updates,bionic-updates,bionic-updates,bionic-updates 1:18.04.32 all [upgradable from: 1:18.04.31] ubuntu-release-upgrader-core/bionic-updates,bionic-updates,bionic-updates,bionic-updates 1:18.04.32 all [upgradable from: 1:18.04.31]


UK Visa Application For Family From Nigeria

I want to know the process to follow if I want to apply for a 6 month UK visa for myself, wife and children. Do I have to fill separate forms for each person and do I have to pay separately for each person including children under 8 years old?


How do I change the default session for when using auto-logins?

When autologon is active, lightdm will start the Unity 3D session, not the 2D (or any other shell that I want to auto-login to).  Is there a way to start the shell I want automatically (autologon)?  Anyway, if autologon is disabled, the last used session is launched, and that's fine. I just want to choose which is default with autologon.


Site-only or Global Moderators? + Moderator privileges?

Out of curiosity, I'm just asking if a moderator is global or site-based. In other words, will a moderator only moderate a specific site or moderate all SE sites? And is there any privileges for moderators (e.g. Gain lots of reputation instantly)?


Best conditional statement for many instances python

I am writing a program in python that responds to about three different messages based on content in an if: elif: else: format. I plan to expand this script to numerous (possibly over 100?) different options to which it will respond accordingly. A continual if: elif: elif: elif: elif: ... else: seems like very poor coding to me, and maybe I should use a switch statement? Wondering what the community thinks is the best way to go about it. Maybe theres a better way I'm not thinking about.