agung@agung-K43SJ:~$ steam Running Steam on ubuntu 15.04 64-bit  STEAM_RUNTIME is enabled automatically  Installing breakpad exception handler for appid(steam)/version(0)  libGL error: unable to load driver: nouveau_dri.so  libGL error: driver pointer missing  libGL error: failed to load driver: nouveau  libGL error: unable to load driver: swrast_dri.so  libGL error: failed to load driver: swrast   Before that, I also tried installing Steam from Terminal, but it didn't launch after having downloaded the update.  Can anyone help me finding a solution to install Steam?
Actually I have installed the new Ubuntu 15.04 64bit, and when I'm trying to install Steam on it, there is a problem. In fact I have downloaded the deb package from steam website, installed it and when I start it nothing happens. I tried to start it from terminal and what I've got  $ steam Running Steam on ubuntu 15.04 64-bit STEAM_RUNTIME is enabled automatically Installing breakpad exception handler for appid(steam)/version(0_client) libGL error: unable to load driver: r600_dri.so libGL error: driver pointer missing libGL error: failed to load driver: r600 libGL error: unable to load driver: swrast_dri.so libGL error: failed to load driver: swrast
Application-priority based automatic bandwidth distribution in Windows? Whenever my browser wants to download data, I want it to be granted as much of the bandwidth as it wants, while other applications must do with the leftover bandwidth; and when the browser is not transferring any data, other applications could be given the bandwidth. Something like the process priority in Windows task manager. Any method/software to accomplish this automatically? How are we able to calculate specific numbers in the Fibonacci Sequence? I was reading up on the Fibonacci Sequence,  $\text {{1,1,2,3,5,8,13,....}}$ when I've noticed some were able to calculate specific numbers. So far I've only figured out creating an array and counting to the value, which is incredibly simple, but I reckon I can't find any formula for calculating a Fibonacci number based on it's position.  Is there a way to do this? If so, how are we able to apply these formulas to arrays? How to find $\sum_{i=1}^n\left\lfloor i\sqrt{2}\right\rfloor$ A001951 A Beatty sequence: a(n) = floor(n*sqrt(2)). [A001951 A Beatty sequence: a(n) = floor(n*sqrt(2)).][1]  If $n = 5$ then  $$\left\lfloor1\sqrt{2}\right\rfloor+ \left\lfloor2\sqrt{2}\right\rfloor + \left\lfloor3\sqrt{2}\right\rfloor +\left\lfloor4 \sqrt{2}\right\rfloor+ \left\lfloor5\sqrt{2}\right\rfloor = 1+2+4+5+7 = 19$$  Sequence from $1$ to $20$ is:  $S=\{1,2,4,5,7,8,9,11,12,14,15,16,18,19,21,22,24,25,26,28\}$  I want to find answer for $10^{100} n$? Linearlayout order is reversed on some devices What ensures big holes in my bread? Cannot install a version of GDAL via Anaconda that permits reading BigTIFFs How to enable crash reports/core dumps/stack trace logging globally? Crashing bugs can be the most annoying ones, leading to data loss, downtime and frustrated users. It would be good if applications crashed less.  Because of the complexity of the machine context, crashes often can't be reproduced in reasonable time for an ordinary user. That doesn't mean that the bug is rare - It could simply mean that the thing that triggers it occurs rarely for each user (for example DST changes). Such bugs are unlikely to be fixed unless a lot of users report them. It would be good if more crashes were reported.  To debug crashes, the developers need as much unambiguous context as possible. Generated crash reports are good, because they're usually detailed and accurate. Users can't be expected to zealously observe and report all the context manually, so they often submit sparse and wrong information.  The target audience for a lot of applications is not developers or sysadmins, but rather the general public, at home or at work. Such users can't be expected to know how to collect crash information manually, or to install -dbg packages, but generated reports from such users can still be usable. Some applications have their own crash reporting tools, but in my experience these rarely work, and when they report that they failed to report the error there doesn't seem to be any information on how to do it manually (I've observed this for recent versions of both Firefox and Flash). System-wide generation of crash reports would be good.  Is there any sort of crash report generation* which can be enabled globally** without installing a ton of -dbg packages, reading the documentation of each and every application, or slowing a normal machine down to a crawl?  * Logs, core dumps, stack traces, whatever  ** Not necessarily for init, but at least for a significant subset of the applications running on a typical desktop Linux installation. In my experience GUI applications crash 100+ times more frequently than shell applications, so GUI applications would naturally be the focus. Find $\lim_{n \to \infty} \left[\frac{(n+1)^{n + 1}}{n^n} - \frac{n^{n}}{(n-1)^{n-1}} \right]$ (a question asked at trivia) "What more" vs "what else" do you need? I am providing you with food, shelter, clothes.      What more do you need   or      what else do you need?   Which one's correct? how to convert System::String to const char*? I have multiple cameras in a scene. What I want to do is to change which one is active. This way I can view the scene from different angles. How would I do this? What is the size of an enum in C? I'm creating a set of enum values, but I need each enum value to be 64 bits wide. If I recall correctly, an enum is generally the same size as an int; but I thought I read somewhere that (at least in GCC) the compiler can make the enum any width they need to be to hold their values. So, is it possible to have an enum that is 64 bits wide? Objective-C - When to use 'self' Wear a hat multiple times? Let $A,B \in \mathbb{M}_n (\mathbb{C})$. If $A^2B + BA^2 = 2ABA$ then exist $k \in \mathbb{N}$ where $(AB-BA)^k = 0$.  I tried solve with minimal polynomial, but I did not have much effect. All I remember is the guy was sent to a planet to test something or he did something illegal, and time moved really fast on the planet but slow to the outside world. He had to fix something to leave the planet I think. His dad was also dying and he checked how many days he had left every day, but in the end his dad didn't actually die as time was fast. It took place on a sandy planet. How to find the inverse modulo $m$? For example: $$7x \equiv 1 \pmod{31} $$ In this example, the modular inverse of $7$ with respect to $31$ is $9$. How can we find out that $9$? What are the steps that I need to do? Update If I have a general modulo equation: $$5x + 1 \equiv 2 \pmod{6}$$ What is the fastest way to solve it? My initial thought was: $$5x + 1 \equiv 2 \pmod{6}$$ $$\Leftrightarrow 5x + 1 - 1\equiv 2 - 1 \pmod{6}$$ $$\Leftrightarrow 5x \equiv 1 \pmod{6}$$ Then solve for the inverse of $5$ modulo 6. Is it a right approach? Thanks. Astronauts land on planet, met by aliens impersonating their deceased relatives When I was young, I read a chilling story of astronauts coming to an unknown planet and found to their delight  the occupants were all members of their family who were deceased. Each crew member goes off to their respective childhood homes to relive memories.   One astronaut however in the same bedroom as his brother suddenly wonders if aliens may have searched the memories of himself and fellow crew members and used this to gain power over the intruders. His brother asks suspiciously what he's thinking and doesn't believe the answer. The last scene shows astronauts being buried by aliens whose faces melt from human into something terrifying.   Anyone know the name of the story and author? I thought it might be something like Coming Home, but only a guess. How much set theory and logic should typical algebraists/analysts/geometers know? (soft-question) I know enough amount of set theory and logic to study grad-level math. However, I don't know more advanced set theory and logic, such as the ones on Kunen's or Shoenfield's texts. Although it's good to learn such advanced topics, I may not have enough time to do so, since I will probably put my emphasis on algebra, analysis or geometry as well as mathematical physics.   Although how much set theory and logic I should learn is totally up to what sort of analysis, algebra or geometry I will study, I want to know how much of them typical competitive algebraists/analysts/geometers know. If you are one of them, how much do you know? Ring of rational-coefficient power series defining entire functions