• Log InLog In
  • Register
Liquid`
Team Liquid Liquipedia
EDT 08:46
CEST 14:46
KST 21:46
  • Home
  • Forum
  • Calendar
  • Streams
  • Liquipedia
  • Features
  • Store
  • EPT
  • TL+
  • StarCraft 2
  • Brood War
  • Smash
  • Heroes
  • Counter-Strike
  • Overwatch
  • Liquibet
  • Fantasy StarCraft
  • TLPD
  • StarCraft 2
  • Brood War
  • Blogs
Forum Sidebar
Events/Features
News
Featured News
[ASL19] Finals Recap: Standing Tall2HomeStory Cup 27 - Info & Preview18Classic wins Code S Season 2 (2025)16Code S RO4 & Finals Preview: herO, Rogue, Classic, GuMiho0TL Team Map Contest #5: Presented by Monster Energy6
Community News
Flash Announces Retirement From ASL19Weekly Cups (June 23-29): Reynor in world title form?12FEL Cracov 2025 (July 27) - $8000 live event16Esports World Cup 2025 - Final Player Roster14Weekly Cups (June 16-22): Clem strikes back1
StarCraft 2
General
The SCII GOAT: A statistical Evaluation Weekly Cups (June 23-29): Reynor in world title form? StarCraft Mass Recall: SC1 campaigns on SC2 thread How does the number of casters affect your enjoyment of esports? Esports World Cup 2025 - Final Player Roster
Tourneys
FEL Cracov 2025 (July 27) - $8000 live event HomeStory Cup 27 (June 27-29) WardiTV Mondays SOOPer7s Showmatches 2025 $200 Biweekly - StarCraft Evolution League #1
Strategy
How did i lose this ZvP, whats the proper response Simple Questions Simple Answers
Custom Maps
[UMS] Zillion Zerglings
External Content
Mutation # 480 Moths to the Flame Mutation # 479 Worn Out Welcome Mutation # 478 Instant Karma Mutation # 477 Slow and Steady
Brood War
General
Flash Announces Retirement From ASL [ASL19] Finals Recap: Standing Tall ASL20 Preliminary Maps BW General Discussion BGH Auto Balance -> http://bghmmr.eu/
Tourneys
[Megathread] Daily Proleagues [BSL20] GosuLeague RO16 - Tue & Wed 20:00+CET The Casual Games of the Week Thread [BSL20] ProLeague LB Final - Saturday 20:00 CET
Strategy
Simple Questions, Simple Answers I am doing this better than progamers do.
Other Games
General Games
Stormgate/Frost Giant Megathread Nintendo Switch Thread Path of Exile What do you want from future RTS games? Beyond All Reason
Dota 2
Official 'what is Dota anymore' discussion
League of Legends
Heroes of the Storm
Simple Questions, Simple Answers Heroes of the Storm 2.0
Hearthstone
Heroes of StarCraft mini-set
TL Mafia
TL Mafia Community Thread Vanilla Mini Mafia
Community
General
Things Aren’t Peaceful in Palestine US Politics Mega-thread Trading/Investing Thread Stop Killing Games - European Citizens Initiative Russo-Ukrainian War Thread
Fan Clubs
SKT1 Classic Fan Club! Maru Fan Club
Media & Entertainment
Anime Discussion Thread [Manga] One Piece [\m/] Heavy Metal Thread Korean Music Discussion
Sports
2024 - 2025 Football Thread NBA General Discussion Formula 1 Discussion TeamLiquid Health and Fitness Initiative For 2023 NHL Playoffs 2024
World Cup 2022
Tech Support
Computer Build, Upgrade & Buying Resource Thread
TL Community
The Automated Ban List
Blogs
from making sc maps to makin…
Husyelt
Blog #2
tankgirl
Game Sound vs. Music: The Im…
TrAiDoS
StarCraft improvement
iopq
Heero Yuy & the Tax…
KrillinFromwales
Trip to the Zoo
micronesia
Customize Sidebar...

Website Feedback

Closed Threads



Active: 645 users

[Math] Prime number progression?! - Page 4

Forum Index > General Forum
Post a Reply
Prev 1 2 3 4 All
Mithrandir
Profile Joined March 2011
United States99 Posts
May 15 2011 00:24 GMT
#61
On May 15 2011 09:21 Samhax wrote:
Show nested quote +
On May 15 2011 09:20 aoeua wrote:
I have discovered a truly marvellous solution for this problem. Unfortunately, the post width here is too narrow to contain it.


Haha Fermat quote, but Andrew Wiles did it!



Hahaha at the reference.

And yes Andrew Wiles did it, using more than the margin . Also using math that wasn't invented until many, many years later.

To a Mod: Now that this problem is known to be unsolved, can this thread be closed?
blah_blah
Profile Joined April 2011
346 Posts
May 15 2011 01:32 GMT
#62
On May 15 2011 08:57 Samhax wrote:
Show nested quote +
On May 15 2011 08:52 VIB wrote:
On May 15 2011 08:44 dUTtrOACh wrote:
The only way to test if it produces only prime numbers is to run divisibility tests on the answers for each case.
You do realize "each case" is infinite right? If anyone ever solves this problem, it's not gonna be by making a computer bigger than infinite


Maybe 2^127 -1 is not prime, if the op is lucky. But if 2^127 -1 is prime then you need for sure a super computer to prove it.


2^{127}-1 is prime.
Samhax
Profile Joined August 2010
1054 Posts
Last Edited: 2011-05-15 02:00:50
May 15 2011 02:00 GMT
#63
On May 15 2011 10:32 blah_blah wrote:
Show nested quote +
On May 15 2011 08:57 Samhax wrote:
On May 15 2011 08:52 VIB wrote:
On May 15 2011 08:44 dUTtrOACh wrote:
The only way to test if it produces only prime numbers is to run divisibility tests on the answers for each case.
You do realize "each case" is infinite right? If anyone ever solves this problem, it's not gonna be by making a computer bigger than infinite


Maybe 2^127 -1 is not prime, if the op is lucky. But if 2^127 -1 is prime then you need for sure a super computer to prove it.


2^{127}-1 is prime.


that's unfortunate for the OP :p
n.DieJokes
Profile Blog Joined November 2008
United States3443 Posts
May 15 2011 02:18 GMT
#64
If you could prove every number was a prime you be in line for hundreds of thousands of dollars
MyLove + Your Love= Supa Love
Wonders
Profile Blog Joined September 2006
Australia753 Posts
May 15 2011 02:26 GMT
#65
On May 15 2011 08:57 Samhax wrote:
Maybe 2^127 -1 is not prime, if the op is lucky. But if 2^127 -1 is prime then you need for sure a super computer to prove it.


This number was known to be prime in 1876, when they didn't have supercomputers. Even then there were much better techniques for testing primality than exhaustively checking divisibility.
Samhax
Profile Joined August 2010
1054 Posts
Last Edited: 2011-05-15 02:51:17
May 15 2011 02:41 GMT
#66
On May 15 2011 11:26 Wonders wrote:
Show nested quote +
On May 15 2011 08:57 Samhax wrote:
Maybe 2^127 -1 is not prime, if the op is lucky. But if 2^127 -1 is prime then you need for sure a super computer to prove it.


This number was known to be prime in 1876, when they didn't have supercomputers. Even then there were much better techniques for testing primality than exhaustively checking divisibility.


I didn't say for 2^127 -1 you need a super computer, this number is "relatively" small (~10^38). But for 2^(2^127-1) -1, show me how you can do it whitout a super computer, knowing that 2^127 -1 is prime. I really want to see that.

edit : when i talked about super computer, i was talking about the next iterations.
UniversalSnip
Profile Blog Joined July 2010
9871 Posts
Last Edited: 2011-05-15 02:54:31
May 15 2011 02:51 GMT
#67
On May 15 2011 09:20 aoeua wrote:
I have discovered a truly marvellous solution for this problem. Unfortunately, the post width here is too narrow to contain it.


I've always wondered if fermat was just a huge troll or if he actually thought he had the proof - although of course he could not have.
"How fucking dare you defile the sanctity of DotA with your fucking casual plebian terminology? May the curse of Gaben and Volvo be upon you. le filthy casual."
NB
Profile Blog Joined February 2010
Netherlands12045 Posts
May 15 2011 02:51 GMT
#68
one of the rule of TL is do not ask homework here!

about the math problem, use induction (basic 1st year math)
Im daed. Follow me @TL_NB
Mithrandir
Profile Joined March 2011
United States99 Posts
May 15 2011 02:54 GMT
#69
On May 15 2011 11:51 NB wrote:
one of the rule of TL is do not ask homework here!

about the math problem, use induction (basic 1st year math)


You are wrong. This problem is unsolved. He was trolling.
Mithrandir
Profile Joined March 2011
United States99 Posts
May 15 2011 02:55 GMT
#70
On May 15 2011 11:41 Samhax wrote:
Show nested quote +
On May 15 2011 11:26 Wonders wrote:
On May 15 2011 08:57 Samhax wrote:
Maybe 2^127 -1 is not prime, if the op is lucky. But if 2^127 -1 is prime then you need for sure a super computer to prove it.


This number was known to be prime in 1876, when they didn't have supercomputers. Even then there were much better techniques for testing primality than exhaustively checking divisibility.


I didn't say for 2^127 -1 you need a super computer, this number is "relatively" small (~10^38). But for 2^(2^127-1) -1, show me how you can do it whitout a super computer, knowing that 2^127 -1 is prime. I really want to see that.

edit : when i talked about super computer, i was talking about the next iterations.


2^(2^127-1)-1 cannot be done even with today's super computers, although people have checked all possible factors up to 10^50 without success.
Samhax
Profile Joined August 2010
1054 Posts
May 15 2011 03:00 GMT
#71
On May 15 2011 11:55 Mithrandir wrote:
Show nested quote +
On May 15 2011 11:41 Samhax wrote:
On May 15 2011 11:26 Wonders wrote:
On May 15 2011 08:57 Samhax wrote:
Maybe 2^127 -1 is not prime, if the op is lucky. But if 2^127 -1 is prime then you need for sure a super computer to prove it.


This number was known to be prime in 1876, when they didn't have supercomputers. Even then there were much better techniques for testing primality than exhaustively checking divisibility.


I didn't say for 2^127 -1 you need a super computer, this number is "relatively" small (~10^38). But for 2^(2^127-1) -1, show me how you can do it whitout a super computer, knowing that 2^127 -1 is prime. I really want to see that.

edit : when i talked about super computer, i was talking about the next iterations.


2^(2^127-1)-1 cannot be done even with today's super computers, although people have checked all possible factors up to 10^50 without success.


Yeah i know, but knowing the size of the number it's impossible to test it without computers. It's my point.
arbiter_md
Profile Joined February 2008
Moldova1219 Posts
May 15 2011 03:07 GMT
#72
On May 15 2011 12:00 Samhax wrote:
Show nested quote +
On May 15 2011 11:55 Mithrandir wrote:
On May 15 2011 11:41 Samhax wrote:
On May 15 2011 11:26 Wonders wrote:
On May 15 2011 08:57 Samhax wrote:
Maybe 2^127 -1 is not prime, if the op is lucky. But if 2^127 -1 is prime then you need for sure a super computer to prove it.


This number was known to be prime in 1876, when they didn't have supercomputers. Even then there were much better techniques for testing primality than exhaustively checking divisibility.


I didn't say for 2^127 -1 you need a super computer, this number is "relatively" small (~10^38). But for 2^(2^127-1) -1, show me how you can do it whitout a super computer, knowing that 2^127 -1 is prime. I really want to see that.

edit : when i talked about super computer, i was talking about the next iterations.


2^(2^127-1)-1 cannot be done even with today's super computers, although people have checked all possible factors up to 10^50 without success.


Yeah i know, but knowing the size of the number it's impossible to test it without computers. It's my point.

If you'd put all the computers in the world to work on this problem for the next 10 billion years, you wouldn't yet know if that number is really prime. Assuming it is prime.

That's how big that number is. Math has many simple ways to tell the people that some questions will never get responses.
The copyright of this post belongs solely to me. Nobody else, not teamliquid, not greetech and not even blizzard have any share of this copyright. You can copy, distribute, use in commercial purposes the content of this post or parts of it freely.
Samhax
Profile Joined August 2010
1054 Posts
May 15 2011 03:12 GMT
#73
On May 15 2011 12:07 arbiter_md wrote:
Show nested quote +
On May 15 2011 12:00 Samhax wrote:
On May 15 2011 11:55 Mithrandir wrote:
On May 15 2011 11:41 Samhax wrote:
On May 15 2011 11:26 Wonders wrote:
On May 15 2011 08:57 Samhax wrote:
Maybe 2^127 -1 is not prime, if the op is lucky. But if 2^127 -1 is prime then you need for sure a super computer to prove it.


This number was known to be prime in 1876, when they didn't have supercomputers. Even then there were much better techniques for testing primality than exhaustively checking divisibility.


I didn't say for 2^127 -1 you need a super computer, this number is "relatively" small (~10^38). But for 2^(2^127-1) -1, show me how you can do it whitout a super computer, knowing that 2^127 -1 is prime. I really want to see that.

edit : when i talked about super computer, i was talking about the next iterations.


2^(2^127-1)-1 cannot be done even with today's super computers, although people have checked all possible factors up to 10^50 without success.


Yeah i know, but knowing the size of the number it's impossible to test it without computers. It's my point.

If you'd put all the computers in the world to work on this problem for the next 10 billion years, you wouldn't yet know if that number is really prime. Assuming it is prime.

That's how big that number is. Math has many simple ways to tell the people that some questions will never get responses.


hum not sure about that, do you know Quantum computer (search it on wikipedia if not). Maybe one day, it will be possible, who knows.
Manit0u
Profile Blog Joined August 2004
Poland17242 Posts
May 15 2011 09:08 GMT
#74
On a sidenote: I've noticed an increasing amount of posts starting with 'hi TL' or something like that. It seems similar to 'sub /b/' or whatever.
Anyway, my point is, why the hell would you use 'hi TL' on a TL? Just 'Hi!' would be enough in my opinion. There's no need for redundant stuff, especially one that shares some similarities with 4chan...
Time is precious. Waste it wisely.
oBlade
Profile Blog Joined December 2008
United States5524 Posts
May 15 2011 11:14 GMT
#75
On May 15 2011 18:08 Manit0u wrote:
On a sidenote: I've noticed an increasing amount of posts starting with 'hi TL' or something like that. It seems similar to 'sub /b/' or whatever.
Anyway, my point is, why the hell would you use 'hi TL' on a TL? Just 'Hi!' would be enough in my opinion. There's no need for redundant stuff, especially one that shares some similarities with 4chan...

Similarly, 4chan.org and teamliquid.net both have advertisements. I don't think teamliquid.net should have advertisements because 4chan.org has them. Also, 4chan.org has moderators, so I think the banlings should surrender their powers. 4chan is a website, so I think teamliquid should become a restaurant.

Seriously. All he did was greet us, it's not the least bit rude.
"I read it. You know how to read, you ignorant fuck?" - Andy Dufresne
mcc
Profile Joined October 2010
Czech Republic4646 Posts
Last Edited: 2011-05-15 11:34:28
May 15 2011 11:33 GMT
#76
On May 15 2011 12:07 arbiter_md wrote:
Show nested quote +
On May 15 2011 12:00 Samhax wrote:
On May 15 2011 11:55 Mithrandir wrote:
On May 15 2011 11:41 Samhax wrote:
On May 15 2011 11:26 Wonders wrote:
On May 15 2011 08:57 Samhax wrote:
Maybe 2^127 -1 is not prime, if the op is lucky. But if 2^127 -1 is prime then you need for sure a super computer to prove it.


This number was known to be prime in 1876, when they didn't have supercomputers. Even then there were much better techniques for testing primality than exhaustively checking divisibility.


I didn't say for 2^127 -1 you need a super computer, this number is "relatively" small (~10^38). But for 2^(2^127-1) -1, show me how you can do it whitout a super computer, knowing that 2^127 -1 is prime. I really want to see that.

edit : when i talked about super computer, i was talking about the next iterations.


2^(2^127-1)-1 cannot be done even with today's super computers, although people have checked all possible factors up to 10^50 without success.


Yeah i know, but knowing the size of the number it's impossible to test it without computers. It's my point.

If you'd put all the computers in the world to work on this problem for the next 10 billion years, you wouldn't yet know if that number is really prime. Assuming it is prime.

That's how big that number is. Math has many simple ways to tell the people that some questions will never get responses.

That assumes that checking divisibility is the only way to check this or even that our current methods for checking primality are the only ones. I agree that we won't find a solution to OP, but that does not mean that propositions here are the only way to get there.

EDIT: by "we" I mean this thread/TL
Prev 1 2 3 4 All
Please log in or register to reply.
Live Events Refresh
Next event in 3h 14m
[ Submit Event ]
Live Streams
Refresh
StarCraft 2
Harstem 315
RotterdaM 290
ForJumy 40
StarCraft: Brood War
Rain 5464
Sea 5334
Larva 660
EffOrt 542
Pusan 371
Mini 349
BeSt 326
Stork 314
Zeus 223
Last 209
[ Show more ]
Mind 182
ZerO 169
Snow 142
Hyun 113
Light 112
Rush 79
hero 71
Aegong 51
JYJ42
Movie 32
Sharp 22
sSak 18
IntoTheRainbow 11
Icarus 10
NaDa 10
scan(afreeca) 9
HiyA 9
Barracks 9
ajuk12(nOOB) 8
Shinee 8
Noble 8
SilentControl 7
Hm[arnc] 3
Britney 0
Stormgate
NightEnD14
Dota 2
Gorgc5235
qojqva1934
BananaSlamJamma497
XcaliburYe403
febbydoto3
League of Legends
singsing2306
Counter-Strike
x6flipin617
markeloff122
Super Smash Bros
Mew2King167
Westballz12
Heroes of the Storm
Khaldor156
Other Games
DeMusliM532
Fuzer 445
hiko429
XaKoH 238
crisheroes229
Pyrionflax215
ArmadaUGS60
ZerO(Twitch)12
Organizations
StarCraft 2
Blizzard YouTube
StarCraft: Brood War
BSLTrovo
sctven
[ Show 13 non-featured ]
StarCraft 2
• StrangeGG 54
• AfreecaTV YouTube
• intothetv
• Kozan
• IndyKCrew
• LaughNgamezSOOP
• Migwel
• sooper7s
StarCraft: Brood War
• iopq 2
• BSLYoutube
• STPLYoutube
• ZZZeroYoutube
Dota 2
• C_a_k_e 1744
Upcoming Events
uThermal 2v2 Circuit
3h 14m
OSC
6h 14m
Cham vs MaNa
SHIN vs Bunny
SKillous vs TBD
Replay Cast
11h 14m
The PondCast
21h 14m
RSL Revival
21h 14m
ByuN vs Classic
Clem vs Cham
WardiTV European League
1d 3h
Replay Cast
1d 11h
RSL Revival
1d 21h
herO vs SHIN
Reynor vs Cure
WardiTV European League
2 days
FEL
2 days
[ Show More ]
Korean StarCraft League
2 days
CranKy Ducklings
2 days
RSL Revival
2 days
FEL
3 days
Sparkling Tuna Cup
3 days
RSL Revival
3 days
FEL
3 days
BSL: ProLeague
4 days
Dewalt vs Bonyth
Replay Cast
5 days
Replay Cast
5 days
The PondCast
6 days
Liquipedia Results

Completed

Proleague 2025-06-28
HSC XXVII
Heroes 10 EU

Ongoing

JPL Season 2
BSL 2v2 Season 3
BSL Season 20
Acropolis #3
KCM Race Survival 2025 Season 2
CSL 17: 2025 SUMMER
Copa Latinoamericana 4
Championship of Russia 2025
RSL Revival: Season 1
Murky Cup #2
BLAST.tv Austin Major 2025
ESL Impact League Season 7
IEM Dallas 2025
PGL Astana 2025
Asian Champions League '25
BLAST Rivals Spring 2025
MESA Nomadic Masters
CCT Season 2 Global Finals
IEM Melbourne 2025
YaLLa Compass Qatar 2025

Upcoming

CSLPRO Last Chance 2025
CSLPRO Chat StarLAN 3
K-Championship
uThermal 2v2 Main Event
SEL Season 2 Championship
FEL Cracov 2025
Esports World Cup 2025
StarSeries Fall 2025
FISSURE Playground #2
BLAST Open Fall 2025
BLAST Open Fall Qual
Esports World Cup 2025
BLAST Bounty Fall 2025
BLAST Bounty Fall Qual
IEM Cologne 2025
FISSURE Playground #1
TLPD

1. ByuN
2. TY
3. Dark
4. Solar
5. Stats
6. Nerchio
7. sOs
8. soO
9. INnoVation
10. Elazer
1. Rain
2. Flash
3. EffOrt
4. Last
5. Bisu
6. Soulkey
7. Mini
8. Sharp
Sidebar Settings...

Advertising | Privacy Policy | Terms Of Use | Contact Us

Original banner artwork: Jim Warren
The contents of this webpage are copyright © 2025 TLnet. All Rights Reserved.