Alice has a secp256k1 key pair that she used some time ago when she communicated with Bob. Bob can no longer user secp256k1 but he only uses ed25519 instead. Alice and Bob cannot exchange any messages.  Is there a secure algorithm that Bob can use to derive an ed25519 pubkey from original Alice's secp256k1 pub key and also Alice can derive the matching ed25519 private key from her original secp256k1 private key
Alice has a secp256k1 key pair that she used some time ago when she communicated with Bob. Bob can no longer user secp256k1 but he only uses ed25519 instead.  Is there a secure algorithm that Bob can use to derive an ed25519 pubkey from original Alice's secp256k1 pub key and also Alice can derive the matching ed25519 private key from her original secp256k1 private key such that they can communicate securely via ed25519 encrypted messages?  Thanks!
I think we all understand the necessity of delete when reassigning a dynamically-allocated pointer in order to prevent memory leaks. However, I'm curious, to what extent does the C++ mandate the usage of delete? For example, take the following program  int main() {      int* arr = new int[5];      return 0; }   While for all intents and purposes no leak occurs here (since your program is ending and the OS will clean up all memory once it returns), but does the standard still require -- or recommend -- the usage of delete[] in this case? If not, would there be any other reason why you would delete[] here? HDD SMART interpretation - Possible impending drive failure I've just had an issue pop up related to my drives.  First things first, I was working in my case when I clumsily shifted the foot of the case off of my desk. Case shifted and hit the desk somewhat hard, but only fell an inch or two. It had been properly shut down so this may not have anything to do with the issue.  After booting up, I noticed that when playing a video from my F: Drive (Seagate), it produced a whine, almost a chirping sound coming from the hard drive bay. I think I may have heard this before the drop, but quieter.  Fearing impending failure I downloaded GSmartControl and inspected the drive information. The Seagate drive displayed a high Raw Read Error Rate, as well as a high Seek Error Rate.  I've read some of these values can be high on Seagate drives from the start. This drive is about 6 months old and the producer of the noise.  I also checked my Toshiba drive, which came with a refurbished prebuilt I bought about a year ago. It showed more normal SMART data, but displayed some concerning statistics (2 "Mechanical Start Failures" and 2 "Reported Uncorrectable Errors").  Both of the drives passed the basic SMART test, but the noise was quite alarming. It would stop as soon as a paused the video and start right up again as soon as I resumed playing.  Here is an album with 3 photos of the SMART data, the Seagate did not display statistics.  Could I please have help interpreting the SMART data, and whether this may indicate an impending failure?   Thank you for your time.   Here are images of the SMART data. Correctness of questions without inversion, relying on intonation I have been racking my brain to understand the solutions of constrained stars and bars problems like:  $a+b+c+d = 19$;  $a,b,c,d \in \{0,1,2,3,4,5,6,7\}$  Finding the total number of solutions is really simple $\dbinom{22}{3}$.   What to do after that? I want to understand the entire procedure step by step.   Please do not mark it as a duplicate of .  Reasons:   The accepted answer's trick doesn't always work.   Another person (the answer with two upvotes) has just listed out the binomial coefficients and I can't even remotely understand what he has tried to do.   The second answer isn't my cup of tea. Show that if $\lim_{x\to a}f'(x) = A$ then $f'(a)$ exists and equals A I ran across this problem in my Analysis class and can't seem to come up with a good solution. Here's the question: Show that if $\lim_{x\to a}f'(x) = A$ then $f'(a)$ exists and equals $A$. $f$ is continuous on $[a,b]$ and differentiable on $(a,b)$.  I tried applying the Mean Value theorem like this: There exists a $c \in (a, x)$ st $f(x)-f(a)=f'(c)(x-a) \implies \frac{f(x)-f(a)}{x-a}=f'(c) \implies f'(a)=\lim_{x\to a}\frac{f(x)-f(a)}{x-a}=\lim_{c\to a}f'(c)=A$  However, I think this is wrong. I am pretty sure the Mean Value theorem is needed, but my application of it seems to be incorrect. Would somebody be able to point me in the right direction? The class of cardinal numbers is well ordered I'm looking for a proof that the class of cardinal numbers is well ordered under the order relation $|A|\leq |B| \Leftrightarrow$ exists an injection $f:A \to B$.  In fact, I've found a very beautiful proof in an article, but I think it's not the standard one. Duplicate auxiliary verbs in a sentence (may we / should we delete the second?) I've tried everything I can think of. Resetting the router, changing the channel number and band.   The internet connection is fine, and then just hangs for a minute or 2, then returns to normal.   The wifi icon remains connected, and I have the latest 10.10.4 update installed. At first I thought it was a DNS bug with Yosemite, and have played with the settings such as changing DNS provider, changing the IPV6 to IPV4 only etc.  Driving me nuts. Has anyone had a similar problem? I've checked the surroundings with wifi scanners and have chosen the best channel available.     One thing I have noticed, it seems a lot more reliable on 5GHz as opposed to 2.4Ghz It seems to affect my Macbook Pro Retina 13in Early 2015 a lot more than the other devices on the network. I'm using a Virginmedia  1. Is it possible to embed a scrollable frame inside a PDF? (This is an end-of-year crazy question)   Is it possible to embed a (scrollable) frame or a PDF inside a PDF? If so, how to do it in (pdf)LaTeX?  This is something pretty common in HTML (see for example ). Here it is a webpage with PDF frames   Here it is a fake screenshot so you get the idea.  Portable and non-portable (e.g. only-Acrobat) answers are welcomed.     Example of a down arrow below a frame. The up arrow can be on top of the frame and the triangles point up. How should I deal with becoming discouraged as a graduate student? I am a third year (starting fourth year in the fall) PhD student in mathematics. I've passed all qualifying exams and am currently doing research. As far as I can tell, I am not doing poorly. I have the good fortune of having a great advisor, being in a very supportive department, and having friends and family who genuinely care about my success.   The fact is research is hard. It appears to consist primarily of staring at a problem for days and days and days without getting anywhere. Sometimes, rarely, I do figure something out and that feels wonderful, but the overwhelming majority of my time appears to be spent banging my head against a mostly figurative wall. I am not complaining about the material being hard, and I am not averse to putting in hard work, but I get frequently discouraged when I realize the vast volumes of mathematics that I yet know nothing about (and probably never will). It's very hard to quantify progress - in particular, there are too few tangible returns after too many hours worked. I find myself thinking along the lines of "Oh, if only someone actually smart were thinking about this problem they would have solved it in moments" and so on.   I've talked about this to some number of people; here is some advice I have received:   Take a day off. Putting in hours upon hours of trying things doesn't magically lead to a solution, particularly if the brain is tired and just wants to sleep. Have a hobby. Since math research doesn't exactly provide instant gratification, a hobby might provide some instead.  Talk to other graduate students. Realize that many graduate students go through this.   I'm interested to know how other folks have dealt with being discouraged as a graduate student. Does it get better with time and experience? Is this a sign that research is not for me and that I should seriously consider a life outside academia? Given an alphabet of size $n$, how many strings of length $c$ contain every single letter of the alphabet at least once?  I first attempted to use a recurrence relation to work it out:  $$ T(c) = \left\{ \begin{array}{cr} 0 &amp;\mbox{ if $c&lt;n$} \\ n! &amp;\mbox{ if $c = n$} \\ T(c-1) \cdot n \cdot c &amp;\mbox{ if $c &gt; n$} \end{array} \right. $$  As there's no strings that contain every letter if c &lt; n, and if c = n then it's just all permutations. When c > n you can take any string of size (c-1) that contains all letters (of which there are $T(c-1)$ to choose from), you choose which letter to add (of which there are $n$ choices) and there are $c$ different positions to put it. However, this gives out results that are larger than $n^c$ (the total number of strings), so it can't be right, and I realised it was because you could count some strings multiple times, as you can make them taking different inserting steps.   Then I thought about being simpler: you choose n positions in the string, put each letter of the alphabet in one of those positions, then let the rest of the string be anything:  $$ {c\choose{n}} \cdot n! \cdot n^{c-n} $$  But again this counts strings multiple times.  I've also considered using multinomial coefficients, but as we don't know how many times each letter appears in the string it seems unlikely they would be much help. I've also tried several other methods, some complicated and some simple, but none of them seem to work.  How would you go about working out a formula for this? I'm sure there's something simple that I'm missing. Wrap text at any point if normal hyphenation not possible Messed up my PATH environment variable and can't login to desktop To get an maven environment variable to run, I tried several options. Basically, I followed some options from , such as ~/.pam_environment, /etc/bash.bashrc and I don't really know anymore. Within them I exported sth like export PATH=/opt/apache-maven-3.6.0/bin:$PATH (I'm being so unconcrete because I cannot look it up).   Afterwards, I did run gnome-session-quit and my machine got stuck.   So after hard restart I try to login again, but I'm not able to do that: I see my username, enter the password, hit enter, screen turns black and after 2 seconds I'm back at the login screen.   So, that very strange and worrying. Next step: Login via tty (Strg + ALT + F3). Within there I can login, but can not do much. I thought about sth like . But whatever I do: The command could not be located because '\bin' is not included in the PATH environment variable. I think, altogether thats alarming and I'm getting really nervous.  Executing export PATH="/usr/bin:$PATH seems to work and echo $PATHgives an output starting with /usr/bin:/usr/bin:/usr/bin:/home/user/Documents/.../esper/examples/transaction/etc:/home/user/anaconda3/bin:/usr/lib/jvm/java-1.8.0-openjdk-amd64/bin:/opt/apache-maven-3.6.0/bin:/opt/apache-maven-3.6.0/bin:/opt/apache-maven-3.6.0/bin but does not really help.  I'm running an Ubuntu 18.04 on an Lenovo G50-70.   Can you help me accessing my desktop again and/or fixing my PATH issue? I can't write Chinese characters in edited posts, but OP could when posting Why isn't a virus "alive"? What is the origin of Dol Goldur, and why did Sauron start there? Who built the fortress of Dol Goldur, and when was it built? And was it always a place for evil, or Sauron just occupied it?  Despite the fact that Mordor is much better fortified; artificially by the old fortifications,  and geographically, as it is surrounded by the mountains. Also considering the presence of mount doom that seem to enhance Sauron's power, Sauron chose to start his campaign from Dol Goldur, despite Mordor being ready for quite some time.  Why did he choose this enigmatic fortress, and not go straight for Mordor or even go earlier? Where should I put software I compile myself? In HTML5, can the  and  tags appear outside of the  tag? So I installed vlc daily built snap package. It's working great, no problems there. However I noticed that after upgrade the system has 2 versions of vlc (7 and 9). That can be seen when browsing /snap/vlc/ directory and using system monitor. This is also the case with other snaps. Is there a way to automatically delete older versions of snaps? Or do I just delete them using plain &quot;rm&quot; command? Is it safe to delete them that way? Groups of order $pq$ without using Sylow theorems