I got a pub/pri key pair generated using ssh-keygen. ssh-keygen -t rsa -b 2048  Now say, I lost the public key but have the private key. So I want to generate the public key using private key, which I know is possible but am not sure how. I went through few post and articles which suggest using below command, but I am facing error? $ openssl rsa -in pri  -pubout #generates public key from private key unable to load Private Key 139858264044864:error:0909006C:PEM routines:get_name:no start line:../crypto/pem/pem_lib.c:745:Expecting: ANY PRIVATE KEY  Could some one suggest on how to fix this?
I've somehow lost my id_rsa.pub file. I still have my id_rsa file. How do I recover the public key from the private key?  (This question came up after ssh-copy-id was reporting "ERROR: No identities found" while ssh-keygen reported "/root/.ssh/id_rsa already exists". ls ~/.ssh pointed out the problem was having id_rsa but not id_rsa.pub. I found the solution, but it was buried at the bottom of a long post on an Ubuntu support forum.)
I am programming a tile based game and I have some basic tiles (grass, dirt, etc..), but I can't figure out how to make good random map generation, because when I do some really random selection, if the tile should be grass/dirt, I get this:    I understand why this is happening, but what I want is to create some random continuous areas of grass or dirt. Something that would make more sense, like this: I'm looking for a simple, easy to understand algorithm to alphabetically sort an array of characters in C. Error 404 : While using flag Recently on Stack Overflow I got privilege to flag a post. So when I try to flag a post as duplicate. The diaglog box is not properly loading.         However I am easily able to use other flag option like "other","spam" or "offensive".   "other"        "spam"        "offensive"        I am using Google Chrome Version 28.0.1500.71 and Win XP Operating System. I have tried in firefox as well but it is showing me same problem. I have noticed that if you look directly at tubelight (I have only white ones in my home) and close your eyes little, you see little random shaped colourless things sometimes with slow speed and sometimes with falling down.   They are shaped like circles with something in between and in chains of random length.   My father has also seen them. So, I am sure I am not imagining things. What the hell are they? How is Anti Aliasing Implemented in Ray Tracing? After reading a few articles online I can confidently say I am clueless on how Anti-Aliasing works when using Ray Tracing.  All I understand is that A Single Pixel/Ray is split into 4 sub-pixels and 4 rays rather than 1.  Could somebody please explain how this is done (preferably with code)? Do mankind and manmade activities/constructions have any effect on the rotation of the Earth? We walk or ride on our vehicles to our destinations daily. Does our movement have any effect on the rotation of the earth according to Newton's law? What will be the effect if we move all the peoples along with their vehicles at their maximum velocity in one line in one direction along the equator? How much effect will it make? Is a sub-shell the same thing as a child-shell There are this two names: a subshell and a child-shell.  Yes, a child process will be started by any of this:  sh -c 'echo "Hello"' ( echo "hello" ) echo "$(echo "hello") echo "hello" | cat   Are all equivalent and share the same name? Do all share the same properties?    POSIX :     A shell execution environment consists of ....   But the last paragraph of above link has this:     A subshell environment shall be created as a duplicate of the shell environment, except that signal traps that are not being ignored shall be set to the default action.    And specially:     Command substitution, commands that are grouped with parentheses, and asynchronous lists shall be executed in a subshell environment. Additionally, each command of a multi-command pipeline is in a subshell environment; ....   The sh -c 'echo "Hello"' is not included there, should that be called a subshell also? Sometimes when you're downloading an image and the connection breaks mid stream, you are left with a half downloaded image. If you try to view it you get the upper part of the image and the bottom part is usually coloured grey or green or some other color.  In other words, it is corrupted.  Is there a way to check whether the image is damaged in that way or otherwise corrupted? Recurrence relation for the integral, $ I_n=\int\frac{dx}{(1+x^2)^n} $ Express recurrence relation  of the integral  $$ I_n=\int\frac{dx}{(1+x^2)^n} $$  [My Answer]  $$ I_n = \int\frac{1+x^2}{(1+x^2)^n}dx-\int\frac{x^2}{(1+x^2)^n}dx $$  $$ I_n=I_{n-1}-\int x\cdot\frac{x}{(1+x^2)^n}dx $$  $$ I_n=I_{n-1}-\frac{x}{2(1-n)(x^2+1)^{n-1}}+\frac{1}{2(1-n)}I_{n-1} $$  $$ I_n=\frac{2n-3}{2(n-1)}I_{n-1}+\frac{x}{2(n-1)(x^2+1)^{n-1}} \ \ \ \ (n&gt;1) $$  $$ I_1=\arctan(x) $$  Is my answer correct? When I log into my web server via SSH I see the information:  88 packages can be updated. 80 updates are security updates   I tried apt-get update then apt-get upgrade but each time I log in I still see the message about updates. How do I install them? When to use \par and when \\, \newline, or blank lines How do I give players already enchanted Tools/Armour/Weapons Past participle vs being+past participle Let $a\ge 2$ be an integer. Show that for positive integers $m,n$, we have $a^n - 1$ divides $a^m - 1$ if and only if $n$ divides $m$.   I am having trouble showing this. I've seen a similar problem on here but it only shows one direction for the proof. I would like to see both directions.  This is what I have so far: Let $m = nq + r$, then $a^m - 1 = a^{nq + r}- 1 = a^{nq}a^r - 1 = a^{nq}a^r - a^r + a^r - 1 = a^r(a^{nq} - 1) + a^r - 1$. Since $0\le r\lt n$, $r = 0$ then $a^m - 1$ = $a^{nq} - 1$ so $a^m$ = $a^{nq}$ . Thus $m = nq$ hence $n\mid m$. I built a desktop computer a couple years back with the following specs:  CPU: Intel  Yorkfield 2.5GHz 6 MB L2 Cache LGA 775 95W Quad-Core Processor BX80580Q9300 Motherboard:  LGA 775 NVIDIA nForce 680i SLI ATX Intel Motherboard Video Card: Two  GeForce 8600GT SCC 256 MB 128-bit GDDR3 PCI Express x16 SLI Supported Video Card PSU: SeaSonic S12 Energy Plus  ATX12V V2.3 / EPS12V V2.91 SLI Certified CrossFire Ready 80 PLUS Certified Active PFC Power Supply Memory: Two G.SKILL 4 GB (2 x 2 GB) 240-Pin DDR2 SDRAM DDR2 800 (PC2 6400) Dual Channel Kit Desktop Memory   Since its inception, the machine has periodically locked up, the regularity having varied over the years from once a day to once a month. Typically, lockups happen once every few days. By &quot;lockup&quot; I mean my computer just freezes. The screen locks up, I can't move the mouse. Hitting keys on my keyboard that normally turn LEDs on or off on the keyboard (such as Caps Lock) no longer turn the LEDs on or off. If there was music playing at the time of the lockup, noise keeps coming out of the speakers, but it's just the current frequency/note that plays indefinitely. There is no BSOD. When such a lockup occurs I have to do a hard reboot by either turning off the computer or hitting the reset button. I have the most recent version of the NVIDIA hardware drivers, and update them semi-regularly, but that hasn't seemed to help. I am currently using Windows 7 x64, but was previously using Windows Server 2003 x64 and having the same lockup issues. My guess is that it's somehow video driver or motherboard related, but I don't know how to go about diagnosing this problem to narrow down which of the two is the culprit.  Additional information re: cooling Regarding cooling... I've not installed any after-market cooling systems aside from two regular fans I scavenged from an older computer. The fan atop the CPU is the one that shipped with it. One of the two scavenged fans I added it located at the bottom tower of the corner, in an attempt to create some airflow from front to back. The second fan is pointed directly at the two video cards.  SpeedFan installation and readings Per studiohack's suggestion, I installed , which provided the following temperature readings:  GPU: 63C GPU: 65C System: 76C CPU: 64C AUX: 36C Core 0: 78C Core 1: 76C Core 2: 79C Core 3: 79C   Update #3: Another Lockup :-( Well, I had another lockup last night. :-( SpeedFan reported the CPU temp at 38 C when it happened, and there was no spike in temperature leading up to the freeze. One thing I notice is that the freeze seems more likely to happen if I am watching a video. In fact, of the last 5 freezes over the past month, 4 of them have been while watching a video on Flickr. Not necessarily the same video, but a video nevertheless. I don't know if this is just coincidence or if it means anything. (As an aside, each night before bedtime my 2 year old daughter sits on my lap and watches some home videos on Flickr and, in the last month, has learned the phrase, &quot;Uh oh, computer broke.&quot;)  Update #4: MemTest86 and 3DMark06 Test Results: Per suggestions in the comments, I ran the MemTest86 overnight and it cycled through the 8 GB of memory 5 times without error. I also ran the 3DMark06 test without a problem (see my scores at ). So... what now? :-) Any further suggestions on what to check? Is there some way to get a stack trace or something when the computer locks like that? Resolution I have never did figure out the particular problems, but based on the suggestions here and elsewhere, I'm presuming it was a motherboard issue. In any event, I recently upgraded my system, buying a new motherbeard, PSU, CPU, and RAM, and that new rig has been working splendidly the past several weeks. I am using the same graphic cards as in the old setup, so I think it's safe to reason that they weren't the cause of the problem. Using strtok with a std::string I have a string that I would like to tokenize. But the C strtok() function requires my string to be a char*. How can I do this simply?  I tried:  token = strtok(str.c_str(), " ");    which fails because it turns it into a const char*, not a char* Do I have to buy or need a 3D-enabled phone to use Google Cardboard? Google cardboard comes with 3D glasses. Does that mean that we will be able to watch 3D videos using a smartphone like the Moto-G (1st edition) which is not 3D enabled? Different ways to prove there are infinitely many primes? This is just a curiosity. I have come across multiple proofs of the fact that there are infinitely many primes, some of them were quite trivial, but some others were really, really fancy. I'll show you what proofs I have and I'd like to know more because I think it's cool to see that something can be proved in so many different ways.  Proof 1 : Euclid's. If there are finitely many primes then $p_1 p_2 ... p_n + 1$ is coprime to all of these guys. This is the basic idea in most proofs : generate a number coprime to all previous primes.  Proof 2 : Consider the sequence $a_n = 2^{2^n} + 1$. We have that  $$ 2^{2^n}-1 = (2^{2^1} - 1) \prod_{m=1}^{n-1} (2^{2^m}+1), $$  so that for $m &lt; n$, $(2^{2^m} + 1, 2^{2^n} + 1) \, | \, (2^{2^n}-1, 2^{2^n} +1) = 1$. Since we have an infinite sequence of numbers coprime in pairs, at least one prime number must divide each one of them and they are all distinct primes, thus giving an infinity of them.  Proof 3 : (Note : I particularly like this one.) Define a topology on $\mathbb Z$ in the following way : a set $\mathscr N$ of integers is said to be open if for every $n \in \mathscr N$ there is an arithmetic progression $\mathscr A$ such that $n \in \mathscr A \subseteq \mathscr N$. This can easily be proven to define a topology on $\mathbb Z$. Note that under this topology arithmetic progressions are open and closed. Supposing there are finitely many primes, notice that this means that the set $$ \mathscr U \,\,\,\, \overset{def}{=} \,\,\, \bigcup_{p} \,\, p \mathbb Z $$ should be open and closed, but by the fundamental theorem of arithmetic, its complement in $\mathbb Z$ is the set $\{ -1, 1 \}$, which is not open, thus giving a contradiction.   Proof 4 : Let $a,b$ be coprime integers and $c &gt; 0$. There exists $x$ such that $(a+bx, c) = 1$. To see this, choose $x$ such that $a+bx \not\equiv 0 \, \mathrm{mod}$ $p_i$ for all primes $p_i$ dividing $c$. If $a \equiv 0 \, \mathrm{mod}$ $p_i$, since $a$ and $b$ are coprime, $b$ has an inverse mod $p_i$, call it $\overline{b}$. Choosing $x \equiv \overline{b} \, \mathrm{mod}$ $p_i$, you are done. If $a \not\equiv 0 \, \mathrm{mod}$ $p_i$, then choosing $x \equiv 0 \, \mathrm{mod}$ $p_i$ works fine. Find $x$ using the Chinese Remainder Theorem.   Now assuming there are finitely many primes, let $c$ be the product of all of them. Our construction generates an integer coprime to $c$, giving a contradiction to the fundamental theorem of arithmetic.  Proof 5 : Dirichlet's theorem on arithmetic progressions (just so that you not bring it up as an example...)  Do you have any other nice proofs? Access denied when creating keystore for Android app Is there a sentence that begins with “them”?