Define $I_n=\int_0^1\frac{x^n}{\sqrt{x^2+1}}dx$ for every $n\in\mathbb{N}$. Prove that $\lim_{n\to\infty}nI_n=\frac{1}{\sqrt 2}$.

Question: Define $I_n=\int_0^1\frac{x^n}{\sqrt{x^2+1}}dx$ for every $n\in\mathbb{N}$. Prove that $$\lim_{n\to\infty}nI_n=\frac{1}{\sqrt 2}$$.    My approach: Given that $I_n=\int_0^1\frac{x^n}{\sqrt{x^2+1}}dx, \forall n\in\mathbb{N}.$ Let us make the substitution $x^n=t$, then $$nI_n=\int_0^1\frac{dt}{\sqrt{1+t^{-2/n}}}.$$  Now since $0\le t\le 1\implies \frac{1}{t}\ge 1\implies \left(\frac{1}{t}\right)^{2/n}\ge 1 \implies 1+\left(\frac{1}{t}\right)^{2/n}\ge 2\implies \sqrt{1+\left(\frac{1}{t}\right)^{2/n}}\ge \sqrt 2.$   This implies that $$\frac{1}{\sqrt{1+\left(\frac{1}{t}\right)^{2/n}}}\le\frac{1}{\sqrt 2}\\ \implies \int_0^1 \frac{dt}{\sqrt{1+\left(\frac{1}{t}\right)^{2/n}}}\le \int_0^1\frac{dt}{\sqrt 2}=\frac{1}{\sqrt 2}.$$  So, as you can see, I am trying to solve the question using Sandwich theorem.   Can someone help me to proceed after this?   Also, in $$\lim_{n\to\infty}nI_n=\lim_{n\to\infty}\int_0^1\frac{dt}{\sqrt{1+t^{-2/n}}},$$ the limit and integral interchangeable?


How to do one-way hashing of an ASCII string using standard functions of Delphi?

I'm new in Delphi.I'm trying to make a one-way hashing of an ASCII string.  Is there any way to encrypt ASCII string without adding Indy or any other Cryptography library to the project And just by standard functions ?  if there is any way to use windows API , How i can do that ?  if it is possible , please give me an example.


Would Thanos include himself in his plan?

In Avengers: Infinity War Thanos wants to kill half the population of the universe, that's clear. And he wants to do that totally in random as well.  So, since he's also part of the universe population, does it mean that there is 50% chance he would die when he would finally snap his fingers after getting all the stones and his wish came true?


I have  web site that as you can see on the top right has is a "Forums" button that links to my forums.   My problem is that if, for instance, I make a Google search "site:heliumscraper.com answers" I don't get any result, even though the word "answers" is in the forum's board index and it has been there for a few months already.  I don't have a robots file. I also uploaded a sitemap to Google that contained the forum. I'm thinking the problem might be the fact that the only link from my main page to the forum opens in a new window. Could this be the problem?


Custom avatars are fetched using http instead of https

Stack Overflow  to work through , but the custom avatars (uploaded files, not those from gravatar) are even then fetched from  using standard   (which generates warning in browsers and is not a very good practice). As those images are also available   it could be just a service misconfiguration.  Is there a technical (or any other) reason why they couldn't be fetched using HTTPS?


I wish to make some editor tools: when I am working only the draft of my document I want to display the 'name' of the equation (set by \label) after each equation. For example in case of  \begin{equation} \label{eq::einstein} E=mc^2 \end{equation}   I want to see something like     E=mc^2 (1)      (eq::einstein)   I have to tried to redefine \label to store the parameter in \@currentlabelname then redefine environment equation to print \@currentlabelname after the equation (into a margin note box).  My MnWE:  \documentclass[a4paper]{article}  \usepackage[T1]{fontenc}  \usepackage[utf8]{inputenc} \usepackage[english]{babel}  \usepackage{amsmath}  \usepackage{marginnote} \usepackage{tikz} \setlength{\marginparwidth}{1.5cm} \usepackage{todonotes}  \usepackage{regexpatch} \makeatletter \xpatchcmd{\@todo}{\setkeys{todonotes}{#1}}{\setkeys{todonotes}{size=\tiny,#1}}{}{} \makeatother  \newcommand{\note}[2][yellow]{\todo[color=#1]{\tiny #2}}  \makeatletter \let\oldlabel\label %% %% Problem occurs here %% \def\label#1{\oldlabel \gdef\@currentlabelname{#1}}  \let\Oldequation\equation \let\Oldendequation\endequation \renewenvironment{equation}{\Oldequation}{\Oldendequation \note[blue!90!black]{\textcolor{white}{\@currentlabelname}}} \makeatother  \usepackage{lipsum}  \begin{document}  \lipsum[1]  \begin{equation} \label{equ::lenvente} d_{twin}=\frac{1}{\beta} \end{equation}  \lipsum[1]  \end{document}   Thank you for your time!


How do you ban people from your world in Minecraft PE?

My friend Evan,is griefing me. When I went on his world to get revenge, he banned me. The screen said " HerobineYoung has banned enderpizza you will be kicked out in 5 minutes." I begged him to tell me how but he wouldn't tell me.   How can I ban people in Minecraft PE?


How to deal with bibliography items containing long URLs?

A picture is worth a thousand macros:    I don't blame LaTeX for having difficulty in formatting this entry.   What can I do, however, to alleviate the effects and avoid the Word-like indentation?   A related question suggested by the site is  which indeed produces a better aligned entry:   While I like the sane alignment, I'm not not very happy with the switch to a monospaced font (while it works in the regular text, in bibliographical entries it attracts too much attention and takes too much space).  Any other suggestions?  The entry for the above test bibitem is:  \begin{thebibliography}  \bibitem{anything-here} "Lorem Ipsum Society, \emph{dolor sit amet, consectetur}, May 2010 retrieved on Oct 16, 2010 from http://www.lorem-ipsum.com/whatever-here/about\%20something/here\%20takes/space\%20in\%20a\%20long/url\%20foobar.aspx   \end{thebibliography}


In my Windows host, I have an Arch linux VirtualBox guest. I setup a Windows folder as a shared folder in VBox. I then manage to mount the folder as type vboxsf in my guest (done in /etc/fstab), but the owner is root, not my user.  How can I control who the owner of the mounted filesystem is?  chown did not work at all, not chown -R on the unmounted mounting point either.


In Java, I've noticed that 1.1+(2.2*(3.3+4.4)) results in 18.040000000000003, rather than 18.04. Is there a way to prevent this from happening?


I will be away until this Sunday.  I will be available Sunday afternoon 2 PM to 3 PM.  Please correct this if there are any corrections required. Kindly explain the rule for help in understanding its use.


What is the proper structure for the sentence "Whose dog does this ball belong to?"

As I understand, keeping prepositions from the end of a sentence is a cardinal rule with no exceptions.  However, "To whose dog does this ball belong?" does not seem correct to me at all.  How should this sentence be structured?


After I partition the drive for Ubuntu and Windows, can I use the Windows defrag utility on the Ubuntu partition, or do I defrag each with their own utilities?  I am planning on installing version 12.04 LTS with Win7 Pro 64-bit.


For instance in the snippet below - how do I access the h1 element knowing the ID of parent element (header-inner div)?

        Some text I want to change

   Thanks!


How to get dynamic string value within for:each loop of LWC template

I want to set style attribute value dynamically while looping in template.  But LWC is warning me of this error message.     LWC1060: Template expression doesn't allow CallExpression   Below is my template.    <template for:each={colors} for:item="color">
                <--! warning here -->           {color}
   </template>   How can I achieve my purpose?


A Möbius map from the unit disc onto itself

I know that this has been asked a few times, but I found no thread that fully derived the results.  I want to show that for any Möbius transformation from the unit disc onto itself it has the form $e^{i\alpha} \frac{z-z_0}{\overline{z_0}z-1}\quad,\quad \alpha \in \mathbb{R},\ \vert z_0 \vert < 1$ I found that for $\frac{a z + b}{ c z + d}$ it's necessary that: $\forall z\ \vert z \vert = 1\ :\  \vert az+b \vert^2 = \vert cz+d \vert^2$ which implies (by using $\vert\ k \vert^2 = k\overline{k}$ and assigning $z=1,-1,i$) $\vert a\vert^2 + \vert b \vert^2 = \vert c \vert^2 + \vert d \vert^2$ $a\overline{b} = c\overline{d}$ From here didn't get much further. The closest I got is: $\frac{az+b}{cz+d}=\frac{\overline{c}}{\overline{a}}\frac{\vert a \vert^2z+\overline{a}b}{\vert c \vert^2 z+\underbrace{\overline{c}d}_{z_0}} = \frac{\overline{c}}{\overline{a}}\frac{\vert a \vert^2z+z_0}{\vert c \vert^2 z+z_0}$ It can go further, but I didn't get something similar to $z-z_0$ nor $z_0 z - 1$.


Solving $\frac{\sqrt {x}}{2}=-1$, I get $x=4$. Where did I go wrong?

We have the equation $$\frac{\sqrt {x}}{2}=-1$$ I proceed as follows $$\sqrt {x}=-2 $$ $$x=4$$ Which does not certainly solve the equation. Where did I go wrong?


Name of cartoon movie with a unicorn trying to save other unicorns?

Back in the 80's, one of my aunt's used to record a bunch of cartoons off of TV onto VCR tapes for my cousins watch over and over. When they would get bored of them, they would give me the tapes.   One of the cartoons I ended up with was a feature length film about a little unicorn. I don't remember much about it, except that at the end the antagonist was like somehow (I assume magically) turning all of the other unicorns into blocks in some big wall or structure or something. And somehow our hero unicorn was trying to stop him... Honestly, I'm not even sure that it had a happy ending, or at least maybe it was a bittersweet one. It was in English in the US.  This would've been '85 to '90 range when I watched it. It would have been recorded sometime within a year or two before. I know this is obscure, but I've thought about that cartoon a few times over the years and could never figure out what it was.


Convenient Terminal GNOME Extension which hides and unhides when key is pressed

Ideally I would like a way of easily toggling it so that a Terminal window (or something of the sort) appears over the top of everything when I press a certain keyboard shortcut and then disappears again when the keyboard shortcut is pressed again (or another keyboard shortcut), but I would like it so that it stays on top of everything while another window is selected. Is there a way to get something like this? Preferably it would be a GNOME Shell extension. I am running Ubuntu GNOME 15.10 with GNOME 3.18.


I am applying for PhD programs in the USA, one of the schools requested a PhD research interest. The problem is I do not know how to write it, and I didn't done any research in my masters degree, are there any solution?


Why does a lens hood plus built in flash cause shadows on the photo?

Why is there a shadow on the photo taken with Canon DSLR camera with lens hood and built in flash?


Is $0.\overline{0}1$ a valid repeating decimal?

Surprisingly, I never came across a repeating decimal, which did not include the last digit, so I'm wondering if this would even be a valid notation?  $$0.\overline{0}1$$  So the following statement would be true?  $$1 - 0.\overline{9} = 0.\overline{0}1$$  Thanks for clarification.


Should we do something against a 'call to arms' to flag bad content for factual accuracy?

Recently, a user 'called to arms' on chat to cast flags on potentially incorrect advise on Stack Overflow. As this incorrectness was seemingly correct, I flagged en mass, without giving it much thought (main reason was that I trusted the user. That trust has now evaporated. Trust comes on foot, but leaves by horse...).  However, after looking more carefully, most answers only needed a simple caveat to be fixed! (this has since been added).   After looking even more carefully, I noticed the factual inaccuracy was due to a generalization of the question by the same users calling to arms!  Clearly, I have been misled! Personally, I will be more critical of these 'calls to flag' in the future, but I hope I can shield others from making the same mistake!  All that ends well is well, and the answers now have the caveat and that makes them correct.  However, all the flaggin was completely unnecessary! Hence, a call of      Hey, I think these answers are incorrect, can someone fix them?   Would have been a lot better than     Hey, these answers are wrong. Go flag them!   This is an advice to be very cautious when 'subverting the system' in this manner!  Perhaps this needs implementation as policy or a mod tool, but I think being aware of the issue is a good start.  So, my main point is this:  Wouldn't it be better if people simply called for attention, instead of for flags? And if such requests of the 2nd nature are made, assume the first.     is related but not a dupe. That one talks about when to flag. This one talks about when to listen to people who ask you to flag.


Antimation-how to make object visible then invisible

I am creating a small antimation, where I need a few objects. One which is text to appear then disappear, and one object to disappear at a given frame setting(s).   I know the eye button in the outliner can do this, but how do I work that in using key frames?


Does formatting really remove everything on a physical hard drive?

I would like to understand what does formatting really remove.  When launching a computer, something shows up, resembling DOS. This can't possibly be stored on a hard drive ? Where is it stored then ?  I read that there is a boot sector on the hard drive, is there some leftover on the hard drive after formatting it ? Does it really ends up with 0 bytes left on a drive ?


I want to hit enemy's axe to break it. How this is properly played in D&D 5e? And what about shield or armor? Can I attack these items to break it?


Data Recovery from a corrupted Flash Drive

When I plug my flash drive in the USB I get the message that I have to Format the disk in order to use  it. Does that  mean that I have already lost all of my data?


How do I recover the default version of some configuration file?

By accident, I messed up a configuration file. How do I recover the default version without reinstalling or affecting other things?


Sharepoint 2010 User permissions for all sites/subsite/folders

We have SharePoint 2010 in our environment. I need to give report of all users who have got access to SharePoint Site.  Looking for one script which will give all users permission on all sites/subsites/document Library.  If any third party tools which doesn't required to be installed on SharePoint server let me know that too.


I asked this question earlier and asked people to not tell me the answer. After a few more hours of attempts, I cannot figure this out. Can someone please tell me how to solve this proof?  Suppose $(6,a) = (6,b) = 1$. Prove $24 \mid (a^2-b^2)$.


Find string and replace in whole database in oracle

I want to replace '@flipkart.com' to '@Walmart.com' in whole database. I try to use all_tab_colums but this will not able to help to find the string in table.  Please assist.


I have this string:  $str = '
23.zzerze& erezrzeràr ezrezr àrez éé
 &mdash; 𐌶Ұ₭₱∅Δ (@Zykprod) 4 avril 2017

';   And what I want is to remove those kind of characters:  𐌶Ұ₭₱∅Δ    I try to convert my string with utf8_encode , filter_var but I don't think it is the solution.


Three positive real numbers $a,b,c$ satisfy the equations $a^2+\sqrt3 ab+b^2=25$,  $b^2+c^2=9$  and $a^2+ac+c^2=16$ .Then find the value of $ab+ 2cb+\sqrt3 ac$?  Is there some way to find the desired value without actually finding values of $a,b,c$ or any other smart method to find $a,b,c$


It gives this error installing VLC and sort of same for the chrome too, can anybody please help?   Reading package lists... Done Building dependency tree        Reading state information... Done Some packages could not be installed. This may mean that you have requested an impossible situation or if you are using the unstable distribution that some required packages have not yet been created or been moved out of Incoming. The following information may help to resolve the situation:  The following packages have unmet dependencies:  vlc : Depends: vlc-nox (= 2.1.4-0ubuntu14.04.1) but it is not going to be installed        Depends: libsdl-image1.2 (>= 1.2.10) but it is not installable        Depends: libsdl1.2debian (>= 1.2.11) but it is not installable        Depends: libtar0 but it is not installable        Depends: libva-x11-1 (> 1.3.0~) but it is not installable        Depends: libva1 (> 1.3.0~) but it is not installable        Depends: libvlccore7 (>= 2.1.0) but it is not going to be installed        Depends: libxcb-composite0 but it is not installable        Depends: libxcb-keysyms1 (>= 0.3.9) but it is not installable        Depends: libxcb-xv0 (>= 1.2) but it is not installable        Recommends: vlc-plugin-notify (= 2.1.4-0ubuntu14.04.1) but it is not going to be installed        Recommends: vlc-plugin-pulse (= 2.1.4-0ubuntu14.04.1) but it is not going to be installed E: Unable to correct problems, you have held broken packages.


Determine the number of possible values for $\det(A)$, given that $A$ is an $n \times n$ matrix with real entries such that $A^3 - A^2 -3A +2I=0$.   is the source of the problem. In the last comment, I don't understand why we can say for sure that $A$ has only three distinct eigenvalues. Can anyone explain to me?  Remark: I understand that the roots of the equation $x^3-x^2-3x+2=0$ are eigenvalues of $A$. My problem is why the matrix $A$ cannot have another eigenvalue?


I already have the demonstration that $x > y$ implies that $x^{n} > y^{n}$ for $x$ and $y$ positives and I read that to prove the inverse way I could use the contrapositive form but this would give me that $x^{n} \le y^n \Rightarrow x\le y$ not $x^n < y^n\Rightarrow x<y$. So, how can I prove this?


For $n \in Z^{\geq 0}$, define $g_n = 2^{2^n} + 1$. Show that $g_0\cdot g_1\cdots g_{n-1} = g_n -2$.

For $n \in Z^{\geq 0}$, define $g_n = 2^{2^n} + 1$. Show that $g_0\cdot g_1\cdots g_{n-1} = g_n -2$ for all $n \in Z^+$.    I thought that this could be proved using induction, but then the base case wouldn't work since for n=0, there would be nothing on the left hand side of the equation. Is there a way to prove this algebraically or otherwise?


I'm upgrading to a dedicated server, and I've decided between two servers, but I don't know which to choose. The differences between the two configurations are:  Server 1: Intel Xeon W3520(4 cores/ 8 threads), 2.66 GHz+, 32 GB ECC RAM, 2 X 2TB SATA Server 2: Intel Xeon E3 1225v2(4 cores/ 4 threads), 3.2 GHz+, 32 GB Non-ECC RAM, 3 x 120 GB SSD  The server will be a LAMP, and probably Debian 7.  After searching I found that ECC RAM is definitely optimal for a server, especially for mine (I got 40,000 monthly hits on shared hosting), and .  The first server also has 8 threads to Server 2's 4, but server 2 has 3.2 GHz+ and I get the all-important SSDs. The reduction in sze available is not important to me.  I couldn't find an answer online. Should I go for server 1 because of its ECC RAM and double the # of threads, or should I go for the SSDs, and higher CPU frequency?


Prove that for $a_k>0,$ if $\sum a_k^2$ converges, then $\sum \frac{a_k}k$ converges.

Prove that for for $a_k>0,$ if $\sum a_k^2$ converges, then $\sum \frac{a_k}k$ converges. I was given this in an introductory calculus class, where I was only taught the basic convergence tests. I’ve tried limit comparison, power series, direct comparison, all to no avail. I have tried proving the contrapositive, using integrals as well, but the limit comparison with any series I’ve tried just goes to 0 or infinity which is inconclusive. My searches on MSE just yield the simpler problem of “if$\sum a_k$ converges then prove $\sum a_k^2$ converges“, and searches on google turned up nothing. Thank you for any help.


No splitter widget in new separate window

I am new to Blender and I am trying to find my way through its interface. I want to have several windows (I mean OS windows, not Blender windows). So I create a separate window by dragging splitter widget while holding Shift.  The problem is there are no splitter widgets in the newly created OS window. So I can't have multiple blender windows in it. The new window does not have a Layout type drop down menu either. So how do I add new Blender windows in a new OS window? (Sorry if I'm using the wrong terms, but hopefully its clear what I am trying to achieve).


I am using Ubuntu 16.04 and I have noticed that from time to time a process named MainThread appears in my machine. I couldn't find out in which program it belong to though. Besides that I have noticed that if I kill it it doesn't seem to affect my machine. The reason I am interested in killing it is because it allocates some memory I need from my RAM (about half a GB).  So, I am wondering what's this process about and if it's OK to kill it (if I am missing something here I mean)?


Konsole does not execute .profile or .bash_profile

When I open Konsole the settings in .profile are not executed, and it means the ~/bin is not added to the PATH.  Is there a way to get Konsole to do that?  PS. Is there a way to tell whether Konsole is running bash or dash


Show that every group of order $35$ is abelian.

How can I show that every group of order $35$ is abelian ? I know that if such a group is abelian the it's isomorphic to $\mathbb Z_{35}$ or $\mathbb Z_7\times \mathbb Z_5$. But, how can I show that any group of order 35 is either isomorphic to $\mathbb Z_{35}$ or to $\mathbb Z_7\times \mathbb Z_5$ ?


Questions that do not fit the scope of the respective sites get voted to close, if 5 people voted to close it (and unless 3 voted against), the question get closed. Once it it closed, the OP can edit his/her question, and that bring the question on the reopen queue.  This is all fine on a site like SO, or here on meta, where there are many users and finding 5-7 reviewers does not take too much time.  On a less frequented site, the review process of a question may take some time. It can be several minutes, to several hours. The OP, noting that there are some VTC is incited to edit his/her question immediately without waiting for the question to be completely closed.  But then the earlier people who voted to close have a vote still there, which does not correspond to the edited question. When there are several successive edits, we might have the case that the review process is made with each reviewer having voted for a different version of the question.  Wouldn't it make sense to ask reviewers to re-evaluate their vote after a question got edited, and before it actually get closed? Or at least authorize them to change their vote?


Could anyone give me some good references for studying interpretation of QM?


How can I fix broken sudo - sudo: parse error in /etc/sudoers near line 23?

I am getting this error:  sudo: parse error in /etc/sudoers near line 23 sudo: no valid sudoers sources found, quitting sudo: unable to initialize policy plugin   I was trying to disable password authentication so I don't have to type password every time I want to install something, but I probably changed it in a not very good way. I am a newbie to Ubuntu, I got sick of Windows :)  So far I've found some people suggesting booting in single user mode, but I'm afraid of messing things up more.  How can I fix this error?


Vandermonde's Identity: How to find a closed formula for the given summation

I've stumbled upon the following challenging question. Find a closed formula for the following summation $$ S(a,b,n) = \sum_{k=0}^n {a \choose k} {b \choose n-k}$$ for all possible parameters $a,b$.  Anyone happens to see how to solve this one?


Boot stuck at logo screen after upgrading to 14.10

After upgrading from 14.04 to 14.10 my computer cannot boot anymore, it is stuck at the logo screen (with animated dots).  By displaying the boot process, I see that it is stuck at "Stopping log initial device creation". When I press Ctrl+Alt+F2, only a flickering dash appears, and I can't even log in.    Thank you in advance for any suggestions.


What would be a good way to describe computational power that is too large or requires too long of a time?

I would essentially like communicate that solving a problem, if done through this method, would take way too long to be realistic or practical. This is a common occurrence in computer science where you can solve a problem, but your solution takes too long. I feel like  this problem requires infeasible computational resources  is essentially what I'd like to say. But I'm not sure if  this problem requires infeasibly large computational resources  is more appropriate. Does anyone have any better suggestions than these? Or do any one of these sound better for any reason? A side question: "unfeasibly large" brings up over 300,000 search results, whereas "infeasibly large" only brings up 15,000. They both seem correct, according to , but is there really a preference?


May a PhD be more practical than theoretical?

I'm thinking about pursue my studies and doing a PhD in information technology.  My problem is that I would like to create something new (== write code), and focus my thesis on how this new technology works (each component and global interactions), what it can do, and how it can evolves / be improved. I'm not against doing research, reading books and work on theory - but I want to be more practical than theoretical.  I'm starting to think that a PhD is not a valid option if my goal is to develop something new instead of conducting pure research. Am I wrong ?  About my cursus: I will receive my master degree soon (~= 3 months). I come from a highly technical background, with 5 years of programming and project management.    Edit & more information My university doesn't offers PhD courses, thus my supervisor don't care about   my choices. Another consequence is that I have no other choices than to go to another university.


Proofs of the Cauchy-Schwarz Inequality?

How many proofs of the Cauchy-Schwarz inequality are there? Is there some kind of reference that lists all of these proofs?


grep. Find multiple AND patterns in any order using single condition

Is there any way to use grep to search for entry matching multiple patterns in any order using single condidion?  As showed in  for multiple patterns i can use   grep -e 'foo.*bar' -e 'bar.*foo'   but i have to write 2 conditions here, 6 conditions for 3 patterns and so on... I want to write single condition if possible. For finding patterns in any order you can suggest to use:   grep -e 'foo' | grep -e 'bar' # at least i do not retype patterns here   and this will work but i would like to see colored output and in this case only bar will be highlighted.  I would like to write condition as easy as   awk '/foo/ && /bar/'   if it is possible for grep (awk does not highlight results and i doubt it can be done easily).  agrep can probably do what i want, but i wonder if my default grep (2.10-1) on ubuntu 12.04 can do this.


Where do I find the power cells to restore the bunker door in “Ancient armory”?

I am trying to find the power cells to access the amor. Yet the placement is unmarked and I thought I would eventually stumble over them clearing the cauldrons.  Yet after clearing three cauldrons (RHO, XI, and Sigma) I still only have the one from the very beginning.  Where do I find all the power cells?


Proving limit of ratio of $L^p$ norms tends to $L^\infty$ norm

Let $X$ be a measurable subset of $\mathbb{R}$ with $m(X) < \infty$. Let $f \in L^\infty(X)$ with $||f||_\infty > 0$. I'm trying to show that $$\lim_{p \to \infty} \frac{||f||^{p+1}_{p+1}}{||f||_p^p} = ||f||_\infty.$$ So far, I've shown that $$\frac{||f||_{p+1}^{p+1}}{m(X)^{1/{(p+1)}}||f||_{p+1}^p} \leq \frac{||f||^{p+1}_{p+1}}{||f||_p^p}$$ so that when I take the $\liminf$ of both sides the left side tends to $||f||_\infty$. Now for the upper bound, let $\epsilon > 0$ with $\epsilon < ||f||_\infty$. Define $X_\epsilon = \{x \in X : |f(x)| > ||f||_\infty - \epsilon \}$ so that $m(X_\epsilon) > 0$. Then, we have $$\frac{||f||^{p+1}_{p+1}}{||f||_p^p} \leq \frac{m(X) ||f||_\infty^{p+1}}{m(X_\epsilon)(||f||_\infty - \epsilon)^p}.$$ I'm not sure how to proceed from here and would appreciate any help.


I think there is an error in the  physics profile page. The about me section does not fit. I already tried to zoom, but that didn't help. Please see the picture below for clarification.


How to get netplan on 17.10 server to work with a Windows Server DHCP server using MAC address reservations?

To do this on recent Fedora and Arch, it is necessary to set dhcp-client-identifier = hardware to get DHCP to work. I suspect the same is true on 17.10. However, Artful uses netplan and systemd-networkd.  For the latter I can set  [DHCP] ClientIdentifier=mac  In /etc/systemd/network/(interface name).network, which overrides /run/systemd/network/10-netplan-(ifname).network.  I'd prefer to set this in the file /etc/netplan/01-netcfg.yaml, or something in /etc/netplan/.  These are specifics of how the above might be solved, though. The overall question is how to use the MS Windows Server 2012 DHCP server with MAC reservations with Ubuntu 17.10 server using netplan. I may be able to request reconfiguration of the DHCP server if it won't have a significant effect on other clients, or can be done per-reservation somehow.  (I'd have used the tag windows-server, but it doesn't exist for some reason)


Trouble calling base constructor - getting read access violation

I'm setting up a program that uses 'DFS' as a child class of 'Search', and calls its base constructor.  The program runs fine, until the breakpoint I placed just after calling the constructor, in which I receive the error:   Exception thrown: read access violation. _Pnext was 0xCCCCCCD0.  I've tried to summarise the code to only what is important.  in main.cpp:  DFS search(gridSize, startPoint, endPoints, walls);   in Search.h:  public:     Search(unsigned int gridSize, unsigned int startPoint, unsigned int endPoints[2], vector<int> walls);   in Search.cpp:  #include "Search.h"  Search::Search(unsigned int gridSize, unsigned int startPoint, unsigned int endPoints[2], vector<int> walls) {     sGridSize = gridSize;     sStartPoint = startPoint;     sEndPoints[2] = endPoints[2];     sWalls = walls; }   In DFS.h:  #include "Search.h"  #include <vector>  public:     DFS(unsigned int gridSize, unsigned int startPoint, unsigned int endPoints[2], vector<int> walls);   In DFS.cpp:  #include "DFS.h"  DFS::DFS(unsigned int gridSize, unsigned int startPoint, unsigned int endPoints[2], vector<int> walls) : Search(gridSize, startPoint, endPoints, walls) {  }   If any more code is needed to understand this, just ask - I'm worried about pasting in too much.  Any help is greatly appreciated :)


Giving a Randomly Chosen Variable From a List a Certain String Value

So I'm currently making a tic tack toe game where you play against the computer, and I can't seem to figure this part out.  I want the computer to select a random variable from a list of positions that haven't been used yet, and make that variable's value O.  Here is what I have currently.    #positions is a list of variables that start off = ''  positions = [ul, uc, ur, cl, cc, cr, ll, lc, lr]  comchoice = randrange(0, len(positions))  while positions[comchoice] != '':     comchoice = randrange(0, len(positions)) else:     positions[comchoice] = 'O'   EDIT: This question is different than the one that it is said to be a duplicate of.  It is different because it is asking about changing the value of a variable in a list.  It's clear in my post that I understood the duplicate post's question with my code.


What are all the IDs on the /reputation page, and what do they mean?

Here's an excerpt from my  page:   1  14132869 (2)  1  14132300 (15)  3  14138562 (-1)  2  14138574 (10)  2  14138574 (10)  2  14138746 (10)  2  14140825 (10)  2  14140825 (10)  2  14140825 (10)  2  14140825 (10)  16 14140805 (2)   From what I've gathered so far, the IDs are:   1: accepted an answer or have an answer accepted 2: upvote 3: downvote or downvoted 16: got a suggested edit approved   I see a few things missing:   deleted posts or removed votes - I can't seem to find any setting or earning a bounty - I've never done either the -100 penalty for getting a post deleted as spam/offensive - obviously never done that   What are the IDs for those? Are there any more I'm missing?


Variation of algorithms to find point from another point with bearing and distance

There are several algorithms to calculate distance between two latitude/longitude points.     Hubeny     But there are not so many algorithms (actually I can't finally find it) which can calculate latitude/longitude of point B from another latitude/longitude point A with bearing and distance.      I'm glad to know if there are any algorithms which is lesser accurate, but faster than Vincenty's formulae.


Does every Doctor have a catchphrase? If so what are they?

What are the catchphrases of the eleven (at the time of this posting) Doctor incarnations in Doctor Who?  For example I know of a few:     Chris Eccleston (9th Doctor): Fantastic! David Tenant (10th Doctor): Allons-y!, I am so sorry   Et cetera.  Does anyone have a list of all of the doctor's catchphrases over the years?


Q-learning algorithm in reinforcement learning

In reinforcement learning, there is a known example of a robot/agent that is placed in a random room whose task is to find the exit of a house. (Illustration here ) The house has multiple rooms, with some rooms connected to the others.   The link above provides a simple solved example of how Q-learning works. It is very intuitive and fairly easy to follow.   It repetitively updates the $Q(s,a)$ matrix until it converges. So for every row $s$, I will select the element with the highest value and the find the corresponding column $a$. This means that the $\max {a_i}$ will be the optimum action I should take while in state $s$. This is good for the case of discrete states.   In the case of continuous states, there is a something called the features-based representation. Hence, $Q(s,a) = w_1f_1(s,a) + w_2f_2(s,a) +\cdots +w_nf_n(s,a)$. $f_n$ are the features and $w_n$ are the weights.   My questions are:   What will happen to this $Q(s,a)$ function in the continuous case? Will it also update itself repetitively like the one in the discrete case?  If it does update and 'converge', how should we interpret the result?    Your insights will be very helpful.


How to quickly move into and from deeply nested directories through CLI?

We know that using cd <directory> will open the directory, if it exists!  Also, cd .. will take us up one level from the current working directory.  But, when we have a nested dir with longer path like /home/thina/teams/td/tech/app/release/apks, it is tiring to just go into the folder apks and also it is hard to get back to another node, say here /home/thina/teams.   Is there any way to skip the typing of cd and cd ..? I'm using Ubuntu 16.04.


Just out of curiosity what kind of network activity causes the spinner in the status bar to spin? It never spins in my app even when data is being fetched. In Instagram, it always spins when data is being fetched.      Edit: To clarify that this question is not a duplicate. I am wondering what makes the loading indicator appear in the status bar, not just how to make it appear. Is it common to call UIApplication.shared.isNetworkActivityIndicatorVisible = true every time a call is made to the server?


Screen goes blank when VLC is playing a video

During playback of a video file (on the HDD) the screen attempts to go blank.  If I move the mouse the blank screen disappears and I am able to see the video again. I have checked the settings; Tools>Preferences>All (to select the Advanced Menu)>Video and placed a check mark (ticked) Turn off Screensaver (which, by the way, was already selected) but this seems to have no effect.  The screen is still trying to go blank during video playback. I do not believe that this is an issue with VLC at this point.  However, I have been wrong B-4. Any help with this matter is greatly appreciated.  My OS is Linux Ubuntu Ultimate Edition 3.2  Thank you in advance.


The following repository ppa:gezakovacs/ppa  is not working  and when I try to install by download method.  kmoin@kmoin-Inspiron-15-3567:~$ chmod +x ./unetbootin-linux chmod: cannot access './unetbootin-linux': No such file or directory


correlation between a continous variable and categorical variable?

I have a large data set with several columns. One of columns are continous and another one is categorical. Can you find the correlation between those columns?


Alien surface transport that walks, not rolls

A magazine connected with (Boy) Scouting, possibly "Boys Life", in the early 1950's ran a short story in which a group of interplanetary explorers on an extraterrestrial planet, which may have been postulated to have a breathable atmosphere, encountered a functional alien transport designed to travel across rough terrain.   The machine was half hidden or buried when a member of the team discovered it and when he reported back was asked to "roll it out." He replied, "It, 'er, walks."   The alien inventors turned out to be long gone. The machine resembled a large multi-legged insect. There may have been a drawing accompanying the story.  The link I'm attempting to add here may not work, but if it does it's the only source to the Boy's Life image of the alien walking machine that's currently accessible. Boy's Life issues from 1950 are not to be found. If the link works, open Boy's Life November 1950 issue and scroll down to page 21.


Is it dangerous if you drop a metal object(like a screw) on a motherboard that is powered on?

I am not very good with electricity so I can only guess. So should i be careful with screws and stuff when the pc is on?


Add circle animation to cursor when clicked

I want to know does any solution exist to add a circle around the cursor when I click on the screen?


How to pass a variable into a js function

I am trying to pass a variable A1 into a function and change it from 0 to 1 (and back). The argument note_switch is changing from 0 to 1, when logged on the console, but the variable A1, which takes the place of note_switch, is not changing. What's going wrong? var A1 = 0  function square_on_off(note_switch,note_id) {   console.log(note_switch);   console.log(A1);   if (note_switch == 0) {     note_switch = 1;     change_colour(note_id,"blue");   } else {     note_switch = 0;     change_colour(note_id,"red");   }   console.log(note_switch);   console.log(A1); }  function onA1() {   square_on_off(A1,"A1"); }


How to identify this particular SMD component?

It is used on a small board RFID antenna circuit based on the TMS3705:    At the first check it seems to be a 0 ohm resistor, but the dimension 4x4mm its strange.  Any ideas?  L.


How does the Mac choose which connection to use when both Wifi and Ethernet are connected?

When I'm connected to two networks with separate routers using Wifi and Ethernet, how does my Mac know what connection to use when I visit a website?


What is the error on measuring the phase of a sine wave?

Let's say I have a wave, with frequency $\omega$ and phase $\phi$, of the form:  $$y(t)=1+A\sin(\omega t+\phi)$$  where $A<1$.   I have $N$ measures of $(\hat{y}_i, \hat{t}_i)$, that are assumed to be evenly spaced over one period. For practical purposes, $\hat{t}_i=t_i$ is assumed to be accurate, while $\hat{y}_i$ is measured with a normally distributed error : $\hat{y}_i= y_i + \epsilon_i$, with $\epsilon_i \sim \mathcal{N}(0, \sigma_y)$.  How well can I measure the phase of this sine wave? Edit: I'm trying to derive an analytic answer, to predict the results of future measurements. What I presume is the previous version of this question was asking how to fit to observed data, which is a different problem. Also, I figured out the answer and placed it in the comments, for anyone else who needs this.  I've tried constructing a Fisher matrix for the problem, but Mathematica thinks it's singular, and I can't see how to invert it either.


Is the chatroom to be used for topic related chatting or not?

I found a chat section in Stack Overflow. Is it to be used for simply chatting or a particular topic? For example, if Android is the name of the chat room, is there only Android-related chat allowed?


Are there lower class men in The Handmaid's Tale who are not law enforcement/military?

Are there men (who have not been exiled to the colonies) in Gilead who are not law enforcement or military (guardians/angels) and not part of the ruling elite (e.g. commanders)? If so are any of these named characters?


I've tried enabling from settings, doing sudo /etc/init.d/bluetooth start, sudo /etc/init.d/bluetooth restart, rfkill list says   2: hci0: Bluetooth Soft blocked: no Hard blocked: no   I have rfkill unblock bluetooth in rc.local but it just won't turn on. If I try enabling it via checkbox from settings the checkbox changes state but the text "bluetooth is disabled" is still there. Btw, yes, I've double checked that I didn't disable it with hardware button. How do I make bluetooth work on 16.04?   UPD: requested console output  yxfxmx@yxfxmx-pc:~$ lspci -knn | grep Net -A2; lsusb 13:00.0 Network controller [0280]: Broadcom Corporation BCM43142 802.11b/g/n [14e4:4365] (rev 01) Subsystem: Hewlett-Packard Company BCM43142 802.11b/g/n [103c:804a] Kernel driver in use: wl Bus 001 Device 002: ID 8087:8000 Intel Corp.  Bus 001 Device 001: ID 1d6b:0002 Linux Foundation 2.0 root hub Bus 003 Device 001: ID 1d6b:0003 Linux Foundation 3.0 root hub Bus 002 Device 004: ID 05c8:022a Cheng Uei Precision Industry Co., Ltd (Foxlink)  Bus 002 Device 003: ID 0a5c:216d Broadcom Corp.  Bus 002 Device 005: ID 22b8:2e76 Motorola PCS  Bus 002 Device 002: ID 0458:012b KYE Systems Corp. (Mouse Systems)  Bus 002 Device 001: ID 1d6b:0002 Linux Foundation 2.0 root hub   UPD2:  yxfxmx@yxfxmx-pc:~$ dmesg | grep Blue [    6.446411] Bluetooth: Core ver 2.21 [    6.446433] Bluetooth: HCI device and connection manager  initialized [    6.446438] Bluetooth: HCI socket layer initialized [    6.446442] Bluetooth: L2CAP socket layer initialized [    6.446450] Bluetooth: SCO socket layer initialized [    8.478642] Bluetooth: hci0 command 0x1001 tx timeout [    8.827513] Bluetooth: BNEP (Ethernet Emulation) ver 1.3 [    8.827519] Bluetooth: BNEP filters: protocol multicast [    8.827526] Bluetooth: BNEP socket layer initialized [   16.474175] Bluetooth: hci0: BCM: Reading local version info failed (-110) [   18.478015] Bluetooth: hci0 command 0x1001 tx timeout [   26.473545] Bluetooth: hci0: BCM: Reading local version info failed   (-110)   UPD3: after installing firmware  yxfxmx@yxfxmx-pc:~$ dmesg | grep Blue [    6.249804] Bluetooth: Core ver 2.21 [    6.249829] Bluetooth: HCI device and connection manager initialized [    6.249835] Bluetooth: HCI socket layer initialized [    6.249839] Bluetooth: L2CAP socket layer initialized [    6.249858] Bluetooth: SCO socket layer initialized [    8.393500] Bluetooth: hci0 command 0x1001 tx timeout [    8.877281] Bluetooth: BNEP (Ethernet Emulation) ver 1.3 [    8.877286] Bluetooth: BNEP filters: protocol multicast [    8.877292] Bluetooth: BNEP socket layer initialized [   16.389750] Bluetooth: hci0: BCM: Reading local version info failed (-110) [   18.393828] Bluetooth: hci0 command 0x1001 tx timeout [   26.390149] Bluetooth: hci0: BCM: Reading local version info failed (-110) [  430.267410] Bluetooth: hci0 command 0x1001 tx timeout [  438.263237] Bluetooth: hci0: BCM: Reading local version info failed (-110) [  438.268233] Bluetooth: hci0: BCM: chip id 70 [  438.284219] Bluetooth: hci0: BCM43142A [  438.284225] Bluetooth: hci0: BCM (001.001.011) build 0000 [  438.742225] Bluetooth: hci0: BCM (001.001.011) build 0227 [  438.758225] Bluetooth: hci0: Broadcom 43142 Bluetooth 4.0 Adapter [ 3600.950603] Bluetooth: hci0: BCM: chip id 70 [ 3600.966645] Bluetooth: hci0: Broadcom 43142 Bluetooth 4.0 Adapter [ 3600.966653] Bluetooth: hci0: BCM (001.001.011) build 0227 [ 3601.421687] Bluetooth: hci0: BCM (001.001.011) build 0227 [ 3601.437680] Bluetooth: hci0: Broadcom 43142 Bluetooth 4.0 Adapter


Why is $\sum_{n \leq x }1/n=log(x)+\mathcal{O(1)}$?

I know I can compare  $\sum_{n \leq x}1/n$ with $log(x).$ I also think $log(x) \leq\sum_{n \leq x}1/n.$


How to limit the current of a short circuit

I will be turning a relay on from my circuit by sending a signal 500ms to 1000ms long, and i am trying to protect against poor wiring or faulty relay from the user that causes a short circuit on the relay which could blow the fuse on the module  The power supply is rated for 2A and the fuse on the module is rated for 1A. I would like to create a protection that even if there is some short circuit on the relay output the fuse cannot blow,  My solution was to add a resistor on series of the relay, but this would mean that resistor should have atleast 5watt rating for it to survive, or a high value resistance for it to survive. Having a high resistance also might mean that the relay might not turn on because there wont be enough voltage that will cross it.    Paralleling a resistor to the relay seem kinda useless also since the current will not flow to the resistor but to the short instead.  How should i approach this? i possible how can this be done with basic components (resistor,capacitor,diodes etc)


How can I fetch a domain name from a URL String? Examples: +----------------------+------------+ | input                | output     | +----------------------+------------+ | www.google.com       | google     | | www.mail.yahoo.com   | mail.yahoo | | www.mail.yahoo.co.in | mail.yahoo | | www.abc.au.uk        | abc        | +----------------------+------------+  Related:


pokemon go locked me out of my account and i can't log in!

so I got the new update, and when I went into the game, professor willow came up like when I started playing. I tried to login with google but it didn't work, and now when I try to log in, the choice to log in with google won't even come up anymore!


forward port from one IP to another IP in a local network

I have a server on local network with local IP 192.168.0.1 that is running POP3 server on port 995 (SSL). This server doesn't have external IP and I am not in control of it.  There's another server on local network with local IP 192.168.0.2 and external IP 123.123.123.123. It is running Ubuntu 16.04 and I have control over it.  How do access port 995 on server 192.168.0.1 via external IP 123.123.123.123?  UPDATE: So I tried this with iptables on 192.168.0.2 with no success so far:  sudo iptables -t nat -A PREROUTING -p tcp --dport 995 -j DNAT --to-destination 192.168.0.1:995


I am certain this must have been asked at some point - but most of the questions I have found pertaining to metamagic are quite specific.  My question is;  can I utilise the MM Twinned Spell, followed by the Quickened Spell?  At 3rd level a sorcerer gets 3 SP. What is to stop me applying 1 SP into Ray of Frost (using Twinned Spell) and then again using Quickened Spell - allowing for a double strike and a single strike against two targets (or 3 seperate-target attacks) ?


How to install a library when I have its source code?

I want to include some libraries in my project like json-glib, beecrypt or libffi.  Usually, I install all the libraries using sudo apt-get install XYZ. But sometimes, I get a .tar file of any library which I extract at some place on my desktop. I don't know how to install these type of libraries for which I have the source code. I get the installed files in /usr/include or sometimes in /usr/lib folder when I install using the above command written. How to do it in case of source code?


Google Chrome not retaining default browser selection in Ubuntu 15.10

Google Chrome is set being my default browser in System Settings, Details. And is also set as default browser within Google Chrome 46.0.2490.80 (64-bit) I reboot three or four times a day and Google constantly asks whether it should be the default. Bug?


Introducing the possibility of creating folders in favorites section

I tried to see if it is possible to create folders in the section of favorites, to organise the related question in different topics. Personally I have saved different questions because I still can't understand them properly but many of these could really help me in future, but in this way the section gets quite confusing, allowing to create folders and name them could help to give a lot of order. I think this could be a good tool, obviously it is just a suggestion, I am not expecting anything but if it is something that a big part of the community would appreciate maybe could be considered.   I am aware that this has been discussed in the past in the following links, thanks to the clarification given on the same question I posed (wrongly) on th PSE . The following are some links to discussions of this type          but since these discussions are quite old and as new features concernig the favorites section should come out in this period as explained , maybe it could be possible reconsider an introduction of tools like folders (just as an example) or whatever the community feels more adapt to cover this kind of problem. Thanks a lot


trouble installing Ubuntu 19.04 on hp envy x360

I’m having an issue with my laptop. It is an HP Envy x360 with an AMD Ryzen 5 3500u processor and Radeon Vega Graphics. I’ve turned off Secure Boot, but it still won’t boot. All I get is a blank screen.  Any suggestions?


Is there any ambiguity when forming operators for classical observables from other operators?

There are some classical quantities, for which we know corresponding operators: e.g. position, momentum. For some others it's straightforward to compose these operators using expressions similar to their classical counterparts, e.g.  $$\vec L=\vec r\times\vec p\;\leadsto\; \hat{\vec L}=\hat{\vec r}\times\hat{\vec p}.$$  After checking that the resulting operator is Hermitian, we can use it as the operator for our quantity.  But in some cases we have to do some special considerations. E.g. one term of the Laplace-Runge-Lenz vector in classical mechanics, whose operator cannot be straightforwardly composed from simpler operators:  $$\vec p\times\vec L\;\not\leadsto\;\hat{\vec p}\times\hat{\vec L},$$  because such an operator wouldn't be Hermitian. Fortunately, we can easily form an appropriate Hermitian version of it by adding a symmetrizing term, so that the expression is equivalent to the original classically, but results in an Hermitian operator:  $$\vec p\times\vec L\;\leadsto\;\frac12\left(\hat{\vec p}\times\hat{\vec L}-\hat{\vec L}\times\hat{\vec p}\right).$$  But is there always a unique choice of an Hermitian combination of operators which would reduce to a given classical expression of corresponding observables? If not, what are some examples where one classical expression could be represented by more than one different Hermitian operators? Do we have any criteria of choosing one over others without need to do experiment?


Compute the sum $\sum_{k=1}^{10}{\frac{k}{2^k}}$

Compute the sum   $$\sum_{k=1}^{10}{\dfrac{k}{2^k}}$$  This question is taken from SMO junior (I can't remember which year it is). I have no idea how to start. Can anyone give some hint?  By writing out the sum, one has   $$\frac{1}{2} + \frac{2}{4} + \frac{3}{8} + ... + \frac{10}{1024}$$  but I don't know how to proceed from here.


Can't use unebootin or re-install windows

I had windows 7 installed before I install ubuntu, I downloaded ubuntu when I had windows and installed it but I removed all my data by accident and I lost my windows 7, now I'm trying to install windows back but I completely fail doing that!   Why do you fail?  Actually I downloaded windows ISO file, I searched online how to install windows using ubuntu and I knew that I have to formate my USB  to NFTS using gparted, I did, everything is fine now I opened UneBootIN but I can't find my USB, can't be detected then error message pop-up saying I have to formate my USB to FAT32, and I know that I can't do that to install windows 7 or boot it, but I gave it try and formatted my USB to FAT32, everything went well and it made the usb boot-able I restarted my device and pressed F2, it showed my USB, I choosed it and pressed enter, it said in the top: UnEbootIN and there's something in the list called 'Default' and message down saying 'Boot or whatever will happen, install or boot after 10 seconds, I wait 10 seconds and it recount again, I press enter and nothing happen just re count the 10 seconds! and I can't find any similar programs like UneBootIN to do that for me so i'm stuck on ubuntu only, I wanna install ubuntu as alternate os when I install windows but I'm just stuck on it now..  I wanna something to make me make windows 7 bootable instead of UneBootin because it doesn't detect NTFS Formatted USB, and I can't go with FAT32 cuz it doesn't work!


For some of you, this question is going to seem extremely basic.  I think I understand what an ideal is. Such as $\langle 2, 1 + \sqrt{-5} \rangle$, it consists of all numbers in this ring of the form $2a + (1 + \sqrt{-5})b$.  But then what is $\langle 2, 1 + \sqrt{-5} \rangle^2$? My first thought was $\langle 4, -4 + 2 \sqrt{-5} \rangle$, but that seems wrong somehow. I also had something in the back of my mind saying $\langle 2 \rangle$, but I'm not sure about that one either.  Then I thought about trying to figure out $\langle 2, 1 + \sqrt{-5} \rangle \langle 2, 1 + \sqrt{-5} \rangle$ when I realized I don't actually understand how to multiply ideals to begin with.  I'm only using $\langle 2, 1 + \sqrt{-5} \rangle$ as an example (though that does draw in one question identified as similar that looks much more relevant than all the questions identified as "Questions that may already have your answer"). In a principal ideal domain, would it be correct to think that $\langle a \rangle \langle b \rangle = \langle ab \rangle$?  Any help would be much appreciated.


I am getting this "AL lib: (EE) UpdateDeviceParams: Failed to set 44100hz, got 48000hz instead" when I'm trying to open blender now. Any help would be much appreciated


How to choose a specialization for trooper

I am in the starting zone and level 11 but can't seem to find the specialization trainer that should be available at level 10.  Where do I find the specialization trainer for troopers?


I want to allow incoming FTP traffic.  CentOS 5.4:  This is my /etc/sysconfig/iptables file.  # Generated by iptables-save v1.3.5 on Thu Oct  3 21:23:07 2013 *filter :INPUT ACCEPT [0:0] :FORWARD ACCEPT [0:0] :OUTPUT ACCEPT [133:14837] -A INPUT -p tcp -m tcp --dport 21 -j ACCEPT -A INPUT -p tcp -m state --state ESTABLISHED -j ACCEPT -A INPUT -j REJECT --reject-with icmp-port-unreachable -A OUTPUT -p tcp -m tcp --sport 20 -j ACCEPT COMMIT # Completed on Thu Oct  3 21:23:07 2013   Also, by default, ip_conntrack_netbios_n module is getting loaded.  #service iptables restart  Flushing firewall rules:                                   [  OK  ] Setting chains to policy ACCEPT: filter                    [  OK  ] Unloading iptables modules:                                [  OK  ] Applying iptables firewall rules:                          [  OK  ] Loading additional iptables modules: ip_conntrack_netbios_n[  OK  ]   But the problem is not with that module, as I tried unloading it and still no luck.  If I disable iptables, I am able to transfer my backup from another machine to FTP. If iptables is enforcing, then transfer failed.


Prove that the natural number formula $n=3^{k}$ divide $2^{n}+1$

Problem :   Prove that : all natural numbers formula :   $n=3^{k},k\in\mathbb N^{*}$ divide $2^{n}+1$  For example : $k=1$ then $n=3$ so : $9|_{2^{3}+1=9}$ correct ?   I'm think use induction for $k$ mean I will prove that :   $2^{3^{k+1}}+1=m.3^{k+1}$ , $m\in \mathbb Z$   $2^{3^{k+1}}+1=8^{3^{k}}+1$   How I complete ??


In the book Deep Learning, it says the softmax function is de facto a soft argmax function, and the corresponding soft version of the maximum function is $$\text{softmax} (z)^T z$$ How to understand the latter?


Suggested alternatives for "nice-to-have" as a noun

In the example below, I’m looking for a suitable synonym for nice-to-have. I’m specifically looking for an appropriate noun replacement; do we actually have such a thing in English?     Maintenance shouldn’t be a ‘nice-to-have’ but an all-important necessity.


What is better to have? A pokemon with higher IV but lower CP or vice versa?

Me and my friends have encountered this situation many times. We need to decide which Pokemon to evolve. Take the following scenario:   Growlithe A: 20% more CP than Growlithe B. (898 instead of 743). Growlithe B: 26% more IV than Growlithe A. (87 instead of 69 in this case).   I didn't give more details about each Pokemon because I'd like a general answer that others can use.  Thank you kind folks!  P.S this is not a duplicate, since I understand what a higher IV interprets into.  Yes, a higher IV will define the MAX CP, but it's not the only thing to consider. A higher IV also means better chance of better moves for the evolved pokemon - and those are much more important than a high CP. Also consider that I have many Arcanines and I don't have the stardust to max them out (that is a different question).


Field extensions - if $(E : F) = n$ then $(E(x) : F(x)) = n$

Well, pretty much everything is in the title - I'm looking for the proof of the following statement: if we have a field extension $F \subset E$ then the degree of the extension $F(x) \subset E(x)$ [fields of rational functions] is the same as that of $E$ over $F$. Will be grateful for any hints!


How do I close all, or many at once, Chrome tabs on Android on a phone?

I'm on Google Pixel 2, Android 11, Chrome 87.0.4280.101. . I need to selectively close about 450 of them, or just close all of them then re-open about 20 to 50 of them. How do I mass-close many or all of them at once? The last time I mass-closed hundreds of tabs manually I sat there for like 30 minutes swiping until they were all closed. I don't want to do that again. That was ridiculous. (Compared to full computers, phones are garbage. :)) This tablet-specific answer doesn't seem to apply to phones, or to apply anymore to the latest versions, so it does not contain an answer that works for me: . Here's what I see in my Chrome menu when I click on the 3 dots in the top-right corner:  This is in French. Translation:  New Tab New Incognito tab Favorites Recent tabs History Downloads Translate Share Search on the page Add to welcome screen Version for computer Settings Help and Feedback


In Counterexamples in Topology Book by Lynn Steen i found that Telophase topology is arc connected. How can we build an arc in this topology ? And also could you give me an idea of how to prove that this space is sequencialy compact ?  Thank you very much!


Delete the data based on the output of awk command

I have a file test.dat with delimited text. Delimiter is | containing 4 columns in a file. But due to some issue, there is some discrepancy in the number of columns for some of the rows. I have found those rows using awk command. Now I need to delete those rows.  test.dat:  a|b|c|d a|b|c a|b|c|d|e   I found rows with:  awk -F "|" 'NF!=4' test.dat   Result:  a|b|c a|b|c|d|e   Now I need to delete this from the file. Any pointers. I used xargs but didn't work.


Glitchy Objects in viewport after solidify modifier

I am creating a 3D model for a bubble tea cut and after I've modeled out the shape of the cup, I wanted to use a solidify modifier to solidify the cup to give it it's thickness. However, after putting on the modifier, everything started being glitchy (shown in image) and even after spamming CTRL-Z a couple of times until the modifier disappeared, it still showed weird artifacts/glitchy edges. After trying multiple things such as shading it flat, restarting blender, it still shows unnatural glitchy edges. Any fixes?? Pretty new to this platform and I'm not sure how to link a file. If anyone wants the file to take a look I'll happily do so through another platform. Thanks!


how to generate the creation script for partition function and partition schema?

I have a script to generate the create table script. .  However, now I need to script my  and    , see the answer has examples on how to add a partition to a table and how to remove a partition from a table, and I would like to have a look at the scripts at any stage.  I have found this link:   how to generate the scripts for create partition function and partition schema?  I was working on a script to generate the create partition function  as you can see below, but it only works for my own PF_year partition function because it was tricky to get over the fact that  has a  data type as value.  when I used a case I got the following error:     Msg 206, Level 16, State 2, Line 35       Operand type clash: int is incompatible with date   Then in his great answer , showed us  some wonderful thing that I was not aware of, now I am a new DBA and person.     SET TRANSACTION ISOLATION LEVEL READ UNCOMMITTED     SELECT     RADHE = 'CREATE PARTITION FUNCTION' + space(1) + quotename(spf.name) +  '(' +       COALESCE(baset.name,'data type not found') +   ')' + CHAR(13) +      'AS RANGE ' + CASE WHEN CAST(spf.boundary_value_on_right AS int) = 1  THEN 'RIGHT ' ELSE 'LEFT ' END  + CHAR(13) +     'FOR VALUES (' +     (SELECT STUFF(     (SELECT     [text()] = N',''' + CAST(                       CASE st.system_type_id                         WHEN 40 THEN CONVERT (date, sprv.value,126)                         --WHEN 56 THEN CONVERT (int,  sprv.value)                        --ELSE CONVERT (int,  sprv.value)                       END                        AS NVARCHAR) + ''''     FROM sys.partition_range_values sprv      WHERE sprv.function_id=spf.function_id     order by sprv.boundary_id      FOR XML PATH('') ), 1, 1,N'')+ N');')      ,st.system_type_id     ,spf.name AS [Name],     spf.function_id AS [ID],     CAST(spf.boundary_value_on_right AS int) AS [RangeType],     spf.create_date AS [CreateDate],     spf.fanout AS [NumberOfPartitions]     FROM     sys.partition_functions AS spf      INNER JOIN sys.partition_parameters AS spp              ON spp.function_id=spf.function_id      INNER JOIN sys.types AS st              ON st.system_type_id = st.user_type_id             and spp.system_type_id = st.system_type_id      LEFT OUTER JOIN sys.types AS baset                    ON (     baset.user_type_id = spp.system_type_id                         and baset.user_type_id = baset.system_type_id)                     or (     (baset.system_type_id = spp.system_type_id)                         and (baset.user_type_id = spp.user_type_id)                         and (baset.is_user_defined = 0)                         and (baset.is_assembly_type = 1))     WHERE spf.name = 'PF_YEAR';


Is it possible to implement real time execution of any content within Marketing Cloud email after the email is triggered?

There is a scenario where I need to display Date, Hours and Minutes left for the subscriber's subscription to end. I am able to implement this using Ampscript in my email and also mail is triggered through Marketing Cloud. The only challenge is every time when the user sees the email, same time is shown as that of when the email was triggered. Is there a way to keep updating the time whenever the user sees the email?


Why do I get a fatal error when clicking on the permissions tab in admin/people?

Steps to reproduce:   Log in as administrator Click on People Click on the Permissions tab   This navigates to admin/people/permissions. Here is the complete source code for that page:  Fatal error: Allowed memory size of 134217728 bytes exhausted (tried to allocate 2048 bytes) in /.../includes/common.inc on line 6300   Why am I getting this error and what can I do about it?  Notes:   my php.ini file contains the following line: memory_limit = 128M .../sites/default/settings.php contains the following line: ini_set('memory_limit', '512M'); If I go to Reports/Status report and scroll down to PHP memory limit, it says 128M


Necessary and sufﬁcient conditions on m and n for $\Bbb F_{p^n}$ to have a subﬁeld isomorphic with $F_{p^m}$.

It is from Milne's notes.   I think since $[\Bbb F_{p^n}:\Bbb F_{p^m}]=[\Bbb F_{p^n}:\Bbb F_p]/[\Bbb F_{p^m}:\Bbb F_p]=n/m$. If we have such a subfield, we must have $m$ divides  $n$.  But I am not able to see that if $m$ divides $n$, then we always have such a subextension.  So may I please ask how can I do it. And how to see if there is some subextensions which are isomorphic? Thanks!


Confusion in BODMAS rule to evaluate $\left(\frac15\right)\div\left(\frac15\right)\div\left(\frac15\right)\div\left(\frac15\right)$

I am stuck with a question $$\left(\frac15\right)\div\left(\frac15\right)\div\left(\frac15\right)\div\left(\frac15\right)$$ We can have different approach to this problem but how are we gonna apply BODMAS here.


I have valid US B1/B2 Visa on an expired Indian passport. My passport has my surname as blank and hence I was issued a US Visa with given name as FNU and Surname "My First Name" . I need to apply for new passport and I am planning to get my given name and the surname correct in the new passport.  My questions are:   Will I have problems travelling to US if my new passport says my given name as "my first name" and surname as "My last name" but my valid visa on old passport says given name as FNU and Surname as "my first name" Or should I again apply for my new passport with just my first name and keeping my surname as blank, which I am not in favor of.


Give the "some of your recent flags have been declined" banner some room

The "some of your recent flags have been declined" message recently got a banner, which makes it stand out  more (which is nice) but it touches the 'Flag' button, which is less nice. Can it have some margin at the bottom (and perhaps less padding?)    Tested in the latest Safari and Firefox on macOS Catalina.


So I am a CS student and work a lot on programming usually on a Linux machine. I have Linux installed on a partition of my laptop, and lately I have been thinking of making the full switch to Ubuntu. However, there is one application that I need to be able to use and the only Linux application I have found similar to it is nowhere near as 'powerful'. That program is onenote, and I know there are many alternatives to onenote but I have a thinkpad yoga with a digitzer pen so I can write on my screen. I know I can get the digitizer to work but I am looking for a good replacement for the onenote digitizer note taking capabilities.  Thanks!  Edit: So My question is more focused on finding an app that lets me take handwritten notes on Linux.


Negation like symbol with text/numbers underneath

@Werner has marked this question as duplicate, but I do not feel the original question deals with the detail of the result as Heiko has given.  The answer marked here provides more detail and a more robust solution.  I'm transcribing some work for a professor of mine and I've come across something that I've never encountered before. I'm trying to reproduce the subscript of this    I'm sure I could manage this with Tikz, but I am wondering if there is any other way to accomplish such a thing?


Initially, when Internet was just growing up, DNS packet size was use to be only 512 bytes (at max), dns servers was listening only on udp protocol and due to other similar issues; number of Root servers was fixed to 13 numbers so that answer from root server can be put into a single packet of 512 bytes.  Now, we are in 21st century, we have DNSSEC enabled across the domains (from last 2-3 years, all the gTLDs are signed) and this force all the servers (be it authoritative or caching) to listen and reply on TCP (along with UDP)  AND this increases a DNS packet size upto 4096 bytes.  I know that multiple instances of each root servers are running and they are providing us resiliency and till date we hadn't face any such major downtime issues with root servers.  Then also, what is stopping us from increasing the number of Root Servers ?


Proving 'Law of Excluded Middle' in Fitch system

I'm taking a course from Stanford in Logic. I'm stuck with an exercise where I'm doing some proof. The Fitch system I'm given only allows   $ \land $ introduction and elimination $ \lor $ introduction and elimination $ \to $ introduction and elimination $ \equiv $ introduction and elimination $ \lnot$ introduction and  $ \lnot \lnot $ elimination   but not    $ \bot $ introduction and elimination   I've been struggling to prove the law of excluded middle (``p ∨ ¬p`) within this system. All of the proofs I've seen online make use of $\bot$ elimination to prove it by contradiction:  | ~(p | ~p)  (assumption) | | p        (assumption) | | p | ~p   (or introduction) | | $\bot$ | | | ~p       (assumption) | | p | ~p   (or introduction) | | $\bot$ | | (p | ~p)   (proof by contradiction)   Since I can't use $\bot$ elimination, I was trying to do this with $ \lnot$ introduction:  | ~(p | ~p)  (assumption) | | ??? | ~(p | ~p) => x | | | ??? | ~(p | ~p) => ~x | p | ~p     (not introduction)   but I just can't get it. I can't figure out how to get x and ~x.  Is this provable without $\bot$ elimination? If so, what are the steps?    Background:  What I'm ultimately trying to prove is : Given p ⇒ q, use the Fitch System to prove ¬p ∨ q. I'm able to prove that p ⇒ ¬p ∨ q and that ¬p ⇒ ¬p ∨ q, but I need to be able to plug p ∨ ¬p into the proof to be able to do 'or elimination'.


Understanding Proof that $\mathbb{Q} \left( \sqrt {2}\right)$ is a field.

Prop. $\mathbb{Q} \left( \sqrt {2}\right)$ under usual properties, i.e., $\mathbb{Q} \left( \sqrt {2}\right)$ is a field.  Proof. (Step of multiplicative inverse of $\mathbb{Q} \left( \sqrt {2}\right)$)  Let $a+b\sqrt {2}$ $\in$ $\mathbb{Q} \left( \sqrt {2}\right)$. We will find a',b' $\in$ $\mathbb{Q}$ such that $\dfrac {1} {a+b\sqrt {2}}$= $a'+b'\sqrt {2}$.  It suffices to show that if a+b$\sqrt {2}$ $\neq$ then $a^{2}-2b^{2}\neq 0$. Suppose not, say $a+b\sqrt {2}\neq 0$ but a^{2}-2b^{2}=0. Then 0 = $a^{2}-2b^{2}$= $(a+b\sqrt {2})$ $(a-b\sqrt {2})$. As $a+b\sqrt {2}$ $\neg$, so $a-b\sqrt {2}$=0. But then $\sqrt {2}$=a/b $\in$ $\mathbb{Q}$ provided by b $\neg$ 0. So b=0. However, (final step) if b=0 then a=0 as $a-b\sqrt {2}$. And this yields $a+b\sqrt {2}$=0. Contradiction.  My question is that is ''if b=0 then a=0 as $a-b\sqrt {2}$ $\equiv$ if $a-b\sqrt {2}$ then a=0 and b=0''? Because my proof is that (final step) if $a-b\sqrt {2}$=0 then a=0 and b=0. And this yields $a+b\sqrt {2}$=0. Contradiction


What does "couldn't have cared less" mean?

I look up the dictionary that it means It doesn't matter to me for couldn't care less . However, I can't get *couldn't have cared less* Thanks.  A: How long have you been divorced?   B: Two years since it's been final, but it hadn't been good for years. Honestly, we stuck it out for the kids, who couldn't have cared less.


Does a 128bit 3DES need billions of years to decrypt using brute force attack?

a) I did some research and there are two opinions.. some say it cracks in several years and others say it doesn't crack for billions of years USING BRUTE FORCE ATTACK...


I have a query stored in a *.sql file on my computer and I want to access the select output from a query.   I found something about using @ before the file path but I can't figure it out.   SELECT * FROM @FILEPATH


What factors to consider for a long lasting salad?

I'd like to make salad in bulk for the week ahead on a weekend, which I will store at home in the fridge, to take to work. My gut feel is that what I'd typically put in salad (leaves,  tomatoes, cheese etc)  won't last long enough to be worth making in bulk, even if I store it at work. If it matters, I typically leave my salad at my desk, as I don't like cold salad at lunchtime.  What factors should I consider when picking ingredients and storage,  for a long life salad? What sorts of food should I look for and how will I know they are more likely to last?


I'm currently running Ubuntu 16.10 from an external drive which I'm using as my main drive. I need to format the drive to install Windows 7, but this laptop doesn't have a cd drive.  I made a bootable usb with windows 7 and wasn't able to install because this version doesn't have the disc repair options and the installation menu won't let me format the drive.


Sometimes, I find that it is useful to do a Clay Render for my model, where all of the materials render with a single common "clay"-like material (see example image below). In the past, I have done this by:   Selecting all of my objects by using the A hotkey Manually deselecting the World object, camera, and lights in the Outliner Linking materials using Ctrl+L Manually setting to the same material in the Properties>Materials menu Render like normal   When I was done with my Clay render, I would revert to the old version by pressing Ctrl+Z a few time. However, this is a rather clunky solution, since I can't make any edits in the clay version without losing my old materials/textures data.  Is there a better way to do Clay renders, either with an addon or through some other technique such that I can make edits to my model and not lose my materials? If at all possible, I would like a single setting that allows me to quickly toggle clay-mode on and off in the same file.  Example "Clay Render":


I'm hoping this is a simple question, but after some browsing through the internet I could not find a solution. I'm trying to create a Button within my WPF application which opens a new browser window to opens a target web page - is this possible? I'm aware of the Hyperlink, but visually this does not look how I need it to (it's just underlined blue text). Any help much appreciated!


How to fix callout error -- You have uncommitted work pending. Please commit or rollback before calling out?

I'm doing an upload attachment to AWS, but I'm getting this error -- 'You have uncommitted work pending. Please commit or rollback before calling out'  How do I fix this?  @AuraEnabled     public static void savePDupcsSettings(ForUploadCustomSettings__c upcsSet, String recId){         ForUploadCustomSettings__c upcs = new ForUploadCustomSettings__c();         upcs = upcsSet;         if (upcs.Objects__c != null) {             if (recordId != null) {                 upcs.Name = upcs.Objects__c +'-'+ upcs.Fields__c +'-'+ upcs.Value__c;                 update upcs;             } else {                 ForUploadCustomSettings__c newVal = new ForUploadCustomSettings__c();                 newVal.Name = upcs.Objects__c +'-'+ upcs.Fields__c +'-'+ upcs.Value__c;                 newVal.Objects__c = upcs.Objects__c;                 newVal.Fields__c = upcs.Fields__c;                 newVal.Value__c = upcs.Value__c;                 insert newVal;             }         }          String stage = 'Closed Won';         ForUploadCustomSettings__c csList = [SELECT Id, Id, Objects__c, Fields__c, Value__c                                                                FROM ForUploadCustomSettings__c                                                  WHERE Value__c = :stage LIMIT 1];     if (csList != null) {         Set<Id> Ids = new Set<Id>();         for (Opportunity opp : [SELECT Id, Name FROM Opportunity WHERE IsClosed = true AND IsWon = true]) {             Ids.add(opp.Id);         }          String formattedDateString = Datetime.now().format('EEE, dd MMM yyyy HH:mm:ss z');            String host = 's3.amazonaws.com/';         String method = 'PUT';          HttpRequest req = new HttpRequest();         Http http = new Http();          List<Attachment> att = [SELECT Id, Name, Body, ContentType FROM Attachment WHERE ParentId IN :Ids];         List<AWScredentialsSettings__c> creds = [SELECT Id, ClientKey__c, SecretKey__c, BucketName__c FROM AWScredentialsSettings__c LIMIT 1];         if (!att.isEmpty() && !creds.isEmpty()) {             String bucketname = creds[0].BucketName__c;             String key = creds[0].ClientKey__c;             String secret = creds[0].SecretKey__c;             String attachmentBody = EncodingUtil.base64Encode(att[0].Body);             String filename = att[0].Name;              req.setMethod(method);             req.setEndpoint('https://' + host + bucketname + '/' + filename); // The file should be uploaded to this path in AWS -- Opportunity/Salesforce Id/Secret Files/filename             req.setHeader('Content-Length', String.valueOf(attachmentBody.length()));             req.setHeader('Content-Encoding', 'UTF-8');             req.setHeader('Content-type', att[0].ContentType);             req.setHeader('Connection', 'keep-alive');             req.setHeader('Date', formattedDateString);             req.setHeader('ACL', 'public-read');             req.setBody(attachmentBody);              String stringToSign = method+'\n\n\n'+ att[0].ContentType + '\n' + formattedDateString +'\n/'+ bucketname +'/' + filename;             Blob mac = Crypto.generateMac('HMACSHA1', blob.valueof(stringToSign),blob.valueof(secret));             String signed  = EncodingUtil.base64Encode(mac);             String authHeader = 'AWS' + ' ' + secret + ':' + signed;             req.setHeader('Authorization',authHeader);         }          HTTPResponse res = http.send(req);         System.debug('*Resp:' + String.ValueOF(res.getBody()));         System.debug('RESPONSE STRING: ' + res.toString());         System.debug('RESPONSE STATUS: ' + res.getStatus());         System.debug('STATUS_CODE: ' + res.getStatusCode());     } }


Why do more sentences start with 'data' as a plural, than when it is within the sentence?

I recently put together some Google n-grams for a short piece on the transition of the word data into a singular (mass) noun: . There was one peculiar finding:  When starting a sentence, the trend reverses. "The data are" and "Data are" are approximately twice as common as "The data is" and "Data is". ()  The best suggestion for why, is that the writer is more careful at the beginning of the sentence (). Are there any actual grammatical reasons? Or, do you have any other guesses as to why the trend reverses? If so, I'll add them to the story - and link back to here. meta:* I'm not asking about the difference between data is and data are, so this question is not related to the earlier ones on ELU.


Expected Value of a Hypergeometric Random Variable

How do you show, that the expected value of a hyper-geometric random variable X with parameters $r$,$w$, and $n$ (a box contains $r$ red balls, $w$ white balls and $n$ balls are drawn without replacement) is $$\mathbf{E}(X)=\frac{rn}{r+w}?$$  I was able to reduce this to $$ \sum _{k=1}^{\infty}{r\choose k}{w\choose n-k}/{r+w\choose n} =\frac{n!(r+w-n)!r!w!}{(r+w)!k!} \sum _{k=1}^{\infty} \frac{1}{k!(r-k)!(n-k)!(w-n+k)!}. $$  No text I have seen yet proves this (and I think I know why mine doesn't either!). Any suggestions or references??


Which one runs faster, ArrayList or LinkedList?

List li = new LinkedList();  for (int i = 0; i &lt; 100; i++) {     li.add(i); }  long start1 = System.nanoTime(); li.get(57);  long end1 = System.nanoTime(); long diff1 = end1-start1;  System.out.println("Time taken by LinkedList = "+diff1);  List al = new ArrayList(); for (int i = 0; i < 100; i++) {     al.add(i); }   What ever operations I perform on both the lists, when I print out the time taken,  ArrayList always runs faster than LinkedList.  Can somebody explain which performs better in terms of time taken? Also let me know if there is something wrong in the code. Thanks!


Single "mkdir" command to make a new directory and change to that directory at the same time?

Quick question:   Is it possible to use "mkdir" to make a new directory AND change to that directory at the same time using a single 'mkdir' command?  Whole question:  I have this question:  What single Linux “mkdir” command could replace the sequence of commands?          mkdir a          cd a          mkdir b          cd b          mkdir c          cd ../..   My answer is:           mkdir a b c && cd c   Is there a single "mkdir" command, without using any other commands, perhaps with some flags or something, I can use to make AND change directory at the same time?


Can your own death be a trigger for Glyph of Warding?

I had made an assumption in an answer and am wondering if your own death is a legitimate trigger for a Glyph of Warding spell you have previously cast.   The requirement simply states:     You decide what triggers the glyph when you cast the spell.   The PHB lists the following as 'typical triggers':     opening that object, approaching within a certain distance of the object, or seeing or reading the glyph...You can further refine the trigger so the spell activates only under certain circumstances or according to physical characteristics (such as height or weight), creature kind (for example, the ward could be set to affect aberrations or drow), or alignment. You can also set conditions for creatures that don't trigger the glyph, such as those who say a certain password.   The common theme on these triggers is proximity, but is that an actual limitation?


How do I find the icon files used by non-default status menus (aka indicators)?

I'd like to find the location of the icons used by some non-default  (also called application indicators or indicator applets).    Where are these icons image files located?  In my screenshot I have ownCloud and Radiotray, but I would like a general answer not specific to these particular icons please. I don't know the file names or file types so searching is difficult.


I have a user control where the XAML of the control can bind to the appropriate properties from the parent's data context like normal (the data context propagates in xaml).   For example, I have a window whose DataContext I am setting to ObjectA for example. My user control within the window is then try to access the properties within the dataContext  So my window's xaml and code behind can both see a non-null DataContext.   My control that DataContext propagates to can see a non-null DataContext in the Xaml but not in the code behind.  What is the proper way of handling this?


Get sequence of numbers in bash without using seq

I want to loop over a sequence of numbers in a BASH script, but the bound values are not constants. I know this syntax:  for year in {2000..2010}; do   echo ${year} done   But the values of 2000 and 2010 are changing in my case, so what I am doing right now is this:  for year in `seq ${yeari} ${yeare}`; do   echo ${year} done   Is there a bash-native way to do the same, without using seq?


pgfplots: drawing multiple vectors with corresponding unit vectors

Suppose you have a couple of 3D-vectors given by their start and endpoints. Now you want to define a command that draws one of these vectors together with its respective unit vector from the same origin.  A similar problem has been answered before  - however the solution only works for vectors starting from (0,0,0).  As I struggled to apply the presented \foreach-approach on two given coordinates simultaniously and given the age of the solution, I approached this problem using the calculator-package.   I'm getting a functioning output for a single vector - unfortunately only the last unit vector (called by \vecuvec{1,1,0}{0,2,1}) is getting drawn correctly for multiple executions of \vecuvec as the coordinates (\sola,\solb,\solc) seem to be overwritten by the last execution of \vecuvec.  Is there a practical alternative by for example storing/accessing the coordinates in a different way or changing the scopes within the command \vecuvec?  MWE:  \documentclass{article} \usepackage{calculator} \usepackage[]{pgfplots} \usepackage{tikz-3dplot} \pgfplotsset{compat=1.15}  % Draw vector and corresponding unitvector \newcommand{\vecuvec}[2] %start point, end point (of vector) {   \VECTORSUB(#2)(#1)(\sola,\solb,\solc)     \UNITVECTOR(\sola, \solb, \solc)(\sola,\solb,\solc)     %arrow in blue     \draw[->,thick,blue] (#1) -- (#2);      %corresponding unit-vector in red:     \draw[->, thick,red] (#1) -- ($(#1)+(\sola,\solb,\solc)$);  }  \begin{document}  \begin{tikzpicture} \begin{axis}[xtick={0,1,...,4}, ytick={0,1,...,4}, ztick={0,1,...,4},              xmin=0,xmax=4,ymin=0,ymax=4, zmin=0,zmax=4]     \vecuvec{3,1,0}{4,2,1};     \vecuvec{2,2,2}{4,3,3};     \vecuvec{1,1,0}{0,2,1}; %only the last one works as intended \end{axis} \end{tikzpicture}  \end{document}   Output:    Here for the blue vectors only the leftmost has its unit vector drawn correctly (in red).


USB Drive is Read-Only, Impossible to Remove

I received a brand-less USB Thumb Drive during a function, those cheap made in China kind. When plugged in, it shows 2 drives, one 8GB and one 12MB drive(not partition). I am trying to remove the 12MB completely or at least delete the contents of it because it came with a trojan. However, that drive appears to be Read-Only and is impossible to delete. The 8GB portion is working fine.  I have tried deleting in Windows, using Disk Management and 3rd party disk management utilities. I have also tried to delete it in Linux using fdisk and Gpart. All were telling me the disk is read-only and they were unable to perform the operation.  There is no write protect switch on the usb drive. I somehow believe that the 12MB part is hard wired to write protect, or is some ROM, but I am not completely sure. I have searched everywhere until I have no choice but to ask. If anyone knows how to get around this, would really be appreciated.


Connotations of "hungry for X" and "thirsty for X."

Does "hungry for X" have different connotations than "thirsty for X"?  I did a few Google searches and found that "hungry for X" outdoes "thirsty for X" by about 250% with most values I tried for X.  On the other hand, "Thirst for knowledge" beats "Hunger for knowledge"; but "Thirsty for knowledge" loses to "Hungry for knowledge."  If you had to choose between the two phrases, what would you consider?   Perhaps thirst is more related to need, and hunger to desire?


SVA: Use "is" or "are" with "an odd number of"?

Which is grammatically correct? (And why?)   (a) "There are an odd number of items in the box." (b) "There is an odd number of items in the box."


The difference boolean doesn't seem to work on a specific area

I am trying to build a pc in blender and I just updated my blender to 2.91 but the boolean modifier doesn't seem to work as expected on a specific area.I am attaching a video below


Topic models and word co-occurrence methods

Popular topic models like LDA usually cluster words that tend to co-occur together into the same topic (cluster).   What is the main difference between such topic models, and other simple co-occurrence based clustering approaches like PMI ? (PMI stands for Pointwise Mutual Information, and it is used to identify the words that co-occur with a given word.)


A prime can be written as $a^2-ab+b^2$ if $p≡1$ (mod 3)

Show that if a prime $p ≠ 3$ is such that $p≡1$  (mod 3) then p can be written as $a^2-ab+b^2$ where a and b are integers.   I have no idea how to approach this question, so any help much appreciated! This is in the context of algebraic number theory, so I'm not sure if it's helpful to consider rings of integers or anything like that.


Prove $\exp(x+y) = \exp(x) \exp(y)$ for $\exp(x) = \sum_{n=0}^\infty \frac {x^n}{n!}$

I am trying to prove $\exp(x+y) = \exp(x) \exp(y)$.  I may use that $$\exp(x) = \sum_{n=0}^\infty \frac {x^n}{n!}$$ I further know how to multiply two power series in one point, i.e. if $f(x) = \sum_{n=0}^\infty c_n(x-a)^n$ and $g(x) = \sum_{k=0}^\infty d_n(x-a)^n$ then $$ f(x)g(x) = \sum_{n=0}^\infty e_n(x-a)^n $$ with $$ e_n = \sum_{m=0}^n c_md_{n-m} $$


Checking multivariate normality in linear regression using R

I am checking assumptions(multivariate normality) of multiple linear regression in R. I have 100 independent variables and want to check their normality.  Should i need to check one by one for all 100 variables? Or should we just assume there is a normality and proceed with the regression? Or is there any way from which I can check the normality of all 100 variables in a single piece of code in R?  Also is there any way the linearity of all these 100 IVs can be checked with the DV?


I've got a numpy array and need to sum the values in the rows. Then use the Update Cursor to update a field with this value. However the update cursor is updating the field with the same values.  tbl = arcpy.da.FeatureClassToNumPyArray(dg, ave_fields)  with arcpy.da.UpdateCursor(dg, "Weekly_Ave") as ucursor:     for urow in ucursor:         for i in range(len(tbl)):             urow[0] = sum(tbl[i])             ucursor.updateRow(urow)


I have dual boot with Win10/Ubuntu. I am running gparted within Ubuntu. I have also tried running gparted using the live USB. The result is same.  This is how it looks like:    I would like to increase the size of /dev/nvme0n1p6 (selected blue) using the unallocated space. But I am not able to do that.    I wonder if I am doing something wrong. I am also unsure why my unallocated space is split in two.


Assigning row number for sorted table by column in QGIS

Field calculator has a great function under "Records" called "$rownum" which returns (assigns) the number of the current row. Is there a way to make it work together with sorting? Let's say I want to sort table by column "length" and get the order (sequence) of lines by length from shortest to longest. I know I can use some office spreadsheet software easily for this to sort by column and populate new column with order (sequence). But I would prefer to do the whole job in QGIS. As workaround there is also  - using mmqgis plugin and function modify/sort and after that use "$rownum" on the new saved file.


Save output to txt file on remote server with user and password

After connecting to remote computer and executing some powershell job, I need to save a text file with output to a remote server using powershell.  My file name is created depending on computer name and date.  $filename = '' + $enddate + '' + $name + ''   Output is:  $output = "\\10.0.50.8\Informatyka\Posnet_raporty"   There is a username and password to connect to folder "Posnet_raporty"  $username = "user" $password = "pass"   I use 2 functions to create the file and have been trying to use the NET USE command to create a disc on the remote computer to save the file there, but it has failed ;/ (already mapped source from this adress, net use don't like it)  If ([int]$end1 -gt 30) {     $end1, $end2 | Out-File Q:\$filename'.txt' } else {     $end1, $end2 | Out-File Q:\'@'$filename'.txt' }   The output of $end1 is a number (this does not apply to the question, but I prefer to write everything I can)  edit: net use fail, can not work with this same source what is already mapped on computers. PSDrive is only accessible in PowerShell session.


How to intuitively understand the $n$-dimensional cube as the dimension grows large

So I read* that for the convex body, i.e. the cube $[-1,1]^n$ in $\mathbb{R}^n$, the smallest ball containing it has radius $\sqrt{n}$, while the largest ball inside the cube has radius $1$. Also,  "...as the dimension grows, the cube resembles a ball less and less."  How do I visualize these things when $n\geq 4$? I just can't see it! It'd be great if I could get some help with the intuition involved here. Thanks! *See page 2 of  Keith Ball, "An elementary introduction to modern convex geometry" in , Silvio Levy ed., Cambridge 1997.  Edit: While the suggested answers are very good, I don't think they address the particular geometric structure I am concerned with in my question.


Given $a=qb+r$, prove $\gcd(a,b)=\gcd(b,r)$

a,b ∈ Z b>0 q,r ∈ R a=qb+r with 0 <= r < b   Prove that GCD(a,b)=GCD(a,r)  My answer:   Let GCD(a,b)=x and GCD(a,r)=y x,y ∈ Z+ a/x,b/x ∈ Z a/x=q(b/x)+r/x ; (Dividing both sides by x) ; holds a=qb+r b/y  ∈ Z a/y=q(b/y)+r/y ; (Dividing both sides by y) To hold this a/y ∈ Z So y must be also an divisor of a   Is my way to reach the answer correct or does this have another method?


Is there any way to get a hat wider than widehat?  Why doesn't  \widehat{abcdefghijklmnopqrstuvwxyz}   really go over all of it?


How to convert a set of enumeration range from Delphi to C#?

I have these Delphi types:  type Color = (Red, Green,Blue); type Colors = set of Color;   then Colors is used as a property type in other types  I am trying to convert this to C#. My attempt:   public enum Color     {     Red, Green,Blue     }  public class Colors {   public Color[] CColor; }   I was wondering if there's a better equivalent way.


While pouring a liquid into a glass from a bottle, some streams have a wavy shape, like the one in the following photo:    What causes the stream to be of such a shape?


Symmetric functional equation $ x f ( y ) + y f ( x ) = ( x + y ) f \left( x ^ 2 + y ^ 2 \right) $ on $ \mathbb N _ 0 $: how to show $ f$ is constant?

Let $ \mathbb N _ 0 $ denote the non-negative integers. Find all functions $ f : \mathbb N _ 0 \to \mathbb N _ 0 $ such that $$ x f ( y ) + y f ( x ) = ( x + y ) f \left( x ^ 2 + y ^ 2 \right) \quad \forall \, x, y \in \mathbb N _ 0 $$  I got that $ f ( x ) = f \left( 2 x ^ 2 \right) $ for non zero $ x $ by setting $ x = y $. Does this show $ f $ is always constant, since the constant case does work by plugging in?


How do I do comments at a Windows command prompt?

What's the equivalent of # for Windows cmd console sessions, to create a comment?   The operating system is Windows XP.


Possible Duplicate:          Maybe this is more for SuperUser website, but as it appears all stack exchange use the same approach I'll ask it globally.  On posts, we can add links to external websites. The link to the various external websites are a light blue with no underline (I mean the HTML a href link). Now, underline in the world of HTML = a link!! Simple as that. Don't get me wrong, I'm a web dev/designer and I rather not use the underline (it's nicer on the eye) but I can't comment now on the amount of time I've replied to a post to only realize I've missed the link in the original question! Well, not only have I waisted the OP time by having to re-alert me I'm repeating his data, I've been marked down (well, it is my fault!) but worse, I may have spent a long time researching the answer!  I also know it could be my screen calibration etc, but, on SuperUser could we either have a darker colour or a rule so links are underlined through out?  EDIT As per Frédéric Hamidi , this has been asked before, but it was asked in 2009 so I'd like this to be a new consideration (if possible).


How to completely disable Subpixel rendering in Windows 8.1?

I am - unfortunately - one of the persons, for whom subpixel rendering is a visual burden instead of a help. So I am trying to disable it completely in Windows 8.1, but it still pops up a lot of places.  I have disabled ClearType in the Display control panel, which is respected by some applications. But Windows still use subpixel rendering in e.g. the control panel and other places.  Is there any way to disable it for all text-rendering?


In Dark Souls 2 there is a 'Shrine of Winter' near Sinners Rise. When you approach the shrine it will not let you open the door and a message pops up that says      Seek Mightier Souls   What does this mean and how do you open this shrine?


(complex measures) $d\nu=d\lambda +f\,dm \Rightarrow d|\nu|=d|\lambda| +|f|\,dm$ and $f\in L^1(\nu)\Rightarrow f\in L^1(|\nu|)$

Two simple exercises on complex measures I don't know how to solve, from Folland's Real Analysis. I find it difficult to manipulate the definitions in computations. For context, if $\nu$ is a complex measure on $(X,\mathcal{M})$ then $|\nu|$ is defined as $d|\nu|=|g|\,d\mu$ where positive measure $\mu$ and $g\in L^1(\mu)$ are such that $\nu \ll \mu$ and $\nu = g\,d\mu$ (and in the textbook it's shown that this definition does not depend on the choice of $\mu$).     1) Let $\nu$ be a reguar complex Borel measure on $\mathbb{R}^n$, $m$ denote   Lebesgue measure, and   let $d\nu = d\lambda + f\,dm$ be its Lebesgue-Radon-Nikodym   representation. Then ("it is easily verified")   $d|\nu|=d|\lambda|+|f|\,dm$.      2) If $f\in L^1(\nu)$ then $f\in L^1(|\nu|)$. I was able to prove the   reverse implication, but not this one.   The definition of $|\nu|$ in the case of real signed measures (as $|\nu|=\nu^+ + \nu^-$) makes sense to me but I can't see intuitively into the definion of $|\nu|$ for complex measures as given in the textbook. Do you have any advice on this?  Thank you!


How is the recommended next badge determined exactly?

According to , the     "Progress to next badge" bar automatically selects the badge you're closest to earning (or that's most logical to go for next)   While "the badge you're closest to earning" is pretty easy to determine: it's the bar with the most progress, I'm wondering what "most logical to go for next" means. Because right now on Meta Stack Exchange, I can track two badges: Illuminator and Legendary. My progress for Illuminator is 66.40% and for Legendary it's 66.67%, yet Illuminator is shown as the recommended next badge:    On some child metas where I barely have any activity, Student is shown as recommended next badge with a progress of 0/1, but I do have cast some votes so I have a small progress towards e.g. Civic Duty. So obviously there is some other logic at work, but what?


Compare two objects and add missing key to object

I got two JavaScript objects. I want to compare both objects to one another. If object 1 has a key which is missing in object 2 add this key to object 2.  But this must also be the case if object 2 has a key which is missing in object 1.  So for example, object 1 looks like this.  var object_1 = {     "Address": "Address",     "AccessDeniedText": "You do not have access to the page you requested.<br>Use the navigation menu on the left to select a page you want to open.",     "Basket": "Shopping cart",     "BasketVAT": "VAT {0}"     ... };   object 2 looks like this.  var object_2 = {     "Address": "Address",     "Basket": "Shopping cart",     ... };   In object 2 the key AccessDeniedText and BasketVAT are missing.  Expected result What i now want is to have an new object, lets say object 3 that would now output the following.  var object_3 = {     "Address": "Address",     "AccessDeniedText": "",  // I can fill this missing text     "Basket": "Shopping cart",     "BasketVAT": "" // I can fill this missing text }   I tried to use $.each() and for(key in object). However, this made my whole browser crash. Not so wierd, because each object has more then a 1000 rows.  I also tried to awnser of this question:  It didn't work for me.  Is there a simple way to do it? Without my browser crashing of the heavy payload? I dont care using jQuery.