mersenneforum.org  

Go Back   mersenneforum.org > Prime Search Projects > Prime Sierpinski Project

Reply
 
Thread Tools
Old 2006-05-25, 05:48   #1
thommy
 

22·1,009 Posts
Default 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
  Reply With Quote
Old 2006-05-27, 06:30   #2
Citrix
 
Citrix's Avatar
 
Jun 2003

2×7×113 Posts
Default

Thanks. If you have the time, could you translate the page for the mersenneforum wiki, and post it there ?
Citrix is offline   Reply With Quote
Reply



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

All times are UTC. The time now is 16:03.


Fri Jul 16 16:03:35 UTC 2021 up 49 days, 13:50, 1 user, load averages: 1.53, 1.88, 1.80

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.