mersenneforum.org  

Go Back   mersenneforum.org > Extra Stuff > Miscellaneous Math

Reply
 
Thread Tools
Old 2022-01-30, 06:30   #12
LaurV
Romulan Interpreter
 
LaurV's Avatar
 
"name field"
Jun 2011
Thailand

9,973 Posts
Default

Quote:
Originally Posted by TimoKinnunen View Post
Biggest known Mersenne prime number has 24 million digits. With a database table having three columns [blah blah], it is possible to bypass biggest known prime number in acceptable time with a powerful super-computer.
Bhaaaaa... you have to pay the coffee I spelt on the keyboard.
You want to do that by trial division?

With a computer sieving a million billions trillions quadrillions primes per pico-second (to be clear, that is a computer larger than the size of the earth, and probably done by quantum technology, filtering 1000000000000000000000000000000000000000000000000000000 primes every second (that is a 1 followed by 6+9+12+15+12 zeroes) you still need about 10^12300000 years to finish it... (that is a 1 followed by about 12 million zeros, in base ten).

People dont really realize how large these numbers are.

Last fiddled with by LaurV on 2022-01-30 at 06:47 Reason: s/quatralions/quadrillions/
LaurV is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Congruent prime numbers that preserves the modulo as the largest prime factor of the sum Hugo1177 Miscellaneous Math 5 2021-02-11 07:40
What can you do with 2 prime numbers? VicDiesel Programming 12 2017-04-20 21:16
Prime Numbers Or Not Arxenar Miscellaneous Math 38 2013-06-28 23:26
All odd numbers are prime Citrix Lounge 5 2010-04-05 21:34
Prime numbers Unregistered Miscellaneous Math 8 2008-11-09 07:45

All times are UTC. The time now is 11:44.


Sat Jul 2 11:44:09 UTC 2022 up 79 days, 9:45, 0 users, load averages: 1.57, 1.63, 1.45

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2022, 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.

≠ ± ∓ ÷ × · − √ ‰ ⊗ ⊕ ⊖ ⊘ ⊙ ≤ ≥ ≦ ≧ ≨ ≩ ≺ ≻ ≼ ≽ ⊏ ⊐ ⊑ ⊒ ² ³ °
∠ ∟ ° ≅ ~ ‖ ⟂ ⫛
≡ ≜ ≈ ∝ ∞ ≪ ≫ ⌊⌋ ⌈⌉ ∘ ∏ ∐ ∑ ∧ ∨ ∩ ∪ ⨀ ⊕ ⊗ 𝖕 𝖖 𝖗 ⊲ ⊳
∅ ∖ ∁ ↦ ↣ ∩ ∪ ⊆ ⊂ ⊄ ⊊ ⊇ ⊃ ⊅ ⊋ ⊖ ∈ ∉ ∋ ∌ ℕ ℤ ℚ ℝ ℂ ℵ ℶ ℷ ℸ 𝓟
¬ ∨ ∧ ⊕ → ← ⇒ ⇐ ⇔ ∀ ∃ ∄ ∴ ∵ ⊤ ⊥ ⊢ ⊨ ⫤ ⊣ … ⋯ ⋮ ⋰ ⋱
∫ ∬ ∭ ∮ ∯ ∰ ∇ ∆ δ ∂ ℱ ℒ ℓ
𝛢𝛼 𝛣𝛽 𝛤𝛾 𝛥𝛿 𝛦𝜀𝜖 𝛧𝜁 𝛨𝜂 𝛩𝜃𝜗 𝛪𝜄 𝛫𝜅 𝛬𝜆 𝛭𝜇 𝛮𝜈 𝛯𝜉 𝛰𝜊 𝛱𝜋 𝛲𝜌 𝛴𝜎𝜍 𝛵𝜏 𝛶𝜐 𝛷𝜙𝜑 𝛸𝜒 𝛹𝜓 𝛺𝜔