mersenneforum.org Search Results
 User Name Remember Me? Password
 Register FAQ Search Today's Posts Mark Forums Read

 Showing results 1 to 25 of 1000 Search took 0.53 seconds. Search: Posts Made By: Batalov
 Forum: Aliquot Sequences 2022-08-05, 01:30 Replies: 3,698 Views: 442,519 Posted By Batalov Taking 199152 Taking 199152
 Forum: Lounge 2022-08-04, 05:37 Replies: 119 Views: 7,213 Posted By Batalov too easy! too easy!
 2022-08-04, 01:37 Replies: 49 Views: 10,633 Posted By Batalov Should this sequence be finite or infinite? ... Should this sequence be finite or infinite? [/QUOTE] I have concerns about your reading comprehension. Maybe A355956 tells something on this subject? Ah... wait...!
 Forum: FactorDB 2022-08-04, 01:32 Replies: 571 Views: 108,163 Posted By Batalov It's not just you! factordb.com... It's not just you! factordb.com (https://downforeveryoneorjustme.com/factordb.com) is down.
 2022-08-02, 22:59 Replies: 49 Views: 10,633 Posted By Batalov {parody of some folks' posts} But... but.. if... {parody of some folks' posts} But... but.. if you sum up 1000007396's digits you will get 26. Therefore, the digital root is 8. If you take the digital root of p(1000007396) you will also get 8....
 Forum: Proth Prime Search 2022-08-01, 16:08 Replies: 16 Views: 2,982 Posted By Batalov 19061965*2^1840922+1 is prime :rolleyes: 19061965*2^1840922+1 is prime :rolleyes:
 Forum: NFS@Home 2022-07-31, 17:36 Replies: 103 Views: 6,523 Posted By Batalov 2,1416+ is done 2,1416+ cofactor = p110 factor: 32312139386459660237589835506395782331854721499061954474461527504052156188529138203172395312834444925463648513 p132 factor:...
 Forum: Software 2022-07-30, 18:20 Replies: 662 Views: 57,438 Posted By Batalov Because such FFT doesn't exist. FFT are... Because such FFT doesn't exist. FFT are implemented for a certain list of sizes. In vicinity of "122" there are: 120, 128, 144 and so on. Longer answer: "still why not 122?" Because FFT is an...
 Forum: Lounge 2022-07-27, 23:15 Replies: 13 Views: 288 Posted By Batalov = =
 Forum: Chess 2022-07-26, 17:53 Replies: 5 Views: 345 Posted By Batalov bAdqazixuRY bAdqazixuRY
 Forum: Lounge 2022-07-25, 21:12 Replies: 1,973 Views: 236,479 Posted By Batalov Paul Sorvino... Paul Sorvino (https://www.bbc.com/news/world-us-canada-62296883), actor
 Forum: Linux 2022-07-25, 10:07 Replies: 21 Views: 538 Posted By Batalov echo wc -l a wc -l b |awk '{print $1*100/$3... echo wc -l a wc -l b |awk '{print $1*100/$3 "%"}'
 Forum: Chess 2022-07-23, 21:43 Replies: 4 Views: 160 Posted By Batalov GM Magnus Carlsen's abdication https://www.chess.com/news/view/carlsens-abdication-reactions-from-the-chess-world ______________ * just in case, unrelated note: the last name Nepomniachtchi (Непо́мнящий) is a nice inside joke;...
 2022-07-21, 11:51 Replies: 49 Views: 10,633 Posted By Batalov p(19439060)... p(19439060) (http://factordb.com/index.php?id=1100000003809020989) and p(19439060)+4 (http://factordb.com/index.php?id=1100000003809021930) are cousin primes. Work in progress: A355956 = 3, 5, 6,...
 Forum: Miscellaneous Math 2022-07-20, 22:46 Replies: 27 Views: 1,203 Posted By Batalov Re: 32 bits, and later 64 bit limit, and then higher. Every road begins with a few first steps. Just to give you, perhaps, a sandwich for the road (because this road is long), there are certain elements that can be used for 1) prototyping, 2)...
 Forum: Miscellaneous Math 2022-07-19, 06:18 Replies: 27 Views: 1,203 Posted By Batalov How about this, straight from Wikipedia (with... How about this, straight from Wikipedia (with pseudocode changed into python): def is_pow_onemod_fromWiki(P,D): # return true if 2^Mp = 1 (mod D) x=2 y=1 while (P > 1): ...
 Forum: Miscellaneous Math 2022-07-18, 10:06 Replies: 27 Views: 1,203 Posted By Batalov There is nothing that needs explaining. You are... There is nothing that needs explaining. You are implementing exponentiation by millions of multiplications. Instead, this method (https://en.wikipedia.org/wiki/Exponentiation_by_squaring) exists...
 Forum: NFS@Home 2022-07-17, 20:32 Replies: 103 Views: 6,523 Posted By Batalov In LA now. (Good dataset, 30M matrix.) ETA ~2... In LA now. (Good dataset, 30M matrix.) ETA ~2 weeks.
 Forum: Lounge 2022-07-17, 00:47 Replies: 296 Views: 45,649 Posted By Batalov Just use license plate 0C2H5OH :rolleyes: Just use license plate 0C2H5OH :rolleyes:
 Forum: Miscellaneous Math 2022-07-16, 23:06 Replies: 27 Views: 1,203 Posted By Batalov Exactly! 5 steps is enough, if done properly. Exactly! 5 steps is enough, if done properly.
 Forum: Miscellaneous Math 2022-07-16, 22:42 Replies: 27 Views: 1,203 Posted By Batalov You are computing Mod(1/2,D)^7 and compare to... You are computing Mod(1/2,D)^7 and compare to 2^4. (where 4 is simply a red herring value. You can change it to 3, to 7, to anything.) That's the same as as computing Mod(1/2,D)^P by dividing by...
 2022-07-15, 21:44 Replies: 3 Views: 429 Posted By Batalov Will we also learn to play go? Neat! EDIT: I... Will we also learn to play go? Neat! EDIT: I would be very interested. I can tell those who haven't experienced it - it is very useful if you travel to Japan. While at a conference you can...
 Forum: sweety439 2022-07-15, 16:58 Replies: 13 Views: 524 Posted By Batalov What part of "E.g.... What part of "E.g. (https://dictionary.cambridge.org/us/dictionary/english/eg)" was too difficult to understand?
 2022-07-15, 05:07 Replies: 49 Views: 10,633 Posted By Batalov Wrote a sieve and ran some range and found a few... Wrote a sieve and ran some range and found a few large sequence elements (e.g. p(2335166)); will run for some more. And credit where credit is due: look at the state of p(2335166) in FactorDb, eh?...
 Forum: NFS@Home 2022-07-14, 20:53 Replies: 103 Views: 6,523 Posted By Batalov I can help with finishing 2_1416p1 I can help with finishing 2_1416p1
 Showing results 1 to 25 of 1000

All times are UTC. The time now is 22:06.

Fri Aug 12 22:06:15 UTC 2022 up 36 days, 16:53, 2 users, load averages: 0.90, 1.06, 1.12

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.

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