If I have a positive life total and cast  then  and draw my whole deck I know I can't lose the game, but is my life total one or negative a bunch?

From reading the rules it would appear there are two kinds of damage and then straight loss of life:     118.3 If an effect causes a player to gain or lose life, that player's life total is adjusted accordingly.   From reading that I would guess that effects like Extort are not sources of damage. You simply lose the life.      119.2a Damage may be dealt as a result of combat. Each attacking and blocking creature deals combat damage equal to its power during the combat damage step.   So damage from creatures during combat is combat damage.     119.2b Damage may be dealt as an effect of a spell or ability. The spell or ability will specify which object deals that damage.   And that is direct damage from an object.  So the arguments are these:  Does loss of life as outlined by rule 118.3 (at top) count as being dealt damage? Do triggered abilities that redirect or reduce damage effect loss of life?  My second related question: You put  on a  and tap her to deal one damage to your opponent. Am I right in saying that because the damage was direct damage (not dealt during combat) then the triggered ability of preventing the combat phase of the damaged player is not triggered?


Definition: A real function $f:X\to\mathbb{R}$ is said to be bounded if there exists a $k>0$ such that $|f(x)|\le k$      Definition: A subset $X$ of a metric space $(M, d)$ is said to be bounded if $d(x,y)\le c$ for all $x,y\in X$.   Let $p:\mathbb{R}\to \mathbb{R}$ a real polynomial function of degree $n>0$ given by $$ p(t) = a_0 + a_1t+ \cdots + a_nt^n $$ Show that $p$ is not bounded. Moreover, show that for every bounded subset $X\subset\mathbb{R}$, the restriction $s:X\to \mathbb{R}, s(t) = p(t)$ is bounded.

Let $p(t) =  a_0+\dots +a_nt^n, a_n\neq 0,$ a polynomial with degree $n>0$. Prove that $p:\mathbb{R}\rightarrow \mathbb{R}$ is not bounded, but for any bounded subset $X\subset \mathbb{R}$ the restriction $p\vert X$ is bounded.   I want to prove this in very elementary terms. I mean, without using the notion of limit or even continuity. I can only show this with "strong" results. Is it possible with elementary terms?


I have the correct encoding in SVN and i see the correct text while opening the file in SVN. The above error is thrown during Cobertura compile in Jenkins server ( log below). When i was doing a jenkins build locally, i could not see this error.  I am using Java 1.7 and have integrated Sonar to Jenkins.I am using IVY to manage dependencies inside the project. I searched a lot in the web and Stack Overflow but could only find answers related to Maven.  Would appreciate if someone could help.  Full Log Below  init:      [echo] ### Making default directories ###      [mkdir] Created dir: /opt/hd/dt/var/jenkins/workspace/A/ProjectName/build/classes  cobertura.compile:       [echo] ### Setting Compile Classpath ###      [javac] /opt/hd/dt/var/jenkins/workspace/A/ProjectName/src/com/cs/mm/ab/common/util/Constants.java:119: error: unmappable character for encoding ASCII     [javac]     public static final String THANK_YOU = "Thank you for choosing Restie?s for your ";     [javac]                                                                                [javac] 1 error  BUILD FAILED /opt/hd/dt/var/jenkins/workspace/A/ProjectName/build/ant/build.xml:32: The following error occurred while executing this line: /opt/hd/dt/var/jenkins/workspace/A/ProjectName/build/ant/cobertura-build.xml:51: Compile failed; see the compiler error output for details.

I'm currently working on a Java project that is emitting the following warning when I compile:  /src/com/myco/apps/AppDBCore.java:439: warning: unmappable character for encoding UTF8     [javac]         String copyright = "� 2003-2008 My Company. All rights reserved.";   I'm not sure how SO will render the character before the date, but it should be a copyright symbol, and is displayed in the warning as a question mark in a diamond.  It's worth noting that the character appears in the output artifact correctly, but the warnings are a nuisance and the file containing this class may one day be touched by a text editor that saves the encoding incorrectly...  How can I inject this character into the "copyright" string so that the compiler is happy, and the symbol is preserved in the file without potential re-encoding issues?


I might have been staring at the computer screen too long today and looked over something small but why can I not target these individual cells? (a1, a2, a3, etc...)

             sdf

   CSS:    div.row-a div.a div.1 {     border: 1px solid green;     margin-left: 5px;     margin-top: 5px;     background-color:red;     height: 50px;     width: 50px; }   jsFiddle:

What characters/symbols are allowed within the CSS class selectors? I know that the following characters are invalid, but what characters are valid?  ~ ! @ $ % ^ & * ( ) + = , . / ' ; : " ? > < [ ] \ { } | ` #


In my next trip I have a long layover at Singapore. I'd like to make the most of my time there visiting cheap electronic gadgets shops (mainly chinese products). I've read that there is a building called Sim Lim Square where you can find electronic items, but everything I've read about it's refered to international trademarks (Nikon, Lenovo, Apple...) and (worst) the prices are equal than in Europe. To clarify, I'm looking for items like the ones you can find in webs like  or  when you search in the "electronics" tab.

In a few weeks I expect to be flying into Singapore to start a long overland trip. But my current laptop is dying and I like to have one on my travels.  So I'm pretty sure computers and electronics will be much cheaper in Singapore than here at home in Australia.  What I am wondering though is whether Singapore has an area dedicated to hi-tech... something similar to  in Tokyo where all kinds of nerdy gadgets new and used can be found.


I can code symbols of the type $$\prod_{i=1}^{n}$$  but when it comes to:   I cannot get the less-than-equal sign placed as shown.Can this be done easily?  EDIT: below removed as reason explained in the comments  **not sure why $\prod_{i=1}^{n}$ not displaying properly while in math.stackexchange its fine*

I've heard that you should use \[ ... \] for displayed equations instead of  $$ ... $$, but why is that?  I'd assumed that it's so that you can more easily tell which are starting and which are ending delimiters, but if I always use a syntax-highlighting text editor, I can see that easily based on the color of the symbols.  Is there any reason for this suggestion?


I have two data sets, i.e., the number of flowers measured in field A and in field B. Each data set has about 40 samples. I want to do a test to check the hypothesis that field A has more flowers than field B. Which test I have to use.   I used Kolmogrov test and lillietest in Matlab, to check if my data is normally distributed, and I also plot the histogram. It seems that the data doesn't have normal distribution.

Context  I need to compare two groups of students. Students of these groups did some work, which later was evaluated. Now I have the values of the accuracy of every student. Here are the results:     0.2   0.065   0.123   0.075   0.181   0.054   0.185   0.106   0.142   and      0.269   0.357   0.2   0.221   0.275   0.277   0.253   0.127   0.246   I would like to check if the first group was better in terms of accuracy than the second group. As the samples are small I thought about using t test to compare the samples.  H0 hypothesis was that the accuracy of both groups are equal  H1 hypothesis was that the accuracy of the 1st group was greater than the accuracy of the 2nd group.  I used the following R function:  t.test(precisionAdHoc$adhoc, precisionH4U$H4U, "g", 0, FALSE, TRUE, 0.95)   where precisionAdHoc$adhoc holds the data from the first group and precisionH4U$4HU holds the data from the second group.   I got the following result:  data:  precisionAdHoc$adhoc and precisionH4U$H4U  t = -4.3687, df = 16, p-value = 0.9998 alternative hypothesis: true difference in means is greater than 0  95 percent confidence interval:  -0.1701334        Inf  sample estimates: mean of x mean of y  0.1256667 0.2472222    Questions   Did I use the t.test function correctly? If not, what did I get wrong? and how should I correct it? If the function was correct, how should I interpret the results?


If $a^{2} + b^{2} = c^{2}$ then show that $ 3 | ab $    Attempt  I'll try by contradiction. If $3$ does not divide $ab$ then $ab = 3m + n$.  So we have  $$ (a+b)^{2} = a^{2} + b^{2} + 2ab = a^{2} +  b^{2} + 6m + 2n $$ $$ a^{2}  + b^{2} = (a+b)^{2} - 2(3m + n) $$  how to show that $(a+b)^{2} - 2(3m + n)$ cannot be a square number?

I'm reading "A friendly introduction to number theory" and I'm stuck in this exercise, I'm mentioning this because what I need is a basic answer, all I know about primitive pythagorean triplets is they satisfy $a^2 + b^2 = c^2$ and a, b and c has no common factors.  Now.. my approach (probably kind of silly) was to "classify" the odd numbers (not divisible by 3) as $6k+1$, $6k+2$ and $6k+5$, and the even numbers with $6k+2$ and $6k+4$, then, trying different combinations of that, I could probe all the cases when I assume c is not 3 divisible, but I still have to probe that c cannot be 3 divisible and I don't know how to do it.  Anyway, probably there is a better simpler solution.  (Sorry, if this is a stupid question, I'm trying to teach myself number theory without much math background)


Let $\Omega \subset \mathbb{R^n}$ be open and bounded by $\partial \Omega$ sufficiently smooth. Let $u \in C^k(\bar{\Omega})$ and $\phi \in C_0^\infty (\Omega)$ for a positive integer k. Show that: $$ \int_\Omega uD^{\alpha}\phi dx = (-1)^{|a|}\int_{\Omega}\phi D^\alpha udx $$ for any multi-index $\alpha$ with $|\alpha| <k$. To me, this problem looks like an application of one of the fundamental theorems of calculus (stoke's, divergence, etc.). However, I might be wrong. I tried to work out the LHS but couldn't get to the RHS.

Let $f,g:\mathbb R^n \rightarrow \mathbb R^n$, $(x_1,\dots, x_n)\mapsto f,g(x_1,\dots, x_n)$ be smooth functions with compact support.  Use the following notation: for an index $\alpha = (\alpha_1,\dots, \alpha_n)$ where $\alpha_i$ is a natural number, we denote by $D^{\alpha}$ the derivative with respect to $x_1$ $\alpha_1$ times, with respect to $x_2$, $\alpha_2$ times, and so on until $x_n$, $\alpha_n$ times.  Can we then say that $$\int_{\mathbb R^n} D^{\alpha} f(x_1,\dots, x_n) g(x_1,\dots, x_n)dx_1 \cdots dx_n = (-1)^{|\alpha|} \int_{\mathbb R^n} f(x_1,\dots, x_n) D^{\alpha} g(x_1,\dots, x_n)dx_1 \cdots dx_n$$ where $|\alpha| = \sum_{i=1}^n \alpha_i$.  Thanks you!


If let's say a 3/3 indestructible creature takes 2 combat damage and then 2nd main gets a -1/-1, does the creature die?  Am assuming no since its still technically a 2/2 indestructible with 2 damage on it and NOT a 3/1 indestructible with a -1/-1

Can I hit a 4/4 indestructible creature with a  (3 damage) and give it -1/-1 with  to kill it? (Does it matter which way around I cast those?)  I read  here and it says, damage is removed in cleanup step, so it should be on the creature still after both spells.     702.12. Indestructible   702.12a Indestructible is a static ability.   702.12b A permanent with indestructible can’t be destroyed. Such permanents aren’t destroyed by lethal damage, and they ignore the state-based action that checks for lethal damage (see rule 704.5g).   702.12c Multiple instances of indestructible on the same permanent are redundant.


I'm currently working on Debian.  I've recently found a package I want to use apt-get to install onto my computer, but the only distribution of it is for the oldstable (jessie) repository. I'm currently using the stable (stretch) repository, and apt-get doesn't have the oldstable repository in 'sources.list.d'. How do I add the oldstable repository to that list?

How can I install a package from Debian Jessie in Stretch?  Note I'm on Stretch and I want to install a package from Jessie, because I'm running an architecture that's only supported by it and missing in Stretch


My pen drive is unreadable, when I plug it in the computer it does not appear on the computer even dist 1 is also not shown. How can the data can be recovered.

So my friend has a USB flash drive that isn't working. I don't know a whole lot about "recovery" software so I figured I'd ask you guys.  What steps can I try (I have access to a Linux machine as well) to see....if I can get ANYTHING off the flash drive?  I've google'd around, but most of the stuff seems for windows.


We want to update our powershell version to core 7, but due to old, absurd security rules, we cannot use the MSI. We have set up dotnet 5 successfully using the zip and can now run powershell 7 successfully. However, we would like to replace 5.1 completely with 7. Registry is complaining that it cannot change the the contents of the powershell command so we cannot change it there. Anyone have experience with this?

The question is simple, even though the answer might not be, but how can I replace Windows 10 default powershell (major 5) with the one on GitHub (Major 6)?   If installed normally it'll be installed in %programfiles%\PowerShell with executable named pwsh.exe. Is there a way of updating PS 'locally' so that it gets automatically replaced by the newest one? Am I missing something?


Is there any way to access a external hard drive with NTFS format in CEntOS 6.2 ?

I am currently setting up a personal server on Debian Wheezy. My machine is an ARM based architecture (Cubox).  The problem appear when I want to mount and use my NTFS external hard drives. The mount point is correct, I can access files and folders, I can change owner but it is impossible to write files even as root.  I mount my drives with "mount -o options source destination" The command mount gives rw option for this mounted drive.


At the end of may I'm planning to visit Portugal, but, from Italy, I found that it is cheaper to take a flight to Sevilla and then drive to Portugal.  Since I want to plan all the trip ahead, I'm looking for cars at the Sevilla airport that I can drive to Portugal and leave at Sevilla when the vacation ends.  Are there some companies that allow me to do so? Are there any restrictions to drive between EU countries with a rental car?  INFO: I'm an Italian citizen and I have an Italian driving license, if that matters.  EDIT: the question that you said could have my answer is very different from mine, i want to leave the car exactly where i'll rent it

I want to rent a car in Europe (London, Amsterdam, Dublin, Paris) and drop it off in another country.  How does the border crossing work with a rented car?


I have written a trigger on case, to prevent closing the case when all the associated tasks are not closed.  Facing this error while saving the trigger:      Error: Compile Error: No such column 'What' on entity 'Task'. If you are attempting to use a custom field, be sure to append the '__c' after the custom field name. Please reference your WSDL or the describe call for the appropriate names. at line 7 column 18       Here is my trigger.  trigger updateCase on Case (before update)  {      Map<Id, Task> taskMap = new Map<Id, Task>();       for(Task t : [SELECT Id, What FROM Task WHERE IsClosed=false AND What IN :trigger.newMap.keySet()])     {         taskMap.put(What, t);     }       for(Case c : Trigger.new)     {          if(taskMap.containsKey(c.Id) && c.IsClosed && c.IsClosed != Trigger.oldMap.get(c.Id).IsClosed)             c.addError('Case Cannot be closed with open tasks');     } }

I'm looking for a way to do a SOQL request to get a Task record, but I keep ending up with this error:     Error: Compile Error: No such column 'What' on entity 'Task'. If you   are attempting to use a custom field, be sure to append the '__c'   after the custom field name. Please reference your WSDL or the   describe call for the appropriate names. at line 59 column 25   The 'What' field is labeled as 'Related To' (it's a standard field of the Activity object).  Here's my request generating this error:  Task task = [SELECT Type FROM Task WHERE What = :this.person.Id];   Thanks for your solutions.


For some users, the number of favorites in one of his/her StackExchange accounts does not match that in his/her network profile. For example,  User Pang (me):   = 4  = 5      User Jon Skeet:   = 3  = 4      User Servy:   = 4  = 5     In my case, I am currently having 4 favorites, so the network profile is wrong. There's  that I am not favoriting but appearing favorited on the network profile. Maybe I favorited it before and unfavorited it later, I don't remember, but even so, that would be months ago. Not sure about the other users.

I've noticed that  on Math SE is listed , but not for Math SE account.  I don't recall ever favoriting it, except when I tried favoriting it and unfavoriting it to get rid of it (this did nothing), so I believe it should not be listed as a favorite under any of my accounts (the question also says 0 users have marked it as a favorite). Is this a bug?  If not, what is going on? Note:  (now deleted) since I originally thought is appeared as a favorite on my Math SE account, but I didn't get any answers.


The Architect says that The One must choose 23 people (16 female, 7 male) to create new Zion.     After which, you will be required to select from the Matrix 23 individuals - 16 female, 7 male - to rebuild Zion.   At first, it seems unfair for males, but again, wouldn't females go haywire if current nature (of sense of security in relationship) is taken into account?  Why exactly this unequal number was chosen? Even if you see females more important in reproduction, you just need one male (or, an extra for backup, in case).

So, re-reading this:     After which, you will be required to select from the Matrix 23 individuals - 16 female, 7 male - to rebuild Zion.   It got me thinking - why exactly this ratio (and why exactly on that scale)?  Is it based on some out-of-universe scientific research for optimal seed population? Was there some in-universe explanation for the peculiar non-1-to-1 ratio?  I am fine with out-of-universe answers, but would prefer those backed by specific data (or in-universe answers based on canon material, or words from franchise workers), as opposed to pure unfounded guesses.


I'm trying to understand taxes as they relate to investments in the United States of America. I've been reading online about capital gains/losses taxes and I'm a bit uncertain how taxes are determined exactly. Take the following example: Say in the same tax year I bought and sold stock from three different companies, Company A, Company B, and Company C. My investments in Company A & Company B did well and I made $5,000 from each investment. Where my investment into Company C did not do well and I sold at a loss of $5,000. I originally thought this would net a total taxable gain of $5,000. Tax Outcome 1 Company A gain ($5,000) + Company B Gain ($5,000) - Company C Loss ($5,000) = $5,000 capital gain However, I've read in other places that you can only claim a total of $3,000 in capital losses per year and any loss over the $3,000 would have to be carried forward in to the next years taxes. Which given this scenario would result in paying taxes on $7,000 and carrying forward $2,000 of losses into the next year. Tax Outcome 2 Company A gain ($5,000) + Company B Gain ($5,000) - Company C Loss ($3,000) = $7,000 capital gain + $2,000 carry forward tax loss Can anyone tell me which tax outcome (1 or 2) is the correct assumption?

Lets say I have online brokerage A providing me with an individual (non-retirement) investment account. Call it X. I also have a Forex account, call it Y. If I make $500 in X, and -$300 in Y on the year do I owe that income tax as net $200? Or just on $500? What if it was absurd and was x=600 and Y=-4000? Would I still owe taxes on $600? I would imagine it has to be net, right? Obviously ignoring the stuff like different tax brackets, short vs long term capital gains, etc...


This is a follow up question based off of .    I have a line feature class representing storm drains and a point feature class representing where storm drains are connected.  The point feature class has an elevation for each point allowing me to determine the slope of the storm drain as the difference in elevation from start to end divided by the length of the storm drain.  However, most of my points act as starting points for one storm drain and end points for another at the same time.  I do know that the start point should always be the point with a higher elevation to facilitate water flow.  How can I calculate the slope for each line segment and designate which points are the start/end points for each line?  Would it be better to calculate new lines based off of my points layer that would include a slope field or is there a way to automate this calculation between the two layers?  I have an ArcMap Advanced license but no 3D or Spatial analyst extensions.  I am open to Python and QGIS solutions.  I just don;t want to have to enter these values in manually as I know there must be a way to automate it.

I have two shapefiles, Point and Polyline. I'm trying to populate my polyline layer with the point data ID (systemID) where the lines start to where they end; eg. create two columns (from and to). The lines already have flow direction assigned to them. I am using ArcHydro tools but Arcpy is also fine.  In ArcHydro I have tried using Attribute Tools > Generate From/To Nodes for lines but it creates values for To and From that are not from my point data. My other alternative was using Feature to Vertices and joining the result to my point data table to get the systemID. But then I would have to update the polyline layer as well. I am sure there is a easier way of doing it.  Note: not all the lines have points at the vertices, blank values are fine for them.


Let $f: \mathbb{C} \rightarrow \mathbb{C}$ be an analytic function and let $a \in \mathbb{R}$. Show that if $\Re f(z) \geq a$ for all $z \in \mathbb{C}$, then $f$ is constant.    Now I know that I need to use the Liouville's theorem, to get the partials in respect of $(x,y)$: $u_x=v_y$ and $u_y=-v_x$.  The problem I'm stuck with is what $f$ should be. Will I use $f(z)= u(x,y)+iv(x,y)$?

Greets  This is exercise 15.d chapter 3 of Stein & Shakarchi's "Complex Analysis", they hint: "Use the maximum modulus principle", but I didn't see how to do the exercise with this hint rightaway, instead I knew how to do it with the Casorati-Weiestrass Theorem, here is my answer:  Define $g(z)=f(1/z)$ for $z\neq{0}$,then by the hypothesis we must have that for any $\epsilon>0$ $g(D_{\epsilon>0}(0)-\{0\})$ is not dense in $\mathbb{C}$, then the singularity at $0$ of $g$ is not essential, this implies $f$ must be a polynomial, but if $f$ is a non-constant polynomial, it is easy to see that its real part must be unbounded, so $f$ must be constant.  I would like to know an answer with the the maximum modulus principle.  Thanks


I came across this equation   $$\sqrt a-\sqrt b=\sqrt 7-\sqrt 5$$  And you have to find the value of '$a$' and '$b$' when both of them are primes. The solution was $a=7, b=5$.  Now, my question is, can't there be any other primes?

I need to find a way of proving that the square roots of a finite set    of different primes are linearly independent over the field of    rationals.    I've tried to solve the problem using elementary algebra  and also using the theory of field extensions, without success. To  prove linear independence of two primes is easy but then my problems  arise. I would be very thankful for an answer to this question.


hello everyone I'm using a windows server 2016 as web server that runs a WebLogic application on a specific port (7001) and I have almost done every thing I know or I read about on the internet to protect  my web server using third party software like Kaspersky ,Spy Hunter ,Firewall issues, autoruns etc.. I'm very confused Kaspersky is always running how it would be stopped and allow the hack tool to encrypt all the data ? for the third time I'm getting hacked and I don't know why ! where is the problem I'm sure 100% its not an inside job ! what should I do , any recommendations ?

This is a  about Server Security - Responding to Breach Events (Hacking)   See Also:                  Canonical Version I suspect that one or more of my servers is compromised by a hacker, virus, or other mechanism:   What are my first steps? When I arrive on site should I disconnect the server, preserve "evidence", are there other initial considerations? How do I go about getting services back online? How do I prevent the same thing from happening immediately again? Are there best practices or methodologies for learning from this incident? If I wanted to put a Incident Response Plan together, where would I start? Should this be part of my Disaster Recovery or Business Continuity Planning?   Original Version       2011.01.02 - I'm on my way into work at 9.30 p.m. on a Sunday because our server has been compromised somehow and was resulting in a    attack on our provider. The servers access to the Internet   has been shut down which means over 5-600 of our clients sites are now   down. Now this could be an FTP hack, or some weakness in code   somewhere. I'm not sure till I get there.      How can I track this down quickly? We're in for a whole lot of   litigation if I don't get the server back up ASAP. Any help is   appreciated. We are running Open SUSE 11.0.            2011.01.03 - Thanks to everyone for your help. Luckily I WASN'T the only person responsible for this server, just the nearest. We managed   to resolve this problem, although it may not apply to many others in a   different situation. I'll detail what we did.      We unplugged the server from the net. It was performing (attempting to   perform) a Denial Of Service attack on another server in Indonesia,   and the guilty party was also based there.      We firstly tried to identify where on the server this was coming from,   considering we have over 500 sites on the server, we expected to be   moonlighting for some time. However, with SSH access still, we ran a   command to find all files edited or created in the time the attacks   started. Luckily, the offending file was created over the winter   holidays which meant that not many other files were created on the   server at that time.      We were then able to identify the offending file which was inside the   uploaded images folder within a  website.      After a short cigarette break we concluded that, due to the files   location, it must have been uploaded via a file upload facility that   was inadequetly secured. After some googling, we found that there was   a security vulnerability that allowed files to be uploaded, within the   ZenCart admin panel, for a picture for a record company. (The section   that it never really even used), posting this form just uploaded any   file, it did not check the extension of the file, and didn't even   check to see if the user was logged in.      This meant that any files could be uploaded, including a PHP file for   the attack. We secured the vulnerability with ZenCart on the infected   site, and removed the offending files.      The job was done, and I was home for 2 a.m.            The Moral   - Always apply security patches for ZenCart, or any other CMS system for that matter. As when security updates are released, the whole   world is made aware of the vulnerability.   - Always do backups, and backup your backups.   - Employ or arrange for someone that will be there in times like these. To prevent anyone from relying on a panicy post on Server   Fault.


I am running Windows 7 Home Premium (64-bit). I remember the days when on Windows 95 it was possible to cause programs to launch once the system had finished booting by placing a link to such applications in a folder known as the Startup folder. On my system there seems to be such a folder, namely C:\Users\MyUserNameHere.MyPCNameHere\AppData\Roaming\Microsoft\Windows\Start Menu\Programs\Startup, but it is empty despite the fact that several programs on my system load into memory once the PC has finished booting up.  What I would like to know is, on Windows 7, to have an application start up automatically after system boot, is it necessary to find the relevant option in the application itself and enable/disable it via the application's GUI, or is there also some other place on the system which can be used to control this behavior, listing every application for which can have this functionality enabled/disabled. Also, is the Startup folder nowadays an obsolete feature, or is it still possible/common to use it for starting applications automatically?  Thanks.

Is there an easy way to prevent programs (Such as Logitech and Windows Live) from starting up automatically when I turn on my computer? I rarely use these, and each time I start my PC, I have to manually exit the program (by right-clicking the system tray icon, or ending the process in the task manager).


Per the 's Wild Magic Surge table (PHB, p. 104)     07-08: You cast fireball as a 3rd-level spell centered on yourself.   There's other questionable area spells in that list (grease is a 10 foot square, so your square and which three?), but I'll focus on spheres like  (PHB p. 241):     (...) Each creature in a 20-foot-radius sphere centered on the point must (...)   My problem is, the sources I found so far - including the   to similar questions here - talk about measuring spheres from grid square intersections, whereas this clearly talks about it being centered on the unlucky Wild Magic sorcerer. Plus, since it's a wild magic effect, it doesn't exactly have a caster that can pick a point of origin. Is there an accepted way to measure an effect like this?

So last night, my D&D group ran into an interesting question. The spell Entangle says:     Area: plants in a 40-ft radius spread.    We (like a lot of people, I think) play D&D on a square grid, where each square represents a 5'x5' area. In that context, how do you find the area when you're given a radius?   The books seem unclear, probably since the definition of a radius is fairly simple. My suggestion was to treat it the way you treat range: start at the center, and any square you can get to with 8 five-foot 'steps' is affected. Someone else thought it should be a square that was 80'x80'; that is, a 'circle' that's 80 feet across, since a lot of other 'circles' in D&D are actually treated as squares. That's a simply huge area, though -- bigger than the board we use. We wound up using a 40x40 square, since my counting would take more time and the 80x80 square was huge. 40x40 was still big enough to encompass the entire fight.   My question: how does a radius measurement (and by extension, circles in general) work on a square grid?


I'm trying to set my application to launch DF.exe. If I double click the exe (running it normally), it launches fine, however if I try to do so from the launcher I'm creating, it can't find the files necessary for it to run, leading me to believe that it's finding the exe and running it using the wrong directory. This is what my code looks like: string DFPath = "0.47.04\\DF.exe"; System.Diagnostics.Process.Start(@DFPath);

I'm firing off a Java application from inside of a C#  console application. It works fine for the case where the Java application doesn't care what the "default" directory is, but fails for a Java application that only searches the current directory for support files.  Is there a process parameter that can be set to specify the default directory that a process is started in?


I want to prove that the the $n$th Fibonacci number $f_n$ is the integer closest to $\frac{1}{\sqrt{5}}(\frac{1+\sqrt{5}}{2})^n$. What would be a rigorous way to go about this? I assume I'll have to use a recurrence relation and maybe Binet's Forumla. I just don't know how to go about tying it all together, so any advice on how to proceed would be much appreciated.

Prove that the $n$th Fibonacci number $f_n$ is the integer that is closest to the number $$\frac{1}{\sqrt{5}}\left( \frac{1 + \sqrt{5}}{2} \right)^n.$$   Hi everyone, I don't really understand the problem. I have the following hint, but I don't know how to work it.     Hint: Show that the absolute value of $\frac{1}{\sqrt{5}}\left( \frac{1 - \sqrt{5}}{2} \right)^n$ is less than $1/2$.


Please check my proof   The original problem ask to determine sinx is uniformly continuous on$(-\infty, \infty )$ and if it is, Prove it   I think this function is uniformly continuous   Ok let do it .  Let $\epsilon ,\delta >0 $  $$|x-y|<\delta \rightarrow |f(x)-f(y)<\epsilon $$  $$     \rightarrow |sinx-siny|<\epsilon $$  Use identity  $$     \rightarrow |2cos(\frac{(x+y)}{2})sin(\frac{(x-y)}{2})|$$  $$     \rightarrow cos(\frac{(x+y)}{2})sin(\frac{(x-y)}{2})<\frac{\epsilon }{2}|$$  Choose $\delta =\frac{\epsilon }{2}$  then  $$ |x-y|<\delta \rightarrow 2|cos\frac{(x+y)}{2}sin\frac{(x-y)}{2}|<2\frac{\epsilon }{2}|=\epsilon $$  Then the function is uniformly continuous on$(-\infty ,\infty )$

How do I prove $\sin x$ is uniformly continuous on $\mathbb R$ with delta and epsilon?   I proved geometrically that $\sin x<x$ and thus, $$|f(x_1)-f(x_2)|=|\sin x_1 - \sin x_2|\le|\sin x_1|+|\sin x_2|<|x_1|+|x_2|$$   But this doesn't help me much finding a delta...   Thanks for any help!  P.S. I'm only at the beginning of calculus so I can't use many theorems and derivation  (because they haven't been regorously proven).


I wonder if there is a difference between these:  ArrayList<Example> list = new ArrayList<Example>   1-)  for(int i = 0; i < list.size(); i++) {     list.get(i).doSomething(); }   2-)  for(Example example : list) {     example.doSomething(); }   If there is not any difference which one is more common or efficient?

Consider:  List<String> someList = new ArrayList<String>(); // add "monkey", "donkey", "skeleton key" to someList     for (String item : someList) {     System.out.println(item); }   What would the equivalent for loop look like without using the for each syntax?


\begin{equation} \begin{aligned} f(h) = \pi h^3 -9\pi h^2 +90\\ f'(h) = 3\pi h^2 -18\pi h\\ h_{n+1} = h_n-\frac{f(h_n)}{f'(h_n)}\\ h_{n+1} = h_n - \frac{\pi h_n^3 -9\pi h_n^2 +90}{3\pi h_n^2 -18\pi h_n}\\ h_{n+1} = \frac{3\pi h_n^3 - 18\pi h_n^2 - \pi h_n^3 -9\pi h_n^2 +9}{3\pi h_n^2 -18\pi h_n}\\ h_{n+1} = \frac{2\pi h_n^3-9\pi h_n^2-90}{3\pi h_n^2-18\pi h} \end{aligned} \end{equation}   What do I do to center my equations in these case?

What is the way to achieve something between gather and aligned? \documentclass[12pt]{article} \usepackage{amsmath} \usepackage{amssymb} \usepackage[utf8]{inputenc}  \begin{document} \begin{gather}     3(a-x) = 3.5x + a - 1 \\     3a - 3x = 3.5x + a -1 \\     a = \frac{13}{4}x - \frac{1}{2}  \end{gather}  \begin{equation}     \begin{aligned}         3(a-x) = 3.5x + a - 1           \\         3a - 3x = 3.5x + a -1           \\         a = \frac{13}{4}x - \frac{1}{2}      \end{aligned} \end{equation} \end{document}  Result:  But... How to achieve something like this? I'd like to keep the centering.  Is this possible somehow?


When I open MS Paint (Win 8), the default border thickness is set to the thickness depicted in the picture.    Is there a way to change the default rectangle border thickness?

After closing paint the last used settings went back to default. I want them to be saved. Like the selected Brush-Tool, Color, Line-strength, etc.  Either after every usage or I define one I use most. Maybe through the registry or by start parameters?


$query = "SELECT id,subject,date,notice from sam_notice ORDER BY id DESC LIMIT 1";$result = $conn->query($query);   This query pulls the last one only and i can view in  section 1  $query2 = "SELECT id,subject,date,notice from sam_notice ORDER BY id DESC";$result2 = $conn->query($query2);   This query pulls all data to view in  section 2  What is the change i need in query2  so that it can pull all data except the last one?

I would like to construct a query that displays all the results in a table, but is offset by 5 from the start of the table. As far as I can tell, MySQL's LIMIT requires a limit as well as an offset. Is there any way to do this?


I am using Location Fused Provider in my app and I want to send latitude and logitude in Firebase Upstream message from Main activity to the DashBoard Fragment where I have button for upstream message. I have posted similar question, but this is not duplicate. My question is why I get null pointer exception?  This is my method in mainActivity which should pass data:  private void updateUI(){         if(null!=mCurrentLocation){              String lat=String.valueOf(mCurrentLocation.getLatitude());             String lot=String.valueOf(mCurrentLocation.getLongitude());             Bundle bundle=new Bundle();             bundle.putString("KEY_LAT", lat);             bundle.putString("KEY_LNG", lot);             DashboardFragment dashboardFragment=new DashboardFragment();             dashboardFragment.setArguments(bundle);  }   And this is the part of DashBoardFragment where I should put latitude and longitude:  public void getObjectEvent(EventModel data){     String longitude;     longitude=getArguments().getString("KEY_LNG");     Log.d("LONGITUDE", "Longitude is: " + longitude);     Gson data_json = new Gson();     String json=data_json.toJson(data);     FirebaseMessaging fm=FirebaseMessaging.getInstance();     fm.send(new RemoteMessage.Builder(SENDER_ID + "@gcm.googleapis.com")             .setMessageId(UUID.randomUUID().toString())             .addData("action","message")             .addData("data","{\"message\":\"Upstream Message\"}")             .addData("object", json)             .addData("longitude", longitude)             .build());   }   And this is my null pointer:  08-08 14:17:12.755 13165-13165/com.telnet.asp E/AndroidRuntime: FATAL EXCEPTION: main                                                                java.lang.NullPointerException at com.telnet.asp.presentation.view.fragments.DashboardFragment.getObjectEvent(DashboardFragment.java:125) at com.telnet.asp.presentation.view.adapters.DashboardGridAdapter.getDataObject(DashboardGridAdapter.java:145) at com.telnet.asp.presentation.view.adapters.DashboardGridAdapter$3.onClick(DashboardGridAdapter.java:128) at android.support.v7.app.AlertController$ButtonHandler.handleMessage(AlertController.java:157) at android.os.Handler.dispatchMessage(Handler.java) at android.os.Looper.loop(Looper.java) at android.app.ActivityThread.main(ActivityThread.java) at java.lang.reflect.Method.invokeNative(Native Method) at java.lang.reflect.Method.invoke(Method.java:525) at com.android.internal.os.ZygoteInit$MethodAndArgsCaller.run(ZygoteInit.java) at com.android.internal.os.ZygoteInit.main(ZygoteInit.java) at dalvik.system.NativeStart.main(Native Method)   Could anyone help me? Thanks in advance.

What are Null Pointer Exceptions (java.lang.NullPointerException) and what causes them?  What methods/tools can be used to determine the cause so that you stop the exception from causing the program to terminate prematurely?


import requests import json   session = requests.session()  headers = {     'Accept-Encoding': 'gzip, deflate, br',     'Accept-Language': 'en-US,en;q=0.9',     'Upgrade-Insecure-Requests': '1',     'User-Agent': 'Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/64.0.3282.167 Safari/537.36',     'Accept': 'text/html,application/xhtml+xml,application/xml;q=0.9,image/webp,image/apng,*/*;q=0.8', }   def ATCbuilder():     global session     response = session.get("https://www.glidesoftwares.com/products.json", headers=headers)     data = json.loads(response.text)     stock = data['products'][0]['variants'][0]['available']     variant = data['products'][0]['variants'][0]['id']     atclink = 'https://www.glidesoftwares.com/cart/{}:1'.format(variant)     print(atclink)      IndentationError: unindent does not match any outer indentation level   why??

When I compile the Python code below, I get      IndentationError: unindent does not match any outer indentation level     import sys  def Factorial(n): # Return factorial     result = 1     for i in range (1,n):         result = result * i     print "factorial is ",result     return result   Why?


I just ordered a NAS from synology and I'm looking at hard drives.  What exactly are the benefits of NAS HDDs? I understand that they tend to be running at lower RPM to reduce heat, but obviously I can just buy a lower speed internal drive. Are NAS drives better for hot swappable applications? My NAS will be running 24/7 in RAID 1, but I don't expect I'll be accessing it a lot, it will be mostly for backups of pictures etc.

When I assembled my current system two years ago, I bought a Crucial M4 128 GB SSD, which was truly worth its price and I bought a Samsung EcoGreen 2 TB HDD, primarily for storing large media data like movies etc. This was likewise the last time being up to date about the actual market situation.  I've just been checking out the most recent releases on the hard disk market, because my EcoGreen gave up a couple of days ago.  I just grabbed dat cheap EcoGreen, because HDD's in 2011 were pretty cheap anyways. Green was in and the market was just flooded with a vast variety of different models being worth their price. There was a lot of silly stuff out there either: green monitors, green power supplies, even green USB flash drives. Despite the EcoGreen gave up after 2 years, I don't regret buying it at all. It's still the cheapest disk space, I've ever bought.  I might get a new EcoGreen, because its 3 years warranty didn't expire yet, nevertheless I searched for potential ones to buy, which might have released in the past two years. And pretty early I found the .  Here what Western Digital writes about their product:        Compatibility: Desktop hard drives are not always tested for compatibility in NAS and can present problems during integration.    Reliability: Most desktop drives are not designed for the high operating temperatures or for 24x7 operating environments making them   less reliable when used in a NAS system.    Error recovery controls: Desktop drives are not traditionally designed for RAID environments and have controls that prevent the RAID   controller from assisting in the event of an error which can cause the   hard drive to drop off the RAID after a period of time.  Rebuilding a   RAID often requires several hours and can have a significant impact on   downtime and productivity.    Noise and vibration: Typically designed for single drive applications, average desktop drives are not optimized for multi-drive   systems which have higher noise and vibration levels. When these   drives are added to a NAS, the additional vibration can reduce the   reliability and life span of the drive.      Since I always thought a system's overall power consumption is impacted by the HDD power consumption at least, I'm suspicious if this might not be another hype? EcoGreen's were about 0.5W more efficient over desktop HHD's, or am I wrong informed? Or am I completely wrong and EcoGreen was not even a hype? I have to admit, that purchasing the EcoGreen already made me expect not such a huge benefit from getting a green one. It's been solid, but nothing special.  What do you think about this?


How can I make google display the number of search results from my website on google search results page.  The highlight yellow shows the number of search results. How can I make it happen for my website as-well?

I'm trying to get the following kind of markup appear on my job site:     There's a  for job adverts listed on the schema.org webpage, but I can't work out how Google is pulling the 1 - 20 of 23229 from the Monster webpage.  I'm presuming the jobs tag is because they use microdata markup for all their adverts, but how is Google pulling the numbers?  There is a specific page tag for search results (), however it doesn't seem to have any relevant options and as far as I can tell Monster aren't using it anyway.  (A search for monster jobs china should show the result)


Noob(ish) to Linux here, and trying to pick up new/useful tricks; I was wondering if there's some way to send the output of a command straight to the clipboard? Something similar to (pseudo-code): dircolors --print-database > clipboard

How to copy the contents of a file in UNIX without displaying the file contents. I don't want to cat or vi to see the contents.  I want to copy them to clipboard so that I can paste it back on my windows notepad.  I can't copy the file from that server to another due to access restrictions.


I referred this link () but i can't get the answer by applying those steps ,can anyone explain please?  let sum = 5; function sumTo(n) {      if(n==1) return n;     else {         return sum + sumTo(n-1);     } } let ss = sumTo(5);

Whilst starting to learn lisp, I've come across the term tail-recursive. What does it mean exactly?


My computer is a (brand new) PC notebook, without a CD drive running Windows 7. I followed this page to install from USB:   The installation went well and i am using Ubuntu now (v. 12.04 i believe)  I want to be able to dual boot Ubuntu and Win7 The problem is that the disc partitioning during the Linux install caused a problem with Windows, caused some problem with windows, and windows can no longer boot when i choose it at the GNU GRUB screen.  When i restart my computer i can successfully boot Linux, but not Windows 7. At the GRUB screen - if i run Win7 normally, it freezes, shows a blue screen, and returns back to GRUB - if i run Win7 recovery, i dont know how to access the files that i need in order to run windows again, so nothing helpful happens.  Can you please tell me what i would need to do(or link a guide) in order to run Windows again. (Windows and Linux is preferable, but if thats impossible going back to only Windows will help too)  Im guessing the easiest thing to do is just to reinstall both OS, or is there anyway to undo the partition i made during the install?  Thanks

I installed Windows on my computer, followed by an installation of Ubuntu. However, now I'm unable to boot into my Windows install.  What can I do to fix this?


I have a problem with the c function 'strcpy' that I have not been able to figure out.  it involves copying to a char *[]  like Argv (but not actually Argv). I can copy out of the structure but not in.  But only if I initially declare the entire Argv Structure in a single go.  I assume that a char *[] is and array of char*.  Here is a simple demo program of the issue:  #include <stdio.h> #include <stdlib.h> #include <string.h>  char FN[]="BBBB";     char *TL[]={  "a0                ",  "a1                ",  "a2                ",  "a3                ",  "a4                ",  "a5                "};   char BN[]="c1                    ";   char N0[]="N0                    ";  char N1[]="N1                    ";  char N2[]="N2                    ";  char N3[]="N3                    ";  char N4[]="N4                    ";  char N5[]="N5                    ";   char* TD[6];     int main ( int argc, char *argv[] )  {      // FN is a pointer to an array of chars     // BN is the same      //TL is an array of pointers (that each point to an array of chars)      //TL[1] is thus a pointer to an array of chars      //TL is the same structure as Argv      //TD is the same structure as Argv  (but built up from parts)     //  but is spread out across the globals and the main func.     //  thus less easy to read and understand then TL.      //TL[i], TD[i], and BN are initially allocated significantly larger than FN     //  to remove the worry of overruns.      //copy "a1                \0" into the space held by "c1   "     strcpy(BN,TL[1]); //works      //copy "BBBB\0" into the space held by "c1   "     strcpy(BN,FN); //works      TD[0]=N0;     TD[1]=N1;     TD[2]=N2;     TD[3]=N3;     TD[4]=N4;     TD[5]=N5;      //copy "BBBB\0" into the space held by "a1   "     strcpy(TD[1],FN); //works      //copy "BBBB\0" into the space held by "a1   "     //strcpy(TL[1],FN); //dies    }

The following code receives seg fault on line 2:  char *str = "string"; str[0] = 'z';  // could be also written as *str = 'z' printf("%s\n", str);   While this works perfectly well:  char str[] = "string"; str[0] = 'z'; printf("%s\n", str);   Tested with MSVC and GCC.


Let's say, that I have a following example.com zone:  $TTL 120  @               IN      SOA     ns1     hostmaster (2018041509                                                     300                                                     150                                                     600                                                     60)                  IN      NS      ns1                 IN      NS      ns2   ns1             IN      A       192.168.0.159 ns2             IN      A       192.168.0.160  blah            IN      A       192.168.0.141   As seen above, ns1.example.com and ns2.example.com are two authoritative name-servers for that zone. When are they queried by other name-servers? As much as I tested, the only time when those two records were queried was when I asked for NS records from 192.168.0.159 with a DNS lookup utility, i.e dig @192.168.0.159 -t NS example.com.

If we have example.com we would setup things something like this: $ORIGIN example.com. @  1D  IN  SOA ns1.example.com. hostmaster.example.com. (                   2002022401 ; serial                   3H ; refresh                   15 ; retry                   1w ; expire                   3h ; nxdomain ttl                  )           IN  NS     ns1.example.com.           IN  NS     ns2.example.com.  since in the parent zone .com. there is already NS record for the example.com. child zone and A glue record for the ns1.example.com. for what purpose do we state NS records again in the child zone? and also, do we need to state A record for the name servers in the child zone itself?


In RAW postprocessing (independently of the software you use: Darktable, Lightroom Rawtherapee, One, ...) is the final result dependent on the order you use in applying the different modules?  I'm pretty sure that you should CROP first (if you need to) because you could cut out areas which suffer from over/under exposure; so you maybe would need to apply lighter corrections to avoid clipping.  NOISE REDUCTION should be the last thing because you will know the noise you introduce only at the end of all the processing.  What about all the other modules? Is there a preferable order?  (BTW: Am I right in supposing the explained order? Why not?)

I know it's best to do as much post-processing before converting from RAW, but in cases where it's not possible - what is the optimal order of post-processing steps (like noise removal, dust-spot removal, color correction, brightness/contrast correction, straighten, distortion/aberration removal, selective edits, sharpening, resize, color space and bit-depth change, etc)?  When I say optimal order I mean the order that will result the least banding, clipping, halos and other digital artefacts. I'd also like to understand the reasons behind some particular ordering. Is it different for prints and web output?


How to merge two or more rasters with values 0 and 1, where the value 1 does not overlap with other rasters. Finally, I want one raster file with pixel values 1 from all raster files as 1 and the rest 0.

I have 2 land cover rasters. I want to update parts of the first raster with values from the second using QGIS.  The workflow should be like this:  1. Select values equal to 30 and 34 in the first raster.  2. Check if there is a value at the corresponding pixel in the second raster.  3. If there is a value in the second raster and it is different from 0,    change the value in the first raster to the value of the second raster.  4. If not, do nothing.   How should I proceed to achieve such updating tasks? I think raster calculator is not supporting conditional statements, so I'm not sure how I can do that.


I am looking for a general formula for $$D_n=\frac{d^n}{dx^n}x^x$$ Here's what I've gotten so far:  $n=0$: $$D_0=x^x$$ $n=1$: $$D_1=x^x(\log x+1)$$ $n=2$: $$D_2=x^{x-1}+x^x(1+2\log x+\log^2 x)$$ And then I gave up. But I would be surprised if there wasn't a general formula.   In any case, I am trying to find $D_n$ so that I can create a Taylor series for $x^x$. If this isn't the way to go, please point me in the right direction or give me a series representation for $x^x$

What would be the $n$th derivative of   $ f (x) = x ^ x$  I have reached the fifth derivative, very long indeed but I see no pattern that will help me find a general expression.  \begin{align*} \frac{df}{dx} &= x^x(1+\ln(x))\\ \frac{d^2f}{dx^2} &= x^x\left(\frac{1}{x}+1+2\ln(x)+\ln(x)^2\right)\\ \frac{d^3f}{dx^3} &= x^x\left( \frac{-1}{x^2}+\frac{3}{x} + \ln(x)^3 + 3 \ln(x)^2 + \frac{3\ln(x)}{x} + 3\ln(x) + 1 \right)\\ \frac{d^4f}{dx^4} &= x^x\left( \frac{2}{x^3}-\frac{1}{x^2}-\frac{4\ln(x)}{x^2}+\frac{6}{x}+\ln(x)^4+4\ln(x)^3\right.\\ &\qquad\qquad\left.+\frac{6\ln(x)^2}{x}+6\ln(x)^2+\frac{12\ln(x)}{x}+4\ln(x)+1 \right)\\ \frac{d^5f}{dx^5} &= x^x\left( \frac{-6}{x^4}+\frac{10\ln(x)}{x^3}+\frac{5}{x^2}-\frac{10\ln(x)^2}{x^2}+\frac{10}{x}+\ln(x)^5+5\ln(x)^4\right.\\ &\qquad\qquad\left.+\frac{10\ln(x)^3}{x}+10\ln(x)^3+\frac{30\ln(x)^2}{x}+10\ln(x)^2+\frac{30\ln(x)}{x}+5\ln(x)+1 \right) \end{align*}


#include <cstdio> #include <string>  std::string foo() {     return "Hello, World!"; }  int main() {     printf( "%s\n", foo().c_str() ); }

Does C++ provide a guarantee for the lifetime of a temporary variable that is created within a function call but not used as a parameter?  Here's an example class:  class StringBuffer { public:     StringBuffer(std::string & str) : m_str(str)     {         m_buffer.push_back(0);     }     ~StringBuffer()     {         m_str = &m_buffer[0];     }     char * Size(int maxlength)     {         m_buffer.resize(maxlength + 1, 0);         return &m_buffer[0];     } private:     std::string & m_str;     std::vector<char> m_buffer; };   And here's how you would use it:  // this is from a crusty old API that can't be changed void GetString(char * str, int maxlength);  std::string mystring; GetString(StringBuffer(mystring).Size(MAXLEN), MAXLEN);   When will the destructor for the temporary StringBuffer object get called?  Is it:   Before the call to GetString? After GetString returns? Compiler dependent?   I know that C++ guarantees that a local temporary variable will be valid as long as there's a reference to it - does this apply to parent objects when there's a reference to a member variable?  Thanks.


I installed Ubuntu 14.04 on my sons computer, then through Ubuntu Software Center purchased MyCraft.  I received an email confirmation of the purchase, but no Product Key or download information.  How do I get and install this?

Hi I purchased and attempted to download MyCraft, but there was an error in the download.  No option to attempt another download, just offer to buy again.  Suggestions?


In ZFC Set Theory, "the set of all sets" famously doesn't exist since it leads to Russell's Paradox. Clearly, there are other constructions that also don't exist like "the set of all non-empty sets" for the same reason.  I want to be able to prove whether a "described" set exists or not.  For example, "the set of all sets that contain natural numbers" $(\mathcal{P}(\mathbb{N}))$ does exist, while "the set of all tuples $(a,b)$ where $a$ and $b$ are sets" does not exist (I think).  Intuitively, it seems that an injection could be used similarly to a proof about the cardinality of a set. I.e., if there is an injection from the universal set to the set $A$, then $A$ is not a set because it has "more" elements (a higher or equal cardinality) than the universal set.  For example, is this a valid proof?:     Let $U$ be the universal set   Suppose $A=\{(a,b)\ |\ a$ and $b$ are sets$\}$ exists   $\forall u\in U$, let $f(u)=(u,\emptyset)$   Then $f$ is an injection from $U$ to $A$   $\therefore A$ does not exist   Is this logic a valid way of showing that a set doesn't exist? I don't think this proof is correct since this it uses the universal set. But is there another way to express the same logical reasoning? Are there any "describable" but non-existent sets that cannot be shown to not exist by this logic? And of course, is there a better general way to show that a "describable" set doesn't exist?

I'm wondering whether or not there is a definite criterion for determining whether a collection of objects is a set. In the literature, I've recently encountered some obscure examples (in Riemann Surface Theory, to be precise) of naturally-arising collections of objects which are not sets.   Here is some pseudo-rigor to make the question more precise:   Let $S$ be a collection of objects. Is there some property $P$ so that $S$ is a set iff $S$ has property $P$?


Let $A \in Mat(2\times 2, \mathbb{Q})$ be a matrix with $AB = BA$ for all matrices $B \in Mat(2\times 2, \mathbb{Q})$.  Show that there exists a $\lambda \in \mathbb{Q}$ so that $A = \lambda E_2$.    Let $E_{ij}$ be the matrix with all entries $0$ except $e_{ij} = 1$.  $$ \begin{align} AE_{11} &= E_{11}A \\ \left( \begin{array}{cc} a_{11} & a_{12} \\ a_{21} & a_{22} \\ \end{array} \right) \left( \begin{array}{cc} 1 & 0 \\ 0 & 0 \\ \end{array} \right) &= \left( \begin{array}{cc} 1 & 0 \\ 0 & 0 \\ \end{array} \right) \left( \begin{array}{cc} a_{11} & a_{12} \\ a_{21} & a_{22} \\ \end{array} \right) \\ \left( \begin{array}{cc} a_{11} & 0 \\ a_{21} & 0 \\ \end{array} \right) &= \left( \begin{array}{cc} a_{11} & a_{12} \\ 0 & 0 \\ \end{array} \right) \\ \end{align} $$  $\implies a_{12} = a_{21} = 0$  And then the same for the other three matrices $E_{12}, E_{21}, E_{22}$ …  I guess it's not the most efficient way of argueing or writing it down … ? Where's the trick to simplify this thingy?

The question is from Axler's "Linear Algebra Done Right", which I'm using for self-study.  We are given a linear operator $T$ over a finite dimensional vector space $V$. We have to show that $T$ is a scalar multiple of the identity iff $\forall S \in {\cal L}(V), TS = ST$. Here, ${\cal L}(V)$ denotes the set of all linear operators over $V$.  One direction is easy to prove. If $T$ is a scalar multiple of the identity, then there exists a scalar $a$ such that $Tv = av$, $\forall v \in V$. Hence, given an arbitrary vector $w$, $$TS(w) = T(Sw) = a(Sw) = S(aw) = S(Tw) = ST(w)$$ where the third equality is possible because $S$ is a linear operator. Then, it follows that $TS = ST$, as required.  I am, however, at a loss as to how to tackle the other direction. I thought that a proof by contradiction,  ultimately constructing a linear operator $S$ for which $TS \neq ST$, might be the way to go, but haven't made much progress.   Thanks in advance!


I downloaded a big data file (others.tgz, some 30GB) from an ftp site.  I did   tar -zxvf others.tgz   some files were extracted ( four files, where it is supposed to have 6 files ) after that it came out throwing the error,  gzip: stdin: unexpected end of file tar: Unexpected EOF in archive tar: Unexpected EOF in archive tar: Error is not recoverable: exiting now   Any suggestions please.

I have downloaded eclipse-platform-3.7-linux-gtk-x86_64.tar.gz.  Using Ubuntu 10.10  64-bit on Intel 64-bit processor.  While trying to unpack the contents (either double-click or right-click & open-with-archive-manager) I get this error:  gzip: stdin: unexpected end of file
 tar: Unexpected EOF in archive
  tar: Error is not recoverable: exiting now   Is there any remedy to repair it? or is the downloaded file corrupt & needs to be re-downloaded?


I was asked to create a mobile application to display datas.  Problem is that the person who created the wireframes was clearly thinking on a website rather than a mobile app. Many people use cardview or listview these days.  I'm trying to come up with a better solution to display that information. However I'm having trouble figure that out.    Some tables can be 48 lines.  Which way is the best solution for showing this table on mobile application?

Related to , I'm interested in what I should do with a responsive design theme where the users have control over the columns which are displayed in a tabular, data rich page. Users are able to manipulate which columns are displayed, so I can't just limit the data to a few columns, as the other question's answers suggest. A potential work-around is to have a custom "mobile" query set up with pre-defined columns which I design for, but I can't control whether the users use this view or not. Right now, I just have each column in each row stacking on top of each other and centered. I think this is not a very good design, as it wastes space and doesn't look organized. How should I best tackle this problem? Desktop:  Mobile View:


Prove by mathematical induction that  $$\forall n \geq 4 \in \mathbb{N}: 3n^2 + 3n +1 < 2(3^n)$$  Step 1: Show that the statement is true for n = 4:  $$3(4)^2 + 3(4) +1 < 2(3^4)$$  Which simplifies to $61 < 162$. That completes the base case.  Step 2: Show that if the statement is true for $n = p$, it is true for $n = p + 1$:  $$3(p+1)^2 + 3(p+1) + 1 =$$ $$3(p^2 + 2p + 1) + 3p + 3 + 1 =$$ $$3p^2 + 3p + 1 + 6p + 6$$ $$ < 2(3^p) + 6p + 6$$  All that is required now is to show that $6p + 6 \leq 4(3^p)$ since $2(3^{p+1}) = 6(3^p)$. Does this require another proof by mathematical induction or is it sufficiently rigorous to say something like "well, $x^p$ clearly grows faster than $px$ as $p$ approaches infinity, so the inequality is trivial"?  In a larger context, are there any specific rules for when inequalities can be considered trivial?

Prove by mathematical  induction that:   $$\forall n \in \mathbb{N}: 3^{n} > n^{3}$$  Step 1: Show that the statement is true for $n = 1$:  $$3^{1} > 1^{3} \Rightarrow 3 > 1$$  Step 2: Show that if the statement is true for $n = p$, it is true for $n = p + 1$  The general idea I had was to start with $(p+1)^{3}$ and during the process substitute in $3^{p}$ for $p^{3}$ as an inequality.  $$(p+1)^{3} = p^{3} + 3p^{2} + 3p + 1 < 3^{p} + 3p^{2} + 3p + 1$$  Now, if it can be shown that:  $$\forall p \in \mathbb{N}: 3p^{2} + 3p + 1 \leq 2 \cdot 3^{p}$$  ...the proof is complete. This is because $3^{p+1} = 3 \cdot 3^{p}$ and one of those three have already been used.   We do this by mathematical induction. First, the base case of $n = 1$:  $$3\cdot 1^{2} + 3 \cdot 1 + 1 \not \leq 2 \cdot 3^{1}$$  ..which turns out to be false.  What are some more productive approaches to this step?


Stack Overflow is great. I see there are Stack Exchange sites that cover other domains.     Is there a Stack Overflow that a company could run internally?

Is the Stack Exchange engine that powers Stack Overflow available to download or install internally for an enterprise or company?  I think Stack Exchange's engine is very great and could be very cool to use for internal enterprise patterns and practices, like the engine of Wikipedia.


i have a pair of servers. A local server for development and a remote vps for deployment. I'm copying the project from the local server to the remote and i have problem with the charset. I have yet setupped the UTF-8 in the head of the HTML document. The text with this error is picked by a SQL Query. Where is the problem? The first image is the local server without error  The second image is the remote server with encoding error

I'm setting up a new server and want to support UTF-8 fully in my web application. I have tried this in the past on existing servers and always seem to end up having to fall back to ISO-8859-1.  Where exactly do I need to set the encoding/charsets? I'm aware that I need to configure Apache, MySQL, and PHP to do this — is there some standard checklist I can follow, or perhaps troubleshoot where the mismatches occur?  This is for a new Linux server, running MySQL 5, PHP, 5 and Apache 2.


Let $X$ be a metrizable space. I'd like to prove that if $X$ is pseudocompact, then $X$ is compact (the converse is true by the Heine-Borel theorem). Suppose $X$ was not compact. Since $X$ is metrizable, we have that $X$ is not sequentially compact. Hence, there exists a sequence $\{x_n\}_{n\in\mathbb{N}}$ in $X$ such that $\{x_n\}_{n\in\mathbb{N}}$ doesn't have any convergent subsequences in $X$. Let $S$ be the support of the sequence $\{x_n\}_{n\in\mathbb{N}}$ and let $g: S\to\mathbb{R}$ the function defined by $g(x_n):=n$. Now I'd like to prove that $S$ is discrete. Why? Because if I will prove that $S$ is discrete, I had that $S$ contains vacuously its accumulation points, then $S$ is closed. Now the function $g:S\to\mathbb{R}$ is continuous (since $S$ is discrete). Hence, I can apply the Tietze Extension Theorem that tells me that $g$ can be extended to a continuous function $G:X\to\mathbb{R}$. But this function is not bounded since the restriction $G_{|S}=g$ is not bounded: this one is a contradiction with the hypothesis of pseudocompactness of $X$. Can anyone help me please? PS: "$X$ is pseudocompact" stands for "each continuous function $F:X\to\mathbb{R}$ is bounded".

Let $X$ be a metric space. Prove that if every continuous function $f: X \rightarrow \mathbb{R}$ is bounded, then $X$ is compact.  This has been asked before, but all the answers I have seen prove the contrapositive. Realistically, this may be the way to go, but is there way to exhibit an unbounded continuous function (under the assumption $X$ is not compact) without appealing to results beyond introductory real analysis (e.g., the solution I've seen involves the Tietze Extension theorem)?  Because we're working with metric spaces, it's clear that the assumption that $X$ is noncompact (towards proving contrapositive) will lead us to extract a sequence of points in the space with no convergent subsequences. But how can we infer the existence of an unbounded continuous on the space knowing only about some sequence of points in this space (without using anything too advanced)?


I don't think I understand the concept of sub-atomic particles very well. How can an electron or any sub-atomic particle have mass and spin if they are waves?

How can photons have different energies if they have the same rest mass (zero) and same speed (speed of light)?


I am using an old millennia desktop - here are the specs:   Cpu: Pentium III  866.4 MHz L1 Cache: 16K 8097 MB/s L2 Cache: 256K 3686 MB/s L3 Cache: none Memory: 320M 343 MB/s Chipset: VIA Apollo Pro/133/133A   I am trying to install 11.10 server because that is the latest non DVD operating system. However when i try it only gives me a blank screen and the 'Caps lock' and 'Scroll lock' keyboard lights flash.  I looked at the 11.10 requirements and it says I only need:  Ubuntu Server (CLI) Installation   300 MHz x86 processor 128 MiB of system memory (RAM) (256 MiB for a virtual installation) 1 GB of disk space Graphics card and monitor capable of 640x480 CD drive   what did i miss?

I'm thinking about installing Ubuntu Desktop, but I don't know what flavor is the best for my system. What are the minimum and recommended hardware requirements? What kind of CPU? How much memory? Should I have Hardware Acceleration? What flavor should I use?  This is an attempt of a canonical answer. My answers have the "official  requirements", the recommended are a mix of official sources and opinion based (along with the answer it's told the source). You can comment or edit if you feel that the information is obsolete or incomplete. It is a good rule of thumb that any system capable of running Windows Vista, 7, 8, x86 (Intel) OS X will almost always be a lot faster with any Ubuntu flavor even if they are lower-spec than described below.


I'm writing a report in Swedish and I have IEEE references using BibTex. The problem is that the program wants to use English words in references such as "[online]" and "available". I don't want those English words since the report is in Swedish.  Does anyone have a solution?  \documentclass[12pt, a4paper,swedish]{article} \usepackage[T1]{fontenc} \usepackage{babel} \usepackage{filecontents} \begin{filecontents}{IEEEabrv.bib} @ONLINE {regeringen, author = "Regeringskansliet", title  = "Mål för förnybar energi",  year   = "2014", url    = "http://www.regeringen.se/regeringens-politik/energi/fornybar-energi/mal-for-fornybar-energi/" } \end{filecontents} \usepackage[utf8]{inputenc} \usepackage[nottoc,numbib]{tocbibind} \bibliographystyle{IEEEtran}  \begin{document} \nocite{*} \bibliography{IEEEabrv.bib} \end{document}

I need to type a bibliography to my final graduation work (in brazilian portuguese) and I am facing a problem with BibTeX. Whenever I add in information like "Edition", it doesn't translate the word "Edition" to "Edição" when compiling. I've been trying to follow advices from other forums and I don't seem to be having any luck. Here's a MWE  \documentclass[12pt]{article} \usepackage[brazil]{babel} \usepackage{lipsum}  \begin{document} \lipsum  \bibliographystyle{plain} \bibliography{biblio}  \cite{Boulos} \end{document}   The contents of my biblio.bib file are below:  @book{Boulos, author    = "BOULOS, Paulo", title     = "C\'{a}lculo Diferencial e Integral", publisher = "Pearson Makron Books", volume   = "1", address  = "S\~{a}o Paulo", edition  = "1", year      = "1999", note     = "380 p", }   So how can I get it to translate the words like "Edition" to "Edição"? Also, when I compile this, I get what seems to be a subitem, as if this entry in the bibliography had subentries, but that's not the case, how can I disable that?  Thanks in advance, my deadline is near and if I can't figure a way around, I'll need to swap back to MS Word to continue this work.


I'm having a look at analysis right now, and I just thought up this question after reading about the comparison test.  Does there exist a "critical" infinite sum of real numbers (which is divergent) such that if $S_n$ is any infinite sum for which the terms in $S_n$ are all less than the terms in this critical sum for $n > N_0$ for some finite $N_0$, then $S_n$ converges?   I know my terminology is somewhat incorrect.

We say $a_n$ converges slower than $b_n$ if there exist an $x$ such that for all $m>x$, $a_m>b_m$ and both $\sum a_n$ and $\sum b_n$ converges.  Ignoring constant factors, which type of function converges the slowest?


I'm working in an old project with some old code and findbug is giving the following error with a byte[].      FindBugs: May expose internal representation by incorporating   reference to mutable object This code stores a reference to an   externally mutable object into the internal representation of the   object.  If instances are accessed by untrusted code, and u nchecked   changes to the mutable object would compromise security or other   important properties, you will need to do something different. Storing   a copy of the object is better approach in many situations.   I'm wondering if someone could help me to understand the proper way to handle this error?  private byte[] fileContent;  public FileUpload(String fileName, String fileExtension, long fileSize, byte[] fileContent, boolean attachedToPo, boolean programOwner) {         this.fileName = fileName;         this.fileExtension = fileExtension;         this.fileSize = fileSize;         this.fileContent = fileContent;         this.attachedToPo = attachedToPo;         this.programOwner = programOwner;     }  public byte[] getFileContent() {     return fileContent; }  public void setFileContent(byte[] fileContent) {     this.fileContent = fileContent; }   EDIT I understand why the bug exist and I know how to deal with this when it comes to dates etc. I'm just a little confused with how to deal with it when it comes to byte[].

This could be the dumbest question ever asked but I think it is quite confusing for a Java newbie.    Can somebody clarify what is meant by immutable?  Why is a String immutable? What are the advantages/disadvantages of the immutable objects? Why should a mutable object such as StringBuilder be preferred over String and vice-verse?   A nice example (in Java) will be really appreciated.


I got this cheap DT-830B multimeter as a bonus when ordering stuff from a Chinese internet shop.  I opened it up and was wondering if this is a fuse or a current shunt? Since the multimeter works out of the box I assumed there must be a fuse in it, as I did not expect it to function without a fuse, but that weird thing is all I can find on either side of the PCB, it has two white lines under it. Also there seems to be contacts on the side of the PCB that I usually associate with a fuse.  Help a confused soul!

What is this large metal bar inside my DMMs? One of them labeled it ST. They appear to be connected to the COM port or fuse. Is this just a big jumper for the 10 A ammeter?


I have a requirement where jars have to be changed based on distribution where    distribution is captured from UI.  Distribution varies from one group to another. If a distribution is selected then jars related to that distribution have to be added to the class-path dynamically/programmatically.  If another distribution is selected then the previous jars which were added to the class-path have to be removed from class-path dynamically and new jars related to new distribution have to be added dynamically.The same has to be continued for other distributions.     I have seen earlier threads which state that adding jars at run-time is possible through Class Loader but I haven't seen any thread where jars can be removed dynamically from class-path.   Can anyone suggest whether this is possible?

Why is it so hard to do this in Java? If you want to have any kind of module system you need to be able to load JAR files dynamically. I'm told there's a way of doing it by writing your own ClassLoader, but that's a lot of work for something that should (in my mind at least) be as easy as calling a method with a JAR file as its argument.  Any suggestions for simple code that does this?


I recently installed Ubuntu 18.04 on my laptop, at the moment of the installation it didn't ask me for a WiFi connection, and it hasn't worked since then.    Here are some of the commands I have used.   Code:  $ sudo lshw -c network [sudo] password for jenn:  *-network UNCLAIMED             description: Network controller      product: RTL8821CE 802.11ac PCIe Wireless Network Adapter      vendor: Realtek Semiconductor Co., Ltd.      physical id: 0      bus info: pci@0000:01:00.0      version: 00      width: 64 bits      clock: 33MHz      capabilities: pm msi pciexpress cap_list      configuration: latency=0      resources: ioport:3000(size=256) memory:a1000000-a100ffff $ lspci | grep Wireless 01:00.0 Network controller: Realtek Semiconductor Co., Ltd. RTL8821CE 802.11ac PCIe  Network Adapter  $ rfkill list 0: hci0: Bluetooth     Soft blocked: no     Hard blocked: no  $ lspci -nnk | grep -A2 0280 01:00.0 Network controller : Realtek Semiconductor Co., Ltd. RTL8821CE 802.11ac PCIe Wireless Network Adapter [10ec:c821]  Subsystem: Hewlett-Packard Company RTL8821CE 802.11ac PCIe Wireless Network Adapter [103c:831a]  $ iwconfig lo        no wireless extensions.  $ dmesg | grep iwl $ lspci -knn | grep -i net -A3 01:00.0  Network controller [0280]: Realtek Semiconductor Co., Ltd. RTL8821CE 802.11ac PCIe Wireless  Network Adapter [10ec:c821] Subsystem: Hewlett-Packard Company RTL8821CE 802.11ac PCIe Wireless  Network Adapter [103c:831a]  $ lspci -nn -d 10ec: 01:00.0 Network controller [0280]: Realtek Semiconductor Co., Ltd. RTL8821CE 802.11ac PCIe Wireless Network Adapter [10ec:c821] $ uname -a Linux jenn 4.15.0-36-generic #39-Ubuntu SMP Mon Sep 24 16:19:09 UTC 2018 x86_64 x86_64 x86_64 GNU/Linux   The network appears unclaimed.   I have seen other cases in which this commands output other options, but in my case, there is only that one.    Finally, there are no additional drivers, even though I am connected with memory that gives me internet.   I'm new in Linux distribution, so I'm really lost with this issue. Thanks in advance.

I'm trying to install drivers for my Wifi on my HP All-in-one desktop. I've been told to show the output of the command "sudo lshw -C network" so here it is:  *-network description: Ethernet interface product: RTL8111/8168/8411 PCI Express Gigabit Ethernet Controller vendor: Realtek Semiconductor Co., Ltd physical id: 0 bus info: pci@0000:01:00.0 logical name: enp1s0 version: 15 serial: 48:ba:4e:5c:06:5f size: 100Mbit/s capacity: 1Gbit/s width: 64 bits clock: 33MHz capabilities: pm msi pciexpress msix bus_master cap_list ethernet physical tp mii 10bt 10bt-fd 100bt 100bt-fd 1000bt 1000bt-fd autonegotiation configuration: autonegotiation=on broadcast=yes driver=r8169 driverversion=2.3LK-NAPI duplex=full firmware=rtl8168h-2_0.0.2 02/26/15 ip=192.168.1.21 latency=0 link=yes multicast=yes port=MII speed=100Mbit/s resources: ire:31 import:e000(size=256) memory: fea04000-fea04fff memory:fea00000-fea03fff  *-network UNCLAIMED description: Network controller product: Realtek Semiconductor Co., Ltd. vendor: Realtek Semiconductor Co., Ltd. physical id: 0 bus info: pci@0000:02:00.0 version: 00 width: 64 bits clock: 33MHz capabilities: pm msi pciexpress cap_list configuration: latency=0 resources: import:d000(size=256) memory:fe900000-fe90ffff   Output from "lspci -nnk | grep -A2 0280":  02:00.0 Network controller [0280]: Realtek Semiconductor Co., Ltd. RTL8821CE 802.11ac PCIe Wireless Network Adapter [10ec:c821] Subsystem: Hewlett-Packard Company RTL8821CE 802.11ac PCIe Wireless Network Adapter [103c:831a] 03:00.0 Unassigned class [ff00]: Realtek Semiconductor Co., Ltd. RTS5229 PCI Express Card Reader [10ec:5229] (rev 01)


Till now, I have learned a lot from this network. I believe that there is unlimited knowledge here. It is a good place to share and gain knowledge of almost all types. This network inspired all the skills in me. I wanna pay thanks to this community. Here are some gifts from me:  You can achieve all your goals with the help of this network:  (Designed with Studio Bricklink)(Rendered with Eyesight Bricklink) Also share your contributions and love for this network... Edit: Here is another version of the first model:  Edit 2: Here is the Blender edition of that model rendered with cycles:

Quite often a number of users will give similar answers to one of my questions. Sometimes someone will give an answer that is interesting, but does not really help with my question.  In all cases, I feel a need to thank the people who answered my question. It isn't always appropriate for me to upvote every answer, and I can only accept one answer. Giving a "thanks" comment on every answer appears to be frowned upon.  So, what's the etiquette?


A question can be locked because of "high amount of off-topic comments". But it is preventing it from being voted on or edited, it prevents adding new answers to this question. I think that comments lock should only lock comments.    A question, locked because of "collaborative effort" should act like closing the question, only prevent adding new answers (voting and editing the question should be allowed).   Actulally, completely locked can be only a question with historical significance, or because of content dispute .

Locking a post has very severe consequences for a post, you cannot   Upvote or downvote on it Edit it Vote to close or reopen it Comment on it Add new answers to it   Because of these severe consequences I usually avoid locking altogether and try to deal with the problem in other ways. Locking just has far too severe side-effects for my taste, I don't want to prevent anyone from voting or answering just because there is an edit-war on the post.  We now also have some locking reasons, ignoring the historical significance reason as it isn't relevant here, they are the following:     Content dispute      This post has been locked while disputes about its   content are being resolved. For more info visit meta.      Off-topic comments      This post has been locked due to the high amount of   off-topic comments generated. For extended discussions, please use   chat.   Both are common reasons for locking a post, and in both cases the locking is there to prevent only a small subset of what locking actually stops.  Those locking reasons shouldn't only be a text attached to the lock, but they should also change the behaviour of the locks:   A lock for off-topic comments should only prevent new comments A lock due to an edit war should only prevent edits to the post   This would make using those locks less disruptive, and more useful to moderators.


I consider the kernel density estimation, and I want to find the quantile the quantile at some level (0.95) of the KDE.       z<-rnorm(25) v<-density(z) plot(v$x,v$y,type="l")  qt<-quantile(z,0.997) abline(v=qt,col="red")     plot(v$x,cumsum(v$y),type="l") abline(h=0.997,col="blue",type="p")   The first plot is the plot of the KDE and the line of the quantile of the data. How to get the distribution of the KDE?   How to get the quantile with respect to the KDE? Is only for comparison.

I have some troble understanding the Kernel density estimation.  If a consider the next example:  s<-0 z<-density(rnorm(25)) f<-function(i)approx(z$x,z$y,xout=i)$y for(i in seq(min(z$x),max(z$x),length.out = 10000)) s<-s+f(i) s   I expected getting that s is approximately equals to one since I am considering an approximation for the integral of the Kernel density function (that I suppose is also a density). However, I don't get the expected result. Why it doesn's sum one?  The idea behind this is that I wanted to use the Kernel as the density of my data points. I was interpolating to get my explicit function and use with other x values. Or do you know another way to get a density function estimated by fitting?


Although I understand that getting an admission into a PhD program depends on many factors, for example--BS and MS GPA, number of journal papers and their quality, number of conference papers and their quality, GRE, Statement of Objective, job experience, profile of other applicants, funding situation etc-- what should be the GPA of an MS student in the US, who is expecting to do a PhD in Mechanical Engineering in any of the top 30 grad schools?  Thanks in advance!

When applying to a PhD program in the US, how does the admissions process work? If an applicant is weak in a particular area, is it possible to offset that by being strong in a different area?  Note that this question originated from this . Please feel free to edit the question to improve it.


Let $A, B, C \in M_n(\mathbb R)$ be such that $A$ commutes with $B$, $B$ commutes with $C$ and $B$ is not a scalar matrix. Then $A$ commutes with $C$.   I think it is false, but how can I solve it within 3 minutes?

Let $A,B,C \in \ M(3,\mathbb{R})$ be such that $A$ commutes with $B $and $B$ commutes with $C$. $B$ is not scalar matrix. Then, $A$ commutes with $C$.   Is this true or false? I think it is not true, but cannot think of a counterexample. Any suggestions?


I have always followed the former rule, i.e, "Tell me why I should marry you" (without a question mark). But my cousin insists the latter is correct. He seems equally confident that he is correct. So can you please answer which is correct? Or are both correct?  Or the following example would illustrate my question better:        Give me reasons why I should marry you.   Give me reasons why should I marry you?      Which of the above is correct?

The grammars I've seen state that dependent clauses never undergo inversion. This agrees with sentences like     Tell me where he is.   But how sentences like     Tell me, where is he?   should be analyzed? Isn't where is he a dependent clause in this case?


At first, I try to draw a cylinder which is much different from what I want....  \documentclass{standalone} \usepackage{pgfplots} \pgfplotsset{compat=1.4} \usepackage{tikz-3dplot} \tdplotsetmaincoords{60}{-30} \tdplotsetrotatedcoords{0}{90}{90}% \begin{document} \begin{tikzpicture}   [tdplot_rotated_coords,     scale=3,     mdc/.style={fill=blue, color=blue,draw=none, opacity=.4,line join=round},     length/.style={<->,thick,line cap=round}]   \def\d{1}   \def\r{\d*.45}      % Cylinder    \foreach \t in {0,12,...,348}     \draw[mdc] ({cos(\t   )*\r+\d/2},  0, {sin(\t   )*\r+\d/2}) % side vertice of cylinder             -- ({cos(\t+12)*\r+\d/2},  0, {sin(\t+12)*\r+\d/2})             -- ({cos(\t+12)*\r+\d/2}, \d, {sin(\t+12)*\r+\d/2})             -- ({cos(\t   )*\r+\d/2}, \d, {sin(\t   )*\r+\d/2})             -- cycle; \end{tikzpicture} \end{document}     I am curious to know that it is possible to draw shell figures with TikZ (like bellow pictures), but the above code and figures below are far different from what I want....

Is there like a library that has default geometric figures like the ones shown below. Am not acquainted yet with 3D diagrams in TikZ.


I'm looking for a way to send SMS messages from my Samsung Galaxy Tab 10.1 (Wi-Fi GT-P5113). The unit is connected to the net via Wi-Fi.

Is there a way to send and receive SMS when a cellular signal is not available, but WiFi is?  I'm often on-site at locations where the building has a strong WiFi (Internet) connection, but a simple cell signal is spotty at best.


I find it hard to prove that R with lower limit topology is not second countable.  Let's construct a collection B consists of half-open interval [a,b) where a,b $\in$ Q, so there's a mapping from B to Q x Q which is a countable set  Consider an arbitrary open set [x,y), then there's an open set [q1,q2) $\subset$ [a,b) such that q1,q2 $\in$ Q which means B is a countable basis for lower limit topology which means R with lower limit topology is 2nd countable  P/S: I've read some of other posts on this but nothing gave me a satisfied answer

I am trying to prove that $\mathbb{R}$ with the lower limit topology is not second-countable.  To do this, I'm trying to form an uncountable union $A$ of disjoint, half-open intervals of the form $[a, b)$, $a < b$. Is this possible? I think this would imply the $A$ is open but no countable union of basis elements could coincide with $A$ therefore making the real numbers with the lower limit topology not second-countable.  I think there must exist something like $A$ described above but I am having trouble visualizing it and coming up with a formula to represent it.  Maybe there is some other way to show it is not second-countable.


The Blender Principled BSDF shader is missing in my node editor. I'm using the latest Blender version 2.79. Please help :)

I have blender 2.69 and I've been following a tutorial on how to make text.  The only problem is when I go to add a glossy shader in the node editor it does not exist. Neither does the shader category.


I have setup my computer to have a dual boot for Ubuntu 20.04 and Windows 10. My time in Ubuntu is OK ,but when I go to Windows it changes. How can I fix my clock in Windows?

Dual boot system Windows XP Pro and Ubuntu 12.04.  I have the bios set for the correct time and Ubuntu set for US Eastern time.  Ubuntu will boot up and the time will be off by -4 hours.  If I correct the time in Ubuntu then when I boot up in Windows XP the time will be off by + 4 hours.  This is a fresh install of 12.04. I did not have this problem before reinstalling Ubuntu.


$\sum_{k\leq n}^{n} \binom{n}{k}= 2^n    , n, k \in  \mathbb{N}$  Im trying with mathematical induction but im stuck.  My inductive step:  $H) \sum_{k=0}^{h} \binom{h}{k}= 2^h$  $T) \sum_{k=0}^{h+1} \binom{h+1}{k}= 2^{h+1}$  For the demo:  $\sum_{k=0}^{h+1} \binom{h+1}{k} \Rightarrow \sum_{k=0}^{h} \binom{h}{k} + \sum_{k=0}^{h} \binom{h}{k-1}$  Where i can use the hypothesis in the first term, but dont know how to continue.

Student here! Just reading Liebecks Introduction to pure mathematics for fun and I made an attempt at proving the total number of subsets of S is equal to $2^n$.   I realized that the total number of subsets of S is just:  $ \binom{n}{1} + \binom{n}{2} + \cdots + \binom{n}{n} + 1$  And so I put together the cool looking formula  $ \displaystyle \sum_{r=1}^n \frac{n!}{r!(n-r)!} = 2^n - 1$  But I have no clue how to approach proving this formula analytically. Any help?    So if I try a proof by induction:  $\displaystyle \sum_{r=1}^n \frac{n!}{r!(n-r)!} = 2^n - 1$  $\displaystyle \sum_{r=0}^n \frac{n!}{r!(n-r)!} = 2^n$  obviously true for $n = 1$:  $1 + \frac{1}{1!0!} = 2 = 2$  assume true for $n$, I could multiply both sides by $2$?  $\displaystyle 2\sum_{r=0}^n \frac{n!}{r!(n-r)!} = 2^{n+1}$  How could I go about proving that  $\displaystyle 2\sum_{r=0}^n \frac{n!}{r!(n-r)!}  = \sum_{r=0}^{n+1} \frac{(n+1)!}{r!((n+1) - r)!}$


How do you tell a spelling mistake from a grammar mistake? For example:  Your the best. This iz the end. I likes music. She preatend to be asleep.  One method is to read the erroneous sentence aloud (let’s call it the ‘speech method’): if the sentence sounds correct then it has a spelling mistake, otherwise it has a grammar mistake. Applied to the examples, 1 and 2 have spelling mistakes, and 3 and 4 have grammar mistakes. Another method is to look up each word of the erroneous sentence in a dictionary (let’s call it the ‘dictionary method’): if the sentence uses a word that is not in the dictionary, then it has a spelling mistake, otherwise it has a grammar mistake. Applied to the examples, 1 and 3 have grammar mistakes, and 2 and 4 have spelling mistakes. The problem is that these two methods give different results (for 1 and 4, not for 2 and 3). Which method should I use?

If a person uses the wrong form of your or you're, would that be considered a spelling or grammatical error? I can really see it swinging both ways...  A sentence with the incorrect use of the word is technically grammatically incorrect, but the root cause could be simple spelling error. If a person speaks a sentence with an incorrect use of the word in question, it seems grammatically correct. When you look at the reader's script, it is then determined to be a spelling error.  When shown in writing, should the error be marked as a spelling or grammatical error?


I came across some numbers which were called transcendental numbers. What are they exactly I want with explanation and eg

This question is motivated from an exercise from Rudin. The exercise says that prove that set of all algebraic numbers is countable.   Proof: We know that a number $z$ is called algebraic if it is the root of a polynomial $a_0z^n+a_1z^{n-1}+\cdots +a_n=0$, where $a_i$'s $\in \Bbb{Z}$. Since there are only finitely many equations of the form $n+|a_0|+|a_1|+\cdots+|a_n|=N$ for a positive integer $N$ this implies there are only finitely many such polynomials. Now since each of these polynomials have finitely many roots therefore there are countably many algebraic numbers.   Now the next exercise in the process asks us to prove that there is a real number which is not algebraic which is very trivial. So this proves that there exists transcendental numbers. Also this shows that there are uncountably many of them. So that means there are fairly many of them.   But where are they? Now if there were uncountably many of them then it should be fairly easy to find them but it is not . Because we can get all sorts of wonky numbers being the root of polynomials.    mentions all the transcendental numbers and the numbers which might be transcendental. These do not seem to be many. So what about the rest of the transcendental numbers. Where are they? And why is it so difficult to find them and prove that they are transcendental?   A side question: Is there some nice property that the class of all these transcendental numbers might satisfy . By a nice property I mean that if I take all transcendental numbers and form a group then what about the isomorphisms on this group. Similarly what about if I take all transcendental numbers and form a topological space?  Note: Now if this is a question that has already been asked then please do notify me in the comments I will delete this question


I recently wrote a couple of extensions to the JS array prototype  Array.prototype.diff = function (a) {     return this.filter(function (i) {         return !(a.indexOf(i) > -1);     }); };  Array.prototype.udiff = function (a, b) {     var rslt = this.concat(b);     return rslt.filter(function (i) {         return !(a.indexOf(i) > -1);     }); };   Nothing terribly exciting there.  But then I ran into something quite unusual.  Here is an example  var arr = []; for (prop in arr) {     arr[prop].attrib = arr[prop].attrib.replaceAll('_', ' ', true); }   Quite an innocent looking piece of code but it came back to me with an error along the lines of "undefined does not have method replaceAll - where replaceAll is my own String.prototype extension.  The solution is simple - before manipulating arr[prop] just issue   if ('string' == typeof(prop)) continue;   The reason being that prop can also be diff or udiff.  So, problem solved but this behavior did take me off my guard and having to do the additional typeof test does sound clumsy.  Perhaps someone here has deeper insights into what happens with prototype extensions?  I should mention that all of these issues occured in Chrome on Windows.

I've been told not to use for...in with arrays in JavaScript. Why not?


I am using Ubuntu 12.04 and I just installed Wine.  sudo add-apt-repository ppa:ubuntu-wine/ppa  sudo apt-get update  sudo apt-get install wine1.5  sudo apt-get install winetricks    The installation was not fully successful because it gave me the error that fonts were not installed.  Without the fonts I cant open any program. I have tried to copy fonts from Windows to /usr/share/fonts but there is no paste option.  Also I have googled and saw somewhere that you can install fonts via winetricks. If so, how does it work? Can I open winetricks? How can I do the install?  Regards

Is there a way to install fonts on wine?   I'm looking to install fonts so i can use them to render text differently on various apps. Specifically myriad.


I have a string:  produits/mousse-de-montage/marque/pbb/item/promax-pro-expansion   Everything that goes after produits is optional and must be captured by groups, here is my regex  /^.*produits(.*)?(\/marque\/.*)?(\/item\/.*)?/g   For some strange reason,  he put those 3 groups into a single one. If i remove question mark, he will split in 3 groups.

I have this gigantic ugly string: J0000000: Transaction A0001401 started on 8/22/2008 9:49:29 AM J0000010: Project name: E:\foo.pf J0000011: Job name: MBiek Direct Mail Test J0000020: Document 1 - Completed successfully  I'm trying to extract pieces from it using regex. In this case, I want to grab everything after Project Name up to the part where it says J0000011: (the 11 is going to be a different number every time). Here's the regex I've been playing with: Project name:\s+(.*)\s+J[0-9]{7}:  The problem is that it doesn't stop until it hits the J0000020: at the end. How do I make the regex stop at the first occurrence of J[0-9]{7}?


When I publish content – for instace an article – on a Drupal site, I'd like Drupal to push a status update with a link to the article to a Facebook company page.  I know there are a lot of Drupal modules that offer Facebook integration, but does any of them offer this particular functionality? Or is perhaps the best way to go to generate an RSS feed and use a third-part app like  to push it to Facebook?  The site in question is a Drupal 6 site.

Is there a way to make Drupal post to facebook?  I want the user to be able to create an article, and when user does that, it automatically posts information of the new article to a Facebook account. Is this possible?


how do I concatenate a variable within a verbatim string literal with large volume of text breaking into newlines? I am using a stringbuilder to append all the string variables but   What I intend doing -   StringBuilder sbuilder = new StringBuilder(); variable y = something variable x = @"text"+ y + "              other text other text"; variable z = @"blablabla"; variable z2 = @"some other text"  sbuilder.Append(x); sbuilder.Append(z); sbuilder.Append(z2);  string html = sbuilder.ToString();   What I tried -   var variable = modelview.something;  string form = @"a whole lotta text "+variable+ "even more text";   I was getting syntax errors   Represents text as a series of Unicode characters.To browse the .NET framework source code for this type, see the Reference Source. Newline in constant

I have a helper class pulling a string from an XML file. That string is a file path (so it has backslashes in it). I need to use that string as it is... How can I use it like I would with the literal command?  Instead of this:  string filePath = @"C:\somepath\file.txt";   I want to do this:  string filePath = @helper.getFilePath(); //getFilePath returns a string   This isn't how I am actually using it; it is just to make what I mean a little clearer. Is there some sort of .ToLiteral() or something?


What is $$\displaystyle\lim_{n\to\infty}\sum_{k=1}^{n}\frac{1}{\sqrt{n^{2}+kn}}$$.I try to check whether series can be written as telescoping series but it doesn't work. I am getting no idea how to start?

How can I find the limit $$\lim_{n\to\infty}\displaystyle\sum_{k=1}^n\frac{1}{\sqrt {n^2 +kn}} \quad?$$  I have tried to solve it using squeeze theorem: $$\sum_{k=1}^n\frac{1}{\sqrt {n^2 +kn}} > \displaystyle\sum_{k=1}^n\frac{1}{\sqrt {n^2 +n^2}} = \displaystyle\sum_{k=1}^n\frac{1}{\sqrt {2n^2}}=\frac{1}{\sqrt {2}} $$ and $$\sum_{k=1}^n\frac{1}{\sqrt {n^2 +kn}} <\displaystyle\sum_{k=1}^n\frac{1}{\sqrt {n^2}} = 1.$$  But I could not find the sequences with the same limits.  Please help - how to solve this?


I find it weird that this simple functionality doesn't exist in macOS, as it does in other OS. IIRC, it used to exist in the System 7 era. What would be the rationale to get this simple functionality out of the window (I should say Apple here, I know ;) )?

On OS X 10.6 (Snow Leopard), I don't seem to be able to us the "Cut" command on a file in the Finder, like you can do in Windows Explorer on Microsoft Windows. (In Windows, once you select a file and "cut" it, you can then move to a different directory and "paste" the file to that location.)   The only way I can move a file using keyboard or contextual menu commands is to copy the file to another drive or location and then delete the old version of the file.   In the Finder's 'Edit' menu, 'Cut' is in the list but if a file itself is selected, it is always greyed out. 'Copy' is not. Why is this?