|
2006-05-25, 05:48
|
#1 |
|
3×37×59 Posts |
proof of sierpinski number
here is an anologue proof to (http://www.teamprimerib.com/sob/78557.php) for 271129*2^n+1 never being prime. ok, its german but in case case anyone wants to see it, its here http://217.160.138.71/wiki/index.php...Project/Beweis
vocabular: Fall case teilt, Teiler divides, divisor ungerade odd folgt follows ersterem the first letzterem the ladder you know the rest     pretty short proof, isn't it? i did it in about 30 minutes for that wiki |
|
|
2006-05-27, 06:30
|
#2 |
Jun 2003
2·7·113 Posts |
Thanks. If you have the time, could you translate the page for the mersenneforum wiki, and post it there
 ?
|
|
|
 |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Sierpinski and Riesel number (Fixed k, Variable base) | Citrix | Sierpinski/Riesel Base 5 | 16 | 2017-02-09 15:55 |
| Definition of Sierpinski/Riesel number base b | sweety439 | Conjectures 'R Us | 32 | 2016-12-16 22:31 |
| perfect number proof | toilet | Homework Help | 12 | 2012-10-17 13:42 |
| Fermat number F6=18446744073709551617 is a composite number. Proof. | literka | Factoring | 5 | 2012-01-30 12:28 |
| smallest number used in a mathematical proof? | ixfd64 | Lounge | 22 | 2006-02-01 17:06 |
