Timeline for equality of two numbers which are in $4k+2$-form powers of 2 and satisfy a certain condition
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 5, 2017 at 21:32 | comment | added | Kevin Buzzard | @T. Amdeberhan: That's not right either -- $(n,m)=(58,174)$. | |
| Jan 5, 2017 at 21:09 | comment | added | T. Amdeberhan | @RobertIsrael: Oh, you're right thanks. I was meaning to write $(2^{2n}+1,2^{2m}+1)$. I Hope this is correct. | |
| Jan 5, 2017 at 20:19 | comment | added | Robert Israel | @T.Amdeberhan The largest prime factor of $2^{51}+1$ is $43691$, which divides $2^{17}+1$. | |
| Jan 5, 2017 at 19:16 | comment | added | T. Amdeberhan | I suspect the answer is "yes"; even for the pair $(2^n+1,2^m+1)$ provided $m>3$. | |
| Jan 5, 2017 at 17:37 | history | asked | Amir Baghban | CC BY-SA 3.0 |