Hi I have just switched from Windows 10 to Ubuntu 16.04  Compiled Log From This  →   I am just learning the system and have gone to use firefox and my internet is not working and saying that there are no connections available.  I'm kind of new to all this so simplifying things to me would help, please please help me as I have set it as my default OS.  Laptop is an HP Stream Notebook 13

I'm having serious problems installing the Broadcom drivers for Ubuntu. It worked perfectly on my previous version, but now, it is impossible.   What are the steps to install Broadcom wireless drivers for a BCM43xx card?  I'm a user with no advance knowledge in Linux, so I would need clear explanations on how to make, compile, etc.    lspci -vnn | grep Network showed:   Broadcom Corporation BCM4322 802.11a/b/g/n Wireless LAN Controller [14e4:432b]      iwconfig showed:  lo        no wireless extensions. eth0      no wireless extensions.   NOTE: Answer below is updated every time new information is added and confirmed working.


I've noticed that all binomial coefficients, apart from first and last, for powers 1, 2, 4 and 8 are even numbers. This suggests, that it may be the case for any $2^n$.  In other words, is the following true?     $\binom{2^n}{k}$ is even for any natural $k<2^n$

It is quite easy to show that for every prime $p$ and $0<i<p$ we have that $p$ divides the binomial coefficient $\large p\choose i$; one simply notes that in $\large \frac{p!}{i!(p-i)!}$ the numerator is divisible by $p$ whereas the denominator is not (since it is a product of numbers smaller than $p$ and $p$ is prime).  My problem is with generalizing this argument for $q=p^n$. I'm looking for the most elegant and simple way to prove that $p$ still divides $\large q\choose i$.


Let $a$, $b$ be positive integers. Clearly if $a\mid b^2$, $ak = b*b$ for some $k$ in $\mathbb{Z}$. Intuitively, $a$ will be the gcd so it must be $1$. But how can I show this? Is there a more appropriate way to phrase this or maybe some mathematical simplification or steps I can see?   Thanks!   Also, when I get to $a = 1$, how can I show that $b$ also must be $1$?

Well I thought this is obvious. since $\gcd(a,b)=1$,  then we have that $a\not\mid b$ AND $a\mid bc$. This implies that $a$ divides $c$. But apparently this is wrong. Help explain why this way is wrong please.   The question tells you give me two relatively prime numbers $a$ and $b$ such that $a$ divides the product $bc$, prove that $a$ divides $c$. how is this not obvious? Explain to me how my "proof" is not correct.


Hi I have created both list and site workflows. All the workflows which i have created could be seen in sharepoint designer as in the below picture.    But in the browser only site workflows are visible  ! How to visible list workflow in browser ? Is there anything am missing or list workflow cannot be visible in browser uh ?  Thanks in advance

I have created two workflows, list and normal workflow.   I have saved and published both the workflows. But under my workflows in the site I can only see the normal workflow, I am not able to see the list workflow.  Why is it so? Is there any other settings that should be done for list workflow?


This problem, stated in the title, comes from Schwarz Lemma part in complex analysis. It usually makes sense to ask of the existence of a holomorphic bijection(constructing one with some familiar holomorphic maps). However, how to figure out that there isn't any such map? Which proposition/theorem/lemma should I consider? Thanks!

Suppose $A=\{z\in \mathbb{C}: 0<|z|<1\}$ and $B=\{z\in \mathbb{C}: 2<|z|<3\}$.   Show that there is no one -to-one analytic function from A to B. Any hints? Thanks!


A  is defined as follows:  Rapidly changing conditions prevent the system from adapting its configuration during the process, hence the spatial probability density remains unchanged. Typically there is no eigenstate of the final Hamiltonian with the same functional form as the initial state. The system ends in a linear combination of states that sum to reproduce the initial probability density.    An  is defined as follows:  Gradually changing conditions allow the system to adapt its configuration, hence the probability density is modified by the process. If the system starts in an eigenstate of the initial Hamiltonian, it will end in the corresponding eigenstate of the final Hamiltonian.    A diabatic process involves a sudden change of the Hamiltonian, while an adiabatic process involves a gradual change of the Hamiltonian.  The word adiabatic, in thermodynamics, is usually reserved for processes that do not involve the exchange of heat between the system and surroundings. Does this use of the word adiabatic have any relation to the use of the word adiabatic in quantum mechanics? How about the word diabatic?

I'm confused about the terminology in the two contexts since I can't figure out if they have a similar motivation. Afaik, the definitions state that quantum processes should be very slow to be called  while  are supposed to be those that don't lose heat. Based on my current intuition, this would mean that the thermodynamic process is typically fast (not leaving enough time for heat transfer). What gives, why the apparent mismatch?


I believe the grammatically correct way is to omit the to before the verb (find in this case). Can someone confirm?     What you have to do instead is find a way to redefine the problem ...   I ask this because I have also seen constructions like     What you have to do instead is to find a way to redefine the problem ...   Are both correct?

I was speaking to an English learner and said, “All you have to do is read a lot.” And they thought that sentence wasn’t grammatically correct because I dropped the word to between is and read.  They thought it should be “All you have to do is to read a lot.” That sounds weird to me.   How do I explain to them the reason you drop the to? Or am I incorrect and it really should have a to?


This film is probably from the 70s or 80s and I think was American. All I remember is the hero encounters a couple (male and female, apparently human) in a spaceship on a planet. I think the spaceship interior was orange and the male pilot is a cowboy.  There is a battle going on around the spaceship and the female android is destroyed, I think by laser fire. It's only at this moment that we realise it was not a real woman. The male pilot mutters something about it being shame the robot is dead but in a kind of "shrugging of the shoulders" way.  And then the movie continues with no further reference to the android. It has a kind of  vibe (ie not high quality effects) and is live action.  I can't find anything like it on Google and am beginning to wonder if I really watched it1. Does this sound familiar?  1 Or if my memory circuits are glitching.

I am trying to identify a sci-fi movie from the 80's or 90's, with the following parameters:  Setting:    Scenes of a red desert planet   Culture:    Either people roam fairly solo and try to acquire resources to survive, or you live in a weird society where if a stranger is captured he needs to play in a game of fight to the death.  Mobility:      One foil character has a giant battle-bot-looking tank as his form of transportation through the desert. Protagonist has a car that has a plastic half bubble on top to look out from.   Robot:      The protagonist runs around in the beginning of the film with a female robot/android whose face is melted off after it has acid touch its face.(This scene happens next to the protagonist's rover)  Love interest:      Somehow protagonist comes across female protagonist in desert. She smells really bad and is hungry. They sleep outside, and he tells her to sleep away from him. He uses a thermal blanket(the first I ever saw in my life). She wakes up next to him, smelling horrible. He bathes her in some water hole they find(as if water were not scarce and they could just waste water.)   Pupa monsters:      Scene where they are in a building and they are trying to get out. They come across a room that is white, in which multiple giant, white, snot, pupa are hanging securely from the ceiling. Through curiosity, they disturb them, and now they have to get out of that room fast.  Boss Antagonist:      Pervert bionic man, that is actually attached to a giant robotic arm, as only form of movement. He is in black and has a pale bald head as his most human looking part.


I have Bought new laptop which contains only C drive with 915.84 GB of space ,in which 874 GB is free ,when i want to partition the space ,the only available space  to Shrink is 467994 MB [467.994 GB],why it is like ,can any one help me in this ,I need to keep C drive as 150GB and remaining space i want to shrink it to new drives  Thanks in Advance.

My computer came with only one hard disk drive: C. It has a capacity of 920 GB. And I have used 80 GB of it.   Now I want two drives in my computer: C and D. But I want 150 GB in the C drive and the rest (770 GB) in the D drive. And I don't want that any files that I currently have in my C drive get deleted. How can I do that?  (I can't back up at the moment, because I already installed a lot of software and customized the operating sytstem. That's a lot of work.)   Thank you.


I am installing the User Picture Field module to take over the Drupal default user picture but it does not display the default user image when empty (D7, Bartik.)  What snippet should I add to the page--user--edit.tpl.php template so that the uploaded user picture is displayed OR the default "nophoto.jpg" file when the user has NOT uploaded a picture.  I can do the first part and display the uploaded picture but I can't get the "nophoto.jpg" to display. The "nophoto.jpg" is located in public://pictures/nophoto.jpg and I do not use image styles.  Any and all help is appreciated.  Thank you :)

I have a view with a thumbnail of the image uploaded by user. I would like to setup a default image which appears in place of thumbnail in case the user did not upload any image. Is that possible? Any advice appreciated.


I have a Wiki pages that I need to add a Web Part to. When I go to Site Actions, Edit Page and scroll to the bottom of the Wiki page I can click Add a Web Part and go through the process to get this set up as I want.  My problem is that I need this Web Part to display at the right side of the page, not the bottom and the only zone available seems to be Bottom.And I want to Keep This setting for Every Wiki Page Which will be create in the future. IS anyone has a solution for this case?

We are looking to see if we can leverage a WIKI to advertise sections of our governance plan to the end user community.   Right now with a WIKI we get the option to add web parts to the bottom of the layout.   The desired design would be to design a layout that would have a right column that would be a zone of other Web Parts.  For instance, a LVWP that would contain contacts and/or FAQS, an image web part etc.   We just want more flexibility with layout.  I am thinking we could add zones with Designer etc but wanted to see if there was something more obvious.  Thanks,  Paul


When I report a bug I may be asked to "try out the latest upstream Kernel", how do I do that?  I see a lot of version specific answers to this question here on ask ubuntu, what are the general instructions?

Currently I'm running Linux-3.0 and I want to update it to Linux-3.3.1 the latest stable kernel release as mentioned at . Can I update to 3.3.1 in Ubuntu without any risk of crashes? I'm updating my kernel regularly as provided by the Update Manager..Currently I have Linux-3.0.0.17..Can I update?  NOTE:  The latest kernel version any user is supposed to use in Ubuntu is updated automatically via the Update Manager, so no action is normally required by user regarding kernel upgrades. What the question author is referring to is mainline kernel, see:


seems to suggest that it's common knowledge that it's not to be encouraged. However, if there is a simple (and usually really short) answer, should I not vote to close it and answer instead?

I've noticed quite a few cases () where people not only vote to close a question, but then also answer said question. At best this is just silly, and at worst it is totally hypocritical and seems almost like rep whoring (since often the closers answers are the only ones that remain to be voted on since no new answers can be given).  If you want to close a question, it makes more sense to simply add a comment if you feel the need to say something. This also leaves the option open for the author of the question to delete it if they want to. If the author realizes they've asked a duplicate, or they want to avoid the onslaught of downvotes that can often accompany a closed question, they should be allowed to delete it. However, if any answers to the question have upvotes, the author can't delete it.  So why do people answer and close? Should we try to crack down on this sort of thing, via either new features, clearly stating it in the FAQs, or just getting the word out through commenting when we see it?  EDIT: Just to clarify, I'm asking this in relation to SO, not MetaSO.


So, I was reading Atom: Journey Across The Subatomic Cosmos by Isaac Asimov in order to better understand quantum mechanics when I came across this sentence:      The electron couldn't spiral into the proton because it couldn't take up an orbit with a length less than a single wave.    I was wondering why that is? Why can't an electron not have non-whole number wavelengths in atomic energy levels?

I have seen similar posts, but I haven't seen what seems to be a clear and direct answer.  Why do only a certain number of electrons occupy each shell? Why are the shells arranged in certain distances from the nucleus? Why don't electrons just collapse into the nucleus or fly away?  It seems there are lots of equations and theories that describe HOW electrons behave (pauli exclusion principle), predictions about WHERE they may be located (Schrödinger equation, uncertainty principle), etc. But hard to find the WHY and/or causality behind these descriptive properties.  What is it about the nucleus and the electrons that causes them to attract/repel in the form of these shells at regular intervals and numbers of electrons per shell?  Please be patient with me, new to this forum and just an amateur fan of physics.


Please help me find the last two digits of $312^{84}$ ; I am stuck right here: $312^\phi \equiv 1 \pmod{100}$.

How do I efficiently compute $a^b\bmod c$:  When $b$ is huge, for instance $5^{844325}\bmod 21$? When $b$ is less than $c$ but it would still be a lot of work to multiply $a$ by itself $b$ times, for instance $5^{69}\bmod 101$? When $(a,c)\ne1$, for instance $6^{103}\bmod 14$?  Are there any other tricks for evaluating exponents in modular arithmetic?  This is being asked in an effort to cut down on duplicates, see  and .


Ice spikes are fairly rare but there is a general consensus about how they form from extruded pressurized water in containers subjected to below freezing conditions. This morning as I fed my dogs I found the above pictured ice spike in their outdoor watering dish.  The spike formed near the edge of the dish, was approximately 8-9 cm long, protruded at about a $45^o$ angle, was fairly flat on the upper surface but ovoid on the lower surface, and was very pointed with the base much larger than the rather short tip.   The outside temperature overnight was $2$-$3^o$ C below freezing. There was freezing rain overnight so the relative humidity was near 100 %.  The dish was in a protected corner so no rain hit the surface, but normal outdoor air currents would have prevailed.  The water in the dish was collected by a dehumidifyer, but the dish itself was not particularly clean as the photo shows.  In online searches about this phenomenon I learned that they can be normal to the liquid surface, or slanted like the one I observed.  They are also sometimes wider at the top than at the base unlike the pointed spike I observed. They sometimes look like inverted pyramids. My question concerns the explanation for the diversity of shapes and angles that these ice spikes exhibit. Are air currents the complete explanation, or are there more subtle things involved here?

I recently saw this picture posted on  which shows a so-called  rising from an ice cube tray.    I have read the Wikipedia page, but it doesn't mean much to me. My instinct was that it is caused by vibrations from the freezer setting up a resonant frequency on the surface of the water, and the spike has gradually "built up" as the water freezes. But I'm not a physicist, so I don't know if this makes sense.  I'm ideally looking for a layman's explanation of why this happens.


In this code I already coded counts as a dict beforehand. Here when I print my get_word_prob function, I get 0.0 as a result. When I print pneg, pword or others, I get name is not defined error. I guess my definition of these variables is not correct but could not find any other way to do so. It is probably easy but I am a total beginner.   def get_word_prob(counts, word, polarity):     """      calculates the probability of a word given a polarity       Parameters:     counts (dict): the dictionaries 'pos' and 'neg' which count word occurances     word (str): the word you want to get the probability for     polarity (str): wither 'pos' or 'neg'      Returns:     probability (float):  the probability of a word given a polarity       """     probability=float()     # Your code goes here     #P(word|polarity)=(p(polarity|word)*p(word))%p(polarity)     #P(word)=(counts[pos][word]+counts[neg][word])%counts[pos]+counts[neg]      for word in counts['pos']:          pword=float((counts['pos'][word]+counts['neg'][word])/sum(counts['pos'].values())+sum(counts['neg'].values()))     #p(pos)=counts[pos]%(counts[pos]+counts[neg])         ppos=float(sum(counts['pos'].values())/(sum(counts['pos'].values())+sum(counts['neg'].values())))         pneg=float(sum(counts['neg'].values())/(sum(counts['pos'].values())+sum(counts['neg'].values())))     #p(pos|word)=counts[pos][word]%(counts[pos][word]+counts[neg][word])         pposword=float(counts['pos'][word]/(counts['pos'][word]+counts['neg'][word]))     #p(neg|word)=counts[neg][word]%(counts[pos][word]+counts[neg][word])         pnegword=float(counts['neg'][word]/(counts['pos'][word]+counts['neg'][word]))         probability == float((pposword*pword)/ppos)     for word in counts['neg']:         probability == float((pnegword*pword)/pneg)                 return probability # P(word|polarity)   #Do not change #print(get_word_prob(counts, "great", "pos")) # should print 0.00255902660421998 #print(get_word_prob(counts, "glad", "neg")) # should print 0.00012164155275442091 #print(get_word_prob(counts, "wugs", "neg")) # should print 0 print(pneg)

What exactly are the Python scoping rules?  If I have some code:  code1 class Foo:    code2    def spam.....       code3       for code4..:        code5        x()   Where is x found?  Some possible choices include the list below:   In the enclosing source file In the class namespace In the function definition In the for loop index variable Inside the for loop   Also there is the context during execution, when the function spam is passed somewhere else. And maybe  pass a bit differently?  There must be a simple reference or algorithm somewhere.  It's a confusing world for intermediate Python programmers.


I review suggested edits on Stack Overflow that contain lots of alterations to back-tick code tags. It can be quite difficult to get a feel for how the edited post looks once those changes have been made.   If I use the "rendered output" page, the coloured diff markup can confuse matters. If I use the "markdown" page, you lose the ability to judge whether the edit looks pleasant.  I would propose the diff colouration becomes a toggle-able feature, as suggested in the image below. When the toggle is unchecked, the colouration will vanish, thus showing the real rendering of the edit.    I see no reason this preference should be stored on a per-user basis - I would be happy for it to default to being checked every time the dialog is opened.   I also believe this would have benefits beyond my back-tick example above - other formatting requires one to really look at the finished product. After all - why do we show the original editor the review pane?

When reviewing Suggested Edits the output is marked using red and green background colors on the text. Sometimes this makes it hard to see the actual changes.  It would be nice if there was a button that turns off the diff color highlighting as long as the mouse is pressed on it (or hovers it or whatever), so one can switch fast between the "natural" look and the diff view.  Just to avoid misunderstandings: The color diff should stay the default view as it does a great job in helping to locate the changes, but it does not help in evaluating them.


For example if I have two js functions in my HTML page named func1() and func2(). My question is how can I execute func1() when someone visits /url/to/the/page#tag1 and/or similarly func2() when someone visits /url/to/the/page#tag2.

I have some jQuery/JavaScript code that I want to run only when there is a hash (#) anchor link in a URL. How can you check for this character using JavaScript? I need a simple catch-all test that would detect URLs like these:   example.com/page.html#anchor example.com/page.html#anotheranchor   Basically something along the lines of:  if (thereIsAHashInTheUrl) {             do this; } else {     do this; }   If anyone could point me in the right direction, that would be much appreciated.


I did a clean install of 19.10 on my HP desktop.  After running software updater and rebooting it goes to the login screen.  I type in the password and it won't login, just shows the login screen again. Tried it a couple times with the same result.  Any suggestions?

My Ubuntu is stuck in a login loop when trying to enter my desktop. When I login, the screen gets black and soon after that the login screen comes back.   I've read that the problem might be caused by an error depending on the graphics, here's my graphics card: ATI Radeon 7670M


Does it means that almost half of its energy is lost as electromagnetic radiation?(I'm referring to hydrogen atom with 1 nucleus and 1 electron) I think that electron in an atom can only have a specific amount of energy so it can be kicked out of the atom by absorbing a photon equal to the missing energy? So as more and more electrons fill up the shells of an atom they will be increasingly less massive and thus would have to absorb photon equals to the missing amount of energy to be kicked out, is that right?

I’ve been told that a greater binding energy means the nucleus is more tightly bound, and therefore that decreases the mass of the nucleus with respect to its nucleons when separated. But why does a tighter nucleus mean a smaller mass?


I have the following code below: def convertint(prices):     output_list = []          for alist in prices:         print (alist)         price_int = re.match(r'([0-9]{2,3})', alist)         print (price_int)          #         print (price_int.group()) #         output_list.append(price_int.group())              return output_list     ###  convertint(['$27' , '$149' , '$59' , '$60' , '$75'])  It's output is below: $27 None $149 None $59 None $60 None $75 None  I want my regex match in my code to return 27, 149, 59, etc. without the $ but it's returning None when I try to match it. What am I doing wrong?

What is the difference between the search() and match() functions in the ?  I've read the  (), but I never seem to remember it.  I keep having to look it up and re-learn it.  I'm hoping that someone will answer it clearly with examples so that (perhaps) it will stick in my head.  Or at least I'll have a better place to return with my question and it will take less time to re-learn it.


I'm working on a small project which involves current measurement.  I'm using R10 to measure Voltage drop (100 mV) when 10 mA current goes through it.  Next I'm amplifing that signal around 37 times using an op-amp (LM358N) which is powered using 0-5 VDC and works as differential amplifier. There should be 3.73 V on the output BUT...  My problem is:  The op-amp is completely ignoring the inputs and it still outputs a value around VCC minus 1.2 V.  Making a symmetrical power supply does not help. I checked everything about 100 times and can't find any solution... If anybody of you know how to help me I'd be grateful.

I've built a current sense differential amplifier that measures the voltage across a 1 Ohm resistor, to give me a reading for the current through it.  I've connected it as follows, all resistors are matched 10k to give a gain of 1:    (Image source: )  I am powering it from a single rail 12 volt source. The problem is even though this is a rail to rail opamp (Output Low swing from 5-20mV) I'm getting a constant error of 0.62V and it seems the opamp is not able to go below this value.   I have tried to resolve this by connected Vout to ground using a 10k resistor, but that makes no difference whatsoever.  I tried it with dual supply configuration (+8V, -8V) and that seems to resolve the issue. However I want to run this off a single supply rail, so this is not a viable option.  How can I resolve this? I'm trying to measure the voltage drop across a 1 ohm resistor to give me a reading for current through the circuit (0-1V represents 0-1 A) so I can set up a current limit. A better way (or practice) to doing this is also welcomed. The initial (but not ideal) fix I can think of, is to offset the readings by a few volts?  Edit:  Changed R1-R4 from 10k to 100k and I'm down to about 30-50mV!


A recent article in The New Yorker included this phrase: "...forbade him to represent Israel in bridge for an additional 18 months...". I would have written " forbade him from representing Israel". Which is correct, and why?

Some verbs are followed by ing, e.g. I enjoy swimming. We can't say I enjoy to swim. Likewise, some verbs are followed by to, e.g. I decided to make a plan.   Which particular verbs are followed by ing and to? Can you please provide a list for that?  Moreover, which verbs can be followed by both without having the meaning changed?


While researching how to derive the divergence theorem from the generalized Stokes' theorem, I ran into the , which claimed that the divergence of a vector field $X$ on a manifold $M$ could be defined as the unique scalar function which solves $$(\textrm{div}X)\omega = d(X \;\lrcorner\;\omega) \quad (1)$$ where $\omega$ is the volume form of $M$ and $X \;\lrcorner\;\omega$ is the interior product with $X$. Stokes' theorem then implies that $$ \int_{M} (\textrm{div}X)\omega = \int_{\partial M}X \;\lrcorner\;\omega \quad (2)$$  This is claimed to be a generalization of the .   Why is $(1)$ a "good" definition for divergence? How does it connect to the usual definition? How should I (intuitively) interpret the relation with the volume form? How does $(2)$ restrict to the usual statement of the divergence theorem? I'd assume there's some way to transform $X \;\lrcorner\;\omega$ into $(X\cdot n) \alpha$ where $\alpha$ is the volume form on $\partial M$, but I don't know how to derive it.

So, given the generalized Stokes theorem:  $$\int_{\partial M} \omega = \int_M d\omega$$  where M is an n-dimensional surface and $\omega$ is a p-form on M (p < n). How can I derive the Divergence Theorem?  $$\iint_S {\bf F} \cdot d{\bf S} = \iiint_R \text{div}\;{\bf F}\; dV$$  I also have another related question. I'm learning that there are several theorems, like the divergence theorem, that are special cases of the generalized Stokes Theorem. For example, apparently, the Kelvin-Stokes Theorem is a special case of the General Stokes Theorem where n=2. So my 2nd question is, what if n=1 in the general stokes theorem? What does that imply or lead to?  Thank You.


I want to list all files in drive and i m also trying this code in c#. but i get unaurthorizedfileaccess exception. plzz give me right solution so i can go ahead in my work....  try {     var files = new List<string>(Directory.GetFiles("E:\", "*.*", SearchOption.AllDirectories));     Method(files);            } catch(Exception e) {     Console.WriteLine(e); }     static void Method(List<string> files) {     foreach (string file in files)     {         Console.WriteLine(file);     }     Console.WriteLine(files.Count); }

I am trying to display a list of all files found in the selected directory (and optionally any subdirectories). The problem I am having is that when the GetFiles() method comes across a folder that it cannot access, it throws an exception and the process stops.  How do I ignore this exception (and ignore the protected folder/file) and continue adding accessible files to the list?  try {     if (cbSubFolders.Checked == false)     {         string[] files = Directory.GetFiles(folderBrowserDialog1.SelectedPath);         foreach (string fileName in files)             ProcessFile(fileName);     }     else     {         string[] files = Directory.GetFiles(folderBrowserDialog1.SelectedPath, "*.*", SearchOption.AllDirectories);         foreach (string fileName in files)             ProcessFile(fileName);     }     lblNumberOfFilesDisplay.Enabled = true; } catch (UnauthorizedAccessException) { } finally {}


So, in season 5/The Winds of Winter,      Myrcella dies/will likely die.   If not, let's just say for the sake of argument that that's the case.  Now assuming for some reason that      Tommen and Margaery did not conceive   at a time when      Joffrey, Tommen and Myrcella   are dead, who      becomes king/queen   ?  Let's not get into speculative stuff like the      kingdoms rebel or secede or someone invades Westeros   Let's assume some ideal situation like the relevant lords believe (at least in practice) that      Tommen, Myrcella and Joffrey are legitimate heirs of Robert Baratheon   and      Daenerys/Aegon/fAegon   doesn't/don't invade anytime soon.  In general, what does the small council/High Septon et al do in situations like these?  What about the wardens or other lords and ladies of Westeros? What might they do? Would this affect them?

I'm three quarters through the third book, "Storm of Swords" right now (so please, no spoilers from too late in the book or any subsequent books).  I just read a part where Tyrion is discussing with Prince Oberyn and they mention the difference between Dornish law and Westerosi law in Line of Succession (ie women can rule under Dornish law).  I'm a little confused trying to puzzle out what the exact LOS rules are.  At first I though it was: at the moment a king/lord dies, to find who holds the title next, you do a depth-first search down the family tree starting with the oldest sibling (ignoring anyone who isn't true-born or has given up their claim ie as Night's Watch or Kingsguard etc.).  Then, for Dornish law you take the first living person and for Westerosi law the first living male person found in this way (so succession can pass through a woman in both cases, but only Dornish law actually allows them to claim the title). If there are no valid living heirs, then you work backwards along the paternal line until you find an ancestor who has living heirs and start from them.  But there were various references to if Sansa's brothers were all dead, then her child would claim Winterfell.  It seems to me that that's only true if somebody else doesn't get it first.  In other words, if Sansa's brothers are killed before she has a child (even if she's already married), doesn't that mean Winterfell would pass to the nearest cousin along her father's line (whomever that may be)?  And then because that cousin has already held Winterfell, when they die the next in the line of succession starts from them so Sansa's children's family would not have claim to Winterfell again unless that cousin has no valid heirs.  What am I missing here? Is there some exception?  Are there no valid cousins?


var1 = "0123456789"   I need to store this string into another string variables by breaking it into 3 parts like    par1 = '0123'   par2 = '4567'   par3 ='89   Purpose:  I have got a dataset I need to break the each record and store it in different variables.

I have a list of arbitrary length, and I need to split it up into equal size chunks and operate on it. There are some obvious ways to do this, like keeping a counter and two lists, and when the second list fills up, add it to the first list and empty the second list for the next round of data, but this is potentially extremely expensive.  I was wondering if anyone had a good solution to this for lists of any length, e.g. using generators.  I was looking for something useful in itertools but I couldn't find anything obviously useful. Might've missed it, though.  Related question:


How can i update the statecode of a lead which is converted.   I am trying to update statecode and countrycode of leads through dataloader. But i get records with errors "Cannot reference converted lead". I am curious to know that if there is any way to update those fields.

Am trying to Update Leads.  When Lead converted flag is true.  Lead Status is Contacted. I have to update all the contacted leads to Converted.  Am Getting this error on the data loader:     ERROR: cannot reference converted lead   Maybe because converted leads cannot be updated because they are locked out once they are converted?  Is there a workaround to update Lead Status to Converted from Contacted?


The question is simple, how to add days to this date format:  MM/dd/yyyy like 11/06/2015

I'm working with a date in this format: yyyy-mm-dd.  How can I increment this date by one day?


What's the effect of int a(); in C++?  Is it equivalent to int a or int a(0)?  And how about char c() and double d()?

Is there any good reason that an empty set of round brackets (parentheses) isn't valid for calling the default constructor in C++?  MyObject  object;  // ok - default ctor MyObject  object(blah); // ok  MyObject  object();  // error   I seem to type "()" automatically everytime. Is there a good reason this isn't allowed?


I think we need another incarnation of Stack Overflow for electrical engineering questions. I just answered  on Stack Overflow which probably should have been marked as Not Programming Related, yet it's one of a family of questions that need a good community to ask and also are tangentially related to programming. I propose that this new site, if created, be for questions about circuit design, selection of components, and things of that nature. Not "how do I replace my iPod's battery". Should we go forward?  I even thought up a potential name for it... Spark Overflow.

Is there an appropriate place to suggest new Stack Exchange based sites, perhaps a place for them to be voted upon?  I wish there was a Stack Exchange site for Aviation (both real-life and simulated).


So we have one task which is to calculate the subnet mask for 310 subnets. The IP of the company is 102.0.0.0.  I think the right approach would be to solve this equation 310 < 2^x which gives me approximately 8.27 so I would need 9 bits, which would make the subnet mask like this 255.255.128.0.  The question is that if this is correct, which would be the first subnet and which IP Addresses would be assigned to the first and the last of the subnet?   I am asking this because I am not sure how to get all the 310 subnets. If I look at the subnet mask on a bit level I get :  1111 1111 1111 1111 1000 0000 0000 0000 --------- -----------|----------------| net id                 host id   Our teacher explained that the first subnet would be as the following :  1111 1111 0000 0000 1000 0000 0000 0000   The second would be :  1111 1111 0000 0001 0000 0000 0000 0000   And the third would be :  1111 1111 0000 0001 1000 0000 0000 0000   Is that correct?  If yes so, I calculated the following for the first and the second subnet :  102.  0.  0.  0 255.255.128.  0  IP 0110 0110 0000 0000 0000 0000 0000 0000 SN 1111 1111 1111 1111 1000 0000 0000 0000    IP 1111 0000 0000 0000 1000 0000 0000 0000 IP 1111 0000 0000 0000 1111 1111 1111 1111      102.0.128.0     102.0.255.255  IP 1111 0000 0000 0001 0000 0000 0000 0000 IP 1111 0000 0000 0001 0111 1111 1111 1111      102.1.0.0     102.1.127.255   Please let me know if anything is wrong.

This is a  about IPv4 Subnets.      Related:               How does Subnetting Work, and How do you do it by hand or in your head?  Can someone explain both conceptually and with several examples? Server Fault gets lots of subnetting homework questions, so we could use an answer to point them to on Server Fault itself.   If I have a network, how do I figure out how to split it up? If I am given a netmask, how do I know what the network Range is for it? Sometimes there is a slash followed by a number, what is that number? Sometimes there is a subnet mask, but also a wildcard mask, they seem like the same thing but they are different? Someone mentioned something about knowing binary for this?


, it'll "Open with" How could i get the file that was "opened with" my python script. Currently i type the name of the file : zipname = input("Enter .osz file : ") with zf.ZipFile(zipname+".osz","r") as zip:  But i wanted to know if i can speed up the process like this. I already searched the question but i haven't found anything.

I would like to drag and drop my data file onto a Python script and have it process the file and generate output. The Python script accepts the name of the data file as a command-line parameter, but Windows Explorer doesn't allow the script to be a drop target.  Is there some kind of configuration that needs to be done somewhere for this work?


Suppose that we have $ x+(1/x)=1$, can we compute the expression $x^{1389}+(1/x)^{1389}$ from that? and how?


Please, help me to prove that $$ \sum_{n=1}^\infty \frac{\cos(\pi n-\sqrt{\pi^2n^2-9})}{n^2}=-\frac{\pi^2}{12 e^3} $$ I found this fact here  but there's no reference.

quotes (see equation $(26)$)     Gosper gives the unusual equation connecting $\pi$ and $e$ $$\sum_{n = 1}^{\infty}\frac{1}{n^{2}}\cos\left(\frac{9}{n\pi + \sqrt{n^{2}\pi^{2} - 9}}\right) = -\frac{\pi^{2}}{12e^{3}}\tag{1}$$   I did not find any references to a paper in which Gosper proved the above formula. I am perplexed by this cosine term in the formula and it does not seem to resemble any familiar series. A direct proof of this formula would be greatly appreciated. Or if someone knows Gosper's paper where this formula is established then do provide a link to that paper.  Update: We can see that $$\frac{9}{n\pi + \sqrt{n^{2}\pi^{2} - 9}} = n\pi - \sqrt{n^{2}\pi^{2} - 9}\tag{2}$$ and noting that $\cos(n\pi - \alpha) = (-1)^{n}\cos \alpha$ we can see that the formula of Gosper can be written as $$\sum_{n = 1}^{\infty}\frac{(-1)^{n}}{n^{2}}\cos\sqrt{n^{2}\pi^{2} - 9} = -\frac{\pi^{2}}{12e^{3}}\tag{3}$$ I think that the formula given by Gosper is probably a special case of a more general formula for the sum $$\sum_{n = 1}^{\infty}\frac{(-1)^{n}}{n^{2}}\cos\sqrt{n^{2}\pi^{2} + a^{2}}\tag{4}$$ (the formula $(3)$ corresponds to $a = 3i$). Looks like Gosper is also fond of strange formulas like Ramanujan.


How can I display a link to a specific comment in Stack Overflow? Like how can I find the url?

The increase in the character limit of comments has led them to become as important as the questions and answers that spawn them. On several occasions (especially on meta) I've found reason to want to link to a comment directly. I'd imagine something as simple as making the date / time stamp an anchored link which mimics the behavior of the question link.


If the title doesn't explain well enough I will detail here: I have a PDF file created with an android app. It allows you to attach files to a pdf. This is a standard feature provided by Adobe. There are libraries out there to do almost anything with a PDF file using PHP. Many even support adding these attachments. I need to extract and save the image(.jpg) embedded inside the PDF to the server. Saving the PDF file isn't really my concern. Just figuring out how to touch the files inside the PDF.  Any help is awesome and I can provide an example PDF if requested. Email me at AriderM@gmail.com Thanks!  EDIT: I'm looking to gain access to these files in PHP.   EDIT: I do mean attached to the file, similiar as an email functions where It's there, but not embedded.

Does anyone know of a good method for editing PDFs in PHP? Preferably open-source/zero-license cost methods. :)  I am thinking along the lines of opening a PDF file, replacing text in the PDF and then writing out the modified version of the PDF?  I have programmatically created PDF files in the past using FPDF, but found it a little unwieldy at times.


I am a beginner at photography, and I have a Canon 600D, a old model but pretty OK for me. I am planning to change the kit lens, so i have proffered Canon 50mm 1.8 STM. Because most of the time i prefer to take portrait/ people photo.  All the youtube video reviews for this lens uses canon 6D/60D/7D etc, and at this point i am confused that if Canon 50mm 1.8 STM will work on Canon 600D.  So, can i use Canon 50mm 1.8 STM Lens on Canon 600D camera? Thanks   Oh and one additional question, will i be able to take photos from a distance with this lens?

I have a canon 760D. It has a EF-S lens mount. Am I able to use a EF lens with my camera?


I'm working on a project that will be using RS485 to communicate between a bunch of modules and a master controller. Low baud rate, 9600, but a decent distance, like a couple of hundred feet. I'm wondering if I can get away with reliably using Cat5e for this, and whether or not I need it to be shielded and connected to ground?  If that is the case, would I be able to use the remaining 3 pairs as the ground instead of getting cable with actual shielding?

I have a serial comms project coming up.  A number of boards with RS-485 interfaces need to communicate.  Date rate is 57600bps and cable length will be less than a few hundred feet.  Will shielded CAT5 cable work well enough in this situation or should I pay the extra for "true" RS-485 cable such as ?    I cannot easily visit the install site ahead of time as it's interstate.  I do have the same boards here in the lab I can test with however.


There was a time when I was using Fiddler very often for development puproses. At some point I stopped and realized that some programs doesn't conntect to the internet when fiddler is off. At the time it was only Visual Studio, I couldn't look for NuGet packages, my Resharper subscription was not able to verify itself. Few months later I've installed Discord and there is also the problem. when I start Discord it checks for updates, and when there is no Fiddler open, it will fail to communicate. I have uninstalled Fiddler thinking that this will help, but it didn't. Is there some sort of setting I have changed and don't remember or what could be possibly wrong with my OS that this is happening? I am running Windows 7 SP 1 x64.

I have installed fiddler on my local machine and when it's working for a long time it uses a lot of RAM.  I have internet when I'm using fiddler but when I close it, I lose my internet connection.  How do I switch off fiddler properly so that I don't lose my internet connection?


I have seen this used on a few posts and tried searching what it stands for. Sure it will be glaringly obvious once someone tells me, but what does 'CVers' mean?

What are the common phrases, words, abbreviations that are used on Stack Overflow, Server Fault, Super User, Meta Stack Overflow, and the other Stack Exchange sites? This is meant to be a very quick overview, not an in-depth tutorial. When considering whether a term ought to be included, please use this test:  New user comes in and posts on day 1. What terminology or jargon are they likely to run into (comments, support, system messages, etc.) that cannot be understood from the context without prior experience with the site (that is, clear only if known). For example: "This is a dupe. Flag a diamond mod to close or migrate to SU." Huh? Can these instruction be made clear from the glossary? Is it clear for those for whom English is a second language?  Please:  Edit the existing answer Insert relevant links to more detailed information on the term/phrase/abbreviation Add only factual information Keep it very, very brief, terse, and to the point Delete your own comments once they become irrelevant (integrated into the glossary) Use the Edit Summary box to note reasons for your edit, not comments  Please avoid:  Opinion Using abbreviations, terms, and phrases inside a description Unverified information Uncommon terms, abbreviations, phrases Long descriptions Unnecessary detail - link to the relevant FAQ instead Citations or examples of usage Inside jokes that are not common on all of the trilogy () Common Internet jargon (that is, , , , etc.) unless usage here differs significantly  Recurring discussion: While the experiment to keep meta-discussion in the comments is going well (that is, deleting them once consensus is reached) it is clear that some discussions will be recurring, and we'll have to keep a record around so people new to the glossary can understand the consensus already reached. Add a new answer if you believe a new issue is likely to come up repeatedly. For instance, discussion about what terms to include, whether the glossary should be broken up to make linking easier, or formatting issues might be best discussed in new answer/comment posts.


When I use the following, I get a result as expected:  $ echo {8..10} 8 9 10   How can I use this brace expansion in an easy way, to get the following output?   $ echo {8..10} 08 09 10   I now that this may be obtained using seq (didn't try), but that is not what I am looking for.  Useful info may be that I am restricted to this bash version. (If you have a zsh solution, but no bash solution, please share as well)  $ bash -version GNU bash, version 3.2.51(1)-release (x86_64-suse-linux-gnu)


So, my dog has a 'babble ball', which is a toy ball that plays random sounds when she rolls it around. She loves it, but the sounds are cringe-worthy. I would like to essentially remake this, but playing sounds of my own choosing (in this case, sound snippets from Austin Powers films).  Because it all has to fit in a small plastic ball, space is at a premium, so please bear that in mind - for instance, I -cannot- use a shield. Also, the sound quality doesn't have to be exceptional, given the application.  Currently, I'm planning to use a shake switch to detect when the ball is in motion, and ideally use an arduino chip as the brains. The part I'm struggling with is storing, and playing the audio.  The default Internet suggested option seems to be using pwm to play sound off a microsd card.  I do not want to use a playback chip, as I'm trying to use this as an excuse to learn how to do this.  What I would like to ask, is;  A. Could I store the relevant sound bytes on the arduino itself? Either in the sketch, or some sort of on-board memory? Putting a microsd card in for a couple of seconds max of audio seems overkill.  B. If so, how would one go about doing this?  C. Out of curiosity, how would one play a sound file without the use of a microcontroller? I appreciate it would probably always be easier to use one, but I'm interested if there is some sort of dedicated IC for this purpose.

I never had to deal with sound and I am pretty sure some of you guys have some experience in that kind of application.  My question is more about getting some tips on the different ways to implement an embedded system based on an AVR that plays sounds. More precisely:   What library should I use? Which sound format should I choose? Do I necessarily need a dedicated memory chip aside the MCU? If yes, which one would you recommend? Do you have some code sample to share?   As always, I know that everything depends on the target application. Here are a few precisions:   I want to make a toy for the kids of a friend of mine, the idea is to have a short sound lasting no more than 30[s] I am not interested in high fidelity sound Power consumption matters


I have burned the ISO image onto a disc, restarted my computer booting from the disc, gone through the "install ubuntu" option to run inside Windows 8. And a while later it tells me to remove the installation media, close the try and press enter.  Then it reboots my laptop, then takes me into Windows 8. Ubuntu literally did nothing!  I'm confused. And I'm stressed out. I've been at this for the pass 5 hours, FIVE hours!  I have a USB available if it's easier to install like that.

I have Windows 8 Release Customer Preview on my laptop. I tried to install Ubuntu on it with Ubuntu Windows installer (I have always used this to install, although that was on Windows 7), it installs and asks to reboot, then immediately Windows 8 boots up.  I do not have the option to choose what OS to boot. How can I boot to Ubuntu? VM is not exactly what I would like to use, but it is an option, however a last resort. Any help?


Date formatting in the U.S.A. is usually shown as Month / Day / Year, while international users expect dates to be shown as Day / Month / Year.   What is the best way to avoid confusion for a date like 04/05/2016 being interpreted as April 5th or May 4th?   This is being used on a form collecting dates along with a calendar picker UI to help avoid confusion, but wasn't sure that was enough.   I have suggested using three letter abbreviations for the month:   Apr 5, 2016 or May 4, 2016

I'm looking for an easy-to-read way to format time and date. The time and date will be displayed in a piece of software, and will be used to tell when an event occurred. For example,      "A temperature spike occurred at [t&d]".    Shorter versions of the time and date will be displayed where appropriate. They will use the format YYYY/MM/DD HH:MM:SS UTC±HH:MM.  Given the software user might be in a different timezone, I feel that using natural language (and saying an event occurred 'Yesterday' or 'Last week') is not ideal. I would like to know what other formats of time and date are standard. Currently I hypothesize that the two formats will be:    "Commonwealth" format: DAY, DD MON YYYY at HH:MM:SS (UTC±HH:MM) eg.      Tue, 30th July 2013 at 15:42 (UTC+13)  US format: DAY, MON DD YYYY at HH:MM:SS (UTC±HH:MM) eg.      Tue, July 30th 2013 at 15:42 (UTC+13)    DAY is a 3-letter abbreviation for the day  MON is a 3-letter abbreviation for the month unless the month has 4 letters in which case, just use that  The year is optional and will default to the current year if not specified    Are my date formats correct and good natural language? Or are there better ones?  Thanks in advance!


Q: Given the function $f(x)=\sum_{n=1}^\infty f_n(x)$, where $f_n(x)=      \left\{      \begin{array}{lr}        0;   \;\;if  \;x< r_n \\        \displaystyle \frac{1}{2^n}; x\geq r_n      \end{array}    \right.   $  Here $r_n$ is an enumeration of $\mathbb{Q}$. Show that $f(x)$ is contionuous at irrationals and discontinuous at rationals.  Here is my work. I proved that each $f_n(x)$ is continuous at irrationals. But now stuck in proving $f(x)$ continuous at irrationals. Can anyone please help me?

Let $q: \mathbb{N} \to \mathbb{Q}$ be a bijection and denote the image of $k \in \mathbb{N}$ by $q_k$.  Let $f: \mathbb{R} \to (0,1)$, $$ f(x) = \underset{q_k \leq x}{\sum_{k \in \mathbb{N}}} 2^{-k} $$  Show that:  1) $f$ is strictly increasing  2) $f$ is continuous at $x$ iff $x \in \mathbb{R} \setminus \mathbb{Q}$.  My work:  Let $x, y \in \mathbb{R}$, $x < y$. Then there exists $q_n \in \mathbb{Q}$ s.t. $x < q_n < y$. Now $$ f(x) = \underset{q_k \leq x}{\sum_{k \in \mathbb{N}}} 2^{-k} < \underset{q_k \leq x}{\sum_{k \in \mathbb{N}}} 2^{-k} + 2^{-n} \leq \underset{q_k \leq y}{\sum_{k \in \mathbb{N}}} 2^{-n} = f(y) $$ so $f$ is strictly increasing.  I think my proof of 1) is ok, but how can I prove 2)?


I currently changed 50,000+ URLs of my website something similar to example.com/articles/new-slug from example.com/old-slug.  What I have done so far.   Add 301 redirection for all old articles to new one. Remove old sitemap from Google Web Master Tools and Add new sitemap.   What else should I do?

I recently submitted a sitemap.xml in Google's Webmaster Tools and some of the pages already got indexed. The problem now is, that I cleaned my URLs with MOD_REWRITE in the .htaccess file afterwards and I would like the new ones to be indexed. The old ones should be removed from the Google Index.  Indexed Page:  www.example.com/article.php?=article=this%is%an%example   New URL:  www.example.com/article-this-is-an-example   Do I even have to remove them manually from the index in any way or do they refresh if Google crawls my new sitemap? I really wan't to prevent duplicate content.  Thanks in advance.


I have a MacBook Pro with 1 TB of disk space.  When I run df -h I get the following:    It tells me I have 702 GiB available on / which I suspect is true -- but nothing on /home.  Do I have a virus or something?

On Linux, (which I am used to), /home is the place where home folders live.  On a Mac, home is some kind of crazy mutant:  $ mount /dev/disk1 on / (hfs, local, journaled) devfs on /dev (devfs, local, nobrowse) map -hosts on /net (autofs, nosuid, automounted, nobrowse) map auto_home on /home (autofs, automounted, nobrowse)   Other than to be non-conformist, is there some purpose to this auto_home mount point?  Considering how it mucks up things that come right out of the box, there must be some wonderful thing that it accomplishes, but I can't figure out what that would be.....


I trying to make jet exhaust for short jet animation, but when i trying to render it, fire and smoke are rendered as black particles.    Here's the node setup for the domain material:       EDIT  After I followed instructions to add shaders for the fire I got this result:    Here is modified node setup:

I am trying to make an explosion in Blender.  I am having a problem with the smoke simulation with the Cycles rendering engine. More specifically, I have been able to render smoke, but flames do not show up. In the viewport however, everything looks perfectly fine.  The render looks like this:    But in the viewport, it is clear that there are flames. Does anyone have any idea what is going on?     This is NOT a duplicate of  because I have Flame Rate set to 1.0


Can you help me to prove the following equality ?

I would like to prove inductively that $${2n\choose n}=\sum_{i=0}^n{n\choose i}^2.$$  I know a couple of non-inductive proofs, but I can't do it this way. The inductive step eludes me. I tried naively things like $${2n+2\choose n+1}={2n+2\over n+1}{2n+1\choose n}=2\cdot {2n+1\over n+1}{2n\choose n},$$  But I don't think it can lead me anywhere. I would like the proof to be as simple as possible.


Clearly, this problem requires applying epsilon, delta definition of uniform continuity. im having trouble finding values that will work here and hence, writing the proof in general.

So I understand the definition of uniform continuity, but wanted some suggestions to prove that a function is or isn't uniformly continuous. I have looked ahead and have seen that if a function is continuous on a compact domain, then the function is also uniformly continuous. But for the purposes of the examples below, I cannot use compactness, or the fact that a function is uniformly continuous if it is continuous and has a bounded derivative. Here's one example:  prove $f(x)= \sqrt{x}$ is uniformly continuous on $(0, \infty)$. I have seen this question asked before on this forum, and the respondents used the traditional definition. Ie. they found a delta such that if $|x-y|<\delta$, then $|\sqrt{x}-\sqrt{y}|< \epsilon$. I was wondering if I could try this in a slightly different way. Suppose I prove that $f$ is continuous at $x_0$, and the choice of $\delta$ doesn't depend on $x_0$. After some scratch work, I proved that $f(x)$ is continuous at $x_0$ provided that $|x-x_0|< \min\{1,(\sqrt{x_0+1} + \sqrt{x_0})*\epsilon\}$. Since $x_0$ is always greater than $0$, we can say that $\delta= \min\{1, \epsilon\}$. Because I proved that our choice of $\delta$ doesn't depend on $x_0$, is this a valid proof that $f(x)$ is uniformly continuous? Here's another example: I want to prove that $f(x)=x^2$ is not uniformly continuous on $(0, \infty)$. After some work, I proved that $f(x)$ is continuous at $x_0$ (in dom $f$), provided that $\delta< min \{1, \frac {\epsilon}{ (2x_0+1)}\}$. Here, since our choice of delta does depend on $x_0$, we can say the function is not uniformly continuous. So am I approaching these problems correctly? I realize that I have not been using the definition of uniformly continuity. (that if $f$ is uniformly continuous, then if $|x-y|<\delta$, then$|f(x)-f(y)|< \epsilon$. Also, sorry about the formatting. I realize I should learn proper formatting soon!. Also, I have read the following post regarding this topic:


Before '14 release there was a invaluable feature in salesforce to check the covered/uncovered code segments of a particular class or trigger. They were clearly showed with pink and red color so that developers can easily manage the code coverage. But recently forums say it has been moved into developer console. But I can't find that feature even in the console. Please help if anyone know the job.

A quick question. We used to have a code coverage highlighted in dev console on which lines of the class are covered and not covered before.   Has salesforce removed this option or do i need to activate it somewhere?


I'm trying to understand ordinal arithmetic.  If one had an ordered list of the some subset of countable ordinal numbers, what order would the following 6 countably infinite ordinals be in?  If the following order is not correct, what is correct order and why is that the correct order?  $$\omega\;<\; \omega^2 \;<\; 2^\omega \;<\; \omega^\omega \;<\; {^\omega}2 \;<\;{^\omega} \omega$$  I know $\epsilon_0 = {^\omega} \omega$ is the largest, but is still countable, but I'm not sure where the powers of $2$ fit in versus the powers of $\omega$.  I understand why $\omega^2$ or $\omega^n$ for any finite value of $n$ needs to be countable.  But, why does $\omega^\omega$ need to be countable?  For cardinal numbers, $2^{\aleph_0}$ is uncountably infinite.  Presumably, there would be some contradiction in mathematics if any finite ordinal arithmetic equation involving $\omega$ generated an uncountable infinity.

In , it says that any epsilon number with the index that is countable is countable. How is it? Out of all those numbers, I especially want to know why $\epsilon_0$ is countable.  Thanks.


It is given in the book Machine Learning A probabilistic Perspective, but i am not able to understand it. Can some one provide an explanation for that ?  I am not clear with the way sub gradient is defined and how is it helping in the optimization  .

I've been reading , and I would like to know why the Lasso provides variable selection and ridge regression doesn't.  Both methods minimize the residual sum of squares and have a constraint on the possible values of the parameters $\beta$. For the Lasso, the constraint is $||\beta||_1 \le t$, whereas for ridge it is $||\beta||_2 \le t$, for some $t$.  I've seen the diamond vs ellipse picture in the book and I have some intuition as for why the Lasso can hit the corners of the constrained region, which implies that one of the coefficients is set to zero. However, my intuition is rather weak, and I'm not convinced. It should be easy to see, but I don't know why this is true.  So I guess I'm looking for a mathematical justification, or an intuitive explanation of why the contours of the residual sum of squares are likely to hit the corners of the  $||\beta||_1$ constrained region (whereas this situation is unlikely if the constraint is $||\beta||_2$).


I have a dedicated server running Proxmox and a VM inside Proxmox running  (Wheezy).  As I only have one IP address, I'm using  to forward ports to the VM.  My /etc/network/interfaces:  # The loopback network interface auto lo iface lo inet loopback  # For routing auto vmbr1 iface vmbr1 inet manual     post-up /etc/pve/kvm-networking.sh     bridge_ports dummy0     bridge_stp off     bridge_fd 0   # vmbr0: Bridging. Make sure to use only MAC adresses that were assigned to you. auto vmbr0 iface vmbr0 inet static     address 91.121.<redacted>     netmask 255.255.255.0     network 91.121.<redacted>.0     broadcast 91.121.<redacted>.255     gateway 91.121.<redacted>.254     bridge_ports eth0     bridge_stp off     bridge_fd 0  iface vmbr0 inet6 static     address 2001:41D0:1:A790::1     netmask 64     post-up /sbin/ip -f inet6 route add 2001:41D0:1:A7ff:ff:ff:ff:ff dev vmbr0     post-up /sbin/ip -f inet6 route add default via 2001:41D0:1:A7ff:ff:ff:ff:ff     pre-down /sbin/ip -f inet6 route del default via 2001:41D0:1:A7ff:ff:ff:ff:ff     pre-down /sbin/ip -f inet6 route del 2001:41D0:1:A7ff:ff:ff:ff:ff dev vmbr0  auto vmbr2 iface vmbr2 inet static     address 10.21.21.254     netmask 255.255.255.0     bridge_ports none     bridge_stp off     bridge_fd 0     pre-up echo 1 > /proc/sys/net/ipv4/ip_forward     pre-up iptables-restore < /etc/iptables.rules   The iptable rule looks like so (along with more ports, but they all look the same more or less):  -A PREROUTING -i vmbr0 -p tcp -m tcp --dport 80 -j DNAT --to-destination 10.21.21.4:80 -A POSTROUTING -s 10.21.21.0/24 -o vmbr0 -j MASQUERADE   There is a site running using , proxied by  all running inside the VM.  My Nginx configuration is:  upstream node {     server 127.0.0.1:4567; } server {     listen 80;     server_name myDomain.co.uk;     location / {         proxy_pass http://node;         proxy_next_upstream error timeout invalid_header http_500 http_502 http_503 http_504;         proxy_redirect off;         proxy_buffering off;         proxy_set_header        Host            $host;         proxy_set_header        X-Real-IP       $remote_addr;         proxy_set_header        X-Forwarded-For $proxy_add_x_forwarded_for;         proxy_http_version 1.1;         proxy_set_header Upgrade $http_upgrade;         proxy_set_header Connection "Upgrade";     } }   When pinging my domain, it works fine:  PING myDomain.co.uk (my.ip.address) 56(84) bytes of data. 64 bytes from myHostName.eu (my.ip.address): icmp_req=1 ttl=64 time=0.282 ms 64 bytes from myHostName.eu (my.ip.address): icmp_req=2 ttl=64 time=0.275 ms 64 bytes from myHostName.eu (my.ip.address): icmp_req=3 ttl=64 time=0.284 ms 64 bytes from myHostName.eu (my.ip.address): icmp_req=4 ttl=64 time=0.339 ms   However when trying , it refuses to connect.  curl --verbose myDomain.co.uk * About to connect() to myDomain.co.uk port 80 (#0) *   Trying my.ip.address... * Connection refused * couldn't connect to host * Closing connection #0 curl: (7) couldn't connect to host   Edit:  I've changed the rules to (as per @FrederikNielsen's advice):  -A PREROUTING -d my.ip.address/32 -p tcp -m multiport --dports 80 -j DNAT --to-destination 10.21.21.4 -A POSTROUTING -s 10.21.21.0/24 -o vmbr0 -j MASQUERADE -A POSTROUTING -s 10.21.21.0/24 -d 10.21.21.4/32 -p tcp -m multiport --dports 80 -j SNAT --to-source my.ip.address   But still no luck. The error has changed to:  * About to connect() to myDomain.co.uk port 80 (#0) *   Trying my.ip.address... * Connection timed out * couldn't connect to host * Closing connection #0 curl: (7) couldn't connect to host

This is a  about Hairpin NAT (Loopback NAT).   The generic form of this question is:  We have a network with clients, a server, and a NAT Router. There is port forwarding on the router to the server so some of it's services are available externally. We have DNS pointing to the external IP. Local network clients fail to connect, but external work.   Why does this fail? How can I create a unified naming scheme (DNS names which work both locally and externally)?   This question has answeres merged from multiple other questions. They originally referenced FreeBSD, D-Link, Microtik, and other equipment. They're all trying to solve the same problem however.


I've finally gotten eclipse installed on my 14.04 machine so that it launches from a new terminal with an eclipse.desktop file. I can drag it onto the launcher and when I click it everything works!  Except when I close eclipse later, shut down, boot back up, and the eclipse.desktop file is no longer on the launcher. Instead is an icon from a previous installation of eclipse that leads nowhere.  So there are two issues here, how to get rid of the icon from the previous installation, and how to get the .desktop file to stay on the launcher.

I can't open Eclipse from Dash Home although it shows its icon. Eclipse was properly installed using apt-get.  When I launch Eclipse from Dash Home it doesn't open. It opens only through Terminal. How can I open it from the dash?


I have noticed that if I shutdown Ubuntu 14.04 from a remote terminal via ssh and running sudo shutdown now, the machine does not power off.  If I use the GUI (shut down using Unity on the machine itself) then the machine does power off.  If I look on the console of the machine after issuing the remote shutdown, there are messages relating to modem manager which seems to keep restarting.  Is this a known issue?     Please note this is not a duplicate of  as I'm using ssh to connect.

When I issue the following:  sudo shutdown now   ..my newly commissioned Ubuntu 14.04 server doesn't shut down. It stops with the following message:  * Stopping System V runlevel compatibility Give root password for maintenance: (or type Control-D to continue):   If I type in the root password, the machine simply sits there at the shell prompt.


im a indian citizen. i am holding a schengen visa through portugal. due to some circumstances i am not visiting portugal now and visiting other schengen countries like Germany and Hungary. would that be a problem at immigration?

In case, if I get a multiple-entry Schengen visa in one of the embassies in Ukraine, Kyiv - should my first trip be to the country which issued the visa?  Any there any requirements of this sort? Does this condition vary depending on embassy which issued the visa?  What are the possible consequences on not visiting that country first? Does it somehow depend on country where the embassy is (i.e. non-Schengen and not EU members)?


Looking for natural numbers larger than 210 which can be expressed as the product of two continuous natural numbers or the product of three continuous natural numbers at the same time.  $6 = 1 \cdot 2 \cdot 3 = 2 \cdot 3$ $210 = 5 \cdot 6 \cdot 7 = 14 \cdot 15$  I have made a program to find that numbers smaller than $1000000000$, only to find $6$ and $210$. Are there any other ones?

$6$ and $210$ share the property that both are the products of both two and three consecutive numbers. $6$ is $2\times3$ and $1\times2\times3$ and $210$ is $14\times15$ and $5\times6\times7$. It was easy enough to write a program to search for more numbers with this property, I found that there were no more up to at least $1{,}000{,}000{,}000{,}000$ ($1$ Trillion). But it is beyond me to prove that there are either no more numbers like this or to find the next one. Any ideas?


I used once a programm called "movie splitter" or "movie splitzer".  It was fantastic for split a movie in clips. Someone has it? Do you know how to get it? I couldn't find any similar program. Is there one? Thanks a lot

If just need to crop Audio/Video from a longer track, what can I use? I tried OpenShot, but I find the export video slow, perhaps its compling all the "layers" into a new movie? Perhaps I just need a simple "crop" tool for audio/video will surfice?


As we know from school physics course light has pressure. So my question is will flash light accelerate in space in the direction opposite to light emission? If not, then will flash light with attached mirror accelerate is the direction opposite to light emission?

Photons have no mass but they can push things, as evidenced by .   Can photons push the source which is emitting them? If yes, will a more intense flashlight accelerate me more? Does the wavelength of the light matter? Is this practical for space propulsion? Doesn't it defy the law of momentum conservation?  Note: As John Rennie mentioned, all in all the wavelength doesn't matter, but for a more accurate answer regarding that, see the comments in  .  Related Wikipedia articles: ,


It is often claimed that if we ever sent humans to colonize other stars, we would have to send them on generational ships. However, if the ship traveled at $99.9\cdots 9c$, wouldn't the passangers' time slow down, and make the travel time just, say, 1 year from their point of view?

Suppose I wanted to travel to one of the recently discovered potentially Earth-like planets such as Kepler 186f that is 490 light years away. Assuming I had a powerful rocket and enough fuel, how long would it take me?


I have a video only (no audio) file in h264, mp4 format with 25 FPS and I would like to just set the framerate up to 30 without reencoding the video. Source file: ffprobe 25fps.mp4  ffprobe version 4.1.4-1build2 Copyright (c) 2007-2019 the FFmpeg developers   built with gcc 9 (Ubuntu 9.2.1-4ubuntu1)   configuration: --prefix=/usr --extra-version=1build2 --toolchain=hardened --libdir=/usr/lib/x86_64-linux-gnu --incdir=/usr/include/x86_64-linux-gnu --arch=amd64 --enable-gpl --disable-stripping --enable-avresample --disable-filter=resample --enable-avisynth --enable-gnutls --enable-ladspa --enable-libaom --enable-libass --enable-libbluray --enable-libbs2b --enable-libcaca --enable-libcdio --enable-libcodec2 --enable-libflite --enable-libfontconfig --enable-libfreetype --enable-libfribidi --enable-libgme --enable-libgsm --enable-libjack --enable-libmp3lame --enable-libmysofa --enable-libopenjpeg --enable-libopenmpt --enable-libopus --enable-libpulse --enable-librsvg --enable-librubberband --enable-libshine --enable-libsnappy --enable-libsoxr --enable-libspeex --enable-libssh --enable-libtheora --enable-libtwolame --enable-libvidstab --enable-libvorbis --enable-libvpx --enable-libwavpack --enable-libwebp --enable-libx265 --enable-libxml2 --enable-libxvid --enable-libzmq --enable-libzvbi --enable-lv2 --enable-omx --enable-openal --enable-opengl --enable-sdl2 --enable-libdc1394 --enable-libdrm --enable-libiec61883 --enable-chromaprint --enable-frei0r --enable-libx264 --enable-shared   libavutil      56. 22.100 / 56. 22.100   libavcodec     58. 35.100 / 58. 35.100   libavformat    58. 20.100 / 58. 20.100   libavdevice    58.  5.100 / 58.  5.100   libavfilter     7. 40.101 /  7. 40.101   libavresample   4.  0.  0 /  4.  0.  0   libswscale      5.  3.100 /  5.  3.100   libswresample   3.  3.100 /  3.  3.100   libpostproc    55.  3.100 / 55.  3.100 Input #0, mov,mp4,m4a,3gp,3g2,mj2, from '25fps.mp4':   Metadata:     major_brand     : isom     minor_version   : 512     compatible_brands: isomiso2avc1mp41     encoder         : Lavf58.20.100   Duration: 00:00:04.96, start: 0.000000, bitrate: 15858 kb/s     Stream #0:0(und): Video: h264 (High) (avc1 / 0x31637661), yuv420p(tv, bt709/unknown/bt709), 1920x1080 [SAR 1:1 DAR 16:9], 15854 kb/s, 25 fps, 25 tbr, 12800 tbn, 50 tbc (default)     Metadata:       handler_name    : VideoHandler  Expected output: [...] Input #0, mov,mp4,m4a,3gp,3g2,mj2, from '30fps.mp4':   Metadata:     major_brand     : isom     minor_version   : 512     compatible_brands: isomiso2avc1mp41     encoder         : Lavf58.20.100   Duration: 00:00:04.13, start: 0.000000, bitrate: (approx. 19000) kb/s     Stream #0:0(und): Video: h264 (High) (avc1 / 0x31637661), yuv420p(tv, bt709/unknown/bt709), 1920x1080 [SAR 1:1 DAR 16:9], (approx. 19000) kb/s, 30 fps, 30 tbr, 15360 tbn, 50 tbc (default)     Metadata:       handler_name    : VideoHandler  What I could acchieve so far is either:  creating a file with 29.86 FPS without reencoding (following this post ) creating a file with 30 FPS with reencoding (ffmpeg -i 25fps.mp4 -r 30 -filter:v "setpts=PTS/1.2" 30fps.mp4)  Both is not what I wanted. Any suggestions? I thought/expected this should be as easy as "man, play this at 1.2 speed, thanx" EDIT: Solved as stated in the comment. Had to try some values arount 5/6 until I found it: ffmpeg -itsscale 0.832 -i 25fps.mp4 -c copy 30fps.mp4

I found this example   ffmpeg -i input.mkv -filter:v "setpts=0.5*PTS" output.mkv    but I have a video I want to speed up by 60 times, not just 2X.


that's problably a very noob question, and answer that i found is: the water volume was always the same, what is kinda obivius, but doesn't seen enought to me. So I can't stop thinking, were did the extra ice volume above the water line goes, I had a tought, and a wanna know if it makes any sense.  Is that volume above the water line, exactly the air volume inside the whole ice cube that will be lose during the melting?

I have read the explanation for this in several textbooks, but I am struggling to understand it via Archimedes' principle. If someone can clarify with a diagram or something so I can understand or a clear equation explanation that would be great.


I would like to capture the gps points which are closer the polygon boundary (inside), not point in polygon.     I have arcgis arcinfo v9.3.   i can do with inner buffer of the polygon and intersection and finding the remaining gps points.  Is there any other way ?

I am currently searching for how to create an "Inner Buffer" in ArcGIS for Desktop?  I have a lot of polygons (houses) in one feature class, and one big polygon (in another feature class).   I want so select all houses contained in that one big polygon within a distance to the outer border (e.g. 1000 meters).  Select Layer By Location could be one possibility to solve this but I can't figure out how.


I have set up a script in PHP to send emails, using PHPMailer. Using the following: - sending through my own domain SMTP server using TLS; - signing/authenticating the message with DKIM/SPF; - the "From" email address is on the domain from which I am sending, as well as "Reply-to"  Unfortunately, the email is flagged automatically by Gmail as spam. My domain is not blacklisted (as reported by MXtoolbox.com) and has a score on SpamAssasin of 1.49.  The PHP code is as follows:  <?php require 'PHPMailerAutoload.php'; $adresaMail = "contact@hbooking.eu"; $mail = new PHPMailer(); $mail->Sender = $adresaMail; $mail->From = $adresaMail;   $mail->FromName = "Hotel Booking"; $mail->AddReplyTo($adresaMail, "Hotel Booking"); //Reply-To Address $mail->IsSMTP();  $mail->SMTPAuth = true;     // turn on SMTP authentication $mail->Username = $adresaMail;  // SMTP username $mail->Password = "Tele7abc$"; // SMTP password  $mail->SMTPSecure = 'tls'; // use TLS authentication // $mail->SMTPSecure = "ssl"; // turn on SSL use $mail->Host = "localhost"; $mail->Port = 25; // $mail->SMTPDebug  = 1; // Enables SMTP debug information (for testing, remove this line on production mode) // 1 = errors and messages // 2 = messages only  // $mail->ConfirmReadingTo  = $adresaMail; $mail->IsHTML(true); //turn on to send html email  //add image - begin //$mail->AddEmbeddedImage('test.jpg', 'logoimg', 'test.jpg'); //add image - end $mail->Subject = "Hotel booking webpage"; // use this if you want to use image // $mail->Body     =  "Acest email a fost trimis folosind phpmailer - ";  $Body = "<!DOCTYPE html>       <meta charset='utf-8' />     <title></title>

                 HB	                 HBooking.eu

Signup confirmation

Thank you for choosing to be a HBooking.eu member!

Your subscription to our services has been confirmed.
                 You can now log-in and start advertising your hotel nights to all our travel agents and tour operator members across Europe.

Please feel free to contact us for any queries you may have.

Yours truly,
The HBooking.eu team

&copy; HBooking.eu , 2017. This email has been sent automatically; please do not reply to it.

    ";    $mail->Body = $Body;  $mail->AddAddress("bogpop68@gmail.com","Bogdan Popescu");  if($mail->Send()){ $mail->ClearAddresses(); echo "message sent"; } else {echo "did not send";} ?>   Please help. Thank you all in advance.

This is a tricky one and I've always relied on techniques, such as permission-based emails (i.e. only sending to people you have permission to send to) and not using blatantly spamish terminology.  Of late, some of the emails I send out programmatically have started being shuffled into people's spam folder automatically and I'm wondering what I can do about it.  This is despite the fact that these particular emails are not ones that humans would mark as spam, specifically, they are emails that contain license keys that people have paid good money for, so I don't think they're going to consider them spam  I figure this is a big topic in which I am essentially an ignorant simpleton.


Given the C# enum:  public enum stuffEnum: int {     New = 0,     Old = 1,     Fresh = 2 }   How do I loop through it in a way that I can copy both the key and its value in a single loop? Something like:  foreach(var item in stuffEnum) {     NewObject thing = new NewObject{        Name = item.Key,        Number = item.Value     } }   So you would end up with 3 objects, with their Name properties set to "New", "Old", and "Fresh", and the Number properties set to 0, 1 and 2.   How do I do this?

How can you enumerate an enum in C#?  E.g. the following code does not compile:  public enum Suit {     Spades,     Hearts,     Clubs,     Diamonds }  public void EnumerateAllSuitsDemoMethod() {     foreach (Suit suit in Suit)     {         DoSomething(suit);     } }   And it gives the following compile-time error:     'Suit' is a 'type' but is used like a 'variable'   It fails on the Suit keyword, the second one.


Just created latest Ubuntu on USB stick with ISO. Have loaded from it on my MAC to point one can "try unbuntu" before install OR one can "Instal". How can I be sure it will install on USB and not overwrite MACOS on hard disc. Or am I worrying too much and should just go for it - I have backed up MacOs on hard drive.

If you are hurrying to reply, System → Administration → StartUp Disk Creator -- no, that's not what I'm talking about.   I want to try Ubuntu 11.04's Unity without touching my existing Ubuntu install.  To do this, I need to install the nVidia drivers first (sigh).  To do this, I need changes to persist a reboot.  To do this, I need to really install Ubuntu on a USB key.  How do you do that?    What I tried   I tried to make a USB key from , then boot from it, then choose "Install Ubuntu." The installer refused to install to the installation media itself. I tried, from my installed copy of Ubuntu:  sudo kvm /dev/sdb --cdrom .cache/testdrive/iso/ubuntu_natty-desktop-i386.iso   ...but the installer didn't detect the disk properly.


The terms are the same, but I cannot outwardly see, whether moments in statistics have something to do with moments in physics.  So are they related? How?

I KNOW what moments are and how to calculate them and how to use the moment generating function for getting higher order moments. Yes, I know the math. Now that I need to get my statistics knowledge lubricated for work, I thought I might as well ask this question – it's been nagging me for about a few years and back in college no professor knew the answer or would just dismiss the question (honestly). So what does the word "moment" mean in this case? Why this choice of word? It doesn't sound intuitive to me (or I never heard it that way back in college :) Come to think of it I am equally curious with its usage in "moment of inertia" ;) but let's not focus on that for now. So what does a "moment" of a distribution mean and what does it seek to do and why THAT word! :) Why does any one care about moments? At this moment I am feeling otherwise about that moment ;) PS: Yes, I've probably asked a similar question on variance but I do value intuitive understanding over 'look in the book to find out' :)


Assume I'm playing in a raffle. The tickets are numbered uniquely and in sequence. So the first ticket has the serial number 1, the second has the serial number 2 and so on. At the end of the day someone draws 10 winning raffle tickets randomly. The winning serial numbers are public for everyone. For example: 321,432,501,623,657,702,754,971,1101,1295 Based on this information is there a way to estimate the total number of raffle tickets sold? Of course in this example we know that they sold at least 1295 ticket. But is there a method to find a probable estimate for the upper limit?

Suppose that I observe $k=4$ tanks with serial numbers $2,6,7,14$.   What is the best estimate for the total number of tanks $n$?   I assume the observations are drawn from a discrete uniform distribution with the interval $[1,n]$. I know that for a $[0,1]$ interval the expected maximum draw $m$ for $k$ draws is  $1 - (1/(1+k))$. So I estimate $\frac {k}{k+1}$$(n-1)≈$ $m$, rearranged so $n≈$ $\frac {k+1 }{k}$$m+1$.  But the frequentist estimate from  is defined as:  $n ≈ m-1 + $$\frac {m}{k}$  I suspect there is some flaw in the way I have extrapolated from one interval to another, but I would welcome an explanation of why I have gone wrong!


Why when I try to delete .. from directory I receive error:  rm: refusing to remove '.' or '..' directory: skipping '..'   And before you ask why I want to do this: Just because.

The expression .* is expanded by bash to include the current and parent directories:  $ ls -la total 2600 drwxrwxrwx   2 terdon terdon 2162688 Sep 10 16:22 . drwxr-xr-x 142 terdon terdon  491520 Sep 10 15:34 .. -rw-r--r--   1 terdon terdon       0 Sep 10 16:22 foo $ echo .* . ..   If I run rm -rf .* on my Debian using GNU bash, version 4.2.36(1)-release and rm from rm (GNU coreutils) 8.13, I get this message:  $ rm -rf .* rm: cannot remove directory: `.' rm: cannot remove directory: `..'   Is this a GNU thing or is it POSIX? Are there any *nix systems where the command above will silently delete . and ..?  Also, is this a safety feature of the shell or of the rm command itself?


It seems one of my colleague's biology textbook claims that plant cells, with presence of light, feed back 100% of carbon dioxide molecules from their respiration into photosynthesis. Can you say that carbon dioxide molecules, gas or dissolved, get transferred from the mitochondria to the chloroplast?

Plants do cellular respiration and release CO2 into the air, but does the plant also use some of this CO2 to do the Calvin cycle? Or does all the CO2 required for the Calvin cycle come in through the stomata?


I am confused why the following does not evaluate to true. How do I compare whether two objects are the same?  var x = new Object(); var y = {}; x == y // false  function Person(name) {   this.name = name; }  var p1 = new Person("Chris"); var p2 = new Person("Chris"); p1 == p2 // false

A strict equality operator will tell you if two object types are equal. However, is there a way to tell if two objects are equal, much like the hash code value in Java?  Stack Overflow question  is similar to this question, but requires a more academic answer. The scenario above demonstrates why it would be necessary to have one, and I'm wondering if there is any equivalent solution.


I’ve got a windows tablet that I want to install Ubuntu on. I have attempted this previously but the touch screen is not recognised, and after failing to get it working I reinstalled windows. The touchscreen still did not work so I had to install the drivers from the manufacturers website to get the touchscreen to once again work on windows. Can I install said drivers on Ubuntu so the touchscreen works? It uses a MS DOS command file to install them, how can I get the drivers to install on Ubuntu? Cheers

I am buing assamble self PC for playing games.  I am wondering, all the drivers, which are most likely for Windows, can i just use them on Ubuntu?  So if i understand you right, it will automaticaly detect the drivers, no need for installs ? or it find custom drivers for ubuntu.  This is the setup, will there be any problem with it?


I don't know when I read this, probably a long time since I can't remember most of the plot scenes.  Plot details I can remember:   There's an engineer who, I think, wants to create an elevator. I don't know if it's an invention or whatsoever but it's a powerful one. I can't remember where the elevator will go but I'm confident it'll be a planet - that's why it is powerful. There's a part where he plans to construct it in a mountain. I think that's where tries to build it but a monk tries to sabotage it. The antagonist is a monk.   Note: Sorry if I only gave little information. That's all I can remember from that story. Maybe some of you already read it and forgot it too, you can edit this question to add more information. I googled all info I can remember but it doesn't match the same book I'm trying to find.

I seem to recall reading of a design by Robert Heinlein (but maybe Sheffield, Clarke or another scientific writer), where the energy cost of a space elevator was virtually nil, as descending loads were used to recoup the energy cost of the lift.  Looking for the story,author and if possible the quote where it is described.


What's the cheapest way to get from Melbourne's two airports to Southern Cross Station?  There's buses that run to $20+ each way to each, which seems quite high for public transport so I am curious if there's other alternatives, e.g. Uber, walking to nearby non-surcharged train or bus stations, etc?  (I hereby exclude walking all the way into the city, any cycling, or having an acquaintance pick me up.)

I'm flying into Melbourne, Australia first thing in the morning in a few weeks.  At that time of the morning (rush hour, I assume) a taxi would be madness. What's the most cost efficient form of public transport from there to the city center?


How can I typeset the symbol for the  (from quantum theory)? It consists in an italic "h" whose upper part is crossed by a small "slanted" bar:     For information, this slanted bar also occurs quite often with the letter "l" (ell) in Polish. Example: the Polish word for "word" is "slowo", where the letter "l" bears a slanted little bar.  Is there a package that provides that symbol?  Second question: please tell me where to look for and how to correct the LaTex PDF warning  overfull/underfull \hbox or \vbox

I know what my symbol or character looks like, but I don't know what the command is or which math alphabet it came from. How do I go about finding this out?


Show that for any continuous random variable $X$ that takes only positive real values $\int_{0}^{\infty}\text{Pr}(X\geq x)dx=\mu$ where $\mu$ is the mean.

I've read the proof for why $\int_0^\infty P(X >x)dx=E[X]$ for nonnegative random variables (located ) and understand its mechanics, but I'm having trouble understanding the intuition behind this formula or why it should be the case at all. Does anyone have any insight on this? I bet I'm missing something obvious.


I have a stove that has been in storage, and it seems a mouse has gotten in and soiled the insulation pretty bad and needs to be replaced. My question is, What type of insulation do I need and where can I get it? I need to use the stove so I would like to be able to be able to go and pick the insulation up and not order it online.

We've had mice work their way into the oven insulation of our standalone range and now it stinks when we turn the oven on.  Looking around on the web suggests that replacing the oven is the most common solution, but that seems extreme!  Any suggestions?  (In this case the oven is a "Viking Professional" (bottom of the line) 4 burner + oven freestanding range. I haven't yet been able to pull it out enough to check if it has removable panels or been able to find a manual online.)  I'm guessing the answer will be something like:   locate the manual for your appliance remove access panels remove insulation while being careful about ?? remove insulation that is "stuck" by doing ?? replace with new insulation from ?? put it all back together and test as follows in general be careful of ??   And, perhaps this is too specific to the brand of appliance? It would be useful to know which brands are more amenable to DIY repairs of this type than others.


If the user was to store data....  (or)  If the user were to store data....  we normally use  If I were, If they were but this usage confuses me. I've tried searching in search engines but haven't found any answer!

If I was... If I were...   When is it correct to use "If I was" vs. "If I were" in standard English?


I have problems downloading and installing several software packages.  This is what I get every time: some broken packages.  $ sudo apt install i3 Reading package lists... Done Building dependency tree        Reading state information... Done Some packages could not be installed. This may mean that you have requested an impossible situation or if you are using the unstable distribution that some required packages have not yet been created or been moved out of Incoming. The following information may help to resolve the situation:  The following packages have unmet dependencies:  i3 : Depends: i3-wm (= 4.16.1-1~~xenial1) but it is not going to be installed       Recommends: i3lock (>= 2.2) but it is not going to be installed       Recommends: suckless-tools but it is not installable       Recommends: i3status (>= 2.3) but it is not going to be installed       Recommends: dunst but it is not installable E: Unable to correct problems, you have held broken packages.   My Ubuntu version is 16.04.  As asked for, the contents of /etc/apt/sources.list.d/sur5r-i3.list:  deb https://debian.sur5r.net/i3/ xenial universe

After upgrading from 10.04 to 12.04 I am trying to install different packages.  For instance ia32-libs and skype (4.0).  When trying to install these, I am getting the 'Unable to correct problems, you have held broken packages' error message.   Output of commands:  sudo apt-get install -f Reading package lists... Done Building dependency tree        Reading state information... Done 0 upgraded, 0 newly installed, 0 to remove and 0 not upgraded.   After running this:  sudo dpkg --configure -a foo@foo:~$ sudo apt-get install -f Reading package lists... Done Building dependency tree        Reading state information... Done 0 upgraded, 0 newly installed, 0 to remove and 0 not upgraded.


So I am solving a number theory problem and as the last step I have to figure out all perfect squares in the form of $103k-104$ where $k$ is an integer. I am stuck, is there any hint?

I came across this problem and I believe Lagrange's theorem is the key to its solution.  The question is:     Let $p$ be an odd prime. Prove that there is some integer $x$ such that $x^2 \equiv −1 \pmod p$ if and only if $p \equiv 1 \pmod 4$.   I appreciate any help.  Thanks.


I found the following link on youtube.com:    $\text{Isn't } \textbf{P(0)} = 0 \;\;?$  I did not understand this video. Can anyone kindly tell me why that is so? Why probability of zero is not impossible?  I am asking the above question because in the following link at the bottom of the website, one of the poster said the probability of zero means impossibility. Then? Where is my error in understanding? I am really confused now. Can anyone kindly elaborate on this paradoxical math problem or is it really a paradox?

I read a comment under :     There are plenty of events that can occur that have zero probability.   This reminds me that I have seen similar saying before elsewhere, and have never been able to make sense out of it. So I was wondering    if zero probability and impossibility mean the same? if an event with zero probability doesn't mean that the event is impossible to occur, how probability theory represents/describes impossibility?   Thanks and regards!


Ubuntu 14.04 is pre-installed on my dell laptop. I am trying to run mp4 files but it's not playing. It's asking me to install a package.  I checked for VLC player and it's not installed.

I am unable to play any MP3 or MP4 files. When I try to open any MP3 or MP4 file, both show an error, a Python 2.7 plug-in is required.


My question is about when the statement has a potential of inclusivity, for example a statement like "It's either day time or night time" will obviously be exclusive as it's a logical contradiction if we are in day time and night time simultaneously, however I have realized that when there is potential of inclusivity then it's kind of an assumption that our statement is inclusive. For example: The definition of the union of sets is considered inclusive, etc... Is that always an assumption we can make (that when there potential for inclusivity then the statement is inclusive) or we will have to see what the author states? (for example in some books the definition of the union of sets is explicitly mentioned to be inclusive, in others no)

I am trying to understand the intuition behind .  Why it is called exclusive or? Wikipedia says: it gains the name "exclusive or" because the meaning of "or" is ambiguous when both operands are true  Wait! why "or" is ambiguous when both operands are true?  says nothing about ambiguation.


I was given this series:  Let $q \in \mathbb{C}, \mid q\mid <1. $  $$\frac{1}{2}\sum_{n=0}^{\infty} (n^2 +3n +2)q^n $$  Now I have to show that   $$\frac{1}{(1-q)^3}=\frac{1}{2}\sum_{n=0}^{\infty} (n^2 +3n +2)q^n$$  and proof whether or not this series converges absolutely.  For the convergence I guess I have to use one of the many convergence criteria and for the equality I have no clue how to even start.

Use Cauchy product to find a power series represenitation of   $$1 \over {(1-x)^3}$$ which is valid in the interval $(-1,1)$.   Is it right to use the product of $1 \over {1-x}$ and $1 \over {(1-x)^2}$ if I know thier expantion (HOW).. Is there another way?


I am wondering what ports are used by SQL Server database engine? I need such port number to write configuration scripts to grant access to specific port of the machine installed with SQL Server to make it safe. A related question is whether SQL Server database engine will use one static port number to serve all client requests, or using one port for each request?  BTW: my background is SQL Server 2008 enterprise.  thanks in advance, George

I need to know the default  port settings for the following services   SQL Server SQL Browser SQL Reporting services SQL Analysis services   I neeed to know the port settings for these services for different versions of SQL Server (2000,2005,2008)  Also let me know whether the default port setting will change based on sql server versions  Thanks in advance.


I am to prove that the variation of Dirichlet's function is infinite. I would really appreciate any help, because I do not know how to start. $$f(x)= \begin{cases} 1  & \text{if $x\in\mathbb{Q}$}\\ 0 & \text{if $ x \notin\mathbb{Q}$} \\ \end{cases}$$

I was trying to do some of these questions to check my understanding about the topic, but I'm not sure if they're correct. Here are my answers.   1) Suppose $f$ is continuous on $[0,1]$. Must there be a nondegenerate closed subinterval $[a,b]$ of $[0,1]$ for which the restriction of $f$ to $[a,b]$ is of bounded variation?   No, because $f(x)$ might be a constant function. In this case, $f(x)$ will not be the difference of two increasing functions...and so will not be of bounded variation.  2) Let $f$ be the Dirichlet function, the characteristic function of the rationals in $[0,1]$. Is $f$ of bounded variation on $[0,1]$?   No, because we cannot express it as the difference of two increasing functions.  3) Let $f$ be a step function on $[a,b]$. Find a formula for its total variation.  If we partition $[a,b]$ in such a way that for each $[x_{i-1}, x_i]$ (which is part of the partition), $x_{i-1}$ and $x_i$ each correspond to the midpoint of a step. I know this is not a formal answer, but I'm just trying to check my understanding.


Prove the inequality $${1 \over a^3 (b + c)} + {1 \over b^3 (a+c)} + {1 \over c^3 (a+b)} \ge \frac 32 $$ So, I know a proof for this, but I basically memorized it without understanding. It's $$ {(\frac 1a + \frac 1b +  \frac 1c)}^2 + {(a(b+c) + b(a+c) + c(a+b))}^-1 = {ab + bc + ac \over 2} \ge {\frac 32} $$ I don't know what inequalities were applied here or how. Another proof would also be appreciated.

$a,b,c$ are positive reals with $abc = 1$. Prove that    $$\frac{1}{a^3(b+c)}+\frac{1}{b^3(a+c)}+\frac{1}{c^3(a+b)}\ge \frac32$$   I try to use AM $\ge$ HM.  $$\frac{\dfrac{1}{a^3(b+c)}+\dfrac{1}{b^3(a+c)}+\dfrac{1}{c^3(a+b)}}3\ge \frac{3}{a^3(b+c)+b^3(a+c)+c^3(a+b)}$$ Then how I proceed.


I'm writing a static lib that needs to handle XML. I want it to include everything that is necessary out of the box but I don't know how to make other static libs link to it, namely libxml2.  I pass the -c flag to gcc to generate .o that ar then uses to create the lib. What magic flag combination must I pass to have my static lib swallow libxml2?

I'm tired of adding ten link libraries into my project, or requiring eight of them to use my own. I'd like to take existing libraries like libpng.a, libz.a, libjpeg.a, and combine them into one single .a library. Is that possible? How about combining .lib libraries?


Why force is negative gradient of potential energy? Why negative sign is involved in this definition?

I'm learning about work in my dynamics class right now. We have defined the work on a particle due to the force field from point A to point B as the curve Integral over the force field from point A to B. From math I know that if a vector field has a potential, we only need to evaluate the potential at point B minus the potential at point A to get the result of the curve Integral. In the text that I'm reading, it's explained that if the integral over a force-field is path-independent, then the force field $F = -{\rm grad}(V)$, where $V$ is the potential. Why is it defined as the negative gradient? Doesn't one determine the potential from $F$ mathematically. Why do we impose the sign on the potential?