The ranger and rogue in my game were asking about setting traps in preparation for a battle that was coming. Another player is convinced rogues can make traps because he saw it happen in D&D sessions online (in streams). But the only information about making traps that I can find seems to be addressed at DMs, in the context of designing dungeons and such. Research Rogues do get proficiency in , but this only lets you disarm traps (not create them):  This set of tools includes a small file, a set of lock picks, a small mirror mounted on a metal handle, a set of narrow-bladed scissors, and a pair of pliers. Proficiency with these tools lets you add your proficiency bonus to any ability checks you make to disarm traps or open locks.  PCs are also able to buy . So it would make sense that nifty rogues could backwards-engineer traps that they can buy and/or disarm, but I'm curious whether the books cover guidance in this regard. Related:   (only covers "hasty traps")   Question What are the options for player characters to create traps? By 'traps' I mean methods or mechanisms designed to influence, hinder, or expose enemies, which must be set up before use, operate on a trigger (set off by target or by trapper are both fine). For this question I'm excluding spells that function as traps.


I am looking for an older series about space colonization

Way back in high school I read a series about colonization of other planets. In the books, contact was lost with the rest of the civilization and over time people with mathematical ability were able to control the computers that were doing the terraforming...and later came to be seen as wizards.  I cannot for the life of me remember the author or title...can anyone help?


Proving simple Equation has only one root

Show that the equation $$3^x+4^x=5^x$$ has exactly one root.  Consider x as a member of real number set. This question was given by my instructor as part of Calculus course.  I don't have any clue on how to approach this. Please help me in solving this.


"Be the 1% that do not." vs "Be the 1% that does not." vs "Be the 1% who does not."

I'm stuck on which is the correct grammar to use in my ad copy. The first sentence is "99% of patients have to wait." which is followed by (one of the following):   "Be the 1% that do not." "Be the 1% that does not." "Be the 1% who does not." "Be the 1% who do not."


So I know that the period of a pendulum in a free falling elevator isn't going to change because there is no force acting on it since $$T = 2\pi\sqrt{\frac{\ell}{g}}.$$ So what happens to a pendulums period when it's going up in a lift in a constant speed, and what will happen to the period of a pendulum if it's accelerating up in a lift?


If $a \mid m$ and $(a + 1) \mid m$, prove $a(a + 1) | m$.

Can anyone help me out here? Can't seem to find the right rules of divisibility to show this:  If $a \mid m$ and $(a + 1) \mid m$, then $a(a + 1) \mid m$.


Potato Power. Self sustaining medium using a living potato plant possible?

The second picture are potatoes wired in parallel. I understand that the potato is the medium for a chemical reaction between the copper and zinc. That aside, would wire and in soil potato plant continue to grow replenishing the medium(nutrients and water) regardless of having a current in the potato?     Or   Will the plant react to the physical damage or be depleted of nutrients/water needed to weakening the current or plant?  Maybe the current can be intermittent to allow the plant to recover? Can the current be low enough not inhibit plant growth?  I would ask chemistry if I was interested how a potato clock works, but I am more interested in the plant health and connections.       I have seen many potato experiments online but none where the potato plant was intact in the soil producing power.


Can "sitcom" be considered an "acronym"? A Syllabic Acronym? Or a Hybrid Acronym?

ACRONYM - An abbreviation formed from the initial letters of other words and pronounced as a word    Much has been written about acronyms and abbreviations here at EL&U. See   However, I see no mention to this type of acronym where the first half of a word is joined to the second half of another.        Sitcom - a situation comedy, certainly doesn't fulfill the classic criterion for an acronym.  But it might be a variety and might be called by a diferent name. Is it?


Prove that $\mathbb{Q}(\sqrt[3]{p}, \sqrt{q}) = \mathbb{Q}(\sqrt[3]{p}\cdot\sqrt{q})$

Let $p, q$ be distinct primes and $L := \mathbb{Q}(\sqrt[3]{p}, \sqrt{q})$.  I want to show that $L = \mathbb{Q}(\sqrt[3]{p}\cdot\sqrt{q})$. Of course one inclusion is clear, but how do I get the other one?


How to convert an Stream into a byte[] in C#?

Is there a simple way or method to convert an Stream into a byte[] in C#?


Normal ordering of the commutator between annihilation and creation operator

According to the commutation relation of annihilation and creation operators,   $$[a,a^{\dagger}]=1. \tag{1}$$   I would like to calculate the vacuum expectation value of the normal order of this commutator. We claim that since this commutator is just a c-number, then there is no effect from the normal ordering. We therefore get   $$\langle 0|(:[a,a ^\dagger]:)|0 \rangle=1. \tag{2}$$  However, if we expand the commutator first and do normal order later, we will get something like   $$\langle0|(:[a,a^\dagger]:)|0\rangle=\langle0|(:aa^\dagger-a^\dagger a:)|0\rangle=\langle0|(a^\dagger a-a^\dagger a)|0\rangle=0.\tag{3}$$ Which is contradicting with itself.


Is there a number that can be represented as $A^B=B^A$ after $16$ , where A and B are 2 distinct real numbers?

The number $16$ can be represented as $2^4=4^2$. Is there a (real) number after $16$ that can be represented as $A^B=B^A$? Where A and B are two distinct real numbers.I've checked many numbers and I'm convinced that there are  no other numbers with such property, I conjecture that $16$ is the only real number with such property. But maybe I'm wrong. Is it true that $16$ is the only number with such property ? (My question here is much more specific than the other similar question has been posted.)


Speed of light's relation with the expansion of the universe

If nothing can travel at the speed of light and light cannot escape the universe, then the rate of expansion of the universe should be equal to the speed of light, why it is not?


Suggested edits that add a link to a JSFiddle: should we approve or reject them?

Today I saw a  that just added a JSFiddle to the question. I didn't know whether we have have to approve or reject them, so I .  replied that I could ask it on Meta, so that's what I do now.  Do we have to approve or reject suggested edits that only add a JSFiddle link?


FFmpeg - blur image according to blur map

Is it possible with FFmpeg to blur a video according to blur map like this? Attached a sample.  Looking for a way to make specific parts of image blurred. Like ImageMagick's "compose blur", but for video.


How to push footer to the bottom of the page with little content (flexbox or grid)

I want to push footer to the bottom of the page with little content.   It tried the code below and the footer is pushed to the bottom, but I can't scroll pages with lots of content.     #Wrapper, body {   height:100%;  background: white; }  #Wrapper {   display: flex;   flex-direction: column; }  #Header_wrapper, #Content {   flex: 1 0 auto; }  #Footer {  flex-shrink: 0;  margin-top:auto }


Are there too many Sith in The Phantom Menace?

I read on Wookieepedia that  was still plotting with Darth Sidious during "The Phantom Menace".   If Plagueis is Sidious' Master and Maul is Sidious' Sith Apprentice doesn't that violate the Sith's ?


How to do mission 'The Molecular Level' with Brotherhood of Steel?

I am having hard time powering up Teleporter when aligning myself with Brotherhood of steel.  I don't get additional items required in special build menu, what do I do?


I understand this: There is a 95% chance any sample from a binomial distribution of samples of size n will have a sample proportion of success between: $$p\pm 1.96*\sqrt{\frac{p(1-p)}{n}}$$  I don't understand why the 95% confidence interval for population proportion p is:  $$\hat{p}\pm 1.96*\sqrt{\frac{\hat{p}(1-\hat{p})}{n}}$$  can someone please provide a derivation of some sort, to me, it really makes no intuitive sense.


Why do I need an `;` or newline in `echo hi| { cat; }`?

In bash and dash the examples  echo hi | { cat ; }   and   echo hi | { cat }   produce the intended result hi. However,   echo hi | { cat }  is a syntax error   $ sh -c "echo hi | { cat };" sh: 1: Syntax error: end of file unexpected (expecting "}")   This seems somewhat surprising to me. I did a little digging and looked at the POSIX specification for sh ()  a brace group is defined as   brace_group      : Lbrace compound_list Rbrace                  ;   And a compound list is defined as  compound_list    :              term                  | newline_list term                  |              term separator                  | newline_list term separator   The following rules seem to suggest to me that cat with no newline should be a valid term (and hence a valid compound_list on its own)  A term can consist of just an and_or  term             : term separator and_or                  |                and_or   An and_or can consist of just a pipeline  and_or           :                         pipeline                  | and_or AND_IF linebreak pipeline                  | and_or OR_IF  linebreak pipeline   which can consist of just a pipe_sequence  pipeline         :      pipe_sequence                  | Bang pipe_sequence   which can consist of just a command  pipe_sequence    :                             command                  | pipe_sequence '|' linebreak command   which can be just a simple_command  command          : simple_command                  | compound_command                  | compound_command redirect_list                  | function_definition   which can consist of just a cmd_word or cmd_name, I'm not sure which cat would be in this context.  simple_command   : cmd_prefix cmd_word cmd_suffix                  | cmd_prefix cmd_word                  | cmd_prefix                  | cmd_name cmd_suffix                  | cmd_name   I'm not sure whether cat in the above example would be parsed as a cmd_word or a cmd_name, but it seems like it should at least be parsed as a simple_command, why is an explicit separator required in this context?


If $(M,d)$ is a compact metric space and $f:M\rightarrow M$ is an isometry ($d(x,y)=d(f(x),f(y))$ for any $x,y\in M$), then $f$ is a homeomorphism

If (M,d)  is a compact metric space and f:M→M  is an isometry (d(x,y)=d(f(x),f(y))  for any x,y∈M ), then f  is a homeomorphism.   I proved that $f$ is continuous as its inverse,I proved that it is injective also. I couldn't prove that it is also surjective...  thanks for any advance.


how to install java 8 32 in ubuntu 18.04

i have downloaded the java 8 32 bit "jdk-8u171-linux-i586.tar.gz" and i have extract the folder "jdk1.8.0_171". Here my question is how to install jdk1.8.0_171  Please help me on this?


Is there a table that includes all of the magic items sorted by rarity?

This might be a 'read the rules' to me question, but I haven't been able to find it.  I need to select a magic item based on it's rarity (specifically Uncommon if it's relevant). I'm looking for a table that lists all of the DMG's magical items alphabetically and either splits them by rarity or indicates rarity. This seems like a very useful table for a DM to dole out treasure from, so I'm not sure why it would be excluded.  Without this table, I've had to sort through the entire list of magic items manually and check rarity, which isn't a big ordeal, but it is inconvenient.  Is there a table like this available somewhere? I know that sometimes useful tables that reasonably belong in one book end up being put in another.


Analyzing Windows 7 intermittent freezes

For a few weeks now, my Windows 7 installation has been showing intermittent freezes. Typically, the currently focused application window will freeze for up to 7 seconds, but I can still switch to a different application which will be working fine. Often, Firefox will freeze when loading a page, but other applications freeze as well at unpredictable times.  I created two xperf traces which capture a freeze in two different applications, as well as a trace without a freeze (following ). The only correlation I found so far is some higher-than-usual writing to the disk occurring near the moment of the freeze, but in the summary table, I see no obvious differences between the freezing and the non-freezing traces. What should I be looking for?


What is the most efficient way to create and mine obsidian after bug patch?

Now that the "Infiniobsidian" obsidian generator method has been patched as of the more recent snapshots, what is the most efficient way to generate and mine obsidian?


Compelled and compeled - American English

As for the British English it's always taught - compel, compelled, compelling  Some of the books/dictionaries say that in American English you say compel, compeled, compeling instead, you simply don't double that l.  Moreover, Merriam Webster (11th Collegiate) doesn't mention "compeled" at all. With counsel - both options are listed.  Interestingly,  doesn't indicate much usage of "compeled". On the  hand, "counseled" is more popular than "counselled" in AmE  How is it really in American English?


Moving data from columns in a table to rows by a key field?

I would like to shift data found in a column to a row by Key field. I have a table, within a geodatabase, set up similar to what's below.  KEY_    Value 123     Yellow 123     Blue 456     Red 456     Yellow 789     Green 246     Green 246     Orange   I want to create a table that moves the data in the Value field to rows based on the KEY_ field. The result will look like what's below.  KEY_    Value001    Value002 123     Yellow      Blue 456     Red         Yellow 789     Green 246     Green       Orange   Does anyone have an idea of how this can be done? I tried using the Transpose tool Esri offers but it didn't produce the result I'm looking for. I have basic understanding of Python.


Why aren't Maxwell's equations overdetermined?

Consider the four differential equations in the table given on wikipedia  and assume there is no charge distribution at any point in time, and thus also no current. If there is no charge, then the four equations reduce to the following: $\nabla\cdot E = 0$ $\nabla\cdot B = 0$ $\frac{\partial B}{\partial t} = -\nabla\times E$ $\frac{\partial E}{\partial t} = c^2\nabla\times B$ The last two equations tell us how both the magnetic and electric fields change over time respectively, thus given some initial magnetic and electric fields, one should be able to determine any future state of both field. This makes the first two equations seem redundant to me and thus the system seems over determined. However they are clearly necessary, so I must be missing something. Are the first two equations simply initial conditions?


Words that mean the exact opposite to themselves

As I'm sure everyone is now aware,  -- two words with the opposite definition. It got me wondering:   Are there any other words in the English language that can mean the opposite to itself?


Let G be a connected graph with at least one cycle. Proof that G is biparthite when no cycle is odd

So i have this task i am a little bit lost how to approach this problem. Could anyone guide me trough it? Let G be a connected graph with at least one cycle. Proof that G is bipartite when no cycle is odd.


Altitude extraction from a DEM(.tiff) file using Python

I have a DEM(.tiff) file and I need to know the altitude of certain points(coordinates).   I opened it like this:  import tifffile as tiff import matplotlib.pyplot as plt import rasterio  tfile = tiff.imread('ms.tif') tfile.shape tiff.imshow(tfile)   Then I've got this image:    I just need some function to get altitude to my points, not the full code.


How can I run a batch file when Firefox starts?

I want to run a .bat file when any .exe file (such as Firefox) is double clicked. I want to run this .bat file when Firefox runs. Is there any way to do this?  I tried with this batch code:  reg add "HKEY_LOCAL_MACHINE\SOFTWARE\Microsoft\Windows NT\CurrentVersion\Image File Execution Options\firefox.exe" /v Debugger /d "D:\Desktop\m.bat" /f   Here, m.bat is the file which I want to run when Firefox runs.  Image of my Registry:


How should I think about morphism equality?

I am studying category theory, and I think I often struggle between the fuzzy lines between Set as a category and then the category theoretic abstractions.  For example, take monomorphisms. I totally get the idea, but what does it mean for two morphisms to be equal, or not to be equal? It seems like the definition of a category (objects and morphisms between them) doesn't provide for the possibility of comparing morphisms... and yet, in things like monomorphisms, it only makes sense if there is an idea of different morphisms between the same objects that may or may not be equal.  I get that in set, since the underlying object are sets and the morphisms are functions between sets, it's possible that, say...  A = {1, 2, 3} B = {1, 2} f = 1 -> 1, 2 -> 1, 3 -> 2 g = 1 -> 2, 2-> 2, 3 ->1   But what in category theory allows me to distinguish between the morphisms f and g?


How does wave function collapsing fit into QFT?

I followed a basic course on QFT and know some basic concepts but I focussed mainly on calculations and understanding the Feynman rules e.g.. However, sometimes I have the idea that there a quite some fundamental concepts I might be missing, especially regarding the interpretation of QFT and "what's happening". One of the things I wonder is how does wave collapsing of QM fit into QFT? In QM there was a lot of focus on measurements, probabilities, and (the collapsing) of the wave function. Of course, particles in QM and QFT are fundamentally different. In QM they are probability waves and in QFT they are (excitations of) fields. And if I'm not mistaken I would say that for the field of a particle, the excitations of the field are governed by the rules of Quantum Mechanics. However, is the wave function really completely gone, or is there some way to link fields to wave functions again and effects of measurements etc.


Some sentences begin with a construction like "May I suggest that...." These are phrased as questions but are really statements. Should such a sentence end with a question mark or a period [full stop] (and what is the rationale)?


Calculate simple expression: $\sqrt[3]{2 + \sqrt{5}} + \sqrt[3]{2 - \sqrt{5}}$

Tell me please, how calculate this expression:  $$ \sqrt[3]{2 + \sqrt{5}} + \sqrt[3]{2 - \sqrt{5}} $$  The result should be a number.  I try this:  $$ \frac{\left(\sqrt[3]{2 + \sqrt{5}} + \sqrt[3]{2 - \sqrt{5}}\right)\left(\sqrt[3]{\left(2 + \sqrt{5}\right)^2} - \sqrt[3]{\left(2 + \sqrt{5}\right)\left(2 - \sqrt{5}\right)} + \sqrt[3]{\left(2 - \sqrt{5}\right)^2}\right)}{\left(\sqrt[3]{\left(2 + \sqrt{5}\right)^2} - \sqrt[3]{\left(2 + \sqrt{5}\right)\left(2 - \sqrt{5}\right)} + \sqrt[3]{\left(2 - \sqrt{5}\right)^2}\right)} = $$  $$ = \frac{2 + \sqrt{5} + 2 - \sqrt{5}}{\sqrt[3]{\left(2 + \sqrt{5}\right)^2} + 1 + \sqrt[3]{\left(2 - \sqrt{5}\right)^2}} $$  what next?


which Ubuntu should I install for a low spec computer

I want to install Ubuntu but my computer specs are very low and I don't know which Ubuntu I should download. I want to install Ubuntu but my PC is a Compaq Mini 110.   It has:   70 GB of free of disk space 1 GB RAM 32 bit system Intel Atom CPU N270 / 1 GHz   I currently have Windows 7. So I want to have both windows and Ubuntu on my PC.


I'm a fan of James Martin and have no problem with the amount of butter that he uses.  However, I'm totally unsure what type of butter to use!  Salted or unsalted?


I'm learning C, and I encountered a problem when I tried to increment letters in a string. Consider the code below:  int main() {     char *s = "abcdefg";     increment(s);     printf("%s\n", s); }   void increment(char *string) {     for (int i = 0; string[i] != 0; i++) {         (*(string + i))++;     } }   Currently I'm using C99. After I tried executing this, it gives be Bus Error: 10. I don't know why this is the case. Thanks!


Beamer: set global parksip for all columns

It seems that parskip does not affect columns which was also discussed . However, Stefan's solution seems to work only in block environments (which I do not want to add everywhere). So I thought that I try to patch the column environment with etoolbox. In this regard, I tried to add the following commands to the preamble without effect:  \documentclass{beamer} \usepackage{etoolbox} \setlength{\parskip}{1cm} %\BeforeBeginEnvironment{column}{\setlength{\parskip}{2cm}} \AtBeginEnvironment{column}{\setlength{\parskip}{2cm}} \begin{document}     \begin{frame}{Title}         foo          bar     \end{frame}      \begin{frame}{Title}         \begin{columns}             \begin{column}{\textwidth}                 foo                  bar             \end{column}         \end{columns}     \end{frame}      \begin{frame}{Title}     \begin{columns}         \begin{column}{\textwidth}\setlength{\parskip}{1cm}             foo              bar         \end{column}     \end{columns} \end{frame} \end{document}     Is there any way to set a parskip in every column to make it work like in the last frame of the MWE?


Prove the sum of all numbers that do not have a multiplicative inverse mod $n$

I understand that for a number $a$ to have a multiplicative inverse in mod $n$, it must be coprime to $n$; therefore, all numbers that do not have a multiplicative inverse mod $n$ must share a factor with $n$.  Now, my prediction was that if $n$ is even, then the sum of all numbers that do not have a multiplicative inverse mod $n$ is $\frac{n}{2}\bmod{n}$, and if $n$ is odd, then the sum is $0\bmod{n}$.  Originally my proof was constructed something like this: if $n = p_1^{\alpha_1} p_2^{\alpha_2} \cdots p_k^{\alpha_k}$, then the sum of all the elements of this array:  $$\begin{align} \begin{matrix} p_1 & p_2 & \cdots & p_k \\ 2p_1 & 2p_2 & \cdots & 2p_k \\ \vdots & \vdots & \cdots & \vdots \\ n-2p_1 & n-2p_2 & \cdots & n-2p_k \\ n-p_1 & n-p_2 & \cdots & n-p_k \end{matrix} \end{align}$$   would cancel out in the correct way. However, while trying to prove this, I hit a roadblock  because I wasn't sure how to account for the multiplicity of the factors of $n$.  If I understand  correctly, this is the same as finding the sum of all numbers that are not units in the ring of integers modulo $n$, $\mathbb{Z}/n\mathbb{Z}$. Is there any way to do this? If the result is so nice, I feel like there is also a nice way to prove this.


Does a stationary charge in a gravitational field radiate?

According to the equivalence principle, a freely falling observer constitutes an inertial frame. Thus, locally, Maxwell's equations apply in their usual form. According to these equations, an accelerated charge should radiate electromagnetic energy. But in this frame, a stationary charge on the earth does indeed accelerate, meaning that it should radiate. So why don't we observe that stationary charges in gravitational fields, like that of the earth, radiate electromagnetic radiation? And do we observe that charges in free fall radiate (which they shouldn't according to the equivalence principle)?


I need an algorithm that can compare two text files and highlight their difference and  ( even better!) can compute their difference in a meaningful way (like two similar files should have a similarity score higher than two dissimilar files, with the word "similar" defined in the normal terms). It sounds easy to implement, but it's not.  The implementation can be in c# or python.  Thanks.


How can I install Python 3.5 for Ubuntu 18.04?

For some tox tests, I need a Python 3.5 interpreter. How can I install it on Ubuntu 18.04?


In $(\mathbb{R},<)$ $D_{1}:=\{(x,y)\in\mathbb{R}\times\mathbb{R}|\,x<y\}  , D_{2}:=\{(x,y)\in\mathbb{R}\times\mathbb{R}|\,x=y\}  , D_{3}:=\{(x,y)\in\mathbb{R}\times\mathbb{R}|\,y<x\}   D_{4}:=\{(x,y)\in\mathbb{R}\times\mathbb{R}|\,x\neq y\},   D_{5}:=\{(x,y)\in\mathbb{R}\times\mathbb{R}|\,x\leq y\}  , D_{6}:=\{(x,y)\in\mathbb{R}\times\mathbb{R}|\,y\leq x\}  , D_{7}=\mathbb{R}\times\mathbb{R}$  , and $D_{8}:=\emptyset $  I want to Show none of else is definable in $(\mathbb R,<)$.  Using Hint:   . Using if h is an automorphism, then it preserves setwise,i.e. h[D]=D.   And hint also says, first check that if D   is definable in $\mathbb{R}\times\mathbb{R}$  , then for i=1,2,3  . $D\cap D_{i}\neq\emptyset$   iff $D_{i}\subseteq D$  And left hand side is done. The problem is r.h.s.   For doing $\Rightarrow $, I need an automorphism $h$ which preserves <  and for any $(x,y) \in D_i$, and for (a,b) in $D_i\cap D$,  $ (h(a),h(b))=(x,y)$ so that $D_i\subseteq D$. But I couldn't find such automorphism.


How is Einstein's postulate about the invariance of the laws of physics justified?

According to one of Einstein's postulates related to special relativity, > "the laws of physics remain invariant in their form and nature in all inertial frames".   But global inertial frames don't exist in this universe, so how is Einstein's postulate justified?


How to have a default method while still be able to override it?

This is a C# project.  I have several classes inherited from a base class. Most of the child classes have the same behavior while some of them behave differently.  I'm using the new keyword.  public class Parent {     public DataTable FetchScore()     {         // blahblah     } }  public class ChildNormal : Parent { }  public class ChildOdd : Parent {     public new DataTable FetchScore()     {         DataTable dt = base.FetchScore();         // blahblah     } }   But the build says using new is not a good practice.  I cannot use virtual and override either, because I want a default. I don't want to copy the same override implementation many times.  How do I do this in C#?


Verification of proof that two sequences converge to the same value

Consider the sequences $\{x_n\}_{n=1}^\infty$ and $\{y_n\}_{n=1}^\infty$ satisfying the following properties:         $0<y_1<x_1$   $x_{n+1}=(x_n+y_n)/2$ for all $n\ge2$   $y_{n+1}=2x_ny_n/(x_n+y_n)$ for all $n\geq 2$      I would like to prove that $\lim_{n\to\infty}x_n=\lim_{n\to\infty}y_n=\sqrt{x_1y_1}$. Here's my proof. Is it correct?     $x_2$ is the arithmetic mean of $x_1$ and $y_1$, while $y_2$ is their harmonic mean. Since the former mean is always larger, $x_1>x_2>y_2>y_1>0$. By extension:   $$x_1>x_2>x_3>\dots x_n>x_{n+1}>y_{n+1}>y_n>\dots y_3>y_2>y_1>0$$   Thus $\{x_n\}$ and $\{y_n\}$ are monotone and bounded; by the monotone convergence theorem they converge to a finite limit.      Let $\lim_{n\to\infty}x_n=x$ and $\lim_{n\to\infty}y_n=y$. Then $x=(x+y)/2$ as $n$ goes to infinity, so $x=y=L$.   Moreover, $x_1y_1=x_2y_2=x_3y_3=\dots=x_ny_n=x_{n+1}y_{n+1}=L^2$, so $L=\sqrt{x_1y_1}$. $\blacksquare$


Getting “Command not found” when trying to execute mounted file

I’m not able to execute the files in a mounted directory in my Ubuntu 16.04 VM. I get the error “command not found”:  dseltz-VirtualBox:/local> ls -al /nfs/local/gnu/i86Linux2.0/bin/makeheader -rwxr-xr-x 1 systemd-network uucp 49379 Oct 20  1999 /nfs/local/gnu/i86Linux2.0/bin/makeheader dseltz-VirtualBox:/local> /nfs/local/gnu/i86Linux2.0/bin/makeheader /nfs/local/gnu/i86Linux2.0/bin/makeheader: Command not found.  My VM is a x64 running Ubuntu 16.04 and so is the mounted system. I looked at the mounts and don’t see the noexec property(on either system). Here is the mount command:  sudo mount -o exec 10.15.1.203:/local /nfs/local  I made sure my users matched on my VM machine and the build system. Any ideas what I'm doing wrong?


How many digits does $2^{1000}$ contain?

I tried this way, I only need to know if this is correct or if there are better ways to solve this:  $2^{1000}$ does not have a factor of $5$ obviously therefore we can assume  $$ 10^{m} < 2^{1000} < 10^{m+1}$$ for some  $m$   Assume $ k = 2^{1000}$, then take log on both sides $\log k = 1000  \log 2 \approx 301.02999 > 301$  Therefore $2^{1000}$ has $302$ digits.


I am training a DNN (CNN + RNN) for a voice conversion task. Although my train loss can be very low with good performance, I believe I am experiencing massive overfitting. To overcome this, I have already added quite a bit of batch norm and dropout inside the model as well as weight decay — however, the model still continues to overfit a lot. I present some of my loss curves below: With a weight decay constant of 1e-7:  With a weight decay constant of 1e-2:  Note that I noticed that if the weight decay constant is > 1e-4, the model seems to experience underfitting. I want to know what else can I do to improve this model's generalization. Is it just a matter of more data, or do I need to modify my DNN architecture in some way. I have been struggling with this overfitting problem for some days now, and any insight would be a help.


See .  The problem was that Stack Overflow was trying to access  http://cdn2.sstatic.net/stackoverflowimg/so-fb-logo.png?v=2   When it should have done this:  http://cdn2.sstatic.net/stackoverflow/img/so-fb-logo.png?v=2     I have been experiencing similar problems all over Stack Exchange. For example, here's one from math.SE (click image to enlarge):    From gamedev.SE:    It says:  Failed to load resource: the server responded with a status of 404 (Not Found)   And the URL that returned a 404 was  http://cdn.sstatic.net/math/imgnewsletter-ad.png   Not surprisingly, :  http://cdn.sstatic.net/math/img/newsletter-ad.png   I've been seeing these types of 404s on many other Stack Exchange sites.


The series Star Trek: Discovery, due to be released in early 2017, will be the first new Star Trek series since Enterprise. According to :      Set to premiere on CBS in January 2017 before moving to All Access,   the series will introduce new characters to the Star Trek franchise,   and will not be related to the 2016 film Star Trek Beyond.   The same article mentions that it will take place in the original timeline.   Has there been any confirmation of what year the series is set in? Is it before or after Star Trek: Beyond?


Trying to map + to  globally (Vim-like arrow keys) with xmodmap

I am trying to map Ctrl+H,J,K,L to arrow keys Left,Down,Up,Right, respectively, on Ubuntu OS (globally, not inside Vim).   I've attempted the solution posted , but the modifier commands are not working. Here is what I am trying:  xmodmap -e "keycode 45 Control_L = k Up" xmodmap -e "keycode 45 control = k Up"   (keycode 45 maps to "k")  Neither commands work. (They give no errors, but ctrl + k is not remapped to up arrow)  Is there a way to do this xmodmap, and if not, is there a cleaner workaround?  Thanks!  Edit: I have found my answer  - thanks to swift


I'm struggling to get my head around the relationship between UFD, PID and Euclidean Domain. I've seen in a theorem in my notes that Euclidean Domain ⇒ PID ⇒ UFD ⇒ ID. Is it possible for UFD ⇒ ED?


Virtual Host not working as expected when I'm using .dev domain extension

I'm doing a Laravel project and I need to set up a virtual host example.dev in my system. For that I've created a copy of 000-default.conf and named it as example.dev.conf and placed in /etc/apache2/sites-available. The contents of the file is given below (comments removed):  <VirtualHost *:80>     <Directory /var/www/html/example/public/>         Options Indexes FollowSymLinks MultiViews         AllowOverride All         Require all granted     </Directory>      ServerName example.dev     ServerAlias www.example.dev      ServerAdmin admin@example.dev     DocumentRoot /var/www/html/example/public      ErrorLog ${APACHE_LOG_DIR}/error.log     CustomLog ${APACHE_LOG_DIR}/access.log combined </VirtualHost>   Then I've enabled the site using a2ensite command and disabled 000-default.conf using a2dissite command. Then it will open my project when I try localhost (/var/www/html) in my browser and not example.dev. The virtual host example.dev always produce "The site can't be reached" error in browsers.  Any suggestions?


If $f(2n)=\frac1{f(n)+1}$ and $f(2n+1)=f(n)+1$ for all $n\in\Bbb N$, then find $n$ such that $f(n)=14/5$.

The set $\mathbb{N}$ is the set of nonnegative integers.  Let $ f : \Bbb{N} \rightarrow \Bbb{Q}$ be defined such that 1.) $f(2n) = \dfrac{1}{f(n)+1}$ for all integers $n>0$, and 2.) $f(2n + 1 ) = f(n)+1$ for all $n\in\Bbb{N}$. If $f(0)=0$, then determine the value of $n\in\mathbb{N}$ such that $f(n)=\dfrac{14}{5}$.


I am currently working on a hydrology project where I am trying to break a stream network into 250m segments.  The problem is that the streams are not all adjacent, as I have clipped the NHD file to include only perennial streams in my watershed.  What I have been doing is taking these different, unconnected line features and merging them into one stream using editor.  I then have been using the "divide line by length" add in found here: .    What this tool is doing however is spliting the whole set into 250m segments, but not necessarily keeping the new segments adjacent to each other.  The tool is combining segments that do not measure up to 250m with portions of other lines that also do not add up, but on totally unconnected streams.    I have also tried to use the split tool in editor.  I have been splitting by distance (250m), but it is only creating one new feature of that length, not breaking it up the entire merged stream.


I thought python 3 is standards on ubuntu 16.04, but to use it I have to type 'python3'. Is there a way to use python instead and python2 for the old version?


How do I change parts of my terminal prompt?

In Terminal it says  Last login: Mon Jan 13 00:00:14 on ttys000 Logsdon:~ DomGomez$    How do I change the DomGomez part in Terminal?


Why does Stack Exchange (and Stack Overflow in particular) make it so hard for new contributors to participate?

I've been a lurker (or consumer) of Stack Overflow for as long as I can think back (it definitely feels longer than the 12 years the site exists). During that time, I've often felt the impulse to add to what is already there. But apparently that will never happen. How will I ever earn the reputation that is needed for contributing if I may not contribute? And, duly noted, I will never gather the hubris to say "I've got a completely new question that was never asked before", and  beware much less will I claim to have an answer. No, I want to contribute in form of refinements, and the perfect way to do this would be comments. So tough luck, one less contributor, I guess I will stay consumer. Any thoughts? Bye


Searching symbols, non-letter characters in Google

I'd like to search the internet for a string containing a few symbols, namely dashes, pipes and angle brackets.  I tried searching for them by typing them into Google but it seems to ignore the symbols.  Any advice?


What can a scammer do with my name, birthday, address, email and bank?

I had a scammer call me. The person knew my name, birthday, address, email and my bank. I didn't give them sort code, account number, or anything else. Am I still in danger of fraudulent transactions? I hung up as soon as they asked for the sort code.


Is there a simple way to create a custom Install Media that uses a customized Ubiquity installer?

I want to know how to create a Ubuntu based Install Media that has an customized Ubiquity installer that has custom branding and custom packages. I don't just want to create a ISO file of a system, I want an installer.   I also don't want to create my own mirror, just want to use the default Ubuntu mirrors.   (Pretty much I want to create a custom Ubuntu flavor for myself)  I can't find how to do this in a simple way anywhere. I AM READING the DebianCustomCD page on the Debian Wiki but it doesn't go over editing the Ubiquity Installer which is one of the main things I am trying to do.


Am I eligible for a refund of Social Security and Medicare taxes for when I was on an F-1 visa?

This question is for a friend. They came to the United States as a student in 2009 on OPT/F-1 visa. In November of 2011 they started to work for the Department of Defense as a teacher. They had Social Security and Medicare taxes withheld and not refunded. In August of 2012 they were converted to an H-1B visa.  Should they have been refunded the Social Security and Medicare taxes that were withheld for 2011, and possibly 2012? It seems to depend on whether they were considered a resident or nonresident alien for those tax years, according to . The  says as an F-1 student they are exempt. Would this count for 2011 and 2012, or just 2011? If they are due a refund, how should they go about getting it?


How to return more than one value from a function in Python?

How to return more than one variable from a function in Python?


all time or all-time, not sure which one it is. Are they different in different scenarios?


"Data management tools" does not exist under "Vector layer"?

I am using QGIS 2.18.12 and I need to calculate the area of overlap between two shapefiles. Help I've already found for this problem says to use "Data management tools" under "Vector layer" but the former does not exist in my version of QGIS.  Can someone explain what I need to do?


I'm confused as to why I can't step into either of these if statements. Am I missing something incredibly simple? I'm typing in aa or AA or c or C and it doesn't step into either if statement. Any ideas why?   while(play){         String answer;         Scanner input = new Scanner( System.in );         System.out.println("Please select an option");          answer = input.nextLine();          answer = answer.toUpperCase().trim();          System.out.println(answer);       if(answer == "AA"){          System.out.println("Have fun!");          System.out.println("Enter player 1's name");          Player player1 = new Player(input.nextLine());          System.out.println("Enter player 2's name");          Player player2 = new Player(input.nextLine());           System.out.println(player1.getName());          System.out.println(player1.getCash());      }       else if (answer == "C"){          play = false;          System.out.println("Thanks for playing");      }    }


In $\mathbb{R}$ with the usual metric, define the sequence $\{ x_n \}_{n \in \mathbb{N}}$ for $$x_n = \displaystyle\int_{1}^{n} \displaystyle\frac{\cos t}{t^2} dt.$$ Prove that $\{ x_n \}_{n \in \mathbb{N}}$ is a Cauchy sequence My attempt: We know that every convergent sequence (with limit s, say) is a Cauchy sequence But. We have that $\displaystyle\int \dfrac{\cos t}{t^2}dt = - \dfrac{\cos t}{t} - \displaystyle\int \dfrac{\sin t}{t} dt$ but the last integral is not solved with elementary functions. Thanks


What's the proper way to round a decimal in 2 digits but as zero. i.e if the number is 561.82 to be rounded as 562.00 ?


Quantum entanglement: does it necessarily imply superluminal information transfer?

From what I understand, information is communicated instantly between two quantum-entangled particles regardless of the spatial distance between them. However, does this necessarily imply superluminal data transfer? If the "distance" between the particles is simply assumed to be measured in our common 3D euclidean space then that would seem to imply superluminal communication. However, could there be other paths between the two particles that lie beyond our observable 3D euclidean space, other paths that involve additional dimensions in which the particles remain very close or some sort of folding of space on other dimensions that provide an information pathway? Anybody aware of any such research/findings? Thnx.


AutoComplete in Webforms [bsnautosuggest and jqueryautocomplete]

I want to know which one is the best way to implement autocomplete in aspx forms using jquery?  What is the difference between using bsn.autosuggest and jquery autocomplete.If possible pls explain Thanks in advance.


Ubuntu booted from live USB freezing on boot message

This is my first time really getting to know Linux. I'm booting Ubuntu 12.10 on my HP G65 Notebook, which is pre installed with Windows 7 64 bit, from a live USB. The HP loads just fine and proceeds to try to boot Ubuntu but it freezes up on a black screen with syslinux 4.06 edd 2012-10-23 copyright (c) 1994-2012 H. petter Anvin et al and a blinking bar under it at the top.   I'm tired of windows and I want something far more stable. And try to keep the talk on a noob understandable level.


How can I automate "I am Groot" reply to annoying friend's texts?

I kinda want to convey the point that all this individual's texts are just as meaningful as the phrase "I am Groot." Can this be done on my iPhone? That is, anytime I get a text from said individual, it will automatically reply "I am Groot."


Examples of convergence in distribution using CDF directly

I find very interesting the example that if we let $Q_n$ be the maximum of n i.i.d. with distribution $U[0,\alpha]$, then $n(Q_n - \alpha)$ converges to an exponential distribution. See e.g.  for this solution.  What other examples are there that are similar in the sense that they are (1) non-trivial and (2) they don't need to rely on other theorems (e.g., like CLT or delta method), but rather can be found directly from taking the limit of the CDF.  I'm interested in both discrete and continuous examples.


i have converted a 300w pc power supply into a bench top power supply

why does the unit shut down when negative and positive touch.Is there a way to bypass this? I have heard turn it into a floating ground.


Why aren't the enemies scaling with my level in Borderlands 2?

Borderlands 2, Playthrough 2. I tried farming Mobley and Gettle, and even though I reached level 40, they remained at a low level. In all the videos I've seen, they were at the player's level. I understand that it's the level of the area, because in my vending machines sold items are level 34. Question: why so others have region level scaling up with the player, but I don't?


The relevant PR was merged into code-prettify:   As per , I'm asking to deploy it to the network and assign to kotlin tag.


How can I install Wine software in Ubuntu 17.04?

I have found wine software in Ubuntu software Software, but the rating is low. Is it good or is there any source or command to install wine?


Rigorous proof of $n\sum_{d\mid n}\frac{1}{d}=\sum_{d\mid n}d$ for $n\in\mathbb N$.

Let $n\in\mathbb N$ and consider the sum $$\sum_{d\mid n}\frac{n}{d}.$$ I understand that dividing $n$ by any of it's divisors is also a divisor of $n$ so intuitively it would make sense that $\{\frac n d\ :\ d\mid n \}=\{d\ :\ d\mid n\}$, from which the desired equality in the title is acquired. but I cannot "see" how this can be proven rigorously. Any help or insight would be appreciated! Edit: In many sources, including the question this one is marked as a possible duplicate to, it is not explained why the identity holds, it's just used. If it actually is explained, it's not clear to me, at least. I am interested in an actual explanation, that's why my question differs from the one marked as duplicate.


Finding a root of transcendental equation

I am having a problem with the following equation $$e^{2x}(2x−1)+1=0$$  By trial and error, you can see that the root is $x=0$, but how can I actually find it?   $$e^{2x}=\frac{-1}{2x-1}$$  As we can see, $e^{2x} > 0,  \forall x \in \Re$, but $\frac{-1}{2x-1} > 0 , x \in (-\infty,\frac{1}{2})$, and $\frac{-1}{2x-1}<0, x\in(\frac{1}{2},\infty)$.   When the $x\to-\infty$, LHS is decreasing, and RHS is increasing, but when $x\to\infty$ LHS is increasing, and RHS is decreasing. How can I find the root of this equation? It is clear that it has a root, because one can easily find two points where in one function is positive, and in the other one it is negative.


I've noticed that Q# favors Little Endian. Meaning that most operations are designed for this type of encoding.  Is is it the same with Qiskit?


I want to prove the following:     If every Sylow subgroup of $G$ is a normal subgroup, then $G$ is isomorphic to the product of its Sylow subgroups.   So far, I have gotten to realize that for every prime factor $p_i$ of $|G|$, there is exactly one Sylow subgroup and that these form a partition of $G$. However, I am having trouble finding the isomorphism between $G$ and the product which I will call $G_1 \times \ldots \times G_r$. My idea was just to use the mapping $(g_1, \ldots, g_r) \mapsto g_1\ldots g_r$, which is a bijection, but I don't see whether it is a homomorphism. In general, not all elements of $G_i$ commute with elements of $G_j$, so one cannot simply change the order of the elements in the product.


Suppose we have a necklace of n beads. Each bead is labeled with an integer and the sum of all these labels is $n − 1$. Prove that we can cut the necklace to form a string whose consecutive labels $x_1, x_2,\dots, x_n$ satisfy $\sum_{i=1}^k x_i \le k −1$ for $k = 1,2,\dots,n$


Merge Javascript objects, can't seem to find correct way

Hi i've been struggling a bit and i cant seem to find why the methods i found dont work, could be "fixture-0"   First Object array   personformdata[i]: "{"isInvalid":false,"agentRole":"role"}"   Second   address_ids[i] : "[{"address_id": "fixture-0" }]"   preferable out come, something like this.  "{"isInvalid":false,"agentRole":"role", "address_id": "fixture-0"}"


Enable editing for high rep users even if under editing review

As I understand it, approval of edits now takes more than one reviewer.  I am a high rep user on  and thus, I often edit questions to improve them. Today I came across a question that needed editing. One low rep user had already proposed some edits. I approved these edits. But because I was the first reviewer, I could not then build on those edits to really polish the question. It seems that I have to wait for another reviewer to come along and approve the edits. This seems pointless.  Given that I am a high rep user I can in theory make any edits to the question without approval. Thus, I could choose to incorporate the proposed edits or not. Of course, general standards suggest that I should incorporate any reasonable edits already made. And I would typically do that. The important point however is that high rep users who have editing privileges should be able to edit a question immediately even if there are pending edits.   My feature request  High rep users should be able to edit a question that is under editing review and should be given the choice when pressing edit of    approving the edit under review immediately or  disapproving the edit under review.   (UPDATE) Alternatively a high rep user should be able to improve an edit after they have pressed "approve" and prior to the edit receiving sufficient approvals to be published.  Are there any reasons why this would not be a good idea? What do others think?


Can I just have a color coded HTML editor in Drupal 6 that keeps line indentations?

I'm trying to get out some minimally designed pages. The WYSIWYG (CKEditor) has a habit of collapsing the code between saves. WHile this is fine and all, I'm finding myself copying copy and pasting it into sublime text in order to reformat. The copy-pasting -- while not difficult -- is thumbing me up a bit. I've copied/pasted the wrong code and had to redo a lot of my work.   So can I have stop CKEditor from minimizing the HTML code? This is a legacy site in Drupal 6.28.


How to derive variance-covariance matrix of coefficients in linear regression

I am reading a book on linear regression and have some trouble understanding the variance-covariance matrix of $\mathbf{b}$:    The diagonal items are easy enough, but the off-diagonal ones are a bit more difficult, what puzzles me is that  $$ \sigma(b_0, b_1) = E(b_0 b_1) - E(b_0)E(b_1) = E(b_0 b_1) - \beta_0 \beta_1 $$  but there is no trace of $\beta_0$ and $\beta_1$ here.


Closing duplicates between StackOverflow and StackExchange

I have found a question on SO, which is very similar to a question on the SE community ().  I have tried to create a flag with the standard flags for it, but it seems that SE community isn't allowed. I am getting the following message:     The duplicate question must exist on Stack Overflow   So I wrote a custom comment to point to the duplicate similar to the following message:     Possible duplicate of URL   This was declined with the comment:     Please use standard close votes and flags for this.   What is the recommended way to show up duplicates on SE sites?


I don't have the theoretical background in my PhD topic. I can't justify getting the degree

I did my PhD in computational materials science. I used molecular dynamics simulations and finite element method to carry out my research investigations. I have published several publications and about to defend my thesis next month.  But, I did not take any classes on finite element analysis or molecular dynamics during my undergraduate or graduate school. Whatever theory I know about them is through self study and through work experience. I understand the concepts of the methods, but I never got a chance to have a formal course with exams and assignments on the subjects. So, my self study hasn't been very meticulous.  Now, I feel like a charlatan, and don't feel like I deserve a PhD degree. I am also feeling lost and like a loser. Saddest thing is that, I passed all my qualifiers, proposals and no one questioned my abilities.   I don't know what can I do to feel confident again. I am 31 years old. I always thought that by the end of PhD I will be a confident researcher.


How to fetch a remote image to display in a canvas?

How can I fetch images from a server?  I've got this bit of code which allows me to draw some images on a canvas.                     <canvas id="canv" width="1024" height="1024"></canvas>                      Instead of looping over document.images, i would like to continually fetch images from a server.  for (;;) {     /* how to fetch myimage??? */     myimage = fetch???('http://myserver/nextimage.cgi');     ctx.drawImage(myimage, x, y); }


DNS A record pointing to private IP address

I own a domain. I will call it example.com. I want to set up a local BIND server on my private network. I have a box with the private IP address of 192.168.2.13   I would like to have this box named development.example.com, Is it considered normal practice to add an A record for example.com at my DNS provider pointing to the private ip (192.168.2.13), so that development.example.com can resolve to my machine inside my private network?


I am working on a project in Java that requests user inputs information like name, id, score in array.I need to help about calculate a average grade that user input and how to find out who have highest score. Here is my code:  package finalproject; import java.util.Scanner; /**  *  * @author vincephng  */ public class FinalProject {      /**      * @param args the command line arguments      */      public static void main(String[] args)      {          Scanner input= new Scanner(System.in);         Cis84[] student= new Cis84[50];          int option;          for (int c = 0; c<50;c++)         student[c]=new Cis84();          do{             System.out.print("");             System.out.println("1) Add Information");             System.out.println("2) Show report");             System.out.println("3) Exit");             System.out.print("\nEnter option: ");               option = input.nextInt();              switch(option)             {                 case 1:                     String n;                      double g;                     int index, i;                      System.out.println("Which position of the student?");                     index=input.nextInt();                      System.out.println("What is the student's name:");                     n=input.nextLine();                     n=input.nextLine();                      System.out.println("What is student's Id");                     i=input.nextInt();                       System.out.println("What is student's score");                     g=input.nextDouble();                      student[index].setName(n);                     student[index].setGrade(g);                     student[index].setId(i);                     break;                  case 2:                     for(int c=0; c<50;c++)                     System.out.println(student[c]);                     break;                 case 3:                     System.out.println("You are done");                     break;                 default:                     System.out.println("Try again");                     break;             }          }while (option != 3);        } }      and class  package finalproject;   public class Cis84  {     private String name;     private int id;     private double grade;      public Cis84()     {         name="not input yet";         id= 00000;         grade= 0.0;     }     public Cis84(String n, int i, double g)     {        name= n;        id= i;        grade=g;     }      public void setName(String n)     {         name=n;     }     public void setId(int i)     {         id=i;     }     public void setGrade(double g)     {         grade=g;     }      public String getName()     {         return name;     }     public int getId()     {         return id;     }     public double getGrade()     {         return grade;     }      public String toString()     {         return String.format("%s\n%d\n%.2f\n", name, id, grade);     } }


How can I improve my explanation of why the ratio $\pi=\frac{C}{d}$ holds for all circles?

I'm trying to informally explain why $\pi$ holds for all circles. I would like to know if there is anything pertinent that I can add, or that is wrong with this explanation. It's an explanation, not an attempt at a rigorous proof, so go easy.  $\pi = \frac{C}{d}$ is the ratio of $C$, the circumference of the circle, to $d$, the diameter of the circle. The ratio holds for all circles because all circles are "similar". That is to say they are all the same essential shape and that they only differ in size, thus for "similarity" to hold this ratio must extend to all circles. It is easier to see why $\pi$ holds for all circles if we rewrite it in terms of the radius $r$ as $\pi=\frac{2\pi r }{2r}$. According to this, any change in the radius $r$ (and thus circumference and ultimately the size of the circle) will affect an equivalent change in the numerator and denominator of the equation. So in essence any changes in the size of the radius $r$ and subsequently the circle are negated, so the ratio $\pi=\frac{C}{d}$ holds for all circle.


I'm trying to find a way to incorporate an A3 landscape page in my report. I found a way using \newgeometry, but the problem here is, I can't get it to return to my preamble settings after using it. I wondered if there were another way to do it. It should be just like a normal side in the document, with headers, page numbers and everything, but on an A3 landscape page.


Direction of H and B inside and outside a bar magnet

I seem to have encountered a contradiction when thinking about the directions of $\textbf{H}$ and $\textbf{B}$ inside and outside a bar magnet.  Suppose that a bar magnet has a roughly constant magnetisation M pointing along the positive z direction. Suppose also that the magnet is made from an isotropic material, i.e. $\textbf{M}=\chi_m \textbf{H}$ (1). Therefore $\textbf{H}$ should be pointing in the same direction as $\textbf{M}$, provided that $\chi_m$ is positive, which should be the case for most magnetic materials? From the definition $\textbf{H}=\frac{1}{\mu_0}\textbf{B}-\textbf{M}$ and substituting using (1), we get $\textbf{B}=\mu_0(1+\chi_m)\textbf{H}=\frac{\mu_0(1+\chi_m)}{\chi_m}\textbf{M}=\frac{\mu_0\mu_r}{\mu_r-1}\textbf{M}$. Unless $\mu_r$ is less than 1, $\textbf{B}$ should also be parallel to $\textbf{M}$. Therefore so far we get that both $\textbf{H}$ and $\textbf{B}$ should point in the same direction as direction as $\textbf{M}$ inside the magnet, that is along the positive z direction.  We know that $\nabla\cdot\textbf{B}=0$ and thus applying boundary conditions on the top and bottom surfaces of the magnet (normal to the z axis) using an infinitesimally thin gaussian pillbox, we get that $\textbf{B}^\perp_\textrm{outside}=\textbf{B}^\perp_\textrm{inside}$. Therefore $\textbf{B}$ immediately outside the top surface should also point in the positive z direction. Assuming that there are no free currents near the magnet, $\nabla\times\textbf{H}=\textbf{J}_\textrm{free}=\textbf{0}$. Applying boundary conditions to the side surfaces of the magnet (parallel to the z axis), $\textbf{H}^\parallel_\textrm{outside}=\textbf{H}^\parallel_\textrm{inside}$. Therefore $\textbf{H}$ immediately outside the side surfaces must also point along the positive z direction. However, the field lines must also curl around and meet the top surface of the magnet, where $\textbf{H}$ will therefore need to point in the negative z direction. Since $\textbf{M}=\textbf{0}$ outside, $\textbf{H}=\frac{1}{\mu_0}\textbf{B}-\textbf{M}=\frac{1}{\mu_0}\textbf{B}$ and $\textbf{H}$ needs to be parallel to $\textbf{B}$ but we just argued that they point in opposite directions due to the boundary conditions. How do we resolve this contradiction?


Prove that $(1+2+3+\cdots + n)^2 = 1^3+2^3+3^3+\cdots + n^3$ for every $n \in \mathbb{N}$.  Proof. We will use mathematical induction. If $n = 1$, then we have $(1)^2= 1^3 = 1$. We must show that $S_n$ implies $S_{n+1}$. Assume that for $n \in \mathbb{N}$, the statement $(1+2+3+\cdots + n)^2 = 1^3+2^3+3^3+\cdots + n^3$ holds. Then  $\begin{align} &\left[\displaystyle\sum_{n \in \mathbb{N}}^n n\right]^2+(n+1)^3 \\ =& \displaystyle\sum_{n \in \mathbb{N}}^n n^3+(n+1)^3 \\ =& \displaystyle\sum_{n \in \mathbb{N}}^n n^3 + n^3 + 3n^2 +3n + 1 \end{align}$  How do I finish carrying out the induction? I can't seem to manipulate the right hand side properly get the form $\left[\displaystyle\sum_{n \in \mathbb{N}}^n n+1\right]^2$.


I want to upgrade to 14.04 from 13.10. The software Updater shows that 14.04 is available.     But when I click on the "Upgrade" button, nothing happens. The software updater exits on clicking Upgrade.


How to set edge bevel weights from a python script

I need to set weights for some edges from a python script. I have tried looping through object.data.edges and setting bevel_weight values but I can't get it right. It only works if I have first edited some edge's bevel weight by hand from the 3d-view's transform window. But I would like to get it work from my script without any manual hacking.  Steps to reproduce:  Start Blender with default cube and switch to Scripting view.  Try to set weights for all edges:  for edge in C.object.data.edges:     edge.bevel_weight = 1.0   Verify that values changed:  for edge in C.object.data.edges:     edge.bevel_weight   Switch into edit mode in 3d-view and open up transform window by pressing n. Select edges to see that the change did not work (bevel weights are all zero). Switch back to object mode and read values again in scripting console to see that they were reset to zero:  for edge in C.object.data.edges:     edge.bevel_weight   Go back to edit mode and change some edge bevel weight straight from the transform window by hand. Go back to object mode and change values again from the scripting console:  for edge in C.object.data.edges:     edge.bevel_weight = 1.0   This time it works, bevel weights are 1.0 when you go back to edit mode and look from the transform window.   Any ideas? My final need is to apply a bevel modifier to only some set of edges and that's why I'm trying to mark them by using weights. Using vertex group for bevel modifier does not work in my situation, since I need to specify edges, not vertices, which to bevel.   I'm using Blender v2.71.


Evaluate: $$\sum_{k=1}^\infty\left(\zeta(2)-\sum_{n=1}^k\frac1{n^2}\right)^2$$  Recognizing that $\zeta(2)-\sum_{n=1}^k\frac1{n^2}$ can be written as $\psi_1(1+k)$ where $\psi_1(z)$ is the , What remains to be done is to evaluate: $$\sum_{k=1}^\infty\psi_1^2(k+1)$$ Mathematica could not evaluate it in a closed form but the source assures that it exists.  If you liked this problem check out .


Book recommendation for self-studying abstract algebra

I have searched for getting an information to select textbook for abstract algebra by myself. Now I have three candidates for my abstract algebra text.  (So far, I have learned one-year linear algebra and undergraduate level analysis)  I really appreciate for you to help me select a nice textbook.   Stephen Lovett, Abstract Algebra: Structures and Applications  P.B. Bhattacharya, S.K. Jain, S.R. Nagpaul, Basic Abstract Algebra David S. Dummit, Richard M. Foote, Abstract Algebra   Could you give me an recommendation for choosing textbook with the reason why you recommend that book?(If you have another nice textbook, tell me your another recommended book.)


Transforming Real-time Local position system coordinates into GPS/WGS84

I have a local coordinate system built with Ubisense sensors and tags (it is a real-time locating system used to automatically identify and track the location of objects or people). The local coordinate system is simply a cartesian coordinate system, which I can define the origin and axies at will except the rule that x-y panel must be horizontal, thus the z axis is vertical. After setting up the system, I can get coordinates of tags in the contained area where the sensors can get signals emitted from the tags and locate the tags. Now, I have the problem to convert the (x,y,z) coordinates into global system coordinates.  I made a model myself which took the origin of local coordinate system as a reference point and calculate the difference of other points in lat and lon to make the transformation. However, I guess there must be more standard and accurate way to deal with such problem. Since I am new in this field, I did google something and read some pages. However, there is rarely content relevant with this topic(much I found is from some standard to another, however is not a standard coordinate system, it is cartesian but not geocentric).   Can anyone give any hints or suggestions for this problem?


How do I ask LaTeX to exactly fill up a page?

I understand that I can control interline spacing in LaTeX in a number of ways. The commands like ,  ,  come in handy in controlling the interline spacing. Each has its own speciality and circumstances of usage, as we can find in these discussions (, , ).  If want to go for a ready made solution for controlling line spacing, packages like  come in quite handy (built-in commands like \onehalfspacing or \setstretch for more finer controls).  Anyway, my problem is a bit different. I have some text (both in paragraph and list mode) which I want to fill up exactly one page. To complicate the scenario, it may even contain equations and graphics. (Let us leave aside floats.)   If I want to solve the problem statically, all I will have to is to play with some value of \baselineskip (or  \setstretch) until satisfied. While this works good for most of the cases, I will have to go through the process again when I want to delete or add some texts.  Would it be possible to have a dynamic value for  \baselineskip or  \setstretch so that my text always fills up one page? (Definitely within reasonable limits.)  Another idea will be to use a number of \vfills between some pieces of texts. But I think that this technique is usable for cover pages only.  I am not putting here an MWE. I think that one is not applicable.    The problem is not a theoretical one, I am preparing some kind of handout which I want to fill-up exactly one page.


I must find the sum $$\sum_\limits{n=1}^{\infty}\frac1{n(2n+1)}$$ I have already tried partial fractions, but obtained an indeterminate form of infinity minus infinity. Perhaps completing the square would help?


Personification is an object or a thing described with a human-like aspect (eg. The Sun smiled at me).   Can personification also be used to describe a human with an aspect from an object? For example, in Oliver Twist, Dickens says "[Oliver] was badged and ticketed," which describes/compares him with a package or box. Is this a usage of personification or a different type of literary device?


I am trying to create a dependent picklist in LWC and it is somehow not working. I have a controlling picklist called Event Types. The values for this picklist are fetched from a picklist field present on custom object Event. When a user changes the value in this picklist, in the onchange method, I am calling an Apex class which fetches the value for the dependent picklist. The values are getting returned as expected from Apex, then I am creating the array of objects for the dependent picklist, but the updated values are not getting displayed in the dependent picklist. Can anyone please let me know what's the problem with my code. Thanks.  <template> <lightning-layout class="slds-box slds-theme_default">     <lightning-layout-item size="4" padding="around-small" class="slds-box">         <template if:true={eventTypes.data}>             <lightning-combobox               name="eventType"               label="Choose Event Type"               value={selectedEventType}               placeholder="Select Event Type"               options={eventTypes.data.values}               onchange={handleEventTypeChange}             ></lightning-combobox>           </template>           <lightning-combobox               name="objects2"               label="Choose Object"               value={selectedObject}               placeholder="Choose Object"               options={objects}             ></lightning-combobox>     </lightning-layout-item> </lightning-layout>     JS Controller  import { LightningElement, wire, track } from "lwc"; import { getPicklistValues } from "lightning/uiObjectInfoApi"; import EVENT_TYPE_FIELD from "@salesforce/schema/Event__c.Event_Type__c"; import { getObjectInfo } from "lightning/uiObjectInfoApi"; import EVENT_OBJECT from "@salesforce/schema/Event__c"; import getSupportedObjects from "@salesforce/apex/PicklistController.getSupportedObjects";  export default class EventList extends LightningElement {   @track selectedEventType;   @track selectedObject;   @track objects = [];   @track error;    @wire(getObjectInfo, { objectApiName: EVENT_OBJECT })   objectInfo;    @wire(getPicklistValues, {     recordTypeId: "$objectInfo.data.defaultRecordTypeId",     fieldApiName: EVENT_TYPE_FIELD   })   eventTypes;    handleEventTypeChange(event) {     console.log("*****objects before push:", JSON.stringify(this.objects));     this.objects = [];     this.selectedEventType = event.detail.value;     getSupportedObjects({ eventType: this.selectedEventType })       .then(result => {         result.forEach(element =>           this.objects.push({             label: element.Object__c,             value: element.Object__c           })         );         console.log("*****objects after push:", JSON.stringify(this.objects));       })       .catch(error => {         this.error = error;       });   } }   The output of console log:  *****objects before push: [] *****objects after push: [{"label":"Account","value":"Account"}]  Apex Class:  public class PicklistController {      @AuraEnabled(cacheable=true)     public static List<Configuration__c> getSupportedObjects(String eventType){         return [SELECT Object__c FROM Configuration__c WHERE Event_Type__c=: eventType];     } }


How can I evaluate $\sum_{n=0}^\infty(n+1)x^n$?

How can I evaluate $$\sum_{n=1}^\infty\frac{2n}{3^{n+1}}$$? I know the answer thanks to , but I'm more concerned with how I can derive that answer. It cites tests to prove that it is convergent, but my class has never learned these before. So I feel that there must be a simpler method.  In general, how can I evaluate $$\sum_{n=0}^\infty (n+1)x^n?$$


Securely persist session between https://secure.yourname.com and http://www.yourname.com on rails app

My rails site posts to a secure host (e.g. '') when the user logs into the site.  Session data is stored in the database, with the cookie containing only the session ID.  The problem is that when the user returns to a non-https page, such as the home page (e.g. '') the user appears to have logged out.  I believe the reason for this is that a separate cookie is stored for each host (www vs. secure).  Is this correct?  What is the best secure way to persist the session between both the http and https sections of the site?  Does anyone know of any plugins that address this problem?  The site runs on Heroku.


DataTables cell click event not working when table is filtered

Hi,                                  jQuery('#TheTable tr').each(function() {                                     jQuery('td', this).slice(-1).on('click', function() {                                        var tr = $(this).closest('tr');                                        var row = table.row( tr );                                        if (row.data() != undefined){                                             modalfunc(row.data().id);                                        }                                                                             });                                 });   It's working great when table is loaded but then if user enter something in searchbox and data is filtered - the event is not triggered when clicked on the column's cells. How to adapt this code to dynamically created elements?


The title is a bit general but I'll give all the details in the post.   My problem is that I can't unwrap the part of the conveyor belt "straight" shown in this pic.     Can I really do it or I should stick to these UVs and find another way for just the texture?  Tried about everything I could find and nothing really worked.  The reason I want them straight is because the texture is going to be animated.


Why does pasting a command into the chat return an error?

I am running a server on version 1.16.1 and I'm trying to run the following command which I copied and pasted from a command generator: /tellraw @a ["",{"text":"Co-op >","color":"aqua"},{"text":" [PIG","color":"light_purple"},{"text":"+++","color":"aqua"},{"text":"]","color":"light_purple"},{"text":" Technoblade","color":"light_purple"},{"text":": I have come down from the land of potato gods."}]  Every time I run it it says:  Invalid chat component: Unterminated string at line 1 column 245 path $[6].text  I don't know what any of this means.


Change directory to path of parent/calling script in bash

I have dozens of scripts, all in different directories. (exported/expanded Talend jobs)  At this moment each job has 1 or 2 scripts, starting with the same lines, most important one:  CD ***path-to-script***   and several lines to set the Java path and start the job.  I want to create a script, which will be ran from all these scripts. e.g.:  /scripts/talend.sh   And in all talend scripts, the first line will run /scripts/talend.sh, some examples of where these scripts are ran from:  /talend-job1_0.1/talend-job1_0.1/talend-job1/talend-job1.sh /talend-task2_0.1/talend-task2_0.1/talend-task2/talend-task2.sh /talend-job3_0.1/talend-job3_0.1/talend-job3/talend-job3.sh   How can I determine where the /scripts/talend.sh is started from, so I can CD to that path from within /scripts/talend.sh.  The Talend scripts are not run from within the directory itself, but from a cronjob, or a different users home directory.  EDIT: The question was marked as duplicate, but  is not answering my question 100%. Problem is:  - The basic script is being called from different scripts  - Those different scripts can be run from command line, with, and with or without a symbolic link.  - The $0, the $BASH_SOURCE and the pwd all do some things, but no solution mentioned covers all the difficulties.  Example:  /scripts/talend.sh      In this script I want to configure the $PATH and $HOME_PATH of Java, and CD to the place where the Talend job is placed. (It's a package, so that script MUST be run from that location).  Paths to the jobs are, for example:  /u/talend/talendjob1/sub../../talendjob1.sh  /u/talend/talendjob2/sub../../talendjob2.sh /u/talend/talendjob3/sub../../talendjob3.sh   Multiple jobs are run from a TMS application. This application cannot run these scripts with the whol name (to long, name can only be 6 long), so in a different location I have symbolic links:  /u/tms/links/p00001 -> /u/talend/talendjob1/sub../../talendjob1.sh /u/tms/links/p00002 -> /u/talend/talendjob1/sub../../talendjob2.sh /u/tms/links/p00003 -> /u/talend/talendjob1/sub../../talendjob3.sh /u/tms/links/p00004 -> /u/talend/talendjob1/sub../../talendjob4.sh   I think you get an overview of the complexity and why I want only one basic talend script, where I can leave all basic stuff. But I only can do that, if I know the source of the Talend script, because there I have to be to start that talend job.


Distance and number of corrected errors in quantum error correction

In Gottesman's introduction, it writes     A code that corrects t errors is said to have distance 2t + 1, because it takes 2t + 1 single-qubit changes to get from one codeword to another.   Other reviews have slight different definitions but I think they are all equivalent. I am still new to QEC...and a little confused about how these $2t+1$ single-qubit changes take place during quantum error correction..Could anyone give a more detailed explanation?  Thanks!


How to fetch whatId label in salesforce formula field

I have requirement where in WhatId should be able to display parent name(label) in formula field, i have tried using what.Name in formula field but it displays an error.  The below code fetches the 15 digit id of respective parent. IF( NOT(ISNULL(WhatId )), WhatId,  '')   so far the solution given in the other links are possible by using trigger but i dont want to use triggers.


Having watched the first 4 episodes, I've noticed something rather peculiar: No one ever acknowledges Mr. Robot, except Elliot. Is there any evidence that Mr. Robot is or isn't just in Elliot's head, similar to      Fight Club?


Can anyone recommend a fail2ban-like tool for a Windows OS?  I've got a couple of Windows Media servers that get hammered with brute force authentication attempts.  I would like to plug these authentication failures into some kind of blocking tool.


Question from Herstein's Topics in Algebra on Sylow subgroups

Let $G$ be a finite group and suppose that $f$ is an automorphism of $G$ with order 3 that fixes only the identity element of $G$. Show that $G$ has a single (i. e. normal) $p$-Sylow subgroup for each prime $p$ dividing $|G|$.   Been working for hours and haven't made much progress. I did note that since $f$ considered as a permutation factors as the product of disjoint 3-cycles, 3 divides $|G|$. So my next step is showing that the 3-Sylow subgroup is normal.  Edit: sorry, since $f$ fixes the identity it actually factors into a bunch of 3-cycles and a 1-cycle. So 3 does not divide $|G|$.


Choosing option to close own answered question?

I want to close my question, as it is answered, because I think my question is solved with given answer so which options must I choose from the below to close a question? Which option is suitable?   duplicate of... This question has been asked before and already has an answer. off-topic because… (too old to migrate) This question does not appear to be about Ubuntu within the scope defined in the help center. unclear what you're asking  Please clarify your specific problem or add additional details to highlight exactly what you need. As it's currently written, it’s hard to tell exactly what you're asking. See the How to Ask page for help clarifying this question. too broad Please edit the question to limit it to a specific problem with enough detail to identify an adequate answer. Avoid asking multiple distinct questions at once. See the How to Ask page for help clarifying this question. primarily opinion-based Many good questions generate some degree of opinion based on expert experience, but answers to this question will tend to be almost entirely based on opinions, rather than facts, references, or specific expertise.


Since some days I constantly get a webpart error when trying to reference a file on sharepoint. It tells me that the webpart cannot be displayed along with a correlation ID.     The error associated to the correlation ID is the following:     Error while executing web part: System.NullReferenceException: Object   reference not set to an instance of an object.      at   System.Xml.Xsl.XslCompiledTransform.Load(MethodInfo executeMethod,   Byte[] queryData, Type[] earlyBoundTypes)      at   Microsoft.Xslt.STransform.GetCompiledTransform()      at   Microsoft.SharePoint.WebPartPages.BaseXsltListWebPart.LoadXslCompiledTransform(WSSXmlUrlResolver   someXmlResolver)      at   Microsoft.SharePoint.WebPartPages.DataFormWebPart.GetXslCompiledTransform()       at   Microsoft.SharePoint.WebPartPages.DataFormWebPart.PrepareAndPerformTransform(Boolean   bDeferExecuteTransform)   I tried to restart the sharepoint server but with no effect.  Does anybody know what I could try?  Regards


Medieval style fantasy book with large black creatures as enemies

I remember reading a book when I was younger (maybe 8-10 years ago) that depicted a war between knights and large black non-humanoid monsters. It was a thick book probably 500+ pages and may have had a number of knights displayed on the cover. There may have been sequels but I don't recall, I found it in the teen section of my local library. I think the monsters varied in size and came out of the earth, but could be mistaken.   I believe the characters were mostly adult men, i.e. not teenagers.


Is there a rotational analog for Newton's laws of motion?

In context of rotational dynamics my textbooks interminably states that there always exists a rotational analog for every linear variable and they are related to one another through similar equation. (And for the fact I know about most of these analogs and the related equations)   Though till now I haven't yet seen/learnt of rotational analog of Newton's Laws of Motion. So    Does there exist a rotational analog for Newton's laws of Motion?  If possible, then are they generalizable to non-rigid body?    Edit:  To further clarify the question I am going to write down the rotational analog of Newton's laws of motion. Assuming that there exists a rotational analog of Newton's laws of motion, I suppose they would look like the following:   A body continues it's state of rest and uniform rotation unless acted upon by an external torque.  The torque acting on a body is directly proportional to the rate of change of angular momentum. i.e.,   $$ \boldsymbol {\tau} = \frac {d\mathbf L}{dt}$$   For every torque there is an equal and opposite torque.    So are these statements (that I made as an analog of Newton's laws of Motion) true for all kind of rotational motion? Is there any exception to them?


am trying to cout all values in an array like this  int collect[8],c; for(c = 0; c <= 4; c++) {     cout << "Enter First Number : ";     cin >> collect[c]; } cout << collect[0, 1, 2, 3, 4] << endl;   but it displays the last value. Please leave some note to make me understand why its not working


Problem with $PATH variable in terminal in ubuntu 16.04

I am using Ubuntu 16.04,  I am facing the problem with conda command (conda: command not found). when I export path of Anaconda3/bin to $PATH conda  command is working. if I open another Terminal and try to use the conda command it's not working (conda: command not found). after the export path each time then only it's working. can anyone help me to fix this error?


In the above post one can find the following statement:     Given a DVR and elements of pairwise distinct orders, the sum is nonzero.     By order he means valuation. I could not find a proof of the above. For $2$ elements it is obvious. I tried induction but could not make it work.


Can files be infected with malware and them running as soon as the disk their on is connected/when their opened(Im talking for files like mp4/mov/avi, pngs(images generally) and compressed zip,tar.gz and most of all text files files)  If so is there any reliable way to check if they are infected


I have about 100-1000 points in a 2D coordinate system. When the user zooms out I need to cluster nearby points to show fewer larger points, preferably centered around the middle point of each cluster.  I suspect that there exists some nifty mathematical trick to make this efficient.


A problem with 26 distinct positive integers

I am trying to solve the following problem.   Assume that we are given 26 distinct positive integers. Show that either there exist 6 of them $x_1<x_2<x_3<x_4<x_5<x_6$, with $x_1$ dividing $x_2$, $x_2$ dividing $x_3$, $x_3$ dividing $x_4$, $x_4$ dividing $x_5$ and $x_5$ dividing $x_6$ or there exist six of them, such that none of them divides another one of these six.  A possibly good start is to assume that, in every six of these numbers, there exists at least one dividing another one of the same six.  Update. I have found a solution of the problem (for 17 numbers though) in a Russian site. As unbelievable as it may sound, this problem was a question in a 1983 Soviet Mathematics contest (Турниры Городов) for student of 7-8 grades!  I am presenting the solution I found in that site below as an answer,  and it is generalised for $n^2+1$ distinct integers, where we show that either there exist $n+1$ of them dividing each other or none diving none else.


How $\frac{1}{\sqrt{2}}$ can be equal to $\frac{\sqrt{2}}{2}$?  I got answer $\frac{1}{\sqrt{2}}$, but the real answer is $\frac{\sqrt{2}}{2}$. Anyway, calculator for both answers return same numbers.


Is there any way to determine if a function is periodic or not from the taylor series expression of it?  Elementarily,it can be easily argued that the series must be an alternating one,but that does not guarantee it's periodicity.Is there any trick?


How do I run bibtex after using the -output-directory flag with pdflatex, when files are included from subdirectories?

When I have master pdflatex file which includes one or more child documents using something like \include{include/childdoc}, and I call pdflatex on it using pdflatex -output-directory=out parent.tex, I seem unable to find a way of calling bibtex on the resulting parent.aux file.  I have tried both cd out; bibtex parent, and bibtex out/parent, to no avail.  I know there are various build-tools out there, but I'd like first to make it work just from the shell with no special build-tool dependencies.


looking word for: current state or the state before a change

I'm looking for a word referring to this description: "current state of a situation or the state before situation changed".


How do I "free" member variables that implement IDispose?

I am using a 3rd party class, Table, that represent a database table. The class has a Close() method and it implements IDispose.   I find that calling Close() many times on such a table is fine. Likewise calling Dispose() many times is also fine.  However if I call Dispose() I can not call Close() again or I will get a ObjectDisposedException.  I want to use such a Table as a private member variable in a class.  Samples from the provider of the Table class do not call Dispose() on the table. However since calling Dispose() followed by Close() causes a crash I take it that Dispose() does a full cleanup?  I therefore conclude that I must call Close() followed by Dispose() once and only once?  What is the best way to achieve this? Should I let my class implement IDispose and use the Dispose pattern with a bool disposed_ variable that ensures that the cleanup is only done once + a GC.SuppressFinalize in the Dispose method?  I have already implemented this pattern and understand how it works.  However I am baffled on how complex this is. I would think that C# code would be simpler than C++.  Is there another simpler/better way to do this?


I've got a PHP routine that processes a form and outputs the values to a CSV file. I'm using array_keys() to create the header row (skipped if there is one). Everything works perfectly except the final header term is "submit" because, of course, my form includes a Submit button. So the data ends up looking like this:  name,email,cell,dob,study,submit "Temp One",fred@gmail.com,646-325-1111,1995-03-31,8,Submit "Temp Two",tom@gmail.com,646-325-2222,1995-03-31,4,Submit   How do I omit the submit button both from the header and the data?  Here's my code:  if(isset($_POST['submit'])) {     $data = array_values($_POST); // get only values     $headers = array_keys($_POST); // keys are headers      if( $fp = fopen('data.csv','a+')) {         $line = fgets($fp);         if(!$line == $headers) {                 fputcsv($fp, $headers);                 fputcsv($fp, $data);         }         else         {             fputcsv($fp, $data);         }         fclose($fp);         header('Location: thanks.php');      } }


Hi I am look to run 100 amp sub panel to my shop from my 200 amp panel in my basement. It about 175 ft in middle of both panel box . I was looking for someone help me out on wire size and what I would need to do it ?


Okay so I have a friend who's recently started playing D&D and me and a bunch of other people have said that we would want to join in. However, we're worried that we'll be a bit clueless and are wondering the best ways to get into D&D. Thanks


Can anyone help me how to move this table in overleaf?

Can anyone help me move this table to the middle in overleaf? I've tried to look every where online but I can't seem to find the answer.   Here is the code to my table if it help:  \begin{table}[h!]  \caption{Variables and Parameters in SIR}  \centering  \begin{tabular}{c c c}  \hline\hline  S & Susceptibility stage for humans and mosquitoes \\  I & Infection stage for humans and mosquitoes\\  R & Recovered stage for humans\\  \alpha & Transmission rate of human becoming infected\\  \beta & Removal rate parasites from human  \\  \gamma & The rate which recovered individuals return to the susceptible statue due to loss of immunity\\  \epsilon & Probability of transmission of infection from a infected human to a susceptible mosquito, given that a contact between the two occurs \\  \delta & Probability of transmission of infection from a recovered human to a susceptible mosquito, given that a contact between the two occurs. \\  \zeta & Transmission rate of mosquito becoming infected\\  \eta & Probability of transmission of infection from an infectious mosquito to a susceptible human, given that a contact between the two occurs.\\  \hline   \end{tabular}  \end{table}   Here is how my table looks:


I have forgotten my Gmail account password and the phone number, Gmail is asking for sending a code,  is also deactivated. So how could I open my Gmail account?


Asking Question About Best Computer Programming Book

Is there a Stack Exchange site appropriate for asking, for example which is the best Scala book for getting an overview of the language?   If so, in which site could I ask the question?


How to connect to Office Online Server in Office365

I just wondering if we can use existing Office Online Server in Office365 for SP2013 on premise. If yes, how this can be achieve?   In SP2013 we normally run Get-SPWOPIBinding to find out the server binding and to connect to Office web App we normally run  New-SPWOPIBinding -ServerName. Is this the same command if I want to connect to the existing new Office Online Server in Office365?  Thanks


left align formulae; `flalign` seems not to work

I want a few formulae left align (but not all in formulae in the document) and use flalign following   but the result shows the formula in the center. Why?  \documentclass{article} \usepackage{amsmath}  \begin{document} the formula:  \noindent A \hfill Z \begin{flalign} 1 \in N \end{flalign}  \noindent A \hfill Z  more text   \end{document}   result:


For what values of $\alpha$, does this integral converge?

For what values of $\alpha>0$ this integral converges $$\int_0^{\infty} \frac {\sin x}{x^{\alpha}}dx $$


How can RNN handle variable sized inputs?

I came across this answer which is specific to Keras. But my question is at concept level. I am getting confused, How can RNN handle variable size inputs?  The answer  says RNN can handle variable sequence inputs.  My question is, How exactly the weights matrix W (see my figure) work with different length inputs?  Let us suppose we want to do a  sentiment classification.  Training batches of different length : Which I think means all training examples in a batch must be of same length but different batches can have variable length training examples.  Now, suppose length of training examples in    batch-1 = 10,  batch-2 = 15. batch-3 = 18  ... so on   Now while training batch-1 , In the unrolled RNN there would be 10 columns in the below figure to handle input of sequence 10. By columns I mean different timestamps in RNN. The shared weights W, U,V dimensions must be in sync with sequence length. What I mean by this is,  the shared weights to handle sequence of length 10 would be something like w1,w2,..w10 (horizontal connection that connects columns.)  I understand till this part.  Now, while processing batch-2 which is of sequence length 15, The unrolled RNN must take sequence of length 15. That means there are 15 columns in the below figure  and corresponding weights will be like w1,w2,..w15.  The number of weights W changed from 10(w1,w2,...w10) to 15(w1,w2,..w15) as we go from batch-1 to batch-2.   The W dimension changes. Things don't add up here for me.   What happens to shared weights? How are they learnt?


I have a SQL query that extracts data from the source system, and the data is formatted in CSS format so it contains text along with things such as < p > blah blah < / p >  Is there any simple way to remove all of these?  Thank you for any help :)


How do I run a shell script which runs another script with cron?

Whenn I run sh /opt/script/cypress.sh  Everything works, the script changes directory and executes a command to open another script. But when I have my crontab like this 1 * * * * /opt/script/cypress.sh  It doesn't work. I edited the crontab with "crontab -e" and tested if it works with a touch command The cypress.sh looks like: #!/bin/sh cd "/opt/script" | ./cypress > /opt/script/log;  And the cypress file looks like: cd "/opt/Website Testing/" npx cypress run --record --key *  I replaced the record key with "*" for this post


Firefox versus Python: latest version versus frozen version

Periodically, Ubuntu prompts me to download the latest version of Firefox.  But some programs, like Python, are never upgraded unless you update Ubuntu itself.  For instance, Ubuntu 14.04 uses Python 2.7.6, despite the fact that 2.7.7 came out years ago.  Is there any particular logic as to which things get constantly updated versus which get frozen?


I need to determine the number of pages in a specified PDF file using C# code (.NET 2.0).  The PDF file will be read from the file system, and not from an URL.  Does anyone have any idea on how this could be done?  Note: Adobe Acrobat Reader is installed on the PC where this check will be carried out.


Do any English synonyms have exactly the same meaning?

Air and breeze are termed as synonyms but they do not mean the same thing. Air is a general term while breeze would actually mean a cool flowing air.   Do we actually have exact synonyms for nouns in English?  In other languages, for example Hindi, we have 4–5 words meaning exactly the same thing; Hawa, Vayu, and Pawan all mean “air”.


I am trying to align the three = using align. Here is the code:  \documentclass{article} \usepackage{amsmath}  \begin{document}  \begin{align*} \sum_{i \geq 1} &= \prod_{j \geq 2}\\ &\stackrel{abc, \, xyz} =  \iint_{S}\\ &= \oint_\gamma . \end{align*}  \end{document}   However, I have trouble with the second one since it is part of \stackrel and I cannot put & in front of the second =. What I actually get with the above code is the following.    How can I fix this?


Why is the limit of a function $f(x)$ defined as $$f(x)-L<\varepsilon$$$$x-a<\delta$$but not like $$f(x)-L \leq \varepsilon$$ $$x-a \leq \delta$$What problems would arise if it was defined like this as compared to the standard definition? P.S.- Some may point out these as silly questions, but I want to understand every bit that I read, not just know. Thanks.


What is the product of $p_i-1 \over p_i$

I am trying to find the value of $\prod_{i=0}^{\infty}{p_i-1 \over p_i}$ =  ${\lim_{x \to \infty}} {\phi(p_x!) \over p_x!}$ Where $p_x!$ is the $x$th primorial, and $p_i$ is the $i$th prime number.  I guess I can honestly say I have no idea where to start, other than just iteriating it manually (around $0.25$ maybe?)


How to convert Function {} to real function?

Is there a way to convert Funtion {} to real function type ?  const foo = function(){ return 233 } const bar = { __proto__:  foo } foo.prototype == bar.prototype //true bar() //TypeError: bar is not a function foo // [Function: foo] bar // Function {}   'bar' is really close to 'foo', almost, but it cannot get call. What else it need to behave like 'foo'?


I upgraded from Ubuntu 16.04 to Ubuntu 16.10 and now I can't log in. If I insert the correct password, the system munches a little and then returns to the password request window. It happens for every user including the administrator and is not a problem of password.  Unluckily a bunch of data hadn't been backed up before the upgrade (my fault, I know) and I'm not even able to save them on an external medium. If I log in via bootable USB key I can't copy the data on an external medium because the data have "accessible only from the owner" privileges and if I log in by means of an external USB key I'm not able to copy, to modify the privileges (chmod) or copy the data even from root.


In edit mode scaling, moving and any other manipulation is done via increments

Basically, the functions of ctrl have switched with the basic controls. If I want to have smooth scaling, I now need to press ctrl. I don't know what I have toggled , but I'd rather not reload an entirely new project and copy over the obj file.


Create delegate function on declared line, possible issues?

If I have something like:  void SomeFunction(onCallBackDelegate) {      SomeClass.OnEvent += () => { onCallBackDelegate } }   Will there be issues with functions being loaded up on top of one another every time SomeFunctioni s called? Is tehre a way to mitigate it (i.e. when the declared function is called it is removed from SomeClass.OnEvent)?


I have a page that I receive donations with on my site. My bank's API requires that I generate a unique order id for each transaction. How can i implement this in my code using javascript?  The code I'm using is shown below.  Please enter the amount you wish to donate and click on the pay button. Thank you  <form id="&quot;form1”">   <div>    Amount:<input id="txtAmt" type="text" />    </div> </form> <script src="https://cipg.diamondbank.com/cipg/MerchantServices/UPaybutton.ashx?mercId=xxxxx&amp;CurrencyCode=566" type="text/javascript"> </script> <script type="text/javascript">   upay_settings.setAmountField('txtAmt');   upay_settings.setOrderId('31-Augdd-2014'); // This is the id I'd want to randomize   upay_settings.setProduct('Donation');   upay_settings.setEmail('xxx@xxx.org'); </script>


How do I extrude an object into another creating depth?

I am designing a fader and I want to have the groove be deep. I don't know how to extrude the grey long rectangle into the white face. They are two seperate meshes and I need to show some depth for when I render with light (the fader should look like it is actually sliding in a groove).


Add new field to content type programmatically

I created a content type in Drupal programmatically with the following code:  function reservation_system_node_info() {   $items['add_item'] = array(     'name' => t('Add a new item'),     'type' => 'add_item',     'base' => 'node_content',     'has_title' => '1',     'title_label' => t('Name'),     'help' => t('Please fill in all fields.'),   ); }   Now I want to add some fields into this content type, but with no luck. I hope someone can help me with this. I tried to use the system_create_instance() function from Drupal. The code I used:  function reservation_system_create_instance() {   $instance = array(     'field_name' => 'price_item',     'label' => 'Price',     'entity_type' => 'node',     'bundle' => 'add_item',   );  field_create_instance($instance); }   Should I use an another function to create fields in a content type or do I mis something?


Specifying an absolute Windows path for \includegraphics

I know that includegraphics can be used in Latex to include images into the document, but how can I specify a path for that file?  \includegraphics[]{picture-name}   Instead of asdd.jpg I want to specify C:\Documents and Settings\Nina\asdd.jpg, because that's where the image is.


On aviation maps (ICAO map 1:500.000) restricted areas are indicated by a line with hachure pointing to the inside of the polygon.    Refer to ICAO Annex 4 Appendix 2 page APP 2-9:    Is it possible to create a line or fill style with QGIS which represents this hachure?