• Log InLog In
  • Register
Liquid`
Team Liquid Liquipedia
EST 12:53
CET 18:53
KST 02:53
  • 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
[ASL22] Finals Preview: Sweet Victory!12[ASL22] Ro4 Preview: Mirror Mirror6[ASL22] Ro8 Preview: Within Reach5[ASL22] Ro8 Preview: In A Tizzy11[ASL22] Ro16 Preview: Holy Diver5
Community News
Dark completes military service, returns to SC212[BSL23] RO16 Group Stage20Weekly Cups (Nov 2-8): herO back on top?2Weekly Cups (Oct 26 - Nov 1): MaxPax, herO, Solar win0Weekly Cups (October 19-25): Clem triples first in 5.0.175
StarCraft 2
General
Dark completes military service, returns to SC2 No more SC2 streamers on team liquid? Serral's getting trashed by New Catsle's Mind Weekly Cups (Nov 2-8): herO back on top? Liquibets sc2 season 30
Tourneys
Sparkling Tuna Cup - Weekly Open Tournament Sea Duckling Open (Global, Bronze-Diamond) Dark returns! GSL CK #7 4v4 Team Battle (Nov 19) soO & FanTaSy return! SC2 Kevin Scrim 4v4 (Nov 16) RSL goes to London! 2026 Offline Finals Nov 21-22
Strategy
[H] ZvP Mid-Late Game: Stalkers Collossi HT
Custom Maps
[G] How to playtest arcade maps Starcraft 2 Advance [D] the control group Simple Questions/Answers
External Content
Mutation # 552 Secret Storm The PondCast: SC2 News & Results Mutation # 551 Robotic Revival Mutation # 550 Graveyard Shift
Brood War
General
BW General Discussion List of top players active on ShieldBattery Shield Battery Server New Patch BGH Auto Balance -> http://bghmmr.eu/ Top Players of October 2026 (EBPD Rankings)
Tourneys
2v2v2v2 Tournament Stage 2: Players [$1250] International ShieldBattery League [BSL23] Ro16 Group C - Sunday 21:00 CET [Megathread] Daily Proleagues
Strategy
Pluto's TvP 5Marine 2Medic Push Simple Questions, Simple Answers Infested Terran strategies in 2026 Nuke strategy worked in K-League 2026-11-09
Other Games
General Games
Stormgate/Frost Giant Megathread Free Space RTS Game, optimised f. Phone/Tablet etc Nintendo Switch Thread List of Game Threads The PlayStation 5
Dota 2
League of Legends
[TL LoL EUW IHs] Teemo shall perish
Heroes of the Storm
Heroes of the Storm 2.0
Hearthstone
Deck construction bug
TL Mafia
TL Mafia Community Thread
Community
General
US Politics Mega-thread Artificial Intelligence Thread Things Aren’t Peaceful in Palestine Trading/Investing Thread European Politico-economics QA Mega-thread
Fan Clubs
Fan Club Resource Thread Reynor Fan Club The Flash Fan Club
Media & Entertainment
Movie Discussion! Anime Discussion Thread [Manga] One Piece
Sports
Football (Soccer) Thread TeamLiquid Health and Fitness Initiative For 2023 MLB/Baseball 2023
World Cup 2022
Tech Support
Computer Build, Upgrade & Buying Resource Thread
TL Community
The Automated Ban List Recent Gifted Posts
Blogs
The time I organised my…
AssyrianKing
Why I built Repalyzer (1.1.…
BlueStar
Innovate or Game Over?
TrAiDoS
ShieldBattery on Mac
Kraekkling
Can Bots Beat Pros?? Starcr…
namkraft
Customize Sidebar...

Website Feedback

Closed Threads



Active: 9405 users

[Math] Prime number progression?! - Page 3

Forum Index > General Forum
Post a Reply
Prev 1 2 3 4 Next All
Brethern
Profile Joined February 2011
231 Posts
May 14 2011 23:42 GMT
#41
Dammit. I learned something. But since the equation is posted care to explain how it works exactly?

I'm a lowly high school grade so I don't know things.
dUTtrOACh
Profile Joined December 2010
Canada2339 Posts
Last Edited: 2011-05-14 23:46:34
May 14 2011 23:44 GMT
#42
The only way to test if it produces only prime numbers is to run divisibility tests on the answers for each case. You could write a program which can store the ridiculously large integers produced. Each will need to be tested for divisibility using modulus. Probably fairly time consuming. And when do you stop testing it? You're basically hoping it fails.
twitch.tv/duttroach
Samhax
Profile Joined August 2010
1054 Posts
May 14 2011 23:46 GMT
#43
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 could write a program which can store the ridiculously large integers produced. Each will need to be tested for divisibility using modulus. Probably fairly time consuming. And when do you stop testing it?


I dont think the op has the computer to do it, but i'm pretty the answer is no but you need a super computer to prove it or if he is lucky the first non prime number is not that big.
dUTtrOACh
Profile Joined December 2010
Canada2339 Posts
May 14 2011 23:48 GMT
#44
On May 15 2011 08:46 Samhax wrote:
Show nested quote +
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 could write a program which can store the ridiculously large integers produced. Each will need to be tested for divisibility using modulus. Probably fairly time consuming. And when do you stop testing it?


I dont think the op has the computer to do it, but i'm pretty the answer is no but you need a super computer to prove it or if he is lucky the first non prime number is not that big.


That's basically my point.
twitch.tv/duttroach
VIB
Profile Blog Joined November 2007
Brazil3567 Posts
May 14 2011 23:52 GMT
#45
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
Great people talk about ideas. Average people talk about things. Small people talk about other people.
Samhax
Profile Joined August 2010
1054 Posts
May 14 2011 23:57 GMT
#46
On May 15 2011 08:52 VIB wrote:
Show nested quote +
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.
ZerGuy
Profile Joined June 2008
Poland204 Posts
May 14 2011 23:58 GMT
#47
I just proved that
If a_n is the lowest non prime number in sequence A, then it's smallest dividor is larger that a_(n-1).

That should save you the bothering with checking if A_6 is divisible by a small normal number
Someday ill be pro
mcc
Profile Joined October 2010
Czech Republic4646 Posts
May 14 2011 23:59 GMT
#48
On May 15 2011 08:48 dUTtrOACh wrote:
Show nested quote +
On May 15 2011 08:46 Samhax 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 could write a program which can store the ridiculously large integers produced. Each will need to be tested for divisibility using modulus. Probably fairly time consuming. And when do you stop testing it?


I dont think the op has the computer to do it, but i'm pretty the answer is no but you need a super computer to prove it or if he is lucky the first non prime number is not that big.


That's basically my point.

There are other ways to prove things in math than to test every case, which in case of infinite sets is problematic
Kong John
Profile Blog Joined March 2008
Denmark1020 Posts
May 15 2011 00:01 GMT
#49
I feel so hopelessly stupid when i read these math threads
This is real life, where nerds must battle!
space_yes
Profile Joined April 2010
United States548 Posts
Last Edited: 2011-05-15 00:04:43
May 15 2011 00:01 GMT
#50
From the wikipedia entry on Mersenne primes...



[...]

In mathematics, a Mersenne number, named after Marin Mersenne (a French monk who began the study of these numbers in the early 17th century), is a positive integer that is one less than a power of two:

M_p=2^p-1

Some definitions of Mersenne numbers require that the exponent p be prime, since the associated number must be composite if p is.

A Mersenne prime is a Mersenne number that is prime. It is known[2] that if 2p − 1 is prime then p is prime, so it makes no difference which Mersenne number definition is used. As of October 2009, 47 Mersenne primes are known. The largest known prime number (243,112,609 − 1) is a Mersenne prime.[3] Since 1997, all newly-found Mersenne primes have been discovered by the "Great Internet Mersenne Prime Search" (GIMPS), a distributed computing project on the Internet.

[...]

Many fundamental questions about Mersenne primes remain unresolved. It is not even known whether the set of Mersenne primes is finite. The Lenstra–Pomerance–Wagstaff conjecture asserts that, on the contrary, there are infinitely many Mersenne primes and predicts their order of growth. It is also not known whether infinitely many Mersenne numbers with prime exponents are composite, although this would follow from widely believed conjectures about prime numbers, for example, the infinitude of Sophie Germain primes congruent to 3 (mod 4).

A basic theorem about Mersenne numbers states that in order for Mp to be a Mersenne prime, the exponent p itself must be a prime number. This rules out primality for numbers such as M4 = 24 − 1 = 15: since the exponent 4 = 2×2 is composite, the theorem predicts that 15 is also composite; indeed, 15 = 3×5. The three smallest Mersenne primes are

M2 = 3, M3 = 7, M5 = 31.

While it is true that only Mersenne numbers Mp, where p = 2, 3, 5, … could be prime, often Mp is not prime even for a prime exponent p. The smallest counterexample is the Mersenne number

M11 = 211 − 1 = 2047 = 23 × 89,

which is not prime, even though 11 is a prime number. The lack of an obvious rule to determine whether a given Mersenne number is prime makes the search for Mersenne primes an interesting task, which becomes difficult very quickly, since Mersenne numbers grow very rapidly. The Lucas–Lehmer primality test (LLT) is an efficient primality test that greatly aids this task. The search for the largest known prime has somewhat of a cult following. Consequently, a lot of computer power has been expended searching for new Mersenne primes, much of which is now done using distributed computing.

Manit0u
Profile Blog Joined August 2004
Poland17875 Posts
Last Edited: 2011-05-15 00:04:22
May 15 2011 00:02 GMT
#51
Well, in logic that would be a tautology check.

Example:
(that's conjunction and implication if you don't get the notation used)

p ^ q -> p

Now, we asume that -> is false (0), and for it to be false the left hand side of it must be true (p ^ q) while the right hand side (p) must be false (you can't get false results from true things while you can get anything you want from false things).

Then we get:

0 ^ q -> 0

Now we get to the problem, since no matter what we put in stead of q, our implication is going to be true (1), since in no way conjunction can be true if one of its elements is false, thus proving our original statement ( p ^ q -> p) to be a tautology, since it can never produce false results.

Now all you need to do is create such test for your stuff.
Time is precious. Waste it wisely.
Samhax
Profile Joined August 2010
1054 Posts
Last Edited: 2011-05-15 00:05:00
May 15 2011 00:03 GMT
#52
Wikipedia give the larger Mersenne prime number 2^43 112 609 -1 discovered and 2^(2^127-1) -1 is bigger. So there is no way to prove it even with a super computer.

Close the post :p
Mithrandir
Profile Joined March 2011
United States99 Posts
Last Edited: 2011-05-15 00:10:59
May 15 2011 00:08 GMT
#53
This is an unsolved problem.

These are Catalan-Mersenne Prime Numbers.

http://en.wikipedia.org/wiki/Double_Mersenne_number#Catalan-Mersenne_number

To the OP, please don't post unsolved problems and waste peoples' time.
ZerGuy
Profile Joined June 2008
Poland204 Posts
Last Edited: 2011-05-15 00:12:39
May 15 2011 00:08 GMT
#54
On May 15 2011 09:03 Samhax wrote:
Wikipedia give the larger Mersenne prime number 2^43 112 609 -1 discovered and 2^(2^127-1) -1 is bigger. So there is no way to prove it even with a super computer.

Close the post :p


Actually it's perfectly possible that this particular number can be proved as composed. It's just not known to be prime.



On May 15 2011 09:08 Mithrandir wrote:
This is an unsolved problem.

These are Catalan-Mersenne Prime Numbers.

http://en.wikipedia.org/wiki/Double_Mersenne_number#Catalan-Mersenne_number

To the OP, please don't post unsolved problems and waste peoples' time.



Was OP just a troll? So rude.
Someday ill be pro
Sufficiency
Profile Blog Joined October 2010
Canada23833 Posts
May 15 2011 00:12 GMT
#55
I seriously doubt you have given a formula that always produces prime number.

Thus, I suggest you should compute a few iterations and check if they are primes.
https://twitter.com/SufficientStats
Samhax
Profile Joined August 2010
1054 Posts
Last Edited: 2011-05-15 00:15:19
May 15 2011 00:14 GMT
#56
On May 15 2011 09:08 ZerGuy wrote:
Show nested quote +
On May 15 2011 09:03 Samhax wrote:
Wikipedia give the larger Mersenne prime number 2^43 112 609 -1 discovered and 2^(2^127-1) -1 is bigger. So there is no way to prove it even with a super computer.

Close the post :p


Actually it's perfectly possible that this particular number can be proved as composed. It's just not known to be prime.


I don't think so, because it's very hard top prove that a Mersenne number (2^p-1) is not prime when p is prime so if 2^127 -1 is prime, it's wil be tough.

I'm not saying it's impossible but he will be really hard.
Mithrandir
Profile Joined March 2011
United States99 Posts
May 15 2011 00:15 GMT
#57
On May 15 2011 09:12 Sufficiency wrote:
I seriously doubt you have given a formula that always produces prime number.

Thus, I suggest you should compute a few iterations and check if they are primes.


The only iterations easily checkable have been checked, and they are prime.

Like I said, nobody knows if this sequence (Catalan-Mersenne primes) always produces primes. Hell, this sequence is a subset of Mersenne Primes and nobody even knows if there are an infinite number of Mersenne Primes.
Mithrandir
Profile Joined March 2011
United States99 Posts
May 15 2011 00:17 GMT
#58
On May 15 2011 09:08 ZerGuy wrote:

Was OP just a troll? So rude.


Probably a troll. By the time you discuss questions this hard, you know whether they're even solved. I have a hard time believing some high schooler/undergrad found this problem scribbled in their math textbook and wanted to know the solution. Solving this problem would be a huge achievement for a professional mathematician.
aoeua
Profile Joined February 2007
United Kingdom75 Posts
May 15 2011 00:20 GMT
#59
I have discovered a truly marvellous solution for this problem. Unfortunately, the post width here is too narrow to contain it.
Samhax
Profile Joined August 2010
1054 Posts
Last Edited: 2011-05-15 00:22:12
May 15 2011 00:21 GMT
#60
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!
Prev 1 2 3 4 Next All
Please log in or register to reply.
Live Events Refresh
Next event in 5h 7m
[ Submit Event ]
Live Streams
Refresh
StarCraft 2
mouzHeroMarine 423
LamboSC2 262
MindelVK 35
Codebar 4
StarCraft: Brood War
Rain 1866
Shuttle 538
Mini 331
Horang2 315
Rush 197
Larva 195
ggaemo 156
Soulkey 150
Dewaltoss 131
firebathero 125
[ Show more ]
Stork 111
Mind 101
Barracks 27
Movie 20
soO 17
Bishop 16
scan(afreeca) 15
Trap 15
Noble 11
sorry 11
Dota 2
Gorgc8744
qojqva2305
Counter-Strike
byalli844
x6flipin362
allub152
Heroes of the Storm
Trikslyr84
Other Games
Liquid`RaSZi1822
B2W.Neo704
ceh9548
Grubby266
Liquid`VortiX217
edward111
QueenE80
KnowMe61
ViBE47
Mew2King40
[ Show 10 non-featured ]
StarCraft 2
• AfreecaTV YouTube
• intothetv
• Kozan
• IndyKCrew
• Migwel
StarCraft: Brood War
• BSLYoutube
• STPLYoutube
• ZZZeroYoutube
League of Legends
• TFBlade606
Other Games
• Shiphtur632
Upcoming Events
Replay Cast
5h 7m
Monday Night Weeklies
23h 7m
PiGosaur Cup
1d 7h
The PondCast
1d 16h
OSC
1d 22h
Replay Cast
2 days
GSL
2 days
Maru vs Dark
Patches Events
2 days
OSC
2 days
Replay Cast
3 days
[ Show More ]
KCM Race Survival
3 days
RSL Revival
4 days
BSL
5 days
eOnzErG vs StRyKeR
Cross vs JDConan
RSL Revival
5 days
BSL
6 days
Bonyth vs Doodle
Kyrie vs Jimin
WardiTV Weekly
6 days
Liquipedia Results

Completed

Individual League
Blizzard Classic Cup 2026
HCC Season 3

Ongoing

Acropolis #5
KCM Race Survival 2026 Season 4
International ShieldBattery League
BSL Season 23
IPSL Winter 2026-27
Calamity Cup Div. A Season 8
Underdog Cup 2026 Div 2-3
BLAST Rivals Fall 2026
IEM Beijing 2026
PGL Masters Bucharest 2026
Stake Ranked Episode 5
1win Private Club #2
Thunderpick World Champ. '26
ESL Pro League Season 24
Stake Ranked Episode 4
1win Private Club #1
Logitech G Play Connect 2026
SL StarSeries Fall 2026
FISSURE Playground #3
BLAST Open Fall 2026

Upcoming

Sector 591
YSL S4
SC4ALL II: Brood War
NBSL 2026 Xiamen LAN
BSL 23: Non-Korean Championship
HSC XXX
Stellar Fest 2: Lunar Cup
StarCraft2 Weekly Open Tournament 2026 Grand Finals
SC4ALL II: StarCraft II
Kung Fu Cup 2026 Grand Finals
RSL Offline Finals
IEM Kraków 2027
PGL Bucharest 2027
BLAST Bounty Winter 2027
PGL Major Singapore 2026
Stake Ranked Episode 6
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 © 2026 TLnet. All Rights Reserved.