text
stringlengths
3
1.74M
label
class label
2 classes
source
stringclasses
3 values
Reducibility of polynomials maps. <p>Motivated by <a href="https://mathoverflow.net/questions/152680/generating-primes-via-composition-of-polynomials">this question</a>.</p> <p>Let $f \in \mathbb{Q}[x]$ or$f \in \mathbb{Z}[x]$ .</p> <p>Consider the sequence $f(x),f(f(x)), \ldots f^n(x)$.</p> <p>If some $f^k(x)$ is reducible, the rest iterates will be reducible too.</p> <p>This happens for $g(x) = x^2 - x - 1$.</p> <p>$$g(g(g(x))) = (x^{4} - 3 x^{3} + 4 x - 1) \cdot (x^{4} - x^{3} - 3 x^{2} + x + 1)$$</p> <p>Fermat numbers are related to similar quadratic map and if it happens to be reducible for some $k$, this will mean there are infinitely many Fermat composites.</p> <blockquote> <p>Given $f$, is it possible to decide if some $f^k(x)$ is reducible?</p> </blockquote>
0non-cybersec
Stackexchange
Cat just wants to cuddle..
0non-cybersec
Reddit
Best approximation of a polynomial in relation to a subspace of a unitary space. <p>Find the best approximation of the polynomial $$t^3+t^2+t+1$$ using polynomials of $M$ which is a subspace of $P_4$(unitary space of polynomials with $\deg{p}&lt;4$) where $$M =\{p \in P_4: \deg{p}\leq2,p(t)=p(-t)\}$$</p> <p>The scalar product is defined as: $&lt;q,p&gt;=\int_{-1}^{1}p(t)\cdot q(t)dt$</p> <p>$\\$</p> <p>My attempt: basis for M is obviously $\{1,t^2\}$. Now, the usual process for finding this approximation would be to find an orthonormal basis for $P_4$ e.g. $\{e_1,e_2,e_3,e_4\}$ where:$\\$</p> <p>$M=[\{ e_1,e_2\}]$ and it's orthogonal complement is $M^\bot=[\{e_3,e_4\}]$</p> <p>and then,for the given vector x, find it's unique decomposition $x=\alpha_1e_1+...+\alpha_4e_4$ and then the wanted approximation would be the part of that decomposition that lies in $M$, therefore $\alpha_1e_1+\alpha_2e_2$.</p> <p>But here that doesn't make any sense, because it seems I can just say that the best approximation is $t^2+1$ because $M$ can only contain polynomials of $\deg{p}=0$ or $2$, and $M^\bot$ can contain only polynomials of $\deg{p}=1$ or $3$. So $\alpha_1e_1+\alpha_2e_2$ can never depend on $\alpha_3e_3+\alpha_4e_4$ because of the difference in the polynomial degrees.</p> <p>So, I'm not sure what I'm supposed to do here really, is that just it?</p>
0non-cybersec
Stackexchange
seo implication of taking user to some other link rather than href given on anchor through javascript. <p>I have the following URLs on a page:</p> <pre><code>&lt;a class="mylink" href="http://www.example.com/old-product1" /&gt; &lt;a class="mylink" href="http://www.example.com/old-product2" /&gt; &lt;a class="mylink" href="http://www.example.com/old-product3" /&gt; </code></pre> <p>And essentially I want take the user from <code>/old-product</code> to <code>/new-product</code>without updating the URLS on the page in the source. I am using the following JavaScript to inject new URLS into the source.</p> <pre><code>$(".mylink a").each(function(){ $(this).click(function(event){ var urlSplit = $(this).attr('href').split("product"); var pid = urlSplit[urlSplit.length-1]; window.location.href = "http://www.example.com/new-product"+pid; event.preventDefault() return false; }); }) </code></pre> <p><em>What is the SEO implication of using JavaScript for taking a user from a defined link in href to some other link?</em></p>
0non-cybersec
Stackexchange
We did it, Guardians! Destiny is now in Place!. http://imgur.com/a/pRt4x I'll be devoting the rest of my time on /r/Place to keeping our logo clean, hopefully others will join me!
0non-cybersec
Reddit
The sunset in San Diego last night..
0non-cybersec
Reddit
Is it possible to automatically sign in to the Mac App Store?. <p>Each time (at the beginning of the session) I buy or update an app in the mac app store I have to sign in.<br> I want to be automatically signed in, like I am in the iTunes Store. </p> <p>I couldn't find any "remember password in keychain" option.<br> Did I miss an option somewhere? Or is there any way so I get signed in automatically? </p>
0non-cybersec
Stackexchange
Send new password by email is bad practice but what to do if user forgot his password?. <p>According to <a href="http://plaintextoffenders.com/post/7006690494/whats-so-wrong-about-sending-a-new-password-in">http://plaintextoffenders.com/post/7006690494/whats-so-wrong-about-sending-a-new-password-in</a> it's bad so what to do ?</p> <p>Just ask him to set a new one ?</p>
0non-cybersec
Stackexchange
convergence of series and sum and series. <p>Say <span class="math-container">$\sum a_n+b_n$</span> converges then will it automatically mean <span class="math-container">$\sum a_n$</span> converges as well as <span class="math-container">$\sum b_n$</span>, too?</p> <p>If <span class="math-container">$\sum a_n$</span> and <span class="math-container">$\sum b_n$</span> both converge will it be the case that <span class="math-container">$\sum a_n-b_n$</span> converge?</p>
0non-cybersec
Stackexchange
How can I repair an improper list in Erlang?. <p>I accidentally did (the equivalent of) the following:</p> <pre><code>lists:foldl(fun(X, Acc) -&gt; [X|Acc] end, 0, List). </code></pre> <p>Note the not-a-list initial value for the accumulator.</p> <p>This resulted in an improper list. This means that <code>length</code>, etc., don't work on it.</p> <p>Given that my "equivalent of" took an hour to run, and I don't want to run it again, how do I repair my improper list?</p> <p>For a simpler example of an improper list and the problem that it causes:</p> <pre><code>1&gt; L = [1|[2|[3|4]]]. [1,2,3|4] 2&gt; length(L). ** exception error: bad argument in function length/1 called as length([1,2,3|4]) </code></pre>
0non-cybersec
Stackexchange
Lebesgue integral of $x^{-3/4}$ is finite. <blockquote> <p>Let $X=(0,1]$ and $f(x)=\dfrac{1}{x^{3/4}}$. Show that $A=\int_X f d\mu$ is finite, but $B=\int_X f^2 d\mu$ is infinite, where the integrals are Lebesgue integrals.</p> </blockquote> <p>For $B$, I bound the integral below by simple functions, taking the values of $f^2$ at $x=1/n, 2/n, \ldots, 1$. The integral over the simple function is $\dfrac{1}{n}\sum_{i=1}^n \dfrac{1}{(i/n)^{3/2}} = n^{\frac12}\sum_{i=1}^n \dfrac{1}{i^{3/2}}&gt;n^{1/2}$, which goes to $\infty$ as $n\rightarrow\infty$.</p> <p>What about for $A$? I can't see how to bound the function from above to show that the integral is finite.</p>
0non-cybersec
Stackexchange
Mapstruct: HashMap as source to Object. <p>How could I use a <code>HashMap&lt;String, Object&gt;</code> as source to an object?</p> <p>Here is my target object:</p> <pre><code>public class ComponentStyleDTO{ private String attribute; private Object value; } </code></pre> <p>I've tried to use <a href="https://stackoverflow.com/questions/42226847/mapstruct-mapping-from-java-util-map-to-bean?answertab=votes#tab-top">this</a> approach that I found and that is also in the documentation, but it's failing for me.</p> <p>My Mapper:</p> <pre><code>@Mapper(unmappedTargetPolicy = ReportingPolicy.IGNORE, componentModel = "spring", uses = ComponentStyleMapperUtil.class) public interface ComponentStyleMapper { ComponentStyleMapper MAPPER = Mappers.getMapper(ComponentStyleMapper.class); @Mappings({@Mapping(target = "attribute", qualifiedBy = ComponentStyleMapperUtil.Attribute.class), @Mapping(target = "value", qualifiedBy = ComponentStyleMapperUtil.Value.class)}) ComponentStyleDTO hashMapToComponentStyleDTO(HashMap&lt;String, Object&gt; hashMap); } </code></pre> <p>My Util:</p> <pre><code>public class ComponentStyleMapperUtil{ @Qualifier @Target(ElementType.METHOD) @Retention(RetentionPolicy.SOURCE) public @interface Attribute { } @Qualifier @Target(ElementType.METHOD) @Retention(RetentionPolicy.SOURCE) public @interface Value { } @Attribute public String attribute(HashMap&lt;String, Object&gt; in){ return (String) in.entrySet().stream().findFirst().get().getKey(); } @Value public Object value(HashMap&lt;String, Object&gt; in) { Object value = in.entrySet().stream().findFirst().get().getValue(); if(value instanceof String){ return value; }else if(value instanceof LinkedHashMap){ List&lt;ComponentStyleDTO&gt; childs = new ArrayList&lt;ComponentStyleDTO&gt;(); HashMap&lt;String, Object&gt; child = (HashMap&lt;String, Object&gt;) value; for(String key: child.keySet()){ ComponentStyleDTO schild = new ComponentStyleDTO(); schild.setAttribute(key); schild.setValue((String) child.get(key)); childs.add(schild); } return childs; }else{ return value; } } } </code></pre> <p>And here's how I'm using this:</p> <pre><code> HashMap&lt;String, Object&gt; hmap = new HashMap&lt;String, Object&gt;(); hmap.put(attr.getKey(), attr.getValue()); ComponentStyleDTO componentDTO = componentStyleMapper.hashMapToComponentStyleDTO(hmap); </code></pre> <p>But it's returning me empty in attribute and value. Any idea of what I could be doing wrong?</p>
0non-cybersec
Stackexchange
CheckProofOfWork() Linux error on old altcoins. <p>I've seen the following error on Linnux online with several old altcoins now, the one below is UFO coin. It will sync exactly 500 blocks and then throw the following error, if I restart the client the error on that block does not reappear and it downloads a further 500 blocks and throws the exact same error.</p> <p>I'v added a few extra lines to get some additional debugging info. Before I spent time crawling through code I was hoping that someone else may have come across this same error and found the reason. UFO is several years old and current Windows clients are running OpenSSL 1.0.1h, services running were probably compiled around the time of that SSL release. The server with this issue is running OpenSSL 1.0.2g.</p> <pre><code>CheckProofOfWork() bnTarget.getuint256=000000050e650000000000000000000000000000000000000000000000000000 SetBestChain: new best=f7c2f4f28e66399bc17e0e35498300c20bf384d210ce8c5d640b70d9a3dfe372 height=17000 work=68218691770398 date=01/23/14 03:00:50 tx=2 ProcessBlock: ACCEPTED received block 93f88d57ab19ae388e22 CheckProofOfWork() hash=bf82aa6e76ec014faf5bc9c347eb5ba8242545acdf09259ac753b8d264aec0f0 CheckProofOfWork() nBits=486629382 CheckProofOfWork() bnTarget.getuint256=0000000160060000000000000000000000000000000000000000000000000000 ERROR: CheckProofOfWork() : hash doesn't match nBits ERROR: CheckBlock() : proof of work failed ERROR: ProcessBlock() : CheckBlock FAILED </code></pre> <p>Edit: Compiled it with OpenSSL 1.0.1u and have the error.</p>
0non-cybersec
Stackexchange
ITAP of a firepit.
0non-cybersec
Reddit
Any article elaborating the benefits using Atac seq additionally to bulk RNA seq?. Hi. Please excuse me if my question is stupid. I am a novice in to ATAC seq. Can anyone provide me help on whether there are benefits using Atac seq additionally to bulk RNA seq? Is there a possibility for an integrated analysis of both ATAC seq and Bulk RNA seq on samples from the same biological experiment? I am working with human samples. &#x200B; I want to answer trasncriptional and epigenetic questions on various biological phenomena on my datasets.
0non-cybersec
Reddit
a simple graph has 7 vertices and 10 edges. each vertex has degree at most 3. Find the number of vertices of degree 2. <p>I have created two equations based on this statement, let x be the number of vertices with degree 1, y be number of vertices with degree 2, z be number of vertices with degree 3.</p> <p>$x+2y+3z=20$ from the handshake theorem</p> <p>and $x+y+z=7$</p> <p>But am not sure where to proceed. Can anyone help me out. Thanks.</p>
0non-cybersec
Stackexchange
Continuous Random Variable question, Probability and Statistics. <p>a little help please</p> <p><em>A couple decide they really want a daughter. So, they decide to start having children and continue until they have their first daughter. Assuming having either a boy or girl is equally likely, answer the following:<br> <strong>(a)</strong> In the end, will the couple be more likely to have more boys or more girls? Explain why.<br> <strong>(b)</strong> Give a formula for the probability that they end up with exactly k boys.</em> </p> <p>So for <strong>(a)</strong>, I feel like the intuitive answer would be that the couple is more likely to have a boy. This is because once you have a girl, your done. So the first child is 1/2 likely to be a boy or girl. But, then you have to think about the cases in which multiple boys are born for a girl. {G, BG, BBG, BBBG, etc..} So if I add up all these probabilites, does the chance of having a boy outweight that of having a girl? </p> <p>For <strong>b</strong>, I feel like the <em>geometric distribution</em> is the distribution that I need. <em>p(k) = ((1-p)^(k-1))p</em> This finds the <em>kth</em> success. So if we consider a girl <em>k</em>, then we can find the number of boys? I'm not exactly sure how to think about this, especially without knowing <em>p</em></p>
0non-cybersec
Stackexchange
Probability of two specific words in 26 random letters. <p>A boy is typing 26 letters of the alphabet. Every letter shows up only once! What is the probability that in at least one of the two words will show up: "open", "abc"</p> <p>Suppose <span class="math-container">$\ A = $</span> the word 'open' shows up and <span class="math-container">$\ B = $</span> the word 'abc' shows up.</p> <p><span class="math-container">$$\ P(A) = \frac{{23 \choose 1 } \cdot 22!}{26!} $$</span> there are 23 ways to arranging a sequence of 4 letters and thats why <span class="math-container">$\ {23 \choose 1} $</span> .</p> <p><span class="math-container">$$\ P(B) = \frac{{24 \choose 1}\cdot 23!}{26!} $$</span></p> <p><span class="math-container">$$\ P(A \cap B) = ?$$</span> I'm really not sure how to calculate probability of both events happening. and even trying to calculate the opposite ( the probability that both "open" and "abc" doesn't show).</p>
0non-cybersec
Stackexchange
Bravo six going dark.
0non-cybersec
Reddit
What are some good crypto libraries to learn how the algorithms are coded?. I have been studying cryptography lately, but I want to see how they are actually implemented. I don't want to try to implement them myself (yet), while one has to take into account many thing when programming the crypto algorithms. Therefore, I just want to read some solid crypto libraries, but it should also be very well documented at the same time, so that comments help to explain the stuff. Have you come across such a library? I'm mainly proficient in C, C#, Python, therefore I would like to hear about "readable" crypto libraries in these languages.
1cybersec
Reddit
Limit of a Function involving tangent function and limits at infinity. <p>Determine $$\lim_{x \to \infty}\left(\tan{\frac{\pi x}{2x+1}}\right)^\frac{1}{x}$$.</p> <p><strong>Attempt</strong></p> <p>Let $$y=\left(\tan{\frac{\pi x}{2x+1}}\right)^\frac{1}{x}$$</p> <p>Put $\frac{1}{x}=p$.</p> <p>$$\lim_{p \to 0}\left(\tan{\frac{\pi}{2+p}}\right)^p$$.</p> <p>We have $$\lim_{x \to \infty} y=\lim_{p \to 0}\left(\tan{\frac{\pi}{2+p}}\right)^p$$.</p> <p>Now consider the function $y$ in variable $p$ Taking $ln$ both sides $$ln\left(y\right)=p.ln\left(\tan{\frac{\pi}{2+p}}\right)$$. $$ln\left(y\right)=p.\frac{ln\left(\tan{\frac{\pi}{2+p}}\right)}{\tan{\frac{\pi}{2+p}}}.\tan{\frac{\pi}{2+p}}$$.</p> <p>Putting $\tan{\frac{\pi}{2+p}}=m$</p> <p>We have </p> <p>$$ln\left(y\right)=p.\frac{ln\left(m\right)}{m}.\tan{\frac{\pi}{2+p}}$$.</p> <p>As $x \to \infty$ we have $p \to 0$ and hence $m \to \infty$</p> <p>Hence the limit of $\frac{ln\left(m\right)}{m}$ is $0$.</p> <p>But I am unable to show the limit of other to part of the product. Please help me out.</p>
0non-cybersec
Stackexchange
Trading pokemons. Questions I have about trading pokemons: 1. Can u trade someone far away? 2. What are the chances for lucky pokemon? 3. Is there a limit to the number of pokemons u can trade?
0non-cybersec
Reddit
Completeness and Separability of $C[0,\infty]$. <blockquote> <p>Let $C[0,\infty]$ be the space of all continuous functions on $[0, \infty ]$ with metric $$ \phi(\omega_1, \omega_2) = \sum^{\infty}_{n=1} \frac{1}{2^n}\max_{0{\leq} t {\leq} n}(|\omega_1(t)-\omega_2(t)|\wedge 1)$$ where $n \in \mathbb{N}$. Show that the space $C[0,\infty]$ under $\phi$ is complete and separable.</p> </blockquote> <p>I proceeded as follows: suppose I have a Cauchy sequence $\{\omega_n\}$ in $C[0,\infty]$. Its limit exists in $\phi$ as $\phi$ is bounded. Let the limit be $\omega$, now I have to show that $\omega $ belongs to $C[0,\infty]$. </p>
0non-cybersec
Stackexchange
Show that the sequence is Cauchy.. <p>I need to show that <span class="math-container">$x_n=\frac{1}{n}(1+\frac{1}{4}+\cdots+\frac{1}{3n-2})$</span> is a Cauchy sequence.</p> <p>For <span class="math-container">$n \leq m$</span> , <span class="math-container">$|x_m-x_n|\leq|\frac{1}{n}(\frac{1}{3n+1}+\frac{1}{3n+4}+\cdots+\frac{1}{3m-2})|$</span> How should I proceed further?</p>
0non-cybersec
Stackexchange
Decided on going pre-built, is this a solid deal? it appears to be but i'm a noob.
0non-cybersec
Reddit
Why do the most comfortable ways of sitting have to be the worst for your back?. God low key a hoe for making this the way it be
0non-cybersec
Reddit
Catalan number but with &quot;bad moves&quot;. <p>Im struggling to solve this question (The context is Catalan numbers): With only "up" and "right" moves from <span class="math-container">$(0,0)$</span> to <span class="math-container">$(n,n)$</span>, We'll call the "up" moves above the <span class="math-container">$y=x$</span>, "Bad Moves".</p> <p>Let <span class="math-container">$0 \leq k \leq n-1$</span>,</p> <p>Prove that the number of routes with (k) Bad Moves = the number of routes with (k+1) Bad Moves.</p>
0non-cybersec
Stackexchange
Through the Ages nearly giving me an aneurysm.. I was playing the new Through the Ages IOS app when I nearly died in the middle of the tutorial. [The offending moment.](https://imgur.com/a/SvBhE)
0non-cybersec
Reddit
People say this a lot. But there's also a lot of truth in it.
0non-cybersec
Reddit
Wikipedia has no exhaustive list of languages next to their Garbage Collection schemes. It needs one.. So I was hunting around the internet looking for an exhaustive list of programming languages and a description of their Garbage Collection scheme, and perhaps a list showing which languages do and do not have GC. Being acclimated to the instantaneous gratification that the internet often brings, I expected that I would, in a few minutes be staring at one of those fancy colored tables on a wikipedia article. Alas, after an hour my search never bore fruit. This table does not exist! I can't even find it on websites, let alone wikipedia. Now several hours into this research, I have come away with a little more knowledge than I had before. This new knowledge has convinced me that such a colored table is needed more than ever before. I may end up being the author myself. It would be unfortunate for someone to work through the first six chapters of a book on R, only to find out in chapter 7 (surprise mothef___r) , **R** has GC, but it is not automatic, and has to be implemented by linking a third-party library and calling bizarre library functions in this complicated way ( as detailed by this blog in the dark recesses of the internet. ) #Compile-time quasi-GC Then there is this issue with the language **Rust.** Rust has no GC in the manner of say, Java, where it runs as a separate thread doing magic behind the scenes. Rust therefore allows pointers, call-by-reference, and allocation and free-ing a la C. However, the compiler does some manner of sorcery that checks for plausible memory leaks and dangling pointers right at compile time. If a table existed, the entry on Rust would say red "NO" to "has GC". In the column for "compile-time pointer checks" it would say "YES", in green. #Stop The World JVM languages (Clojure, Scala, et al) have a GC which will halt all threads while the GC comes in and sweeps the RAM clean -- a task often referred to as a "Stop-the-World" event. STWs happen erratically and the application programmer has no control over when , if, or how long the stop takes to complete before handing control back to the program threads. While most of us could care less, this would be a deal-breaker for a realtime game. (imagine a stubborn STW event kicks in, in the middle of a cutscene. The player would think he has crashed, and would reach for the reset button on his Playstation 4. ) Anyways, on our theoretical table, there would be a column labelled "GC has Stop-the-World events" and there would be a green "YES" on Java's entry. # Sweep and Reference Counting. Some GCs utilized Mark-and-sweep, while other GCs use "Reference counting", or perhaps "Tracing without MandS". There may even exist languages that use a strange mixture of these (Python?). Our theoretical table should contain a column for these kinds, with YES's and NO's in appropriate places. In the meanwhile, here is the existing wikipedia article on Garbage Collection. There is no table there, and no link to any other article with such a useful table. https://en.wikipedia.org/wiki/Garbage_collection_(computer_science) It is time to write one. Let's do this.
0non-cybersec
Reddit
Tahoe was beautiful this weekend. .
0non-cybersec
Reddit
Does anyone else find these world quests annoying and wish they could untrack them?.
0non-cybersec
Reddit
SQL Sever Management Studio 2008 does not let me back up my database. <p>I tried to back up a server I created in SQL Server, but I received the following message:</p> <blockquote> <h2>TITLE: Microsoft SQL Server Management Studio</h2> <p>Backup failed for Server 'LAPTOP-6D0L83DV\SQLEXPRESS'. (Microsoft.SqlServer.SmoExtended)</p> <p>For help, click: <a href="http://go.microsoft.com/fwlink?ProdName=Microsoft+SQL+Server&amp;ProdVer=10.50.4000.0+((KJ_PCU_Main).120628-0827+)&amp;EvtSrc=Microsoft.SqlServer.Management.Smo.ExceptionTemplates.FailedOperationExceptionText&amp;EvtID=Backup+Server&amp;LinkId=20476" rel="nofollow noreferrer">http://go.microsoft.com/fwlink?ProdName=Microsoft+SQL+Server&amp;ProdVer=10.50.4000.0+((KJ_PCU_Main).120628-0827+)&amp;EvtSrc=Microsoft.SqlServer.Management.Smo.ExceptionTemplates.FailedOperationExceptionText&amp;EvtID=Backup+Server&amp;LinkId=20476</a></p> <p>------------------------------ ADDITIONAL INFORMATION:</p> <p>System.Data.SqlClient.SqlError: Cannot open backup device 'C:\Users\Flight.bak'. Operating system error 5(Access is denied.). (Microsoft.SqlServer.Smo)</p> <p>For help, click: <a href="http://go.microsoft.com/fwlink?ProdName=Microsoft+SQL+Server&amp;ProdVer=10.50.4000.0+((KJ_PCU_Main).120628-0827+)&amp;LinkId=20476" rel="nofollow noreferrer">http://go.microsoft.com/fwlink?ProdName=Microsoft+SQL+Server&amp;ProdVer=10.50.4000.0+((KJ_PCU_Main).120628-0827+)&amp;LinkId=20476</a></p> <p>------------------------------ BUTTONS:</p> <h2>OK</h2> </blockquote> <p>I failed to understand how to resolve this problem, and the added links were not of much help, either. I'll be extremely glad if someone could explain this to me :)</p>
0non-cybersec
Stackexchange
RESTful API routes design: nested vs. non-nested. <p>My question is about the advantages of nesting resources when building URLs for API purposes. Consider the following two alternatives for accessing an employee resource:</p> <pre><code>/api/employees?department=1 # flat Vs. /api/departments/1/employees # nested </code></pre> <p>Now consider the task of developing a general purpose library to access REST resources from an API. If all routes were flat, such a REST wrapper library would only need to know the name of the resource being accessed:</p> <pre><code>store.query('employees', {department_id:1}) =&gt; /api/employees?department=1 </code></pre> <p>However, if we were to support nested routes, this wrapper would need to know extra information about what models are nested and under which other resource, in order to know how to build the URLs for referencing such a model. Given that not all models would be nested under the same parent resource, and even some models would not be nested at all, the REST wrapper library would need to have some sort of configuration describing all this extra knowledge that wouldn't be needed otherwise.</p> <p>So my questions are:</p> <ul> <li><p>Are there any real advantages to nested resource routes in an API? (Which is not meant to be consumed by end users, and therefore gains less from having prettier URLs).</p></li> <li><p>Is the nested approach really better than flat, beyond aesthetics, so as to justify the extra effort and complexity introduced to support the lack of uniformity in resource URL building?</p></li> </ul> <p>See also: <a href="https://stackoverflow.com/a/36410780/621809">https://stackoverflow.com/a/36410780/621809</a></p> <p><strong>UPDATE: IMPORTANT CLARIFICATION</strong></p> <p>I realize from some of the comments and answers, that I wasn't clear enough regarding one aspect: I'm not against addressing single resources with URLs like <code>/employees/5</code> or <code>/departments/1</code>. I don't consider that to be nested.</p> <p>When I say nested resources, I refer to URLs like <code>/departments/1/employees</code> where a resource is addressed always within the context of another resource. The main issue is the fact that <strong>for URL building, a generic library would need to know extra stuff</strong> like "employees are nested under departments" but "branches are not nested under anything". If all resources could be addressed RESTfully, but in a flat fashion, it is simpler and more predictable to know how to address them.</p> <p>When you think about it, in databases you don't need to know extra information in order to know how to address a collection of objects (e.g. a table in a RDMS). You always refer to the collection of employees as <code>employees</code>, not as <code>departments/5/employees</code>.</p>
0non-cybersec
Stackexchange
7 Best Frameworks for Developing an Android App – Medium.
0non-cybersec
Reddit
Serrano Garlic Hot Sauce.
0non-cybersec
Reddit
Help me to start in making a C# game. So, we have this project where we have to make a game that our teacher assigned us, in my case, I have to make a game like "Icy Tower" but our teacher said we have to give it a twist, so what we have thought of, the platforms will have 3 colors (r,g,b), and the character will either be colored blue or red (depends on the level like lvl 1=red lvl 2=blue) and the player must only jump on the platform that has the same color of the character (if you're blue, jump on blue other wise u ded). Although we already have a concept of what game we will create, I don't know how in the world would I start, so please, can someone give me a path/link or at least a resource for the basic things. I do know if statements and the most basic stuff, but I don't know where would I start, and I don't know about unity though. So please help me where to start to create this, thanks :)
0non-cybersec
Reddit
Volume form as eigenform of the Lie derivative. <p>Suppose (M,g) is a homogeneous Lorentzian manifold and $Y$ a vector field on it. $G$ is a transitively acting Lie group. It is stated that the volume form $\omega$ is $G$-invariant. It is also stated that the Lie derivative $L_Y\omega$ is $G$-invariant so that the volume element is an eigen form: $L_Y\omega=\lambda\omega$.</p> <p>How does this follow? Do I need to state more explicit information about the setting?</p>
0non-cybersec
Stackexchange
Oh would you look at that. [700 × 527].
0non-cybersec
Reddit
/r/AskHistorians discusses Paul's and Jesus's views on sex - from the original Greek - and digs up some often-missed historical context that flies in the face of modern Christianity's cut-and-dry views on sex.. http://np.reddit.com/r/AskHistorians/comments/1j5nlr/in_early_times_where_brothels_and_prostitutes/cbblukq tl;dr: They were so squeamish about sex because back then there was no such thing as a healthy relationship.
0non-cybersec
Reddit
Principal Components Analysis Not Behaving as I Expect it to. <p>I have a bunch of points in $\mathbb{R}^3$ that I would like to translate and rotate so that their center is at the origin and the variance along the $x$ and $y$ axes are maximal (greedy, and in that order). To accomplish this I am trying to use python's principal components analysis algorithm. It is not behaving as I expect it to, most likely due to some misunderstanding about what PCA actually does on my part. </p> <p><strong>The Problem</strong>: When I center and then rotate the data, the variance along the third component is greater than along the second. This means that, once centered and rotated, there is more variance in the data along the $z$ axis than there is along the $y$. In other words, the rotation is not the correct one. </p> <p><strong>What I am Doing</strong>: Python's PCA routine returns an object (say myPCA) with several attributes. myPCA.Y is the data array, but centered, scaled, and rotated (in that order). I do not want the data to be scaled. I simply want a translation and a rotation.</p> <pre class="lang-py prettyprint-override"><code>import numpy as np from matplotlib.mlab import PCA # manufactured data producing the problem data_raw = np.array([ [80.0, 50.0, 30.0], [50.0, 90.0, 60.0], [70.0, 20.0, 40.0], [60.0, 30.0, 45.0], [45.0, 60.0, 20.0] ]) # obtain the PCA myPCA = PCA(data_raw) # center the raw data centered = np.array([point - myPCA.mu for point in data_raw]) # rotate the centered data centered_and_rotated = np.array([np.dot(myPCA.Wt, point) for point in centered]) # the variance along axis 0 should now be greater than along 1, so on variances = np.array([np.var(centered_and_rotated[:,i]) for i in range(3)]) # they are not: print(variances[1]&gt;variances[2]) #False; I want this to be True # Now look at the PCA output, Y. This is centered, scaled, and rotated. # The variances decrease in magnitude, as I want them to: variances2 = np.array([np.var(myPCA.Y[:,i]) for i in range(3)]) # This looks good, but the coordinates have been scaled. # Let's try to get from the raw coordinates to the PCA output Y # mu is the vector of means of the raw data, and sigma is the vector of # standard deviations of the raw data along each coordinate direction guess = np.array([np.dot(myPCA.Wt, (xxx-myPCA.mu)/myPCA.sigma) for xxx in data_raw]) print(guess==myPCA.Y) # all true </code></pre> <p>The last two lines in the above show that we may take a point $\mathbf{x}$ from its representation in the raw data input into its representation $\mathbf{x}'$ in terms of the PCA axes via $$ \mathbf{x}' = \mathrm{R}\cdot\left((\mathbf{x}-\boldsymbol{\mu}) / \boldsymbol{\sigma} \right) $$</p> <p>where $\mathrm{R}$ is myPCA.Wt, the weight matrix, $\boldsymbol{\mu}$ is the vector of means of the original data along each coordinate axis, $\boldsymbol{\sigma}$ is the vector of standard deviations of the original data along each coordinate axis, and the division is element-wise. In order to write this in standard mathematical notation, let's replace this division by multiplication: $$ \mathbf{x}' = \mathrm{R}\cdot\left(\mathrm{D}\cdot(\mathbf{x}-\boldsymbol{\mu}) \right) $$ where $\mathrm{D}$ is a diagonal matrix whose diagonal entries are $1/\sigma_i$. </p> <p>This notation makes clear the problem: to undo the scaling, I need to act on the RHS above with $\mathrm{R}\mathrm{D}^{-1}\mathrm{R}^{-1}$. This will return me to the problem situation, in which the variance is greater along the $z$ axis than the $y$. </p> <p>Is there a way to use PCA to get what I want, or do I need to use another method? </p>
0non-cybersec
Stackexchange
How do you use sessions with Compojure/Ring?. <p>I'm developing a web application using Compojure and I would hugely appreciate a small and complete example of storing and retrieving session data.</p> <p>Many thanks in advance, James.</p>
0non-cybersec
Stackexchange
PsBattle: Car with melted rims.
0non-cybersec
Reddit
How to use spot instance with amazon elastic beanstalk?. <p>I have one infra that use amazon elastic beanstalk to deploy my application. I need to scale my app adding some spot instances that EB do not support.</p> <p>So I create a second autoscaling from a launch configuration with spot instances. The autoscaling use the same load balancer created by beanstalk.</p> <p>To up instances with the last version of my app, I copy the user data from the original launch configuration (created with beanstalk) to the launch configuration with spot instances (created by me).</p> <p>This work fine, but:</p> <ol> <li><p>how to update spot instances that have come up from the second autoscaling when the beanstalk update instances managed by him with a new version of the app?</p> </li> <li><p>is there another way so easy as, and elegant, to use spot instances and enjoy the benefits of beanstalk?</p> </li> </ol> <p><strong>UPDATE</strong></p> <p>Elastic Beanstalk add support to spot instance since 2019... see: <a href="https://docs.aws.amazon.com/elasticbeanstalk/latest/relnotes/release-2019-11-25-spot.html" rel="nofollow noreferrer">https://docs.aws.amazon.com/elasticbeanstalk/latest/relnotes/release-2019-11-25-spot.html</a></p>
0non-cybersec
Stackexchange
Is it possible to conditionally input a file in LaTeX?. <p>I'm new to LaTeX, and here's what I'm trying to accomplish:</p> <ul> <li>I have Markdown and LaTeX files in my working directory, say <code>markdown_1.md</code> and <code>latex_1.tex</code>.</li> <li>In my main LaTeX file, <code>main.tex</code>, I have defined a new command <code>\inject</code> which is supposed to check if the argument is a LaTeX or Markdown file. If the file is Markdown, it should execute <code>\input{.cache/markdown_1.tex}</code> and <code>\input{latex_1.tex}</code>.</li> </ul> <blockquote> <p>Why <code>.cache/markdown.tex</code>? Because I have a <code>\write18</code> command in the file which converts Markdown to Latex and outputs it there.</p> </blockquote> <p>Here's what I've attempted so far, by researching various StackExchange threads online:</p> <pre><code>\usepackage{etoolbox} \makeatletter \newcommand{\inject}[1]{ \def\textendash{-}% \filename@parse{#1}% \edef\filename@base{\detokenize\expandafter{\filename@base}}% \def\file{\ifstrequal{\filename@ext}{md}{.cache/\[email protected]}{#1}}% \input{\file}% } \makeatother </code></pre> <p>I call it as:</p> <pre><code>\inject{markdown_1.md} \inject{latex_1.tex} </code></pre> <p>The issue with this is that the PDF isn't getting generated when I use <code>latexmk</code>. I've passed <code>-shell-escape</code> to pdfLatex.</p> <p>How can I make this work out?</p>
0non-cybersec
Stackexchange
How to use spot instance with amazon elastic beanstalk?. <p>I have one infra that use amazon elastic beanstalk to deploy my application. I need to scale my app adding some spot instances that EB do not support.</p> <p>So I create a second autoscaling from a launch configuration with spot instances. The autoscaling use the same load balancer created by beanstalk.</p> <p>To up instances with the last version of my app, I copy the user data from the original launch configuration (created with beanstalk) to the launch configuration with spot instances (created by me).</p> <p>This work fine, but:</p> <ol> <li><p>how to update spot instances that have come up from the second autoscaling when the beanstalk update instances managed by him with a new version of the app?</p> </li> <li><p>is there another way so easy as, and elegant, to use spot instances and enjoy the benefits of beanstalk?</p> </li> </ol> <p><strong>UPDATE</strong></p> <p>Elastic Beanstalk add support to spot instance since 2019... see: <a href="https://docs.aws.amazon.com/elasticbeanstalk/latest/relnotes/release-2019-11-25-spot.html" rel="nofollow noreferrer">https://docs.aws.amazon.com/elasticbeanstalk/latest/relnotes/release-2019-11-25-spot.html</a></p>
0non-cybersec
Stackexchange
Identity theft is not a joke, human.
0non-cybersec
Reddit
Bash: How to download data from Google Form. <p><strong>How can I download the <code>.csv</code> of the responses of a <code>Google Form</code> from Bash?</strong></p> <p>I tried </p> <pre><code>wget https://docs.google.com/spreadsheets/d/1gRMnKkqKaDAhpm6ytfvZEYfD9_j9HzDk1Q4HgMYC7Xg/edit#gid=1933231618 </code></pre> <p>but it downloads the HTML/CSS code for the page and not the <code>.csv</code> file and it makes sense. Here is what the window looks like for info</p> <p><a href="https://i.stack.imgur.com/maAPm.png" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/maAPm.png" alt="enter image description here"></a></p> <p>In order to download the <code>.csv</code> one must click on <code>file&gt;Download as&gt;csv</code>. I fail to know what the URL (if any exists) corresponds to the <code>.csv</code> document.</p>
0non-cybersec
Stackexchange
3 OS&#39;s on same HDD. <p>I've been all day around my laptop and just can't make it work,</p> <p>I have one HDD 750 GB in size, and I would like to have the following partition table:</p> <pre> 60 GB - Windows 7 150 GB - Windows 8 150 GB - Ubuntu 12.10 390 GB (Rest) - Logical drive for files </pre> <p>However for some reason (and I start by installing windows because I want grub for boot menu) it is not possible to begin the installation with this table and the problem is I cannot have more than four partitions on same disk, since windows automatically creates that annoying 100 MB extra partition.</p> <p>So after many many trial - error installations and partitioning I got this:</p> <pre> part1: 100 MB - Windows (auto created) part2: 60 GB - Windows 7 installed part3: Extended partition with 3.1: part5 150 GB -> Windows 8 installed 3.2: part6 360 GB -> logical for files 3.3: part7 8 GB -> Swap 3.4: part8 160 GB -> Ubuntu 12.10 </pre> <p>All OS's were successfully installed I can see every partition's content on Ubuntu. </p> <p>Since Ubuntu was installed last I managed to have grub, which shows windows 8 (fails to boot when selected: 'Error reading disk'), windows 7 doesn't show at all, and Ubuntu seems pretty fine to me.</p> <p>Is there any way to make this work? I searched everywhere can only find dual boot solutions... I don't mind having to reinstall everything again.</p> <p>Output of <pre>sudo fdisk -l</pre></p> <pre> Disk /dev/sda: 750.2 GB, 750156374016 bytes 255 heads, 63 sectors/track, 91201 cylinders, total 1465149168 sectors Units = sectors of 1 * 512 = 512 bytes Sector size (logical/physical): 512 bytes / 4096 bytes I/O size (minimum/optimal): 4096 bytes / 4096 bytes Disk identifier: 0x44ae409c Device Boot Start End Blocks Id System /dev/sda1 * 2048 206847 102400 7 HPFS/NTFS/exFAT /dev/sda2 206848 127066111 63429632 7 HPFS/NTFS/exFAT /dev/sda3 127068158 1465142699 669037271 f W95 Ext'd (LBA) Partition 3 does not start on physical sector boundary. /dev/sda5 * 127068160 423938047 148434944 7 HPFS/NTFS/exFAT /dev/sda6 423940096 1132926975 354493440 7 HPFS/NTFS/exFAT /dev/sda7 1132929024 1149175807 8123392 7 HPFS/NTFS/exFAT /dev/sda8 1149177856 1465142699 157982422 7 HPFS/NTFS/exFAT Disk /dev/sdb: 7948 MB, 7948206080 bytes 245 heads, 62 sectors/track, 1021 cylinders, total 15523840 sectors Units = sectors of 1 * 512 = 512 bytes Sector size (logical/physical): 512 bytes / 512 bytes I/O size (minimum/optimal): 512 bytes / 512 bytes Disk identifier: 0x0006d557 Device Boot Start End Blocks Id System /dev/sdb1 * 62 15508989 7754464 b W95 FAT32 </pre> <p>Thanks</p>
0non-cybersec
Stackexchange
Property (ii) of increasing functions in Chung&#39;s &quot;A Course in Probability Theory&quot;. <p>I am a bit confused by the line of reasoning on page 2 of <a href="http://books.google.com/books?id=zu80w7wd40UC&amp;lpg=PP1&amp;dq=chung%20course%20probability&amp;pg=PA2#v=onepage&amp;q&amp;f=false" rel="nofollow">Kai Lai Chung's "A Course in Probability Theory"</a>. In particular, he is considering a real-finite valued function $f$ which is defined and increasing on $(-\infty,+\infty)$. That is, for any two real numbers $x_1$ and $x_2$,</p> <p>$$ x_1&lt;x_2 \Rightarrow f(x_1) \le f(x_2). $$</p> <p>Next, he goes on to state and prove a number of properties of such functions (with an eventual eye on distribution functions). The first property is stated as:</p> <blockquote> <p>(i) For each x, both <em>unilateral limits</em></p> <p>$$ \lim_{t \uparrow x} f(t) = f(x-) \quad \text{and} \quad \lim_{t \downarrow x} f(t) = f(x+) $$</p> <p>exist and are finite. Furthermore the <em>limits at infinity</em> $$ \lim_{t \downarrow -\infty} f(t) = f(-\infty) \quad \text{and} \quad \lim_{t \uparrow +\infty} f(t) = f(+\infty) $$ exist; the former may be $-\infty$, the latter may be $+\infty$.</p> <p>This follows from monotonicity; indeed $$ f(x-) = \sup_{-\infty&lt;t&lt;x} f(t) \, , \; f(x+) = \inf_{x&lt;t&lt;+\infty} f(t). $$</p> </blockquote> <p>I understand (i) without any problems: the set $S = \left\{ {f(t) \mid -\infty&lt;t&lt;x}\right\}$ is bounded above by $f(x)$, since $f$ is increasing by hypothesis, and $S$ is nonempty implying that that the supremum of $S$ exists in $\mathbb{R}$. Furthermore, $\sup S$ can be shown to be equal to the left-limit in terms of the usual $\epsilon \text{-}\delta$ definition of one-sided limits by invoking the approximation property of the supremum and manipulating inequalities. A similar argument applies to the infimum of $f$ over $(x,\infty)$.</p> <p>It is the next stated property and its supporting text that seems confusing/misleading:</p> <blockquote> <p>(ii) For each $x$, $f$ is continuous at $x$ if and only if</p> <p>$$ f(x-) = f(x) = f(x+). $$ To see this, observe that the continuity of a monotone function $f$ at $x$ is equivalent to the assertion that $$ \lim_{t \uparrow x} f(t) = f(x) = \lim_{t \downarrow x} f(t). $$</p> </blockquote> <p>First of all, this "observation" is true not just for monotone functions, but in fact for all functions (a function is continuous at a point iff its limit exists and its limit equals the function's value at that point; the limit of a function exists iff the left- and right-limits of the function exist and are equal). So, it seems misleading to state the "observation" in this manner; but not incorrect per se, since it is also true for monotone functions in particular.</p> <p>Furthermore, since $f(x+)$ and $f(x-)$ are just a notational shorthand for the one-sided limits, the first sentence in (ii) seems to be immediate from this observation.</p> <p>However, he goes on to state:</p> <blockquote> <p>By (i), the limits above exist as $f(x-)$ and $f(x+)$ and</p> <p>$$ f(x-) \le f(x) \le f(x+) $$</p> <p>from which (ii) follows.</p> </blockquote> <p>Now I understand the inequality, since $f(x)$ is an upper bound for the set $S$ described above and similarly a lower bound for an analogous set whose infimum gives $f(x+)$. However, I do not see why we need to bother considering this inequality to show (ii). As mentioned, it seems like this follows immediately from the definition of continuity (for monotone functions or otherwise) and the fact that $f(x+)$ and $f(x-)$ are just symbols that are used to denote the left- and right-limits when they exist (which they always do for monotone functions on all of $\mathbb{R}$).</p> <p>What am I missing?</p>
0non-cybersec
Stackexchange
The probability distribution of the sum of independent uniform random variables in $\left[0,1\right]$. <p>Let me preface this by saying that this is not a question about the <a href="https://en.wikipedia.org/wiki/Irwin%E2%80%93Hall_distribution" rel="nofollow noreferrer">Irwin-Hall</a> distribution , at least directly. Rather, in the proof of Lemma 1 in the appendix of this <a href="https://epubs.siam.org/doi/pdf/10.1137/0402048" rel="nofollow noreferrer">paper</a> , the author shows that the joint density of <span class="math-container">$S_n:= \sum_{I=1}^{n}X_i$</span> where <span class="math-container">$X_i\stackrel{\rm i.i.d}{\sim}U\left[0,1\right]$</span> is given by <span class="math-container">$$f_n(s) = \frac{s^{n-1}}{(n-1)!}P\left(\max_{1\leq i\leq n} L_n \leq s^{-1}\right)$$</span> where <span class="math-container">$\{L_i\}_{i=1}^n$</span> are the lengths of consecutive sub-intervals of <span class="math-container">$\left[0,1\right]$</span> cut out by <span class="math-container">$(n-1)$</span> uniform random numbers in the interval. I know that the the joint density of the first <span class="math-container">$(n-1)$</span> such lengths is <span class="math-container">$(n-1)!$</span> on its support. However, I failed to follow the argument of the author to its conclusion. </p> <p>Specifically, he argues that the joint density of <span class="math-container">$S_n,X_1,\ldots,X_{n-1}$</span> is the same as the joint density of the <span class="math-container">$n$</span> independent uniform which is 1 on its support. Then, applying a transformation, the joint density of <span class="math-container">$S_n,\frac{X_1}{S_n},\ldots,\frac{X_{n-1}}{S_n}$</span> can be found to be <span class="math-container">$s^{n-1}$</span>. I cannot follow the argument from this point on, where he presumably integrates out the other variables to derive <span class="math-container">$f(s)$</span>. If anyone could clarify this step for me, it'd be great.</p>
0non-cybersec
Stackexchange
Different HTML folding for notepad++. <p>My question is pretty straightforward. </p> <p>Lets say this is my HTML in notepad++</p> <pre><code>&lt;div id="ff"&gt; &lt;div&gt;&lt;/div&gt; &lt;/div&gt; </code></pre> <p>Now when I fold this lines, it appears like that</p> <pre><code>&lt;div id="ff"&gt; ---------------------------------------------------------------------- </code></pre> <p>but I want to fold it like that</p> <pre><code>&lt;div id="ff"&gt; --------------------------------------------------------------------- &lt;/div&gt; </code></pre> <p>Is it possible with notepad++?</p>
0non-cybersec
Stackexchange
If you could delete a Champion AND revert a rework, what would be your choices?. See title. I'd probably delete Kalista because I never win against her (also her kit is BS) , and would revert Fiora rework, because I was pretty good with her before and now I can't play her :( Though as a jungler main I'm tempted to say delete Lee Sin out of pure hatred of the champion even though he's not strong right now.
0non-cybersec
Reddit
how can a file be removed and then cp can&#39;t write it?. <p>I have a part of a bash script, which I am executing as root:</p> <pre><code>rm -f ../../include/profile.h; \ cp profile.h ../../include/profile.h </code></pre> <p>the file <code>../../include/profile.h</code> in question has permissions:</p> <pre><code>-rw-r--r-- 1 root root 12178 Nov 5 02:00 ../../include/profile.h </code></pre> <p>Most of the time, the snippet executes fine, but very rarely, impossible to reproduce, it fails:</p> <pre><code>cp: cannot create regular file `../../include/profile.h': File exists </code></pre> <p>I checked, there is no other part of the program, that would be executed in parallel, which could write the file in between the two statements, thus creating a race condition which would explain the behaviour. There is no other place than the above, which is executed only once, which would write this file.</p> <p>The system is</p> <p>kernel:</p> <pre><code>Linux dev64 2.6.32.63+drm33.26-64.128-a10 #6 SMP Fri Jul 25 15:21:56 PDT 2014 x86_64 x86_64 x86_64 GNU/Linux </code></pre> <p>distro:</p> <pre><code>CentOS release 6.3 (Final) </code></pre> <p>What could possibly cause this failure to appear??</p>
0non-cybersec
Stackexchange
In Defense Of Implicit Code In C++.
0non-cybersec
Reddit
need to find a good editor for mac. <p>Can someone please suggest a good latex editor for mac. something close to one that is used in this video</p> <p><a href="https://www.youtube.com/watch?v=XzB8YcuGw4w" rel="nofollow">https://www.youtube.com/watch?v=XzB8YcuGw4w</a></p> <p>I liked the highlight and everything that this editor is offering. right now I am using TeXworks and it is so very plain</p> <p>Thanks for the help </p>
0non-cybersec
Stackexchange
Implications with the Lebesgue integral. <p>Let $(X,\mathcal{B},\mu)$ a probability space and $f:X \to \mathbb{R}$ a non negative and integrable function. My question is, for $a&gt;0$, </p> <p>if $\int_{X}fd\mu\geq a$, then there exist a Borel set, $B\in \mathcal{B}$, with $\mu(B)&gt;0$ such that $f(x)\geq a$, for all $x\in B$ ?</p> <p>Please, help me! Thanks.</p>
0non-cybersec
Stackexchange
You Are Allowed to Recover Wiped Partition.
1cybersec
Reddit
Dr Dre loses trademark battle with a gynaecologist called Dr Drai - BBC News.
0non-cybersec
Reddit
I am The Way.
0non-cybersec
Reddit
What is the correct mime type for .min.map javascript source files?. <p><strong>plain/text</strong> or <strong>application/json</strong>?</p> <p>I am unable to locate any mention of it, my google-fu is weak today.</p> <p>It does not mention it in this Source Map Revision document that I can see. <a href="https://docs.google.com/document/d/1U1RGAehQwRypUTovF1KRlpiOFze0b-_2gc6fAH0KY0k/edit?hl=en_US&amp;pli=1&amp;pli=1" rel="noreferrer">https://docs.google.com/document/d/1U1RGAehQwRypUTovF1KRlpiOFze0b-_2gc6fAH0KY0k/edit?hl=en_US&amp;pli=1&amp;pli=1</a></p>
0non-cybersec
Stackexchange
Jupyter Github Code Review. <p>When doing a code review on jupyter notebooks in github, it shows only the html code that generates the notebook. Are there any extensions that would enable github to show the rendered jupyter notebook, along with the ability to comment on cells for code review?</p>
0non-cybersec
Stackexchange
How to use spot instance with amazon elastic beanstalk?. <p>I have one infra that use amazon elastic beanstalk to deploy my application. I need to scale my app adding some spot instances that EB do not support.</p> <p>So I create a second autoscaling from a launch configuration with spot instances. The autoscaling use the same load balancer created by beanstalk.</p> <p>To up instances with the last version of my app, I copy the user data from the original launch configuration (created with beanstalk) to the launch configuration with spot instances (created by me).</p> <p>This work fine, but:</p> <ol> <li><p>how to update spot instances that have come up from the second autoscaling when the beanstalk update instances managed by him with a new version of the app?</p> </li> <li><p>is there another way so easy as, and elegant, to use spot instances and enjoy the benefits of beanstalk?</p> </li> </ol> <p><strong>UPDATE</strong></p> <p>Elastic Beanstalk add support to spot instance since 2019... see: <a href="https://docs.aws.amazon.com/elasticbeanstalk/latest/relnotes/release-2019-11-25-spot.html" rel="nofollow noreferrer">https://docs.aws.amazon.com/elasticbeanstalk/latest/relnotes/release-2019-11-25-spot.html</a></p>
0non-cybersec
Stackexchange
All these new abilities leave me like.... [Priority is no longer going to be the force it used to be](http://i.imgur.com/4XPP07S.png)
0non-cybersec
Reddit
My wife cut up open a bell pepper only to find another bell pepper.
0non-cybersec
Reddit
One point in intersection of conic and cubic, intersection multiplicity?. <p>Let $C \subset \mathbb{P}^2$ be the conic defined by $P(x, y, z) = xz + y^2$,and $D \subset \mathbb{P}^2$ be the cubic defined by $Q(x, y, z) = y^2z - x^3 + xz^2$. Show that there exactly one point $p \in C \cap D$. What is $I_p(C, D)$?</p>
0non-cybersec
Stackexchange
Why stopped when I install offline .NET Framwork 3.5 on win 8?. <p>I tried to install .NET Framework 3.5 on Windows 8. Write command in cmd area, that processed until 68% and then it stopped! Why? </p> <p>I typed: </p> <pre><code>dism /online /enable-feature /featurename:NetFx3 /All /Source:j:\sources\sxs /LimitAccess </code></pre> <p>I don't have any mistake in command and typed it like the microsoft MSDN. Can you help me?</p>
0non-cybersec
Stackexchange
Contract Programming - Deposit % and Payment Methods? Any advice is appreciated. <p>I'm pretty new to doing contract work and finally landed a decent paying project. The guy actually offered to put down a deposit and I'm just wondering what percentage I should consider asking for. I was thinking around 25% since its not a terribly large project (only about 20 hours).</p> <p>Also, I can't use PayPal (have had a terrible experience with them freezing funds for no good reason) so I'm wondering if anyone can suggest other methods for the client to send the deposit / payment. I want to make it as easy as possible for them.. thanks for any advice</p>
0non-cybersec
Stackexchange
Cắt bao quy đầu ở đâu Hà Nội.
0non-cybersec
Reddit
How can I stop having a crush on almost every girl I meet?. Title pretty much says all. Almost every time a girl is friendly towards me, I start having a crush on them.
0non-cybersec
Reddit
Are these conditional probabilities related?. <p>Knowing <span class="math-container">$P(A|B)$</span> &amp; <span class="math-container">$P(A|C)$</span>, would it be possible to infer <span class="math-container">$P(A|B,C)$</span>?<br> I looked at this other question: <a href="https://math.stackexchange.com/questions/1120608/any-mathematical-relation-between-these-conditional-probabilities][1]">Any mathematical relation between these conditional probabilities</a> but it doesn't solve my problem as he only uses mutually exclusive probabilities. </p>
0non-cybersec
Stackexchange
Let $X$ and $Y$ be independent random variables, uniformly distributed in the interval $[0, 1]$. Find the CDF and the PDF of $|X − Y|$.. <p>So this what I have: <span class="math-container">\begin{align} \ F_{z}(Z) &amp;= P (Z&lt;z) \\\ \ &amp;= P( |X-Y| &lt; z)\\ \ &amp;= P(-z &lt; X-Y &lt; z) \\ \ &amp;= P(-z+y&lt;X&lt;z+y)\\ \ &amp;=F_x(z+y)-F_{x}(-z+y) = ? \end{align}</span></p> <p>As for the pdf it is just:</p> <p><span class="math-container">\begin{align} f_{z}(Z)=f_{x}(z+y)+f_{x}(-z+y) \end{align}</span></p>
0non-cybersec
Stackexchange
Who I am on SMB share. <p>There is an SMB share that I am connected to with a Windows 10 PC. Credentials have been saved long ago and forgotten.</p> <p>Now I need to connect to the same share from other Windows 10 PC. In order to do so I need to look under which remote user name I am connected to this share on the first PC. How to do it?</p>
0non-cybersec
Stackexchange
How can we add child table dynamically in frappe (ERPNEXT). <p>I want to add child tables dynamically depending on records in another doctype.</p>
0non-cybersec
Stackexchange
Sister asked me to come up with a 20 minute program that strength trains the entire body. Eh. I'm not sure what to tell her. I guess squats pullups and pushups/dips are the most fundamental ones? There is a lot of animal walks that hit many muscles, but not a single one of them hits the pullup muscles, afaik. What do you think? I'm tempted to send her the links to the squat/pu/pullup progressions.
0non-cybersec
Reddit
Honest, difficult advice..
0non-cybersec
Reddit
I want to learn how to work with the fallen logs on my property, so as an experiment I split this rotten log in two, did my best to remove the rot, and for fun stuck on some rocks my wife found and tumbled near where I got the log.
0non-cybersec
Reddit
My new tattoo designed by my roommate. Actual tattoo done by Dustin Ward at Sterling Skull, Grande Prairie, AB..
0non-cybersec
Reddit
How to use spot instance with amazon elastic beanstalk?. <p>I have one infra that use amazon elastic beanstalk to deploy my application. I need to scale my app adding some spot instances that EB do not support.</p> <p>So I create a second autoscaling from a launch configuration with spot instances. The autoscaling use the same load balancer created by beanstalk.</p> <p>To up instances with the last version of my app, I copy the user data from the original launch configuration (created with beanstalk) to the launch configuration with spot instances (created by me).</p> <p>This work fine, but:</p> <ol> <li><p>how to update spot instances that have come up from the second autoscaling when the beanstalk update instances managed by him with a new version of the app?</p> </li> <li><p>is there another way so easy as, and elegant, to use spot instances and enjoy the benefits of beanstalk?</p> </li> </ol> <p><strong>UPDATE</strong></p> <p>Elastic Beanstalk add support to spot instance since 2019... see: <a href="https://docs.aws.amazon.com/elasticbeanstalk/latest/relnotes/release-2019-11-25-spot.html" rel="nofollow noreferrer">https://docs.aws.amazon.com/elasticbeanstalk/latest/relnotes/release-2019-11-25-spot.html</a></p>
0non-cybersec
Stackexchange
If $f_0(x)=e^x$ and define $f_{n+1}(x)=xf_n&#39;(x)$, what is the exact value of $\sum_{n=0}^\infty f_n(1)/n!$. <p>If $f_0(x)=e^x$ and define $f_{n+1}(x)=xf_n'(x)$, what is the exact value of $$\sum_{n=0}^\infty\frac{f_n(1)}{n!}$$ I tried finding general formula of $f_n(x)$ for $n$.</p> <p>But it is not of the form that i already know.</p> <p>For another way, i set $g(x)=$taht sigma.l, get its derivative and relation between $g(x)$ and $g'(x)$</p> <p>But it was not useful.</p>
0non-cybersec
Stackexchange
what is the difference between ?:, ?! and ?= in regex?. <p>I searched for the meaning of these expressions but couldn't understand the exact difference between them. This is what they say:</p> <ul> <li><code>?:</code> Match expression but do not capture it.</li> <li><code>?=</code> Match a suffix but exclude it from capture.</li> <li><code>?!</code> Match if suffix is absent.</li> </ul> <p>I tried using these in simple RegEx and got similar results for all. example: the following 3 expressions give very similar results.</p> <ul> <li><code>[a-zA-Z0-9._-]+@[a-zA-Z0-9-]+(?!\.[a-zA-Z0-9]+)*</code></li> <li><code>[a-zA-Z0-9._-]+@[a-zA-Z0-9-]+(?=\.[a-zA-Z0-9]+)*</code></li> <li><code>[a-zA-Z0-9._-]+@[a-zA-Z0-9-]+(?:\.[a-zA-Z0-9]+)*</code></li> </ul>
0non-cybersec
Stackexchange
AVD Emulator is not working in Android Studio. <p>While running the emulator on the android studio, my <code>Event Log</code>:</p> <blockquote> <p>17:11 Executing tasks: [:app:assembleDebug]</p> <p><strong>17:11 Emulator: Warning: Quick Boot / Snapshots not supported on this machine. A CPU with EPT + UG features is currently needed. We will address this in a future release.</strong></p> <p><strong>17:11 Emulator: Warning: requested RAM 1536M too high for your system. Reducing to maximum supported size 512M</strong></p> <p><strong>17:11 Emulator: C:\Users....\AppData\Local\Android\Sdk\emulator\qemu\windows-x86\qemu-system-x86_64.exe: Could not load library WinHvPlatform.dll.</strong></p> <p><strong>17:11 Emulator: C:\Users....\AppData\Local\Android\Sdk\emulator\qemu\windows-x86\qemu-system-x86_64.exe: failed to initialize WHPX: Function not implemented</strong></p> <p>17:11 Emulator: Process finished with exit code 0</p> <p>17:11 Gradle build finished in 2 s 704 ms</p> </blockquote> <p>All the <strong>bold sentence</strong> were shown in <code>RED</code> color.</p> <p>I am getting <code>Notification</code> as:</p> <blockquote> <p>Emulator: C:\Users....\AppData\Local\Android\Sdk\emulator\qemu\windows-x86\qemu-system-x86_64.exe: failed to initialize WHPX: Function not implemented</p> </blockquote> <p>My SDK Platform: <a href="https://i.stack.imgur.com/34ENV.png" rel="noreferrer"><img src="https://i.stack.imgur.com/34ENV.png" alt="enter image description here"></a></p> <p>My SDK Tools: <a href="https://i.stack.imgur.com/MB8Cw.png" rel="noreferrer"><img src="https://i.stack.imgur.com/MB8Cw.png" alt="enter image description here"></a></p> <p>I tried to solve the issue with reference: <a href="https://stackoverflow.com/a/52587220/7678788">https://stackoverflow.com/a/52587220/7678788</a> (I was unable to change it) so, I took help of <a href="https://stackoverflow.com/a/52342344/7678788">https://stackoverflow.com/a/52342344/7678788</a>, but this also didn't solve the issue.</p> <pre><code>My SDK Platform and SDK Tools are of the latest version. </code></pre> <p>How to fix this issue?</p> <hr> <h2>UPDATE</h2> <p>I have also installed the latest <strong><code>Intel x86 Emulator Accelerator (HAXM)</code></strong> and tried to run the emulator, my <code>Event Log</code>:</p> <blockquote> <p>19:11 Executing tasks: [:app:assembleDebug]</p> <p><strong>19:11 Emulator: Warning: Quick Boot / Snapshots not supported on this machine. A CPU with EPT + UG features is currently needed. We will address this in a future release.</strong></p> <p><strong>19:11 Emulator: Warning: requested RAM 1536M too high for your system. Reducing to maximum supported size 512M</strong></p> <p>19:11 Gradle build finished in 8 s 357 ms</p> <p>19:11 Emulator: Process finished with exit code 0</p> </blockquote> <p>All the <strong>bold sentence</strong> were shown in <code>RED</code> color.</p>
0non-cybersec
Stackexchange
Median with GROUP BY. <p>Suppose the following table <code>t1</code>:</p> <pre> ================= | tag | val | --+ for the sake of simplicity, val is non NULL ================= | a1 | v1 | | a1 | v2 | | a1 | v3 | | a1 | v4 | | a1 | v5 | | a2 | v6 | | a2 | v7 | | a2 | v8 | | a2 | v9 | | ... | ... | ================= </pre> <p>If you execute the script below in MySQL:</p> <pre><code>SELECT `tag`, AVG(`val`) FROM `t1` GROUP BY `tag` </code></pre> <p>You would get the average values grouped by the column <code>tag</code>:</p> <pre> ================= | tag | AVG() | ================= | a1 | avg1 | | a2 | avg2 | | a3 | avg3 | | a4 | avg4 | | ... | ... | ================= </pre> <p>Besides <code>AVG()</code>, MySQL has several other built in functions to calculate aggregate values (e.g. <code>SUM()</code>, <code>MAX()</code>, <code>COUNT()</code>, and <code>STD()</code>) that could be used in the same way as in the script aforementioned. However, there is no built in function for <em><strong>median</strong></em>.</p> <p>This issue has already come up several other times at SE; however, most of them related to tables without <code>GROUP BY</code>. The only one with <code>GROUP BY</code> seems to be <a href="https://stackoverflow.com/questions/15386799/mysql-count-median-grouped-by-day">MySql: Count median grouped by day</a>; however, the script seems to be overcomplicated.</p> <h3>Question</h3> <p>What would be an easy and simple way (if possible) to calculate this median?</p> <h3>Follow-up</h3> <p>Excellent article that complement the accepted answer:<br /> <a href="http://danielsetzermann.com/howto/how-to-calculate-the-median-per-group-with-mysql/" rel="nofollow noreferrer">http://danielsetzermann.com/howto/how-to-calculate-the-median-per-group-with-mysql/</a></p>
0non-cybersec
Stackexchange
RemoveView not working. <p>I'm having an unusual error. I have this inside a custom viewgroup. The method receives a view and add it to the layout but i keep getting the same error:</p> <pre><code>if((ViewGroup)view.getParent() != null){ ((ViewGroup)view.getParent()).removeView(view); } addView(view); &lt;--- Breakpoints puts the error on this line </code></pre> <p>The error is:</p> <p>java.lang.IllegalStateException: The specified child already has a parent. You must call removeView() on the child's parent first.</p> <p>Using breakpoints around this shows that "view" even after calling removeView onthe parent keep a reference to its parent..</p> <p>Some people proposed using a runnable to wait a few seconds before adding it to the view. I havent tried this because it seems more a hack than a solution.. Either way i hope someone may be able to help</p> <p>Thanks!</p> <p>PS: Not that it should matter but the parent of this view i'm adding is a custom grid layout i made and its parent is a viewpager.</p> <p>Edit:</p> <p>I did a little more breakpoints and debugging and from the looks of it the grid effectively remove the view from its child list (debug) but the child view keeps a reference to that same grid in its mParent variable (debug). How is this possible</p> <p>EDIT:</p> <p>In activity:</p> <pre><code>Button button = new Button(mContext); button.setOnClickListener(mClickListener); (...) Random random = new Random(); button.setText(random.nextInt(9999) + " "); mCurrentGridLayout.addCustomView(button); </code></pre> <p>In CustomGridLayout viewgroup class:</p> <pre><code>public void addCustomView(View view){ if((ViewGroup)view.getParent() != null){ ((ViewGroup)view.getParent()).removeView(view); } addView(view); } </code></pre>
0non-cybersec
Stackexchange
Passing multiple commands to gnome-terminal from a script. <p>My bash-script is not run in a terminal, but opens a terminal at runtime to ask for user input (sudo password). I would like to tell the user in this terminal what the script is trying to do. First, here is my script:</p> <pre><code>#!/bin/bash #This should install: Qt Linguist, lrelease #for Qt Linguist dpkg-query -l qt4-dev-tools if echo $? == 0; then check1=1 fi #for lrelease dpkg-query -l qt4-default if echo $? == 0; then check2=1 fi echo $check1 echo $check2 if [ $check1 = 1 ] &amp;&amp; [ $check2 = 1 ];then gnome-terminal -x sudo apt-get install qt4-dev-tools qt4-default fi $SHELL </code></pre> <p>This opens a terminal with this:</p> <pre><code>[sudo] password for "username": </code></pre> <p>But I would like to have:</p> <pre><code>qt4-dev-tools and qt4-default are missing. Now trying to install. [sudo] password for "username": </code></pre> <p>How do I get this when starting the terminal with <code>gnome-terminal -x</code>?</p>
0non-cybersec
Stackexchange
How to use spot instance with amazon elastic beanstalk?. <p>I have one infra that use amazon elastic beanstalk to deploy my application. I need to scale my app adding some spot instances that EB do not support.</p> <p>So I create a second autoscaling from a launch configuration with spot instances. The autoscaling use the same load balancer created by beanstalk.</p> <p>To up instances with the last version of my app, I copy the user data from the original launch configuration (created with beanstalk) to the launch configuration with spot instances (created by me).</p> <p>This work fine, but:</p> <ol> <li><p>how to update spot instances that have come up from the second autoscaling when the beanstalk update instances managed by him with a new version of the app?</p> </li> <li><p>is there another way so easy as, and elegant, to use spot instances and enjoy the benefits of beanstalk?</p> </li> </ol> <p><strong>UPDATE</strong></p> <p>Elastic Beanstalk add support to spot instance since 2019... see: <a href="https://docs.aws.amazon.com/elasticbeanstalk/latest/relnotes/release-2019-11-25-spot.html" rel="nofollow noreferrer">https://docs.aws.amazon.com/elasticbeanstalk/latest/relnotes/release-2019-11-25-spot.html</a></p>
0non-cybersec
Stackexchange
Some European coworkers asked me why America hasn't developed effective "asteroid defenses" yet....
0non-cybersec
Reddit
Planet found in a four star system.
0non-cybersec
Reddit
An example of a series in which using $\limsup$ rather than $\lim$ in performing the root test or the ratio test would make a difference?. <p>I've learned to apply these tests before in Calculus, but in the textbook that I used, the numbers of interest for the root and ratio tests were presented as $\lim_{n\rightarrow \infty}|a_n|^{1/n}$ and $\lim_{n\rightarrow \infty}a_{n+1}/a_n$ respectively. But now in Baby Rudin, we use instead the limit supremums and I am having a hard time understanding why. Are the tests made somehow more general using the limit supremum? Are there series which I wouldn't be able to apply the tests to without using the limit supremums?</p>
0non-cybersec
Stackexchange
A doubt about the argument that $x=\cos\theta$, $y=\sin\theta$ parametrizes the unit circle. <p>There is the question (<a href="https://math.stackexchange.com/questions/125511/">example</a>) of how the power series definitions of sine and cosine relate to their unit-circle definitions. In many answers (<a href="https://math.stackexchange.com/a/125525/46234">example</a>), the first step is usually something like this:</p> <blockquote> <p>Show that for all <span class="math-container">$\theta \in \mathbb R$</span>, we have <span class="math-container">$\sin^2\theta+\cos^2\theta=1$</span>.</p> <p>Hence conclude that the set <span class="math-container">$S=\{(\cos\theta,\sin\theta)\in\mathbb{R}^2|\theta\in\mathbb{R}\}$</span> describes the unit circle.</p> </blockquote> <p>I have a doubt about the above argument, which seems to say the following:</p> <blockquote> <p>Let <span class="math-container">$f:\mathbb R \rightarrow \mathbb R$</span> and <span class="math-container">$g:\mathbb R \rightarrow \mathbb R$</span> be functions.</p> <p>Show that for all <span class="math-container">$\theta \in \mathbb R$</span>, we have <span class="math-container">$[f(\theta)]^2+[g(\theta)]^2=1$</span>.</p> <p>Hence conclude that <span class="math-container">$S=\{(f(\theta),g(\theta))\in\mathbb{R}^2|\theta\in\mathbb{R}\}$</span> describes the unit circle.</p> </blockquote> <p>But this conclusion does not follow, because it could for example be that <span class="math-container">$f$</span> and <span class="math-container">$g$</span> are defined by <span class="math-container">$f(\theta)=1$</span> and <span class="math-container">$g(\theta)=0$</span> for all <span class="math-container">$\theta \in \mathbb R$</span>. In which case the set <span class="math-container">$S$</span> would not describe the unit circle, but would instead just be a single point: <span class="math-container">$S=\{(1,0)\}$</span>.</p> <p>Am I perhaps missing or misunderstanding something about the argument here?</p>
0non-cybersec
Stackexchange
pylint false positive E0401 import errors in vscode while using venv. <p>I created a venv using python3.6 on my mac os in this folder <code>/Users/kim/Documents/Apps/PythonApps/python36-miros-a3</code></p> <p>I ran a <code>pip install pylint</code> after I activated the virtual env</p> <p>My workspace is in <code>/Users/kim/Documents/Apps/WebApps/miros-a3</code></p> <p>Inside my vscode workspace, I have the following Workspace settings</p> <pre><code>{ "folders": [ { "path": "." } ], "settings": { "python.pythonPath": "/Users/kim/Documents/Apps/PythonApps/python36-miros-a3/bin/python3.6", "python.venvPath": "/Users/kim/Documents/Apps/PythonApps" } } </code></pre> <p>I have tried setting a custom path for the pylint and also changing the venvpath.</p> <p>The pylint kept complaining about the import statement saying it does not exist.</p> <p><a href="https://i.stack.imgur.com/3h7LR.png" rel="noreferrer"><img src="https://i.stack.imgur.com/3h7LR.png" alt="enter image description here"></a></p> <p><a href="https://i.stack.imgur.com/9gs8b.png" rel="noreferrer"><img src="https://i.stack.imgur.com/9gs8b.png" alt="enter image description here"></a></p> <p>As you can see, they are in the same folder, and I can definitely execute my python files.</p> <p>What can I do to avoid these kind of false positive import errors?</p> <p>I have also tried the following:</p> <ol> <li>go to commandline turn on the virtual env and then type <code>code</code> to activate the vscode as recommended here <a href="https://code.visualstudio.com/docs/setup/mac" rel="noreferrer">https://code.visualstudio.com/docs/setup/mac</a></li> <li>also tried this <a href="https://donjayamanne.github.io/pythonVSCodeDocs/docs/troubleshooting_linting/" rel="noreferrer">https://donjayamanne.github.io/pythonVSCodeDocs/docs/troubleshooting_linting/</a></li> </ol>
0non-cybersec
Stackexchange
Welcome To The Salty Spitoon. How Tough Are Ya?.
0non-cybersec
Reddit
How to access host element from within the shadow root using Shadow DOM v1?. <p>Given an element contained in a shadow root, how can I get to the element that hosts the said shadow root? Is there a single way to accomplish this regardless of where an element is in the tree (i.e. given a reference to either <code>element2</code> or <code>element3</code>, get the reference to <code>element1</code>)?</p> <pre><code>element1 └ #shadow-root └ element2 └ element3 </code></pre>
0non-cybersec
Stackexchange
Smoked weed at my master's grave. Now with spliff in frame.
0non-cybersec
Reddit
TIL that H. Jon Benjamin (main voice actor on Archer and Bob's Burgers) and Brendon Small (of Metalocalypse) made a cartoon that featured Louis CK as the father..
0non-cybersec
Reddit
Which is the easier CMS to integrate with CakePHP?. <p>I was trying develop a website with Cakephp and Joomla... But lately I've been founding a lot of barriers that create difficulties implementing things that would have been a lot easier if I only developped using one of the components.</p> <p>So, in your point of view (as someone with more experience than me), is it worth to integrate CakePhp with a CMS?</p> <p>If yes, what do you think its the best and easier CMS to integrate with?</p>
0non-cybersec
Stackexchange
Let $A$ and $B$ be separates subsets of $\mathbb R^k$ and let $a\in A$, $b\in B$. <p>$\mathbf{p}(t)=(1-t)a+tb$. </p> <blockquote> <p>If $A_0 =\mathbf{p}^{-1} (A)$ and $B_0=\mathbf{p}^{-1}(B)$ then there is $t_0\in (0,1)$ such that $\mathbf{p}(t_0)\notin A\cup B$.</p> </blockquote> <p>help please, I don't know how to do it.</p>
0non-cybersec
Stackexchange
Simplifying Complex Fractions: Why Am I Wrong?. <p>I recently encountered the complex fraction $$x+\cfrac{1}{x+\cfrac{1}{x+\cfrac{1}{x+\cfrac{1}{x}}}}$$</p> <p>I am confused because the correct result was very different from the one I get from my method. I took the reciprocal of each fraction in the denominator. The reciprocal of $$x+\cfrac{1}{x+\cfrac{1}{x}}$$ is $2x+1/x$. I did this for all the other terms until I got $4x+1/x$. </p> <hr> <p>Why is this wrong? Can someone please explain to me why I can't take reciprocals like this, and simplify the fraction like this? Can you also do this as simply as possible, because I am still a beginner and will not understand complicated math notation?</p>
0non-cybersec
Stackexchange
Gf likes platonic cuddling, it's driving me crazy.. She wants to be able to cuddle with her male friends and says it's purely platonic, but it drives me crazy thinking about her in the arms of another person. Is it wrong of me to expect her to seek this type of physical comfort from me only? She says it's no big deal because it's just cuddling but I see cuddling as a sensual act that should only happen between partners or in extream circumstances like a death or other very stressful situation, not an every day occurrence between friends. She has tried to convince me not to be hurt by the thought of her with someone else because she would never do more than cuddling (and I believe her), but I don't think I will ever be ok with the cuddling to begin with. Am I being inconsiderate because I don't want her to fulfill her physical needs outside of the relationship? Or is she being inconsiderate for pushing the issue even though she knows how I feel? We have only been together for thee months , and while I do care deeply about her, I'm not willing to go through the pain of watching her cuddle other people just in case I might get over my hangup. Thoughts? Advice? Edit: we broke up
0non-cybersec
Reddit
Can we have a series representation of order $5$ at $x=0$ of the inverse function of $xe^{x^{2}}$?. <p>Well, I am a freshman, This was my homework. With a bit of googling, I found that: <span class="math-container">$$f^{-1}(x) = \pm \frac{\sqrt{W(2x^2)}}{\sqrt{2}}$$</span> What our professor did was: <span class="math-container">$$ f(x)=xe^{x^{2}}=x+x^3+\dfrac{x^5}{2} +O(x^6) $$</span> Then he proved that <span class="math-container">$f(x)$</span> is a bijection then he supposed that: <span class="math-container">$$f^{-1}(x) = a_0+a_1x+a_2x^2+a_3x^3+a_4x^4+a_5x^5+O(x^6)$$</span> then <span class="math-container">$$ f^{-1}(f(x))=x $$</span> <span class="math-container">$$ f^{-1}(f(x))=a_0+a_1{(x+x^3+\dfrac{x^5}{2})}+a_2{(x+x^3+\dfrac{x^5}{2})}^2+a_3{(x+x^3+\dfrac{x^5}{2})}^3+a_4{(x+x^3+\dfrac{x^5}{2})}^4+a_5{(x+x^3+\dfrac{x^5}{2})}^5 $$</span></p> <p>then solved the following for the coefficient: <span class="math-container">$$ a_0+a_1{(x+x^3+\dfrac{x^5}{2})}+a_2{(x+x^3+\dfrac{x^5}{2})}^2+a_3{(x+x^3+\dfrac{x^5}{2})}^3+a_4{(x+x^3+\dfrac{x^5}{2})}^4+a_5{(x+x^3+\dfrac{x^5}{2})}^5=x $$</span> and found that: <span class="math-container">$$ a_0=0,a_1=1,a_2=0,a_3=-1,a_5=\dfrac{5}{2} $$</span> and found that: <span class="math-container">$$f^{-1}(x)=x-x^3+\dfrac{5x^5}{2} +O(x^6)$$</span> I Think it is wrong because when you plot both of them, they are not symmetric to <span class="math-container">$y = x$</span></p>
0non-cybersec
Stackexchange