After trying to fix sound "Unable to correct problems" error
How do I resolve unmet dependencies after adding a PPA?
Minecraft crashes on launch with EXCEPTION_ACCESS_VIOLATION, Problematic frame: ig4dev32.dll or ig4dev64.dll or ig4icd32.dll or ig4icd64.dll When I try to launch Minecraft 1.7.4 or newer, the game crashes on startup, and the game output screen says this:  #  EXCEPTION_ACCESS_VIOLATION (0xc0000005) at pc=*, pid=*, tid=* # # JRE version: Java™ SE Runtime Environment (7.0_51-b13) (build 1.7.0_51-b13) # Java VM: Java HotSpot™ Client VM (* mixed mode, sharing windows-* ) # Problematic frame: # C  [ig4dev32.dll+0x3e88] OR # C  [ig4dev64.dll+0x55ec] OR # C  [ig4icd32.dll+0x104a77] OR  # C  [ig4icd64.dll+0x84930a]   This happens with both Java 7 and 8.  What causes this error, and what can I do to fix the issue? Is there a function or method to give the last day of a month? For example if the date is 27 feb 2013, the last date should be 28 feb 2013 , it become 29 if its a leap year. if the date was 2 jan then it should return 31 Jan.  If there is no function then any ideas on how we can get this?  Thanks How can I extract a predetermined range of lines from a text file on Unix? I have a ~23000 line SQL dump containing several databases worth of data. I need to extract a certain section of this file (i.e. the data for a single database) and place it in a new file. I know both the start and end line numbers of the data that I want.  Does anyone know a Unix command (or series of commands) to extract all lines from a file between say line 16224 and 16482 and then redirect them into a new file? This thing came up in a combinatorics course I am taking.  Choose a fixed set of primes $p_1,p_2,\dots,p_k$ and let $A_n$ be number of integers in $\{1,2,\dots,n\}$ which are not divisible by any of the $p_i$'s. $A_n$ is given by $ n - \sum_{1\leq i_1 \leq k} \lfloor \frac{n}{p_{i_1}} \rfloor + \sum_{1\leq i_1 &lt; i_2 &lt; k} \lfloor \frac{n}{p_{i_1}p_{i_2}}\rfloor - \dots $. Now, if $n$ is divisible by each of the $p_i$'s then we have the simpler expression : $A_n = n \prod_{i=1}^{k}(1-\frac{1}{p_i})$(added later : note I am not assuming $n = \prod_{i=1}^{k}p_i$ here, this holds true whenever $n = c \prod_{i=1}^{k} p_i $ for some integer c, since each $\lfloor \frac{n}{p_{i_1} \dots p_{i_j}} \rfloor = \frac{n}{p_{i_1} \dots p_{i_j}}\ )$.  Another student pointed out that even if $n$ does not have $\prod_{i=1}^{k} p_i$ as a factor, the approximation $B_n = n \prod_{i=1}^{k}(1-\frac{1}{p_i})$ to $A_n$ is quite close in some specific cases. It is easy to see that $\lim_{n\to\infty}\frac{A_n - B_n}{n}=0$ as $\lim_{n\to\infty}\frac{1}{n}\lfloor \frac{n}{p_{i_1}p_{i_2}\dots p_{i_j}} \rfloor \to \frac{1}{p_{i_1}p_{i_2} \dots p_{i_j}},$ however that is not strong enough to imply that $A_n - B_n$ will be always close. Is there any way to analyze how well this approximation will perform in general? I am interested in the worst case for small to moderately sized $n$.  Just to give a feel of how close $A_n$ and $B_n$ can get, assuming the set of primes is $\{2,3,7\}$ we have (assuming my program is correct):  n     A(n)     B(n) 17    5    4.86   27    8    7.71   37    11      10.57   107   31      30.57   1111  318     317.43   3001  858     857.43   4007  1145    1144.86   5000  1429    1428.57 . Customize Ubuntu for a library Internet kiosk I am currently in the process of learning how to prove statements by induction. For the most part, I understand but I am at most clueless when it comes to prove some inequalities.  For example, I am having a hard time proving that: $n &lt; 2^n$ is true. (Even if it's clear that it is indeed true!)  In the induction step, I am stuck with: $n + 1 &lt; 2^{n + 1}$  I don't know what would be the assumption I should make from this statement.  Anyone could point me in the right direction? Thanks! Looking for a short story title about a "weird house" Show that the set $\mathbb{Q}(\sqrt{p})=\{a+b\sqrt{p}; a,b,p\in\mathbb{Q},\sqrt{p}\notin \mathbb{Q}\}$ is a field  I am having a little trouble proving that for each non-zero $b\in\mathbb{Q}(\sqrt{p})$, there is $d\in\mathbb{Q}$ such that $b\cdot d=1$.  My attempt:  Let $b=a_1+b_1\sqrt{p}$  Let $d=a_2+b_2\sqrt{p}$  We want $$b\cdot d=(a_1+b_1\sqrt{p})(a_2+b_2\sqrt{p})$$ $$=a_1a_2+a_1b_2\sqrt{p}+a_2b_1\sqrt{p}+b_1b_2p$$  $$=(a_1a_2+b_1b_2p)+(a_1b_2+a_2b_1)\sqrt{p}$$ $$=1$$  Am I following the right approach? What should be my next step What command do I need to unzip/extract a .tar.gz file? I received a huge .tar.gz file from a client that contains about 800 mb of image files (when uncompressed.) Our hosting company's ftp is seriously slow, so extracting all the files locally and sending them up via ftp isn't practical. I was able to ftp the .tar.gz file to our hosting site, but when I ssh into my directory and try using unzip, it gives me this error:  [esthers@clients locations]$ unzip community_images.tar.gz Archive:  community_images.tar.gz   End-of-central-directory signature not found.  Either this file is not a zipfile, or it constitutes one disk of a multi-part archive.  In the latter case the central directory and zipfile comment will be found on the last disk(s) of this archive. note:  community_images.tar.gz may be a plain executable, not an archive unzip:  cannot find zipfile directory in one of community_images.tar.gz or community_images.tar.gz.zip, and cannot find community_images.tar.gz.ZIP, period.   What command do I need to use to extract all the files in a .tar.gz file? How to SEO a Single-Page website I am creating a new website for a client, and I think a single page website / layout will be pretty neat. There is not that much detailed content, it is a company that imports a lot of products from different companies. So it will be a bit of a showcase of the different types of products / equipment you can order. Of the whole catalog only maybe 10 products are actually shown.  Now I have the basic structure with sections and links like:      #home / #products / #equipment / #services / #contact.    Now from what I understand is that Google does not index links containing #, so there will be no problem of duplicate content, everything will be indexed as the frontpage.  Now what I want to optimize is searching. This company is agent of some product in the country, meaning only they have the permission to import and sell that product. This means  that when somebody searches for product x, this website pops up as the first hit.  Now can I make it that they will be automatically brought to the #products part of the website directly from google.  I was thinking of something like having google index the different sections as different pages. Is something like that possible? Are those stars moving past the window when the ship is at warp? When the enterprise (ENT) is moving at warp we see numerous stars flying past in the windows:    However, according to , at warp 5 (the maximum speed of the 1st enterprise) it would take 7.4 days to get from the Sun to Alpha Centari, our nearest star(s) approximately 4 light years away. So to have stars whizzing past every few seconds would imply that the stars are very close together.  Is this an inaccurate depiction of star movement at warp, or is there some explanation like the warp bubble creates a lensing effect?  Now I realise the classic answer is "suspend your disbelief, it's a tv show", but the animators have at least thought about the star movement as they have added in a bit of red shift and blue shift which you can see in the image. Are the suggested edit audits too easy? Yes, this might be another post complaining about audits. But, in this case, I want the audits to be more difficult.  Specifically, I'm concerned that the suggested edits audits are just too darn easy to spot. They don't behave anything like actual edits, and so after a tiny bit of experience (and electric shocks from audit failures) I think they wouldn't slow down a roboreviewer at all.  Unlike the other queues, which use real data (and are legitimately, in my opinion, difficult), the suggested edits audits look like this:    In about 500ms I can tell that is a bogus edit (less time than it takes for the buttons to unfreeze). After just a few of these, I'm about 99% confident I could tell you which edits were audit edits and which ones were not, and I don't think I actually have to spend extra time on them. On the other queues, picking out the audits is very hard because they use real data, and so I wouldn't bother to do so.  Were I a roboreviewer, I could get on with my Accept-happy life, only pausing to reconsider when someone actually changes the text. (Seriously -- how many real edits have you see which change the text in such a drastic manner? 95% of edits are grammar, spelling, formatting or some combination of those).  Are the suggested edits audits too easy? Is the "Markov-chain random-edit-word-salad" too easily detectable? Or does it legitimately slow down and/or deter robo-reviewers? Should we (and can we) be using real data for the suggested audits queue too? Inferring father/son relationships from Senior (Sr.) / Junior (Jr.) naming? As in my other questions, I am investigating the spread of the Blackstone family name in early America. I came across the following tidbits and I would like to know if my interpretation is (likely to be) correct.  In the "All Kent County, Delaware Probate Records, 1680-1800" collection on ancestry.com, we have the following items.   In 1792, there was a will executed by Eben Blackiston, Sr. In 1794, there was a will executed by Ebenezer Blackiston, Jr. (and Abraham Redgrave).   My question is simple.  Is this enough evidence to reasonably conclude that there was a father/son combo of Ebenezer Blackistons living in Kent County, Delaware during the 1790s?  This would be an interesting result for me as my current research only has two people by this name in the state at the time, and none of them were part of a Jr./Sr. combination.  If this is not enough evidence, what are some other possibilities I need to consider? Novel, group transported to a fantasy world, wild/chaos magic I was reading  and was strongly reminded of a series I remember reading in my teens.  This would have been a series of novels (possibly just one), published in English, and likely before 1980 - I read it in the 90s and it was fairly old, a used book.  I do not think it is the same as the linked question, which is why I'm asking this separately.  It was definitely a fantasy, not sci-fi.  Plot:  At least two girls (and possibly also some boys/other girls) are transported from modern Earth into a fantasy world.  I think they're a group of friends, possibly with some romantic pairings, and are in the 16-25 age range.  The first significant scene I remember is two of the girls ending up in a city, where they are taken in by an older female artist (might have been a different creative type, like a sculptor/actress).  She's lesbian/bisexual.  At some point she attempts to give one of the girls a love potion, but they reverse it on her, so instead the artist falls in love with the girl and accompanies her for the rest of the books.  Twist: It's later revealed that the artist's friends recognized the love potion and removed it.  She pretended to be in love and went along because she thought it would be interesting.  At some point at least one of the girls ends up basically being a magical sex slave/prostitute.  I remember her being tattooed or painted - I think in blue - and also possibly given some magical jewellery/piercings that ensure her obedience/love of her owner.  I do not remember much of the over-arching plot, just a few disjointed pieces:  The world has chaos/wild magic storms.  The books might have called them something else.  Anyone or anything caught by these storms is transformed into something else entirely, so different objects or species.  These show up throughout as minor plot encounters.  I think they can be defended against with a special material.  Near the very end, a large storm engulfs a major city, giving it entirely new architecture and transforming the inhabitants into green, hermaphrodites with a centaurish body structure.  I am not 100% sure this was the same novel, but I recall a secondary character with a secret - at night he turns into a woman (not just his body, but an entirely different person).  At some point it's revealed that the woman was his lover, and he saved her life by sharing his body with her - of course, now they can never meet/touch again. Software/App for electronic research notebooks I want to keep a research notebook for my computational "experiments". Basically, I should at least be able to write text and attach images like plots. Other nice features to have would be   linking to past experiments/pages latex equations uploading papers, or other urls being able to transfer data dating and version control open-source tool   I am already familiar with trello and tiddlywiki. Trello is good for attaching stuff and organising tasks, but I need a notebook where I attach a plot, write stuff around it, attach another below it. It doesn't have a paper or canvas. Tiddlywiki is a little painful for attaching pics and equations, the file bloats, it seems I am keeping a blog.  What is a good, free electronic notebook tool for research/lab work? How can I view the camera through an object as a material in Cycles? php Replacing multiple spaces with a single space Word for person unwilling to share information What do you call a person who is unwilling to share information? Do quest items weigh anything? Someone said that quest items don't count against your carrying capacity in Skyrim, even if they have a weight listed. Is this false? For $x∈\mathbb{R}^n$ , let $B(x,r)$ denote the closed ball in $\mathbb{R}^n$(with Euclidean norm) of radius $r$ centered at $x$. Write $B=B(0,1)$.If $f,g:B→\mathbb{R}^n$ are continuous functions such that $f(x)≠g(x)$ for all $ x∈ B$, then which of the followings are true?       $f(B)∩g(B)=\varnothing$  There exist $ϵ&gt;0$ such that $||f(x)-g(x)||&gt; ϵ$ for all $ x∈ B$  There exist $ϵ&gt;0$ such that $ B(f(x), ϵ) ∩ B(g(x), ϵ)=\varnothing$ for all $ x∈ B$ ${\rm int }(f(B)) ∩ {\rm int }(g(B))=\varnothing$ , where ${\rm int}(E)$ denotes the  interior of a set $E$      How can I solve this problem? Can anyone help?