How many 6 digit numbers are possible with no digit appearing more than thrice?

How many 6 digit numbers are possible with at most three digits repeated?  My attempt:  The possibilities are:   A)(3,2,1) One set of three repeated digit, another set of two repeated digit and another digit (Like, 353325, 126161)  B)(3,1,1,1) One set of three repeated digit, and three different digits.(Like 446394, 888764)  C)(2,2,1,1) Two sets of two repeated digits and two different digits (Like, 363615, 445598)  D)(2,2,2) Three sets of two repeated digits (Like, 223344, 547547)  E)(2,1,1,1,1,1) One set of two repeated digit and four different digits (Like 317653, 770986)  F)(1,1,1,1,1,1) Six Different digits (like 457326, 912568)  G)(3,3) Two pairs of three repeated digits. Let's try to calculate each possibilities separately.    F) is the easiest calculate.   Let us try to workout  Case E)  Let's divide the case into two parts:  Case E(1) Zero is not one of the digit   We can choose any $5$ numbers form $9$ numbers $(1,2,3,\cdot, 9)$ in $\binom{9}{5}$ ways , the digit which one is repeated can be chosen in 5 ways, and you can permute the digits in $\frac{6!}{2!}$ ways. The total number of ways$=\binom{9}{5}\times 5\times \frac{6!}{2!} $  Case E(2) Zero is one of the digit.  Case E(2)(a) Zero is the repeated digit We need to choose four other numbers which can be done in $\binom{9}{4}$ ways, the digits can be permuted in $\frac{6!}{2!}$ ways, but we need to exclude the once which starts with zero ($5!$ many). The total number of ways =$=\binom{9}{4}\times  (\frac{6!}{2!} -5!)$.  Case E(2)(b) Zero is not the repeated digit We need to choose four other numbers which can be done in $\binom{9}{4}$ ways, the repeated digit can be chosen in 4 ways,  the digits can be permuted in $\frac{6!}{2!}$ ways, but we need to exclude the once which starts with zero ($5!$ many). The total number of ways =$=\binom{9}{4}\times 4\times  (\frac{6!}{2!} -5!)$.  Before, proceeding to workout the other cases, I want to know   Is my attempt correct? If it is correct, it is too lengthy, is there any other way to solve this?


Small Spoiler. Can I store 2 cars in a specific Safehouse Garage?

In Fraklin's new Safehouse can you safe 2 cars? Also where do cars go if they disappear from there? And they aren't in the Impound is it a glitch?


How do you branch and merge with TortoiseSVN?

How do you  with Apache Subversion using the TortoiseSVN client?


Discrepancy between the green rep number and the numbers inside

Is there a reason for this? Or is it an actual bug? I haven't received any downvotes recently, so that's not the issue.  Edit to include some questions from the comments below:  Re duplicate of : I haven't deleted any posts recently, nor have any posts of mine been deleted, as far as I can tell.     IIRC, I have downvoted an answer (or question) before (at some point in time), but I'm pretty sure it's been at least 6 months :D.  @Shadow Wizard said that maybe the answer I downvoted (-1) got deleted (+1), and then undeleted (-1).  That's possible, I guess (I had thought that they expire after a while and only mods can undelete, but I guess that's not the case).    Aannd it just happened again.  (Although as @Cai pointed out, I might have already gotten the +5 from this post so this might be a false positive (aha- see what I did there))


Can Europeans reset their "time in Canada" clock by visiting the US?

If a Swiss citizen comes to Canada and stays for 6 months, can they travel to USA for example, for a short period of time, and then return to Canada for another 6 months?  How long must they stay out of Canada before returning?


TikZ: turning edges into arrows using "child" notation

I'm using TikZ for the first time to draw a simple Kripke model, and I'm using the child notation to produce new nodes. How can I turn my edges into arrows?  \begin{tikzpicture}   \node [circle,draw] (q0) {}   child {node [circle,draw] (q1) {$p$}     child {node [circle,draw] (q4) {$p$}       child {node [circle,draw] (q7) {$p\land q$}}       child {node [circle,draw] (q8) {$p\land q$}}       child {node (q9) {} edge from parent[->, dashed]}}     child {node [circle,draw] (q5) {$q$}}     child {node (q6) {} edge from parent[dashed]}}   child {node [circle,draw] (q2) {$p$}}   child {node (q3) {} edge from parent[dashed]}; \end{tikzpicture}   I know how to change the color or thickness of all edges by passing an option at the beginning of \begin{tikzpicture}, but I can't turn them into arrows.   Also, while we're at it, is there a way to label these edges? Or am I left with simply using node notation for all my nodes?  Thanks for all your help, Piotr


How to sanitize a string removing specific character?

I have this string:  PO Box 162, Ferny Hills QLD 4055 Brisbane   which contains these character:    I want remove this charactes, so I tried:  info.Address = dd[i].InnerText                     .Replace("\n", " ")                     .Replace(" ", "")                     .Replace(",", ", ");   but didn't works, I get all the character of the string attached. I'm expecting this result: PO Box 162, Ferny Hills QLD 4055 Brisbane.


The sequences $a_n = \sqrt[n]{4^nn}$ is converge or diverge? Find the limit of each convergent sequence.

I don't know how to determine the sequences is converge or diverge and find the limit of each convergent sequence. Can someone help me to solve this problem?


How do I make cpupower frequency-set not reset at boot?

when I set cpu frequency range with this command:  sudo cpupower frequency-set -d 500MHz -u 2700MHz   the frequency range is succesfully set to these values, but when I reboot and do:  sudo cpupower frequency-info   i notice that the frequency range is set to other values. This is the output:  analyzing CPU 0:   driver: intel_pstate   CPUs which run at the same hardware frequency: 0   CPUs which need to have their frequency coordinated by software: 0   maximum transition latency:  Cannot determine or is not supported.   hardware limits: 500 MHz - 2.70 GHz   available cpufreq governors: performance powersave   current policy: frequency should be within 1.08 GHz and 1.08 GHz.                   The governor "powersave" may decide which speed to use                   within this range.   current CPU frequency: Unable to call hardware   current CPU frequency: 998 MHz (asserted by call to kernel)   boost state support:     Supported: yes     Active: yes   Can anyone help me make it not reset? Thanks!


limit grep context to a part of the result line

I have a big sql dump with long lines and I would like to use grep to find a certain text string.  grep text_string filename.sql   returns the result lines which are huge and difficult to see where my text_string appears. What I want to achieve is to get a result that contains lets say 50 characters to the left and 50 to the right of the search term (text_string). Is this possible?


The volume of a cone whose length of its side is $R$

How can I compute the volume of a cone whose side length is $R$ and the vertex of the cone forms an angle $2\theta$?


Why does my model look "patchy" after I enable smooth shading on it?

[![enter image description here][2]][2]  How I do I fix those strange patches? I tried hours of subdividing areas and such but to no luck.. Is there a simple fix? Could someone people help, I'd be glad to share the Blender file I just really need to get this finished as soon as possible.   Blender file, would be amazing if you could help :)


I'm on overleaf and already tried all LaTeX engines, resulting in the same error:     LaTeX Error: Unknown graphics extension: .bmp   Is there a way to fix this rather than converting the images one by one? I've searched about it and people were talking about DVI, but I didn't understand how it works


Opening *.lyr file in QGIS without access to ArcGIS for Desktop?

Is there a way to open a *.lyr file in QGIS without using ArcGIS for Desktop?   I have no access to ArcGIS, so the solution explained in  is not an option.  I have a *.lyr file with a lot of information and it is not possible to reproduce it all by myself.


Departing from airport before visa is valid, but arriving when it is

My situation is that I have a valid visa for entering Russia on 27/11/2016, and my flight arrives in Moscow at 02:00 same morning, this is only transit for going deeper into Russia.  I'm leaving Amsterdam Airport at 20:40 on 26/11/2016 (when my visa isn't valid yet).  Do you think there will be any problem during my travel? I have European citizenship.  UPDATE: Hello - Everything went as expected! They checked my VISA at Amsterdam Airport and gave me green light to go on the plane :))


Update please: Is there a phone in the U.S. that is supported by Verizon, and can run ubuntu effectively?

I am restricted to using Verizon as my carrier due to coverage barriers. I would like to get a phone that runs ubuntu well, and is supported by Verizon. There was a lot of talk in 2013 regarding Verizon Wireless joining Ubuntu's Carrier Advisory Group, did anything come of this? Are there any phones supported by Verizon that can be converted to Ubuntu? Hoping for good news!


Easy way to draw arc with fixed center but different start and end angles?

I am looking for an easy way to draw an arc that goes e.g. from 45 deg to 90 deg and with 0,0 as center. The arc should start then at (0.707,0.707) and end at (0,1). The common syntax   \draw (0,0) arc [radius=1, start angle=45, end angle= 90];   always starts the arc at (in this case) (0,0) which makes it hard to draw several arcs with the same center but starting from different angles.  Or is there something I am missing?


How to match a string of array by if method. Means i take some value in a string array and take user input and then input match that string array is right or wrong if right give a value or wrong give other value.And I want to take input use it in loop. I have such a code and i do it without loop can match but can not use loop.   public class third {      public static void main(String[] args) {         Scanner user_input = new Scanner(System.in);          System.out.println("Enter a name:\n");         String first_name;         first_name=user_input.next();         String last_name;         last_name=user_input.next();           if(first_name.matches("Elory"))         {             System.out.println("MR. " + first_name + " " + last_name);         }         else if(first_name.matches("Fred"))         {             System.out.println("MR. "+ first_name+" "+last_name);         }         else if(first_name.matches("Graham"))         {             System.out.println("MR. "+ first_name+" "+last_name);         }         else if(first_name.matches("Amy"))         {             System.out.println("MS. "+ first_name+" "+last_name);         }         else if(first_name.matches("Buffy"))         {             System.out.println("MS. "+ first_name+" "+last_name);         }         else if(first_name.matches("Cathy"))         {             System.out.println("MS. "+ first_name+" "+last_name);         }         else          {             System.out.println(first_name+" "+last_name);         }      }  }


Trace map from finite surjective morphism of normal irreducible varieties

I am trying to understand why if $f: Y \rightarrow X$ is a finite surjective morphism of normal (irreducible) complex varieties, there is a trace-map $f_{\ast} \mathcal{O}_Y \rightarrow \mathcal{O}_X$ splitting the natural inclusion in the other direction.   What I understand so far is (1) that the finiteness condition ensures that $f_{\ast} \mathcal{O}_Y$ is integral over $\mathcal{O}_X$, so $K(Y)$ is algebraic over $K(X)$ and (2) that there is a trace map from the algebraic closure $K(Y)$ to $K(X)$, which restricts since the extension is integral.  However these steps feel a little shakey to me, and also I haven't used normality. Is it just required for the extension of fields to be Galois (I guess it guarantees it will be a normal extension?) I don't quite understand this part.   For reference, I am trying to understand the proof of the Injectivity Lemma 4.1.14 in Lazarsfeld.   Thanks for your help.


Is one time pad cipher reuse and random key secure?

The sender and receiver share two different secret keys:  s1 and s2 both y bit values. 'x' is a randomly generated y bit value. The reader sends to the tag a challenge y =  x ⊕ s1, and the receiver  responds with z = x ⊕ s2 after recovering x = y ⊕ s1.   s1 and s2 never change, x is randomly generated each complete transaction. Can you determine s1 and s2 through a single transaction? After multiple?


I have a question. Is it possible to draw a sprite from a side view and then rig that with bones? Maybe I would first have to import the image into blender and then dop that outline with a mesh. Then, if even possible, I could maybe attach the sprite to the mesh and add the bones. I dont really have much experience with blender but I did create a humanoid sculpture and successfully rig it a long time ago. I don't remember being able to paste an image to the mesh in blender, but I do remember something having to do with seams and then maybe I could export those parts and attach it to them in another program (or worse have to draw over them which means having to draw the image all over again.) I'm not much of an art guy, more of a coding guy. I use Unity and would like to only have to draw one image and then do all the animations of that one image in blender so that I can focus more on coding. If it is possible please let me know. Thank you in advance for any response.


Accessing extended tag info is almost impossible

The new tag popup makes it easy to watch or ignore particular tags and shows the tag info excerpt. Here's one on EL&U:    However, the  contains a lot more information which helps users. Getting at that information is not obvious: you need to click the View tag link which provides a , and then click the Learn more... link.  The old tag pop-up used to include a link to the full tag info, and it appears that this was implemented as a result of a  which changed behaviour which was remarkably similar to what happens now.  Here's  to give the idea. The Info link showed the full tag info.    The current behaviour is a regression, breaking something which was previously fixed.  Could View tag in the new popup be changed to Other questions and a new More info link be included which gives easier access to the full tag info? Perhaps something like this...


Evaluating $\lim_{n \to +\infty}\frac{1}{n}\left({\frac{n}{n+1} + \frac{n}{n+2} + \cdots + \frac{n}{2n}}\right)$

How do I evaluate $$\lim_{n \to +\infty}\frac{1}{n}\left({\frac{n}{n+1} + \frac{n}{n+2} + \cdots + \frac{n}{2n}}\right)\ ?$$  I'm stuck. I tried using the sandwich theorem but I was getting nowhere. Since $n \lt n+k \lt 2n$, I think it should be $ \infty$ .


I have a string "2013-10-09 00:00:00" and I use the code below to change it to a timestamp  date_default_timezone_set($timeZone); $timeStamp = strtotime("2013-10-09 00:00:00"); //echos 1381269600   When I do   date_default_timezone_set($timeZone); date("Y-m-d H:m",$timeStamp);   I get 2013-10-09 00:10:00. This is completely strange. Why do I get this 10 minutes difference?


How to put my footer always on the bottom of my page?

How can I have a footer which always stays at the bottom of my page even if this page is too little to fill the entire screen or more ?  I have a button in my page, and when you touch it, it adds thanks to javascript many elements to my page and the page size changed, but my footer doesn't adapt its position.  The problem is when I set the position of my footer to relative, when my page size is too short, he is not at the bottom of my screen, but just under the last element I put on.  I tried position: absolute;, but when the user clicks on the button, my footer stays stuck at his position and it doesn't go to the new bottom of my page.  I don't want my footer to be always visible, but just to be at the real bottom of my page.


Solution verification: a sloppy proof for 𝑑∣𝑛 ⟹ 𝜑(𝑑)∣𝜑(𝑛)

Let $d,n\in\mathbb{Z}^+$. The question is to prove that $d\mid n$ $\implies$ $\varphi(d)\mid\varphi(n)$. Here, $\varphi:\mathbb{Z}^+\to\mathbb{Z}^+$ is the Euler totient function.  For $n=1$, we must have $d=1$. Then, $\varphi(d)=\varphi(n)=1$ and thus $\varphi(d)\mid\varphi(n)$. For $n>1$ and $d=1$, $\varphi(d)\mid\varphi(n)$ since $1\mid z$ for all $z\in\mathbb{Z}^+$. For $n,d>1$, since $d\mid n$, we can express $\varphi(d)$ and $\varphi(n)$ as follows: $$\varphi(d)=p_1^{\alpha_1-1}(p_1-1)p_2^{\alpha_2-1}(p_2-1)...p_s^{\alpha_s-1}(p_s-1)$$ $$\varphi(n)=p_1^{\beta_1-1}(p_1-1)p_2^{\beta_2-1}(p_2-1)...p_s^{\beta_s-1}(p_s-1)q_1^{\gamma_1-1}(q_1-1)q_2^{\gamma_2-1}(q_2-1)...q_t^{\gamma_t-1}(q_t-1)$$ where  $p_i,q_i$ are distinct primes; $s,\alpha_i,\beta_i\in\mathbb{Z}^+$ with $\alpha_i\le\beta_i$; $q_i$ account for those prime factor(s) of $n$ which do not divide $d$. If such factors exist, then $t,\gamma_i\in\mathbb{Z}^+$, otherwise we don't have those terms in $\varphi(n)$.  Now, let $\omega=p_1^{\beta_1-\alpha_1}p_2^{\beta_2-\alpha_2}...p_s^{\beta_s-\alpha_s}q_1^{\gamma_1-1}(q_1-1)q_2^{\gamma_2-1}(q_2-1)...q_t^{\gamma_t-1}(q_t-1)$. Clearly $\omega\in\mathbb{Z}$. We then have $\varphi(d)\omega=\varphi(n)$, that is, $\varphi(d)\mid\varphi(n)$.  May I ask if my proof is valid? Many thanks!


So I play Minecraft on a Windows 10 PC, and every time I try to open it, the screen will stay grey and it won't respond. I re-installed it, but that didn't work. Then I went into my .minecraft folder and saw that my launcher_profiles.json was gone. These are the Minecraft profiles, right? I think that's the problem, but I don't know how to get it back. How do I get Minecraft to start again?


How could a new Force user learn Jedi Mind Trick so quickly?

Within a few hours of learning they could use the Force,      Rey is using Jedi mind tricks to escape her cell.   Some Jedi take months and years to master Jedi mind trick. How is that possible to figure it out so quickly?


Find an expectation of normal random variable

How can I find an expectation of random variable $\xi \sim \mathcal{N}(a,1)$, where $a$ is random variable: $a \sim \mathcal{N}(0,\sigma^2),\quad  \sigma = \text{constant}$ ?


Universities recommandations and choices

I'm a tunisian student, i have a dream to persuit masters educations in a better university in Europe, USA, UK or Canada. I have a Bachelor degree (Licentiate, BAC+3) in computer science and multimedia field and i speak and write three languages fluently(Arabic-Frensh-English). I would like to know if a have enough chance to reach it and what to do? Any recommandations will be helpfull. Thank's


Calculus - Prove $\lim_{n \to \infty} \frac{x^n}{n!}=0$

I need to prove that :  $$\lim_{n \to \infty} \frac{x^n}{n!}=0$$  I tried to prove it using epsilon-delta, but I still haven't managed to prove it.  I think that maybe with sandwich theorem it possible to prove it.  Any help will be appreciated.


Let $G$ be a topological group with identity element $e$. Let $f,g: (S^1, (1,0)) \to (G,e)$ be loops in $G$ with base point $e$.  We define $f * g: (S^1, (1,0)) \to (G,e)$ by $$f * g(s) = f(t) \cdot g(t)$$ where $\cdot$ is the group multiplication.  Then $fg$ and$ f*g$ are homotopic.  [Note: $fg$ denotes the "concatenation" of $f$ and $g$, i.e. we first walk the $f$ and then $g$, both at double speed.]  So we need to find a homotopy from $fg$ to $f*g$. I've tried writing down various possible homotopies but none of them worked and I can't seem to figure it out. I appreciate any hint.


I would like to drive a MOSFET gate using 12V (in order to reduce the drain-source resistance). Using the answer from a few post i've read I have come up with the following circuit. Will this circuit work for an application where i will be switching the motor on and off one every 10 minutes?  Further more is this the best method of driving the FET? and is there any type of "MOSFET driver IC" i can use to reduce space on my PCB?


How to see how many context switches a process makes?

I want to see if my process makes a lot of context switches. I also want to see how manpulating task groups affects the number of context switches.


The sentence is below (standalone sentence, no context)     Bears often hide themselves in places ____ hunters can't find.   My teacher said the answer was "that/which". I feel totally OK with that, but am confused about why which is also applicable here.  IMHO, which leads a non-restrictive clause while that leads a restrictive clause. Since hunters can't find isn't an additional description of the noun places, which is not suitable here. And because it restricts places to those that hunters can't find, that should be OK here. Am I right?


Picklist dependent on 2 controlling picklist

I have 3 picklist in an object Test1, Test2, Test3  1. Test2 is dependent on Test1  2. Test3 is dependent on both.. Test1 and Test2    I want to have Test3 picklist showing values accordindly. i.e  if U selected Test1 = First and Test2 = SA . I should be able to see "IST,ABC and PQR" in Test 3.   Is this possible???


Impact of use of specific terms in slug on SEO

Lets say there are two websites A and B and both have an article with exactly similar title but almost similar content. However, the URL structure of the two articles is as follows:    Site A: www.site-a.com/**article**/article-title.html  Site B: www.site-b.com/**news**/article-title.html   The difference between the above two URLs is that while A is using "article" in slug, while site B is using "news" in slug. Is there any meaningful difference in terms of SEO for these two sites. Please solve this query of mine, which might be arising out of my ignorance but I have seen that site B despite of having poorer content, ranks higher than A.  Or in other words, what can be possible impact if site A also uses "news" in the slug.


Term for wordplay using adjacent repetition of homophones

Is there a term for the kind of wordplay in which homophones are repeated adjacently with different meaning? For example,  The rose rose up. Rose rows in church.


This is part of Exercise 2.7.9 of F. M. Goodman's "Algebra: Abstract and Concrete".  Definition 1: The commutator subgroup $C$ of a group $G$ is the subgroup generated by all elements of the form $xyx^{-1}y^{-1}$ for $x, y\in G$. The Question: Show that the commutator subgroup $C$ of a group $G$ is normal and that $G/C$ is abelian.  My Attempt: Let $g\in G$. Then $g(xyx^{-1}y^{-1})g^{-1}=gxy(gyx)^{-1}$, but I don't know where to go from here. What I'm trying to do is write $g(xyx^{-1}y^{-1})g^{-1}$ as an element of $C$. Please help :)


Amount of Number Combinations to Reach a Sum of 10 With Integers 1-9 Using 2 or More Integers

I received a word problem that goes like this.  A local kindergarten is thinking of making posters that show all the different ways of adding two or more integers from 1 to 9 to get a sum of 10.  If there is enough space on each poster for up to 50 possible solutions, how many posters will the school need to make?  (Note:  sums that contain the same number but in a different order are considered to be different; for example,  1 + 9  and  9 + 1  are two different solutions.)  What is the answer to this problem, and more importantly, how do I solve it?


Formatting a USB stick - unable to operate USB

I followed this commandline method() — since ubuntu studio was different from original ubuntu, and the options were not available in GUI version —to format a USB stick, but I hadn't read after the part that required me to wait, and as a result my USB stick doesn't operate now. However, when I do plug it in, lsblk, shows that my USB is connect, however it's inoperable.     How can i recover my USB stick?


I don't want to be hogging up my wifi network. Can I limit how much wifi I use so I don't hog up the network I am using and if so how?


Is the canonical parameter (and therefore the canonical link function) for a Gamma not unique?

Consider $Y_1, \dots, Y_n$ independent from the Gamma distribution. For $y > 0$: $$\begin{align} f(y \mid \alpha, \beta) &= \dfrac{1}{\beta^{\alpha}\Gamma(\alpha)}y^{\alpha-1}e^{-y/\beta} \\ &= \exp\left[-\log(\beta^{\alpha}\Gamma(\alpha))+(\alpha-1)\log(y)-\dfrac{y}{\beta} \right] \\ &= \exp\left[y\left(\dfrac{-1}{\beta} \right)-\log(\beta^{\alpha}\Gamma(\alpha))+(\alpha-1)\log(y) \right] \end{align}$$ I define an exponential dispersion family as any distribution whose PMF/PDF is  $$f(y \mid \boldsymbol\theta) = \exp\left\{\phi[y\theta - b(\theta)] + c(y, \phi) \right\}\text{, } y \in \Omega$$ where $\Omega$ is in the support of a random variable $Y$ in the family.    Method 1:  Therefore, $Y_i$ is of the exponential dispersion family with (assuming $\alpha_i$ is known) \begin{align} \phi &= 1 \\ \theta_i &= \dfrac{-1}{\beta_i} \\ b(\theta_i) &= \log[\beta_i^{\alpha_i}\Gamma(\alpha_i)] \\ &= \log[(-\theta_i)^{-\alpha_i}\Gamma(\alpha_i)] \\ &= -\alpha_i\log(-\theta_i) + \log \Gamma(\alpha_i) \\ c(\phi, y_i) &= (\alpha_i-1)\log(y_i)\text{.} \end{align} It follows that \begin{equation} \mu_i = b^{\prime}(\theta_i) = \dfrac{-\alpha_i}{-\theta_i}(-1) = \dfrac{-\alpha_i}{\theta_i}\text{.} \end{equation} and our canonical link is   $$g(\mu_i) = \theta_i = -\dfrac{\alpha_i}{\mu_i}\tag{*}$$    Method 2:  Credit due to .  Let $\theta = -\dfrac{1}{\alpha\beta}$. Then rewrite $$\begin{align}f(y \mid \alpha, \beta) &= \exp\left[y\left(\dfrac{-1}{\beta} \right)-\log(\beta^{\alpha}\Gamma(\alpha))+(\alpha-1)\log(y) \right] \\ &= \exp\left[y\left(\dfrac{-1}{\beta} \right)-\alpha\log(\beta)-\log\Gamma(\alpha)+(\alpha-1)\log(y) \right] \\ &= \exp\left[y\alpha\theta-\alpha\log(\theta^{-1})-\log\Gamma(\alpha)+(\alpha-1)\log(y) \right] \\ &= \exp\left\{\alpha[y\theta-\log(\theta^{-1})]-\log\Gamma(\alpha)+(\alpha-1)\log(y) \right\}  \end{align}$$ in which case, since $\phi$ cannot vary depending on $i$, \begin{align} \phi &= \alpha \\ \theta_i &= -\dfrac{1}{\alpha\beta_i} \\ b(\theta_i) &= \log(\theta_i^{-1}) = -\log(\theta_i)\\ c(\phi, y_i) &= (\alpha-1)\log(y_i)-\log\Gamma(\alpha)\text{.} \end{align} In this case, $b^{\prime}(\theta_i) =-\dfrac{1}{\theta_i} = \mu_i$, which means that $$g(\mu_i) = \theta_i = -\dfrac{1}{\mu_i}\text{.}\tag{**}$$     cites (**) as the canonical link function. Why is (**) preferable over (*) for the canonical link function?  What makes this even more confusing is that  says that the canonical link function is $\dfrac{1}{\mu_i}$ (also mentioned in McCullagh and Nelder).     First main question: Are canonical link functions unique, when provided a random component?      Second main question: Is there only supposed to be one canonical link function for each random component? If so, what is wrong with the work above?


Determine if the convergence of $f_n(x) = \sqrt{x^2 + \frac{1}{n^2}}$ is uniform.

$f_n(x) = \sqrt{x^2 + \frac{1}{n^2}}$ converges pointwise in a set $E = [0, \infty)$ to $f(x) = x$.   This problem reminds me a lot of how $\frac{x}{n}$ fails to converge uniformly to $f=0$ on $[0,\infty]$, but does converge uniformly on $[0,a]$. However, when we proved that we used the definition of uniform convergence. I do not wish to do that here.  I wish to use the Weierstrass test here. And that is where I'm stuck. I cannot find $M_n = \sup\limits_{x \in E} |f_n(x)-f(x)|$. Can someone help me out here?


Run a command on every file in a directory, changing the output name

I need to compile all of the C files in a directory into seperate outputs... see example gcc -Wall program1.c -o program1.out  How do I do this?


Why do we "get to school" but "get home"?

I've noticed that we "get to" some places, i.e. school, the gym, work, etc but we only "get home". Why do we omit the "to" for that particular usage?


So the equation is: $$𝑧^2−(4+𝑖)𝑧−10−10𝑖=0$$  I've tried to use the quadratic formula, but still can't get the solution.  I need an algebraic number form.  Thank you for help!


inverting fraction comes out different size

I think I get why the two parentheses/fractions here are not the same size:  \left(\frac{3}{p}\right)\left(\frac{p}{3}\right)   Screenshot from Mathjax website:    Presumably something about the baseline being different for p and for 3.  But at the same time, it just looks bad.  Notice that \frac{3}{p}\frac{p}{3} or (\frac{3}{p})(\frac{p}{3}) look better, but I need parentheses here and I'd prefer them to cover the whole fraction (actually, Legendre symbol).  Can anyone think of a better way to do this?


Morally/Legally, how could Dr. Bashir, a Federation doctor, perform the operation he did to Worf's brother Kurn by wiping his memory?

DS9: "Sons of Mogh":     KURN: I have never understood you, Worf. But I do know this. In your own way you are an honourable man.  (Kurn passes out.)       WORF: And you will be an honourable man again, but not as my brother.   Above implies that Kurn did not know what was about to happen to him and that this was a unilateral decision by Worf.     WORF: What will he remember?       BASHIR: He'll know he's a Klingon, and how to speak the language, and   virtually everything he needs to know in order to survive, except who   he is. And that's the first question he'll ask. Who am I? Do you have   an answer?       WORF: There is a man named Noggra, a friend of our father's. He will   be arriving in a few hours. He has agreed to provide Kurn with a new   identity and a new family. He will supply Kurn with all the answers he   needs.       BASHIR: Are you absolutely certain about this, Worf? Once I've erase   his memory engrams it'll be almost impossible to restore them. He   won't remember you or anything about his real life.       WORF: It is the only way. You may begin.   Again by Worf asking Bashir about the procedure while Kurn is on the table unconscious implies that Kurn was not consulted about this procedure beforehand.  Bashir is a Federation doctor that took a hippocratic oath. Part of that oath is to do no harm. Most people wouldn't want their family doing an elective procedure on them without their consent. In fact, most people wouldn't want any procedure done on them without their consent. (especially one to wipe their memory)   Kurn was effectively stipped of his very being, his memories, everything that made him who he was. Bashir even said it, he won't remember anything about his "real life." He became an empty shell, basically how Klingons refer to their dead.   He didn't really get his honor back, his soul and/or lineage did not change. Plastic surgery, some DNA changes, and wiping someone's memory doesn't change their soul. Although this is not my question, it is something to consider.   I can't believe Sisko would allow it to happen on DS9. There has to be some Federation law against something like this. Telepathically reading someone's mind without their consent is illegal in the Federation. Remember in the same episode Sisko reams Worf for trying to kill his brother to regain his honor, which clearly is a Klingon ritual. Bashir had just saved Kurn earlier thereby stopping a Klingon ritual before it ended.  Even the way they did it was sneaky. If they had asked Kurn, there's a good chance he'd say no. There's no honor in living a lie. What a horrible violation it was.  The Federation is supposed to be an enlightened advanced society.  In light his hippocratic oath to do no harm, existing Federation law, and Kurn's civil liberties, how could Bashir possibly perform this operation without Kurn's consent?  STU, EU, and writers notes are welcome. Anyone with knowledge of Hippocratic oaths or Federation law would be helpful as well.


Why is this command to open man page and perform search not working?

This  question half covers what I'm trying to do:  Instead of doing man chmod and then /a+x to jump to the first section in the chmod man page that mentions a+x, I would like to know if there is a way to open the man page to a specific search string, similar to how you can do vi +string filename.txt in vi(m).  The chosen answer was man foobar | less +/searched_string  However, when I try man tmux | less +/^format  Less launches but returns  Pattern not found  (press RETURN)  Why is the pattern not being found?  OS - Ubuntu 15.10 % less --version less 458 (GNU regular expressions) Copyright (C) 1984-2012 Mark Nudelman


Is $\log_{\cos x}(1)$ defined at $x=0+2k\pi$?

I have an equation like this:  $\cos(x) ^ {\sin(x)} = 1$  I thought I would solve it like this:  $\cos(x) ^ {\sin(x)} = 1$  $\sin(x) = \log_{\cos(x)}(1)$  $\sin(x) = 0 $  $x = 0+k\pi$  But I'm confused about the domain. I did $\log_{\cos(x)}(1)$ which should mean $(\cos(x)>0 \wedge \cos(x)\neq1)$  i.e $x\in(-\frac{\pi}{2}+2k\pi, 0+2k\pi) \cup (0+2k\pi, \frac{\pi}{2}+2k\pi)$ but then all the solutions of $x = 0+k\pi$ are invalidated. Is $\log_{\cos(x)}(1)$ always considered $0$ no matter the $x$?


Creating series of points along multiple polylines at once in ArcMap?

I have a series of polylines that represent linear vegetation (shelterbelts, etc). I need to convert these to a series of points equally spaced in order to add them to a different shapefile that represents point vegetation (individual trees). I should also mention that I have about 300 polylines to do this to, so would like to be able to do them all at once. The polylines vary in length, but regardless of length, I want to place points at the start at end of each line, and then every 10 m.   I would imagine that this will require python script. Of which I am not familiar with how to write.   Does anyone know how I can do this in ArcMap 10?   I looked at a similar question previously posted for someone who wanted to create 6 points on 70,000 lines of various length and found this python script:  import arcpy points = []   for row in arcpy.da.SearchCursor("YourInputLinesFileHere", ["SHAPE@"]):     length = row[0].length     for i in range(0,6):       point = row[0].positionAlongLine(length/5*i)       points.append(point)           arcpy.CopyFeatures_management(points, 'YourOutputPointsFileHere')   So I know it must be possible with python but am not familiar with it enough to manipulate this.


Simplest way to convert a string representing JSON array into Java array List of key value pairs

I have json string which looks like the following:   "users":[       {user_id=1,        user_name=foo,        profile_image=profile.png},       {user_id=2,        ............},        .............           ]   How can I convert it into a java arraylist of key,value pairs?


How do I use pm-suspend-hybrid by default instead of pm-suspend?

I would like to use the hybrid suspend method instead of suspend when closing the lid or selecting "Suspend" from the menu.  I can imagine to change the pm-suspend script to do so automatically, but there might be a more maintainable / easier way.


Irreducibility of $X^{4}-10X^{2}+1$ in $\mathbb{Q} [X]$...

I have to prove that $X^{4}-10X^{2}+1$  cannot be put as a product of two irreducible polynomials  in $\mathbb{Z}[X]$ and show that is irreducible in $\mathbb{Q}[X]$ the exercise also requires finding every root in  $\mathbb{Q}[X]$  and in $\mathbb{R}[X]$.  For the second and third part I tried to "complete squares"...  \begin{align*} X^{4}-10X^{2}+1 & =\left(X^{2}-5\right)^{2}-24=\left(X^{2}-5\right)^{2}-\left(2\sqrt{6}\right)^{2}=\\  & =\left(X^{2}-5+2\sqrt{6}\right)\left(X^{2}-5-2\sqrt{6}\right) \end{align*}  The sum of irrationals is irrational and the square root of an irrational number is irrational so the polynomials above are irreducible in $\mathbb{Q}[X]$, I don't know the proper proof for, after doing that, conclude that $X^{4}-10X^{2}+1$ is irreducible in $\mathbb{Q}[X]$.  Obviously the irrational square roots are $X=\pm\sqrt{5-2\sqrt{6}}$ and $X=\pm\sqrt{5+2\sqrt{6}}$ which are in $\mathbb{R}[X]$ and not in $\mathbb{Q}[X]$. Any ideas?


bash + how to calculate percentage from number

how to calculate percentage from number  for example we set   number=248   and we want to know what is the 80% from $number  so how to calculate it in bash ?  expected output 198  ( exactly is 198.4 but we want to round down with floor )


I have about 45 XML data files and I need to create XSDs for them.  I have Visual Studio 2008 installed. What I am doing right now is opening up each XML file and creating the XSD from the menu option and then saving the XSD.  Is there a command line option for me to create all XSDs?  If not, is there a bulk XSD generation tool that can do this for me?


How to notice log file changes with Linux standard tools?

I need something that does not need to be installed. It's on an embedded system with very little space on the HD. I can't instal anything. I need to do it with something that is already included.  I have a script that I want to run based on a certain line that appears in a log file. Currenty I placed this script to run every 5 minutes in the crontab and check the file for changes.  Is there a way that I can have the system call the script only if the file has changed? Like, to tell the system to fire the script in case a system call was made to open that file with write permission?


The question tells me that i can use $x=(x+y)-y$  and $|x+y|≤|x|+|y|$ to prove. But i don't know where to use  $x=(x+y)-y$.  Till now,i only get that $-|x|-|y|≤|x+y|$ from the use of $|x|≤A$,$-A≤x≤A$


Proof of an integral inequality of polynomials

Let $f$ be a polynomial with degree $n$, also $$\int_{0}^1 f(x)x^kdx=0,k=1,2, \cdots ,n$$ Prove that  $$\int_0^1 f^2(x)dx=(n+1)^2\left(\int_0^1 f(x) dx\right)^2$$ My first step is to subtract zero from the left of the equation.  $$\begin{aligned} \int_0^1 f^2(x)dx&=\int_0^1 f^2(x)dx-\sum_{k=1}^n\int_0^1 a_k x^k f(x)dx\\ &=\int_0^1 f(x)\left(f(x)-\sum_{k=1}^n a_k x^k\right)dx\\ &=a_0 \int_0^1f(x)dx \end{aligned}$$ Then  $$a_0=(n+1)^2\left(\int_0^1 f(x) dx\right)\quad\text{or}\quad \int_0^1 f(x) dx=0$$ I doubt that this is not true because the integral of an arbitrary polynomial is a constant only related to $a_0$. But this is possible. Could you show a better idea and give a proof? Thanks.


Does $\lim_{n\to\infty}\underset{n}{\underbrace{\cos(\cos(...\cos x))}}$ exist?

Possible Duplicate:         Does the following limit exist?  $$\lim_{n\to\infty}\underset{n}{\underbrace{\cos(\cos(...\cos x))}}$$  If yes, find the limit.  If no, please explain why the limit doesn't exist.  I think, the limit exists.  So, I tried to use Squeeze theorem but didn't work.


Exponential of ladder operators acting on a Fock state

I'm trying to evaluate $(\hat{a}+\hat{a}^\dagger)^k|n\rangle$ Where $\hat{a}$ and $\hat{a}^\dagger$ are ladder operators and $|n\rangle$ the $n$th Fock state. For this, I separated the problem in three parts: $k<n$, $k=n$ and $k>n$. In this part I'm a bit confused: Is it possible to evaluate such operations? Some tips on how to start would be really great.


What's the difference between using single and double quotation marks/inverted commas?

I'm quite unsure regarding the usage of single quotation marks (') and double quotation marks (") in English.  I had thought that double quotation marks were usually used to quote sentences from passages/given sources, nouns/things ("Westminster Bridge", "alliteration", or "voice" regarding its usage in poetry), as well as some less common/important uses including being snarky and using them to indicate a sarcastic remark.   Someone had told me today that you were supposed to refer to things with two inverted commas (") instead of one.  Which one is correct? Could someone explain the usages between the two different types of quotation marks?


C++ Data Structures Programming: Passing Values by Reference?

I've done this C++ data structures program is mostly correct, however I am having trouble with the RefFunction() parameters. They are not designed quite properly. They are not supposed to be pass by value, but rather pass by reference and I'm not sure how to do that. It takes a reference to an int, and a reference to a double. It queries the user to input values to be stored in the variables referenced by its arguments. Then be able to return in the class instance and print the values in main(). I greatly appreciate any help as I am very stuck. Thank you very much.  Header file:  #ifndef Prog1Class_h #define Prog1Class_h   //A data structure of type Prog1Struct containing three variables struct Prog1Struct {     int m_iVal;     double m_dVal;     char m_sLine[81]; };  // A class, Prog1Class, containing a constructor and destructor // and function prototypes class Prog1Class { public:     Prog1Class();      ~Prog1Class();       void PtrFunction(int *, double *);     void RefFunction(int, double);     void StructFunction(Prog1Struct *); };  #endif    .CPP file  #include "Prog1Class.h" #include <string> #include <iostream> using namespace std;  Prog1Class::Prog1Class() {} Prog1Class::~Prog1Class() {}  // PtrFunction shall query the user to input values to be stored in the // variables referenced by it's pointer arguments void Prog1Class::PtrFunction(int *a, double *b) {     cout << "Input keyboard values of type integer and double"<<endl;      cin>>*a >>*b; }  // RefFunction shall be a C++ Reference function and shall query the user to // input values to be stored in the variables referenced by it's arguments void Prog1Class::RefFunction(int a, double b) {     cout << "Input keyboard values of type integer and double"<<endl;     cin >>a >>b; }  // StructFunction shall query the user to input values to be stored in the // three fields of the data structure referenced by its argument void Prog1Class::StructFunction(Prog1Struct* s) {     cout << "Input keyboard values of type integer and double"<<endl;      cin >>s->m_iVal>>s->m_dVal;     cout <<"Input a character string";     cin.ignore(1000, '\n');     cin.getline(s->m_sLine, 81, '\n');  }


The relationship between UMVUE and complete sufficient statistic

Let $X_1,...X_n$ $U(-\theta , \theta)$  I want to find the UMVUE of $\theta$ if it is exists.  My answer is , there is no UMVUE in this case.   Because there is no complete sufficient statistic that exists for $\theta$ . So although there exist an unbiased estimator of $\theta$, it is not a function of complete sufficient statistic.   So there is no there exist no UMVUE for $\theta$.  Am I correct in this situation?


Calculating $ \int _{0} ^{\infty} \frac{x^{3}}{e^{x}-1}\;dx$

how to calculate $$\int_0^\infty \frac{x^{3}}{e^{x}-1} \; dx$$   Be $q:= e^{z}-1 , p:= z^{3}$ , then $e^{z} = 1 $ if $z= 2\pi n i $, so the residue at 0 is : $$\frac{p(z_{0})}{q'(z_{0})} = 2\pi i n ^{3}$$  problem is that this is not symmetric, so how does one find the definite integral?


Creating bibliographies with biblatex and moderncv

I wanted to use the moderncv class together with biblatex. To this end, I redefined the bibliography bibenvironment  \defbibenvironment{bibliography}{}{}% {\cvline{\printfield[labelnumberwidth]{labelnumber}}% {} }   The labels were adjusted correctly, but the text of the bib entry (unsurprisingly) started below the label, took the whole line and was not adjusted at all.  My question is if there is a neat solution for this, or if one must define a new BibliographyDriver as is done  here  or even resort to some low level hackery as in this answer ? If so, what do I have to do?


For the following AB power amplifier VBB/2 is large enough such that both Qn and Qp are on for no input signal Vi, if output voltage is large and positive, it may be assumed that most $$i_{L} \approx i_{N}$$   What justifies this assumption?


Python-3.x time.sleep() wont work for print to file

I would like to code a python that adds every x seconds a value. But when I add the time.sleep(x) theres no output into the .txt file anymore.  And is there a way to stop the loop after a certain time?   Code:  f = open('Log.txt','a') while True:     print("This prints once a second.", file=f)     time.sleep(1)


This might seem an impractical and unnecessary conversation, but I feel it's something I need to clarify. Especially, as I just got my first developer job in a blockchain startup.  So hashes are said to generate the same thing for any information it sees, and it's only a one-way interaction.   As far as I understand, hashes are just long alphanumeric strings. If one computes hashes across all documents, keys, information, files, etc, over and over again- it's simply a matter of time until the same combination comes up again for different information (applying it across all possible contexts)? This might be an impractical test given size and possibility, yes, but is it this that makes hashes powerful, that it's practically impossible to recreate a hash that for any foreseeable endeavor it's fine, or is there some element that I'm missing that reduces even that extremely low probability to zero? Is there any design constraint that prevents a very powerful computer to back-calculate the original data from a hash? Or is it simply that the design is so complex that it's simply a futile exercise to dream of such a large computer required for this task? What's stopping a hacker or malicious middle man to hack open the software program or library that creates this "hash" and then use that library to create hashes of his/her own or mislabel some target company's hash with his/her own pointing to their version of the file? Especially since many applications, languages, and developers use hashing independently. Whichever is most weakly secured, we can use that to take on the rest?   Any resources are also appreciated.


when I have "Mentor of the Meek" and the "Mutavault"-land on the battlefield, and when I make Mutavault into a 2/2 creature, can I draw a card when I pay the mana cost for a creature entering the battlefield under my control?  Same question applies to "Suture Priest". Can I gain life using Suture Priest's and Mutavault's abilities?  Thanks friends!


I am currently borrowing New Leaf from my step sister and I have now bought a copy of Animal Crossing: New Leaf for myself.. I am NOT the mayor on her game card, when I transfer my save data from her town to my new town, would i automatically become mayor? Or will I need to start a whole new game in order to become mayor?


GCC error undefined reference to `sqrt' on changing command option order

Why I am getting the following error /tmp/ccuWdVB3.o: In function `test': MyCode.c:(.text+0x1c): undefined reference to `sqrt' collect2: error: ld returned 1 exit status   MyCode.c #include<stdio.h> #include<math.h>  int test(int input1) {    int x = 8;   int z = sqrt(x);      }  int main(int argc, char * a[]) {  }   when running with command: gcc -o a.out -lm MyCode.c  But when I am running the command gcc MyCode.c -o a.out -lm  everything works fine. Why the order of "MyCode.c" cli option is important here ? Or Am i doing something wrong?


Where to report 1099-Misc income and attorney expenses for a lawsuit settlement?

I personally received a 1099-Misc for a settlement income with a creditor that was incorrectly reporting information on my credit report.  The settlement read in part:     Bank agrees to pay Customer $xxx in full and final settlement of the parties' differences that have arisen in connection with account number yyy and the suit.   The settlement check shall be made payable to the Customer's attorney of record, zzz.  No representations regarding the tax consequences of this settlement have been made by either party.   All of the settlement funds went to my attorney.  Where/how do I show this reported income and the fact that I got none of it on my personal tax return?  Should I have issued a 1099 to my attorney for the same amount?  Do 1099 requirements apply to individuals paying their attorney for a personal matter?    This is not a dup of  because that question is for a business receiving the 1099 and this one is for an indiviual.  Also, that question does not address where to report the income and where to report the deduction.


Regex for matching US phone number with or without area code

My question was marked as a duplicate so I've made a couple edits. As I said, I was able to find many similar questions when I searched but none were quite what I needed.  I am not validating a string where the only thing present will be the phone number (this seems to be what most of the other questions are addressing).  Rather, I am attempting to pull out all phone numbers (which will then be manually checked by the user) from a larger block of text.  The problem I am having is that my regular expression is matching zip codes with extensions (ex: 45202-4787), and I am not sure how to alter my regex to avoid that.  If this truly is a duplicate question then I apologize for not being able to find the existing one that deals with my issue.    My specifications for phone number format are:  1) -, ., and space as delimiters (and in any combination)  2) area code may appear with or without parentheses  A few examples:  (xxx) xxx-xxxx (xxx) xxx.xxxx xxx-xxx-xxxx xxx xxx-xxxx xxxxxxxxxxx   I am using Anirudh's regex from the comments:  (\(?\d{3}\)?)?[. -]?\d{3}[. -]?\d{4}   Again, my problem is that this regex matches zip codes with extensions (ex: 45202-4787).  I would be grateful for any help, as I'm very new to using regular expressions. Thanks!


This question is about finding reasons for compile errors when using tikz.  Consider the files compiles.tex, compiles-not1.tex and compiles-not2.tex. Then it is clear that compiles-not1.tex does not compile, because the name C has not been assigned. The file compiles-not2.tex does not compile, because \draw (A) -- (A -| B ); contains a space after the name B. However, this is difficult to see from the error message.   Is it possible to tweak the error messages generated by tikz to perhaps mark tikz-code and names in some way? What I mean is that in the example, an error message ! Package pgf Error: No shape named 'B ' is known. might be more helpful, as the space in the name B\␣ (B with a trailing space) is more clearly delimited from the message.   File compiles.tex compiles without errors.  \documentclass{article} \usepackage{tikz} \begin{document} \begin{tikzpicture}     \node (A) {A};     \node[above right of=A] (B) {B};     \draw (A) -- (A -| B); \end{tikzpicture} \end{document}   On compilation compiles-not1.tex generates ! Package pgf Error: No shape named C is known.  \documentclass{article} \usepackage{tikz} \begin{document} \begin{tikzpicture}     \node (A) {A};     \node[above right of=A] (B) {B};     \draw (A) -- (A -| C); \end{tikzpicture} \end{document}   compiles-not2.tex generates ! Package pgf Error: No shape named B  is known.  \documentclass{article} \usepackage{tikz} \begin{document} \begin{tikzpicture}     \node (A) {A};     \node[above right of=A] (B) {B};     \draw (A) -- (A -| B ); \end{tikzpicture} \end{document}


Tikz picture inside a caption throws errors

I get errors thrown at me because of this kind of expression \begin{figure}     \caption{\( a = \begin{tikzpicture} \node at (0,0) {a}; \end{tikzpicture} \)} \end{figure}  What shall I do to use a Tikz picture inside caption?


Forgive the stupid simplicity of this question, and please feel free to refer me to an older answer. I'm not quite familiar enough with LaTeX terminology to have found it.  All I want to do is set a different default format for my section titles. Instead of just being bolded and slightly larger than the main text, I'd like them to be of normal weight, the same size as the main text, and all caps.   I'm using the article class.


Help designing a satellite MPPT board [SPV1040]

I'm in the process of developing a pocketqube and I am currently working on the power system. I am hoping to use an SPV1040 MPPT IC to simplify the design and maximize efficiency. Each side of the craft will have 8 Trisolx GaAs solar cells with an open voltage of 2.6 V and max power voltage of 2.3 V, they have a max current of 14.6 mA. Obviously all these characteristics are in a direct sunlight ideal scenario at ambient temperature. The battery charged will be a 700 to 900 mAh 3.7 V Li-Ion and the output voltage needed is 3.3 V.  The following schematic here displays an output voltage of 5 V though I cant find what resistors I need to change to adjust that.   Here is the datasheet   Input also says 3 V though the IC is rated to 0.3 V, how can I change that?  Also on a last note I plan to use 1 MPPT circuit for each panel, if I put 4 parallel cells in series with another (basically 1 panel) what diode should I use between the series cells?


Can we create a subsection of the References Cited section with different reference numbering?

I need to add some more publications. I do not want to change the previous reference numbers, so I need to create new citations with difference reference numbering like [p1], [p2], etc. Can LaTeX do that?


Where can I download Windows 7 (legally from Microsoft)?

I just bought a serial for Windows 7 on-line from the Microsoft store (the most painful shopping experience EVER!). I selected that I wanted to download my version of Windows 7 after purchase. After payment, I have listed a Product Key but no download link in sight.   Where do I download my Windows 7 ISO to burn to disk?  Note: I'm not a Technet or MSDN subscriber.


Do I need visa for sightseeing in Istanbul, April and May 2021

Not-so-young but still adventurous American woman traveling alone with two layovers in Istanbul airport: Wednesday April 7, 2021, 4:55 pm to 1:30 am that evening - 8+ hours Tuesday May 4, 4:55 am to 6:20 pm - 13+ hours Question Do I need a visa to leave airport for sightseeing in city?


When two card texts confict, which takes priority?

Let's suppose there are creatures in play and someone plays .  It's clear that all the creatures lose their abilities.  How is this situation changed if  were in play?  Is the situation changed if True Conviction were played after Humility?  Is the solution to this question that the card with the newest time stamp is in effect?


What's the difference between dev package and ordinary package?

When I searched libmicrohttpd package using apt search, I got this  libmicrohttpd-dbg/xenial 0.9.44+dfsg-1ubuntu2 amd64   library embedding HTTP server functionality (debug)  libmicrohttpd-dev/xenial 0.9.44+dfsg-1ubuntu2 amd64   library embedding HTTP server functionality (development)  libmicrohttpd10/xenial,now 0.9.44+dfsg-1ubuntu2 amd64   library embedding HTTP server functionality   I don't know what's the difference between the package ending with -dev/-dbg and the ordinary one. What's the  between them? Thanks in advance!


I'd like to return the value of left battery capacity parsed from the given string. It means I want to get CurrentCapacity / MaxCapacity.  data = '''     "SuperMaxCapacity" =0     "MaxCapacity": +4540;     'CurrentCapacity'=   2897,     "LegacyBatteryInfo" = {"Amperage"=18446744073709550521,"Flags"=4,"Capacity"=4540,"Current"=2897,"Voltage"=7283,"Cycle Count"=406}     "MegaMaxCapacity" = 6700 '''


SharePoint App Deployment error : 'Failed to install app for SharePoint'

I created a test MVC sharepoint app succesfully in a solution. Now I need to integrate this into a main solution project.   But when I added a SharePoint MVC App into the solution and hit F5, I am getting following error:  Error occurred in deployment step 'Install app for SharePoint':  Failed to install app for SharePoint. Please see the output window for details.   Detailed stack trace:  CorrelationId: 50583239-71cb-4b07-8bcb-4bbc51a22631      ErrorDetail: There was a problem with activating the app web definition.      ErrorType: App      ErrorTypeName: App Related      ExceptionMessage: Microsoft.SharePoint.SPException: Exception from HRESULT: 0x81070964 ---> System.Runtime.InteropServices.COMException: Exception from HRESULT: 0x81070964 at Microsoft.SharePoint.Library.SPRequestInternalClass.EnableModuleFromXml(String bstrSetupDirectory, String bstrFeatureDirectory, String bstrUrl, String bstrXML, Boolean fForceUnghost, ISPEnableModuleCallback pModuleContext) at Microsoft.SharePoint.Library.SPRequest.EnableModuleFromXml(String bstrSetupDirectory, String bstrFeatureDirectory, String bstrUrl, String bstrXML, Boolean fForceUnghost, ISPEnableModuleCallback pModuleContext) --- End of inner exception stack trace --- at Microsoft.SharePoint.Administration.SPElementDefinitionCollection.ProvisionModules(SPFeaturePropertyCollection props, SPSite site, SPWeb web, SPFeatureActivateFlags activateFlags, Boolean fForce) at Microsoft.SharePoint.Administration.SPElementDefinitionCollection.ProvisionElements(SPFeaturePropertyCollection props, SPWebApplication webapp, SPSite site, SPWeb web, SPFeatureActivateFlags activateFlags, Boolean fForce) at Microsoft.SharePoint.SPFeature.Activate(SPSite siteParent, SPWeb webParent, SPFeaturePropertyCollection props, SPFeatureActivateFlags activateFlags, Boolean fForce) at Microsoft.SharePoint.SPFeatureCollection.AddInternal(SPFeatureDefinition featdef, Version version, SPFeaturePropertyCollection properties, SPFeatureActivateFlags activateFlags, Boolean force, Boolean fMarkOnly) at Microsoft.SharePoint.SPFeatureCollection.AddInternalWithName(Guid featureId, Int32 compatibilityLevel, String featureName, Version version, SPFeaturePropertyCollection properties, SPFeatureActivateFlags activateFlags, Boolean force, Boolean fMarkOnly, SPFeatureDefinitionScope featdefScope) at Microsoft.SharePoint.SPFeatureCollection.AddInternal(Guid featureId, Version version, SPFeaturePropertyCollection properties, Boolean force, Boolean fMarkOnly, SPFeatureDefinitionScope featdefScope) at Microsoft.SharePoint.SPFeatureCollection.Add(Guid featureId, Boolean force, SPFeatureDefinitionScope featdefScope) at Microsoft.SharePoint.SPUserSolutionCollection.EnsureWebFeaturesActivated(SPUserSolution solution) at Microsoft.SharePoint.Packaging.SPUserCodeSolutionDeploymentGroup.ActivateSolution(SPWeb web, SPUserSolution solution) at Microsoft.SharePoint.Packaging.SPUserCodeSolutionDeploymentGroup.Deploy() at Microsoft.SharePoint.Administration.SPAppTask.DeployOperation() at Microsoft.SharePoint.Lifecycle.MonitoredTaskExecution.DoTask()      Source: AppWeb      SourceName: App Web Deployment   Can somebody shed a light on this issue? :)


Create/Update Global Value Set using Tooling API

Can someone tell me how to create and update Global value set using tooling API? No sure what so send in request body.


Change default XML comment snippet in Visual Studio

When I hit /// in Visual Studio, is it possible to change the resulting snippet from this:  /// <summary> ///  /// </summary>   to this?:  /// <summary></summary>


I get a ClassCastException in java when I ask for the length of one array, how can I solve the problem?

When I ask for the length in the test I get an error with the casting of the integer, I tried with other classes like Character instead of Integer but I get the same error, java does not let me write Object or Comparable as parametrized classes. That's a JUnit Test Case public class EDBinaryHeapTest {     @Test     public void constructorTest01() {         EDBinaryHeap<Integer> toCheck = new EDBinaryHeap<Integer>(0);                  assertEquals(0, toCheck.numElementos);         assertEquals(0, toCheck.elementos.length);      } }  That's the class I`m creating to check  public class EDBinaryHeap<T extends Comparable<T>> implements EDPriorityQueue<T>{     protected T[] elementos;     protected int numElementos;      @SuppressWarnings("unchecked")     public EDBinaryHeap(int numMaxElementos) {         elementos = (T[]) new Comparable[numMaxElementos];     } }


How many combinations can be made with these rules? (game of Dobble)

The game called Dobble consists of a deck of cards; each card contains 8 symbols from a set of 50.  The deck is made so that any two cards have exactly one symbol in common. (The idea of the game is that on each turn, the first player to spot the symbol that's on both cards gets the card. The winner is the one who ends up with the most cards.)  My question is,      With the above numbers, what is the size of the largest possible deck?    (According to  there are actually 55 cards in a deck.)   My guess is that an explanation would involve an application of the multinomial theorem, but I can't see how to work it out.


Having trouble with a statement in sakurai modern qm

I am facing trouble with a statement made after eq 5.2.4 in sakurai modern qm and the statement is $P_1(E-H_0-\lambda P_1VP_1)$ is singular in $P_1$ subspace. How one can we show the validity of the statement?  This question is similar to problem asked previously in this forum but haven't answered appropriately. So I am asking again here. The link for the  qn is


Do frequent DML operations on a table with indexes and huge data affect SELECT query performance?

If I have frequent DML(insert,update,delete) operations on a table with huge data with clustered and non-clustered indexes. Will it affect the Performance of SELECT queries on that table with a where condition on index columns, Or will the performance remain same as when there are no DML operations? This  says UpdateStatistics does block Select queries. So will DML operations cause UpdateStatistics. It says " The only time you wouldn’t be in control of this is if AUTO_UPDATE_STATISTICS is enabled on your database and AUTO_UPDATE_STATISTICS_ASYNC was disabled.". So is changing these values the best solution? Note:  I will be using isolation level (Read Uncommitted) for the SELECT query which should not be blocked by locks.


What's the difference between these Windows versions?

I need a Windows 7 installation file (ISO image). Microsoft no longer provides doesn't provide those for customers with an OEM installation (customer care!), but I found them on . These seem to be the originals from Microsoft, without keys, so you can't use them if you don't already have a key. (I just want to stress that this seems legal to me.)  On that site I find several version with similar names, apart from an added "u" in the name, like      en_windows_7_home_premium_with_sp1_x64_dvd_620851.iso        en_windows_7_home_premium_with_sp1_x64_dvd_u_676549.iso   Does anyone know what's the difference between the ones with the "u" and the ones without?


Notepad++ keyboard shortcut to toggle "Find Result" window

Is there a keyboard shortcut to toggle "Find Result" windows? Or can this be configured in the Shortcut Mapper? I seem cannot find the setting.


Solve $2tx'(t)-x(t)=\ln \left[x'(t)\right]$   That would be an easy Clairaut's equation if $tx'(t)$ wasn't multiplied by $2$. But unfortunately it is, and I have no idea what to do here.


When performing arithmetics code gives unusual results

Python script seems to do incorrect arithmetics.  import _thread import time  def mult(pixel : int, multiplier : tuple) -> float:     "multiplies either r,g,b pixel by row vector (0.257, 0.504, 0.098),(-0.148,-0.291,0.439),(0.439,-0.368,-0.071))"      sum=0     for mul in multiplier:         sum += (pixel * mul)         print(sum)     return sum  redMul = [0.257, 0.504,0.098] greenMul = [-0.148, -0.291, 0.439] blueMul = [0.439, -0.368,-0.071]  redAdd = 16 greenAdd = 128 blueAdd = 128  try:    _thread.start_new_thread(mult,(1,blueMul)) except:     print("Error: unable to start thread")   code outputs:  0.439 0.07100000000000001 1.3877787807814457e-17   when expecting:  0.439  0.071 0   What is the cause of this error and how can i resolve it?


I want when a random number to show as 2 decimal places even if it comes up as an integer

I have a random number generated, then I use round to get it to 2 decimal places.   Occasionally I get an integer such as "2" i would like this to be displayed as "2.00"  Or when I get "3.1" to be displayed as "3.10"  I have tried rounding to 2 d.p using round()  import random  #this creates a number between 2 and 5.99 by adding a decimal to an integer then rounds the sum to 2 d.p  def second_question():     temp_var_4 = random.randint(2,5) + round(random.random(),2)     print(temp_var_4) second_question()   No error messages just returning some numbers to integers or to one d.p


Why is the Mask size mismatched in the Compositor?

I masked an image in the UV/Image editor masking section. I then used that mask in the compositor for background replacement. However, the mask size seems to be different. Why is that? Here's a screenshot:


How would one denote the set of all subsets of $A$ which have size $2$?  Would  $$\binom{A}{2}$$  be a good idea?


Proving for two naturally isomorphic functors, if one is full, then so is the other.

So we let $S,T : \mathscr{C} \rightarrow \mathscr{D}$ be naturally isomorphic functors. We seek to show that if $S$ is a full functor, then so is $T$.  As given, we have a natural isomorphism $\tau : S \rightarrow T$, which also means that each component of it $\tau_A : S(A) \rightarrow T(A)$ is invertible.  From here, though, I get pretty lost and have no clue where to go. I'm not even 100% sure how to best show surjectivity in the context of category theory. I feel like that I would have to use the inverse of the natural transformation, $\tau^{-1}$, and that surjectivity implies right-cancellativity, i.e. $S$'s arrow function has a right-sided inverse $S^{-1}$. But I'm honestly just lost.  Does anyone have a potential nudge in the right direction?


Proving $\lim\limits_{x \to \infty} xf(x)=0$ if $\int_{0}^{\infty}f(x) dx$ converges.

Let $f(x)$ be a monotone non-increasing function such that $\int_{0}^{\infty}f(x) dx$ converges. Prove: $\lim\limits_{x \to \infty} xf(x)=0$. My question is, why can't I simply contradict any other possibility by using the Integral Limit Comparison Test with $1\over x$? I am, after all, to show that $f(x)=o(x)$ as $x\to \infty$. I really don't understand why monotony is crucial here. I could use some help.


Less equal check of double values in C++

Suppose I have two functions f1 and f2 that return a double and get the same input (a const reference to some kind of object).   These functions are designed in such a way that given an input x,  f1(x) <= f2(x)    should always hold.   When testing this assertion on a set of 1000 input instances, a small subset of instances fails. What's remarkable is that in all such cases f1(x) is greater than f2(x) by a delta that's less than      10^-13.  The following code sample is sketchy, but it should be enough for demonstration purposes:   const InputInstance x{...}; const double a{f1(x)}; const double b{f2(x)}; assert(a <= b);   In some other file, I have the functions f1 and f2 declared as follows:  const double f1(const InputInstance& x); const double f2(const InputInstance& x);   The following code       printf("FLT_RADIX = %d\n", FLT_RADIX); printf("DBL_DIG = %d\n", DBL_DIG); printf("DBL_MANT_DIG = %d\n", DBL_MANT_DIG);   prints:  FLT_RADIX = 2 DBL_DIG = 15 DBL_MANT_DIG = 53   on my system.  As far as I understand this correctly, I could expect the output doubles to coincide up to the 15th decimal. Right?  Should I avoid using the '<=' operator on doubles? Has the 13th decimal a meaning I'm not aware of, or should I stop complaining and look for a bug in my code ;-) ?


Is possible to call a Method if I only have an String containing the method name?

Suppose that I've instanced an object like this:  Dim PerformPageSize as New HtmlToRtf.CPageStyle.CPageSize()   The Object contains some method members which I've put in an Enumeration like this, I mean, the enum strings are the same as the method names:  Friend Enum PageSize     Auto     A3     A4     A5     A6     Folio     Letter     Statement End Enum   And I pass the Enum as parameter in a Method:  Friend Sub Test(Byval _pagesize as PageSize) End Sub   Well, now my intention (to avoid writting a large Select case and do this efficientlly) is to parse the Enum value name to call the method (which have exactlly the same name)  So I would like to simplify this:  Friend Sub Test(Byval _pagesize as PageSize)      Dim PerformPageSize As New HtmlToRtf.CPageStyle.CPageSize()      Select Case PageSize          Case PageSize.Auto             PerformPageSize.Auto()          Case PageSize.A3             PerformPageSize.A3()          Case PageSize.A4             PerformPageSize.A4()          Case PageSize.A5             PerformPageSize.A5()              ' Etc...      End Select  End Sub   Into something like this else:  (I know that this code has no sense, but is just to understand the idea 'cause I don't know how should be a real solution using reflection or anything else):  Friend Sub Test(Byval _pagesize as PageSize)      Dim PerformPageSize As New HtmlToRtf.CPageStyle.CPageSize()      ' Parse the Enum value as the Method from the object     Dim Method = PerformPageSize.TryPase(GetType(PageSize), _pagesize).ToString      ' Call the equivalent method     PerformPageSize.[Method]()  End Sub


I just finished reading H. P. Lovecraft's The Case of Charles Dexter Ward. (Spoilers...)   One mystery that remains at the end is who exactly was "number 118" (the powerful being summoned by Dr. Willet which ends up eliminating Orne and Hutchinson and instructing Willet to get rid of Curwen). I read the story in The Thing on the Doorstep and Other Weird Stories which is fairly thoroughly commented by S. T. Joshi, however he doesn't address the identity of number 118 at all. I've also tried searching for it online for a bit, but all I'm finding is some inconclusive speculation.  It seems clear that Lovecraft didn't mean for the text to give it away, but what do we actually know about the identity of 118? Is there any evidence at all that Lovecraft had a specific person (or being) in mind who he just didn't reveal or that he kept it vague without reference to any specific person on purpose? And if it was or may have been a specific person, who is the most likely candidate? Evidence both from inside and outside the text is welcome.


By considering z[sqrt[-2]] show that x^2+2=y^3 only has two integer solutions, (+/-5,3)  I can see that N(x+i Sqrt[2])=y^3, I think x+i Sqrt[2] is prime in z[i Sqrt[2]] so y^(3/2) must be x+i Sqrt[2] but I don't really see how any of this helps. I think I'm missing something.


I'm using PuTTY (Windows 7) to send data using a Raw connection. I type in the data I want to send, but I have to press Return to actually have it transmit the data.  However, the problem is that the CR/LF is sent along with the data, which is invalid as far as the server application is concerned.   Is there a way of either having PuTTY not send the actual CR/LF as a result of pressing Return, or another way of sending the data that was just typed in?


Finding Maximum value of consecutive positive integers with constraints

Let, $x,y,z$ be consecutive positive integers such that $\frac{1}{x} + \frac{1}{y} + \frac{1}{z} > \frac{1}{10}$ I need to find the maximum value of $x+y+z$ ?  My attempt:  I tried guessing first, To maximise $x+y+z$ it is necessary to have high value for $x$, But not too high which will contradict the constrain of the problem. As we can roughly split the $0.1$ into three parts so I started with numbers closer to $30$ with trial an error I got that for $x=29$ we get the optimum and final result would be 90 (=max. value of $x+y+z$).   Is there any way to arrive at this conclusion with using inequalities? Any hints will be appreciated...


International\?? Standards for light switches?

Suppose a blind person wanted to know whether a switch (such as a light switch) was on or off (also suppose the switch was vertical.  Wouldn't it be natural to think that top (=1), would mean on, and bottom (=0), would mean off.  You think about the scenarios (I might edit the question, later).  But then what if more than one switch was connected to the same light? For the case of two switches   U: SameOrientation =   {((0,1), (0,1)), ((1,0), (1,0))}  V: DifferentOrientation =   {((0,1), (1,0)), ((1,0), (0,1))}  for which there are only two possible electrical wiring configurations:  U = Off, V = On  or  U = On, V = Off  In both cases, for the switches to "be standard", both switches would need to communicate, via a circuit, so that when one would be propped on, the other one would switch on as well  (just the same if one is switched off: and the other switch automatically switches off as well).  Any other ideas, or views?


What can Gandalf do, and what can't he do to help?

From what I've read on these forums the race or type of being Gandalf is sort of god-like immortal, like the rest of the wizards. I think I remember reading that they can't interfere in some way.   What are the limitations of what Gandalf can and can't do to alter history?


In acute $\triangle ABC$, show $DE+DF \leq BC$, where $D$, $E$, $F$ are the feet of the altitudes from $A$, $B$, $C$, respectively.

Let $\triangle ABC$ be an acute angled triangle. The feet of the altitudes from $A$, $B$, and $C$ are $D$, $E$, and $F$, respectively. Prove that    $$DE+DF \leq BC$$    and determine the triangles for which equality holds.   (Note: The altitude from A is the line through A which is perpendicular to BC. The foot of this altitude is the point D where it meets BC. The other altitudes are similarly defined. )


Google cache isn't updating after redoing my website

I have a website I completely redid almost a month ago. However, Google is still caching the copy before then.  I've tried submitting a request to remove it from Google Search Console several times, but get rejected every time.  How do I force Google to cache the new website?


issue in figuring out how to calculate probability

A fair, 6-sided die is rolled 6 times independently. Assume that the results of the different rolls are independent. Let $(a_1,\ldots,a_6)$ denote a typical outcome, where each $a_i$ belongs to $\{1,\ldots,6\}$.  For any outcome $\omega=(a_1,\ldots,a_6)$, let $R(\omega)$ be the set $\{a_1,\ldots,a_6\}$; this is the set of numbers that showed up at least once in the different rolls. For example, if $\omega=(2,2,5,2,3,5)$, then $R(\omega)=\{2,3,5\}$.  Find the probability that $R(\omega)$ has exactly two elements. (Answer with at least 3 decimal digits.)  Find the probability that $R(\omega)$ has exactly three elements.  can anyone clarify or make hints for answer


Why are magnets in form of hollow sphere not a magnetic monopole?

If I place many micro-bar-magnets on the surface of hollow sphere such that the pole of every magnet points towards the same side then, you could imagine that a monopole would be produced. So, I just created a monopole. But we all know that monopoles don't exist. Then what is wrong in this procedure? Assuming that I got some kind of power that I can put the magnets together in one place without getting budged by the repulsive forces!


Windows 8.1 error: The application has failed to start because the side by side configuration is incorrect

Hey so I have this error that keeps popping up since last windows update "The application has failed to start because the side by side configuration is incorrect please see the application event log or use the command line sxstrace.exe tool for more detail", I tried looking up a solution, they all say "install Visual Studio Package" or something of that sort of thing, I would like to do that but, even when I try to install something this error keeps showing up, any ideas?


How do I install the latest version of VirtualBox on Ubuntu 14.04 (Trusty Tahr) LTS?

I installed  through sudo apt-get install virtualbox, but it's not working for the installation of .  When I try to install Genymotion, it says 'no virtual box detected'.


How do you deal with aggressive and rude (irrelevant) questions in a conference?

I was at a conference recently as a member of the audience and during the Q & A segment, an audience member (unsolicited) jumped up and said that the presentation was 'absolutely wrong' quite aggressively. The presenter (junior scholar) was mortified.  Can I ask if you have a particular way of responding to questions that are aggressive or ad hominem attacks without being seen as defensive particularly if the person asking the question is someone senior and respected?


Git - move a folder with its history into another project

I have a project that includes back and front.  Smth like:  myProject/back myProject/front   I want to create another repository and move front into it with its commit story. What are my ways?


Does the hunger meter decrease at a constant rate?

Since Minecraft Beta 1.8 there has been a hunger meter that decreases over time.     Does this meter decrease at a fixed rate, or do certain activities like mining or sprinting cause it to decrease faster?


Strange behavior of program in GNU C++, using floating-point numbers

Look at this program:  #include <iostream> #include <cmath>  using namespace std;  typedef pair<int, int> coords;  double dist(coords a, coords b) {     return sqrt((a.first - b.first) * (a.first - b.first) +               (a.second - b.second) * (a.second - b.second)); }  int main() {     coords A = make_pair(1, 0);     coords B = make_pair(0, 1);     coords C = make_pair(-1, 0);     coords D = make_pair(0, -1);      cerr.precision(20);     cerr << dist(A, B) + dist(C, D) << endl;     cerr << dist(A, D) + dist(B, C) << endl;      if(dist(A, B) + dist(C, D) > dist(A, D) + dist(B, C))     {         cerr << "*" << endl;     }     return 0; }   Function dist returns distance betweeen two points. A, B, C, D are corners of square.  It should be dist(A, B) == dist(B, C) == dist(C, D) == dist(D, A) == sqrt(2).  And dist(A, B) + dist(C, D) == dist(A, D) + dist(B, C) == 2 * sqrt(2)  I am using GNU/Linux, i586, GCC 4.8.2.  I compile this program and run:  $ g++ test.cpp ; ./a.out  2.8284271247461902909 2.8284271247461902909 *   We see, that program outputs equal values of dist(A, B) + dist(C, D) and dist(A, D) + dist(B, C), but condition dist(A, B) + dist(C, D) > dist(A, D) + dist(B, C) is true!  When I compile with -O2, its look OK:  $ g++ test.cpp -O2 ; ./a.out  2.8284271247461902909 2.8284271247461902909   I think, it is a gcc-bug, and it is not directly related to floating-point operation accuracy, because in this case values dist(A, B) + dist(C, D) and  dist(A, D) + dist(B, C) MUST BE equal (each of them is sqrt(2) + sqrt(2)).  When I change function dist:  double dist(coords a, coords b) {     double x = sqrt((a.first - b.first) * (a.first - b.first) + (a.second - b.second) * (a.second - b.second));     return x; }   the program runs correct. So the problem not in floating-point representation of numbers, but in the gcc code.  Edit:  Simplified example for 32-bit compiler:  #include <iostream> #include <cmath> using namespace std; int main() {     if (sqrt(2) != sqrt(2))     {         cout << "Unequal" << endl;     }     else     {         cout << "Equal" << endl;     }     return 0; }   Run without optimization:  $ g++ test.cpp ; ./a.out  Unequal   Run with -ffloat-store:  $ g++ test.cpp -ffloat-store ; ./a.out  Equal   Solution:  Probably, it is "not a bug" in GCC #323:   Compiling with -ffloat-store solve the problem.


Is it possible to restrict the amperage of an USB port?

I have a phone attached to my laptop using an USB so that it shares the internet connection over the wire without using Wi-Fi hotspot (it draws a lot of power). But it draws a lot of power from the laptop battery by an undesired charging.  I'd like to find out a way to let the kernel tell the USB chip to restrict the amperage towards the connected device so that the phone doesn't draw any power at all, but solely communicate the internet connection.  I've read the , but unfortunately found nothing I can use.   Is it even possible? If not, than what is the catch?


What are the ramifications of switching the spellcasting ability of a class?

With the exception of multiclassing, is there any big reason that if you were to change the spellcasting ability of a (spellcasting) class it would be a bad idea?  As a specific example: Let's say I was switching Sorcerers from Cha to Wis, what unexpected effects could this have on that class's balance? Additionally let's assume all places in spellcasting where you added your charisma modifier instead you now add wisdom (and vice-versa).


Can I run two cables through the same conduit?

I want to install electrical outlets in my unfinished basement that has block walls.  It is my understanding you can't have cable on the walls--that whatever cable used must be protected by conduit.  My idea is use NM-B cable from the breaker box, run cable through joists down 3/4" conduit to box with GFCI outlet. Then run the 12/2 cable back up the same conduit and thru joists until it goes down conduit on wall again to an outlet and so on.  Is there any issue with taking cable down and back up the same conduit due to heat?   Trying to do this with the least conduit installed as possible but safely.


Access violation when freeing TBitmap variable -- Bitmap variable still assigned after freeing?

I have this code in a VCL Forms Application:  implementation  {$R *.dfm}  var   MyBitmap: TBitmap;  procedure TFormMain.FormCreate(Sender: TObject); begin   MyBitmap := TBitmap.Create; end;  procedure TFormMain.FormDestroy(Sender: TObject); begin   if Assigned(MyBitmap) then     MyBitmap.Free; end;  procedure TFormMain.Button1Click(Sender: TObject); begin   if Assigned(MyBitmap) then     MyBitmap.Free; end;   When I click the button the second time I get an Access violation in MyBitmap.Free; in the button's click handler. But MyBitmap shouldn't be anymore assigned after the first button click. So why the condition if Assigned(MyBitmap) then does not work on the second button click when it obviously did work on the first button click?  Delphi 10.1 Berlin Update 2


"Element is no longer attached to the DOM” StaleElementReferenceException when selecting HTML table row

I am using Selenium 2/WebDriver for automation. I have a table and am trying to select a row in it. When the test runs, I can see the row become highlighted as if it is clicked, but then immediately I get the "org.openqa.selenium.StaleElementReferenceException: Element is no longer attached to the DOM" error and the test fails.  The code is the following:  @Test public void rowSelection() throws Exception {     SeleniumHelper helper = new SeleniumHelper();     action = new SeleniumActionHelper(driver);      helper.login();      String testUrl = navigateToUrl("option/listOptions.xhtml");     driver.get(testUrl);      WebElement table = findElementById("tableSection:dataTableWrapped_data");     List<WebElement> allRows = table.findElements(By.tagName("tr"));     for (WebElement row : allRows)         {             List<WebElement> cells = row.findElements(By.tagName("td"));             for (WebElement cell : cells)             {                 WebElement listName = cell.findElement(By.xpath("./* [text()='body_build']"));                 listName.click();             }         } }   I have put a Thread.sleep(2000) in front and after the listName.click() action, but neither has helped. Any help would be greatly appreciated.


What is this "PCA-based re-ordering" for a correlation heatmap / correlogram?

The R function corrgram (in the corrgram package) offers several options for re-ordering the correlation matrix. One of them is a "PCA-based re-ordering" with the following source code:  x.eigen <- eigen(cmat)$vectors[, 1:2] e1 <- x.eigen[, 1] e2 <- x.eigen[, 2] alpha <- ifelse(e1 > 0, atan(e2/e1), atan(e2/e1) + pi) ord <- order(alpha)   where cmat is a correlation matrix $R$ and ord is used to re-order the variables.  That is, each variable $x_k$ gets assigned an $\alpha_k$ where $$ \alpha_k = \cases{\arctan \frac{e_{1,k}}{e_{2,k}}, \quad e_{1,k} > 0 \\ \arctan \frac{e_{1,k}}{e_{2,k}} + \pi, \quad e_{1,k} \leq 0} $$ and $e_1 = \left(e_{1,k}\right)_{k=1}^K$ and $e_2 = \left(e_{2,k}\right)_{k=1}^K$ are the first two eigenvectors of $R$, which is $K \times K$. Then the variables are sorted in order of largest $\alpha_k$ to smallest.  There's no reference for this or additional detail in the help file. What does this reordering accomplish and how should it be interpreted?


I have text file look like this:    If you are a software developer in your 20s or 30s, you've grown up in a world dominated by Linux. It has been a significant player in the data center for decades, and while it's hard to find definitive operating system market share reports, Linux's share of data center operating systems could be as high as 70%, with Windows variants carrying nearly all the remaining percentage. Developers using any major public cloud can expect the target system will run Linux. Evidence that Linux is everywhere has grown in recent years when you add in Android and Linux-based embedded systems in smartphones, TVs, automobiles, and many other devices.   i want to shrink it so it look like this   If you are a software developer in your 20s or 30s,  you've grown up in a world dominated by Linux. It ha s been a significant player in the data center for d ecades, and while it's hard to find definitive opera ting system market share reports, Linux's share of d ata center operating systems could be as high as 70% , with Windows variants carrying nearly all the rema ining percentage. Developers using any major public  cloud can expect the target system will run Linux. E vidence that Linux is everywhere has grown in recent  years when you add in Android and Linux-based embed ded systems in smartphones, TVs, automobiles, and ma ny other devices.   and then enlarge it so it look like this:  If you are a software developer in your 20s or 30s, you've grown up in a world dominated by Linux. It has been a significant player in the data center for decades, and while it's hard to find definiti ve operating system market share reports, Linux's share of data center operating systems could be as high as 70%, with Windows variants carrying nearly all the remaining percentage. Developers using a ny major public cloud can expect the target system will run Linux. Evidence that Linux is everywhere has grown in recent years when you add in Android and Linux-based embedded systems in smartphones,  TVs, automobiles, and many other devices.   how can I do that, i need to include that in my script


How can we disable triggers, Validation Rules and workflow rules in salesforce org. [on off - switch]

How can we disable triggers, Validation Rules and workflow rules in salesforce org.  This becomes really needed and important when we are doing data migration(data imports) in salesforce.  The way I handled this is create a custom label and include it in workflow and validation rule logic.   example - Custom label 'Disable workflow' = True then do not fire workflows.            if its False then fire workflow  But wanted to understand if there is any more efficient way to handle these scenarios.


Proof $\;\frac{\sin x}{x} \xrightarrow[x\to 0]{}1$

I read this proof  and I wonder: how do we know that  $$x < \tan x?$$  also, we assume that $x>0$, is this because we take the right hand limit?


Do Vader and Sidious ever look into cheating death together?

In Episode III, Anakin accepts Palpatine as his master and turns to the darkside in a desperate attempt to save his wife from dying. We know by their eventual deaths that they never truly discover Darth Plagueis' methods for cheating death but I'm curious how much time they spend trying to unlock his secrets.  It seems reasonable that they would spend a considerable amount of time on this given it was their original agreement when Anakin turned. Even though Padme had already been lost, I would think Vader would still be interested in keeping himself or anyone else he wanted from dying.  I know that in Legends canon Sidious is able to transfer his spirit into a new body but this isn't exactly what Darth Plagueis was doing. Plus, I'm more interested in Sidious' joint efforts with Vader, given their original agreement to search together. Are there any sources (Disney Canon or Legends) that dive into their research?  EDIT:  For clarification, I'm aware of questions like this: . They mention the discovery (which I kind of don't count anyway since it was Palpatine by himself and not really the same thing as what Plagueis did) but talk nothing of the research, the agreement between Vader and Sidious, or Vader's motivations after Padme's death which are what I'm interested in. To be clear, I want to know if Vader and Palpatine looked for Plagueis' secrets together.  If the emperor learning to transfer his essence from body to body is the best there is, then I'd like to know more about the research and anything about what this meant for Vader and their agreement.  I also edited the title of my question to more accurately represent how my question is different from the suggested duplicate.


I posted a similar question here:   Now I'd like to use the same picture as a label (instead of bullets e.g.) in the itemize(/enumerate) environment. Is this possible?


At first glance, sentence 1 below seems more correct because there are two subjects. However, something seems more natural about sentence 2. Maybe there is something abbreviated, elliptical, or adverbial in sentence 2. In sentences of this structure, should the verb be singular or plural?   Not only a book, but also a pencil are on the table  Not only a book, but also a pencil is on the table.


Closed form solution for the series $\sum _{n=1} ^{\infty} \frac{1}{2^n+1}$

I'd like to start by thanking you for your time reading this question and your passion for mathematics.    It would be a pleasant surprise to me if there were a closed form expression for the sum:  $$\sum _{n=1} ^{\infty} \frac{1}{2^n+1}$$  Knowing well that it converges, as term by term, $\frac{1}{2^n+1}<\frac{1}{2^n}$, I searched for a taylor series expansion, I rewrote the expression as $\frac{1}{2^n}-\frac{1}{2^n \cdot (2^n+1)}=\frac {2^{-n}}{1+2^{-n}}=1-\frac {1}{1+2^{-n}}$ in hopes of something, telescoping, nth partial-sum-exposing, or otherwise, all to no avail.     So I ask more accomplished and brilliant minds their thoughts.   Thank goodness for MSE.


Error when not shooting at maximum aperture with Canon 55-250mm lens

Lately, I start getting this message when not shooting at maximum aperture with a Canon 55-250mm lens:     Err 01 Communications between the camera and lens is faulty. Clean the   lens contacts.   I tried to fix the problem cleaning the contacts with a dry cloth but didn't work. Also tested with other cameras and the same result.  The error appears even if I have the lens at it's maximum aperture and change the zoom and that aperture is not the maximum for the new position.  Is there something else I can do other than sending it to the service center?


What does Voldemort become after this event in the 4th book?

After all, Tom Riddle was just a wizard/human.      After his resurrection in the 4th book, does he become something else - like not human?     Since he has Horcruxes to keep him alive even if the new body gets killed, does it take a special way of killing him after destroying the Horcruxes? Must he be killed with magic but not with non-magical weapons like modern day guns? Is there a difference between magical killing ways and non-magical killing ways such as using a gun?   I've already read the related Q&As and they explain a lot but what I'm asking is "Voldemort's resurrection centered", not "using Muggle weapons centered."  EDIT: Including daggers, blades, swords, machine guns and any other weapon that can be included as non-magical weapons.  Thanks in advance.


Can one executable be both a console and GUI application?

I want to make a  program that can be run as a CLI or GUI application depending on what flags are passed into it. Can this be done?  I have found these related questions, but they don't exactly cover my situation:


Quotient group $G/H$ is abelian iff $[G,G] \subseteq H$

So I've been working on this problem for a while. I just can't seem to find the solution. Also in the previous subquestion, I showed that $G$ is abelian iff $[G,G] = {e}$. Where $e$ is the neutral element of $G$ and $[G,G]$ is the commutator group of $G$.  Let $H\triangleleft G$, Show that $G/H$ is abelian iif $[G,G] \subseteq H$.  I've proved this direction  $\Rightarrow $) If $G/H$ is abelian, $\forall x,y \in G$,  $xHyH = xyH = yxH = yHxH$.   Therefore have that $G$ is abelian. As shown earlier, $[G,G] = {e}$ if $G$ is abelian. So $[G,G] = {e} \subseteq H$.  I can't seem to figure out the other direction...  $\Leftarrow$)  I only have that for $x,y \in G$,  $x^{-1}y^{-1}xy \in H$ and that $H\triangleleft G$. It does not seem to lead me anywhere.  Thanks for the help!


How to adapt an old Canon lens to Sony E mount?

I just got a Sony a5100. It has a E mount lens.  My mom has an old lens with an A on it. It's attached to a old Canon camera.  Is there an adapter for this?


How to change IP pool for WiFi tethering on Nexus 5

I would like to know how to change IP pool of Wi-Fi spot mode on on Nexus 5. Could you tell me about it?  I just want control this pool if it's possible.


Comparator output not fully switching on MOSFET

First Question for me.  I have benefited from other answers here but have not fully resolved my problem.  Here's my problem...  The LM311 Comparator output does not drive the N channel MOSFET fully on.  The LM311 has a 110mv ref voltage on the inverting input. The non-inverting input is driven by an opto-isolator output. The Opto-isolator is driven by 1 of 4, AC 60Hz voltages.  <1VAC, 9VAC, 55VAC and 115VAC.  The goal of the design is to have the FET fully turn on the 12VDC fan when there is appreciable AC voltage.  So fan fully On for the 9, 55, and 115VAC voltages.  It seems it should work because I measure voltages on the non inverting input of 1.6, 2.2 and 3VDC respectively for the 3 appreciable AC voltages.  And my ref voltage on the inverting input is 110mv.  So it "almost" works because the fan is off at the <1VAC, but not fully "On" for the other AC voltages.  I believe this is because Vgs is 167mv, 6.1V, 7.7V and 9.9 Volts for the 4 AC voltages listed above.  And the fan is only getting 7, 8 and 10VDC instead of a desired 12VDC. Would really like to be able to fully turn this FET all the way on.  So Close!  Any input or guidance is appreciated.  Ps-Things I think I've done right? Flyback diode across the fan. Putting N channel FET to switch to ground on low side of fan. LM311 has Open collector output using correctly?  PSS-I realize that the pinouts for the LM311 are not right in my schematic.  I have them right in my protoboard circuit.  Its a single device.  Pin 2 is noninveritng and pin 3 in Inverting  Thanks Again.      The suggested duplicate question and answer doesn't help for the following reasons: Both diagram and schematic are"No file found" making it pretty difficult to follow the answers. I am not using any positive feedback in my circuit as I don't think I need one. I have a simple pull up resistor to my 12V supply, not a voltage divider to the power supply as is mentioned in the answer. Thanks.  Just for the record I wanted to post a more accurate schematic and thanks for the response on using a Cap to hold up the opto isolator output. I actually have a full wave input to the phototransistor but I'm sure the cap will help anyway. To answer the last question, the Pin 7 comparator output has a pullup resistor to 12v. The issue is still that Vgs is only 10v when the comparator has 3v on pin 2 and 110mv on pin 3. I would have expected the LM311 output to go much closer to 12v (Vcc) with those inputs. The intent is for the FET to go completely on for pin 2 voltage > pin 3.


Contact list in Gmail to quickly compose emails to no longer appears

I used to have names of most used contacts to the left of all my emails.  Now it's gone.  All I had to do is click on a name and I could then compose an email to them. How do I get that list back?


Where can I find the configuration files for Kdenlive?

I would like to backup my  configuration.   Which files do I need to backup?


What things do I need to look at before buying an Xbox 360 'Jasper' Edition?

I am looking at buying an Xbox 360 'fat' or "Jasper" Edition second hand from a shop nearby. I have been assured it does not have the red light issue; it's on PAL.   I have no knowledge of Xbox 360 as I will be buying it for the first time. What sort of things should I check for to test whether the Xbox360 is OK to buy and does not have any issues? i.e. Temperature, Performance test, any other potential issues?   The seller has said that it has no Red Light issue and the CD-ROM works fine.


Is it correct to say "I wrote him" or "I wrote to him"?  My Mother was a stickler for English grammar and would say "I wrote your Uncle..." rather than "I wrote to your Uncle..."


Does $f_n(x)=f(x+1/n)$ converge to $f(x)$ almost everywhere?

PROBLEM: 1) Assume $f$ is a bounded measurable function on $\mathbb{R}$, does $f_n(x):=f(x+1/n)$ converge to $f(x)$ almost everywhere? 2) If not, is there a subsequence $n_k$ such that $f_{n_k}$ converges to $f$ almost everywhere? Beginner in Real Analysis and have two ideas but neither worked:  Lusin's Theorem. Not sure how the statement would be if the domain of $f$ is $\mathbb{R}$. One related problem here: . Dirichlet Function as an example. When $x$ is irrational, whether $f_n(x)$ converges to $f(x)$ or not.  Any hints or counterexamples will be appreciated.


Identify a catastrophic sci fi story written before 1980: ruptured spleen, alien moon base, time and space travel, antimatter tool

I read a sci fi short story sometime between 1974-1980 but it may have been written long before that.  I believe it was in a paper back anthology of sci fi stories, but I'm not certain.  I think the protagonist is facing the final climactic conflict when we meet him.  Most of the story is memories and flashbacks.  The first flashback is to his childhood.  He and his younger brother are sled riding.  His brother crashes, ruptures his spleen and dies.  He feels responsible and is wracked with guilt.  Much later, as an adult, he is exploring a long-deserted alien base on the moon.  There are unfamiliar artifacts on the base, including a time-travel device/vehicle, and a tool with an anti-matter tip.  It carves neat holes and eliminates matter simply by moving it through matter.  He accidentally drops the tool, which plummets unimpeded to the center of the moon.  He realizes that over time, it will consume and destroy the moon, which will be catastrophic for Earth.  He uses the time-travel device to travel to the moon at an earlier time so that he can prevent himself from dropping the tool.  He makes bigger problems for himself, forcing him to travel back further and further in time.  He travels so far back that he encounters the original alien inhabitants of the base.  Now we are at the present time in the story.  This is his final conflict, he has to escape, travel forward in time and resolve all of the problems he created.  Unfortunately, the alien inhabitants capture him, and the story ends.  Can anyone identify the story and author?