mersenneforum.org  

Go Back   mersenneforum.org > Factoring Projects > FactorDB

Reply
 
Thread Tools
Old 2022-04-20, 15:58   #540
chris2be8
 
chris2be8's Avatar
 
Sep 2009

22·587 Posts
Default

Quote:
Originally Posted by Happy5214 View Post
Does Markus's script know to factor these large products algebraically first? That would be a huge help.
I emailed him about this, he replied:
Quote:
Hello Chris,

looks like there are tons of numbers which are just the product of
several expressions. I'll run a script for these now, might take a while.

Markus
This will clear out a lot of junk. But probably produce a load of small entries for the various expressions that make up the junk. But at least some of them will be SNFS targets.
chris2be8 is offline   Reply With Quote
Old 2022-05-07, 14:45   #541
RichD
 
RichD's Avatar
 
Sep 2008
Kansas

37×97 Posts
Default

This really slows down work in the database.
Attached Thumbnails
Click image for larger version

Name:	FDB.jpg
Views:	90
Size:	53.8 KB
ID:	26849  
RichD is offline   Reply With Quote
Old 2022-05-15, 14:14   #542
sweety439
 
sweety439's Avatar
 
"99(4^34019)99 palind"
Nov 2016
(P^81993)SZ base 36

22×863 Posts
Default

There were many small composites < 10^18 (from a bug) in Oct 2021, and all of them had been deleted, but there were also many small primes < 10^18, also from the same bug, but why they have not been deleted? I think they also need to be deleted.
sweety439 is offline   Reply With Quote
Old 2022-05-20, 14:19   #543
Happy5214
 
Happy5214's Avatar
 
"Alexander"
Nov 2008
The Alamo City

22×7×29 Posts
Default

Along with deleting those bad primes, please just delete/disable the modulo operator altogether if that hasn't been done already. It obviously isn't implemented correctly, it's not particularly useful, and tons of bogus data has resulted from its use.
Happy5214 is offline   Reply With Quote
Old 2022-05-21, 07:34   #544
sweety439
 
sweety439's Avatar
 
"99(4^34019)99 palind"
Nov 2016
(P^81993)SZ base 36

22·863 Posts
Default

Quote:
Originally Posted by Happy5214 View Post
Along with deleting those bad primes, please just delete/disable the modulo operator altogether if that hasn't been done already. It obviously isn't implemented correctly, it's not particularly useful, and tons of bogus data has resulted from its use.
Not delete the modulo operator (%), but just fix this operator, also suggest lower case letters for variables, upper case letters for these functions: (delete these operators: "!!" = double factorial and "##" = product of first n primes, suggest to use "n!m" for the m-factorial function of n (multifactorial))

Code:
A      n! - (n-1)! + (n-2)! - ... 1!      A005165
B      Bell numbers      A000110
C      Catalan numbers      A000108
D      Distinct partition numbers      A000009
E      Euler zigzag numbers      A000111
F      Fermat numbers      A000215
G      Fubini numbers      A000670
H      H(m,n) = n-th m-Fibonacci numbers      A000045 A000129 A006190 A001076 ...
I      I(m,n) = n-th m-step Fibonacci numbers      A000045 A000073 A000078 A001591 ...
J      Coefficients of modular function j as power series in q = e^(2 Pi i t)      A000521
K      1! + 2! + 3! + ... + n!      A007489
L      L(m,n) = n-th m-Lucas numbers      A000032 A002203 A006497 A014448 ...
M      Mersenne numbers      A000225
N      N(m,n) = n!_(m) = m-factorial of n
O      O(m,n) = m-th cyclotomic polynomial evaluated at n
P      Partition numbers      A000041
Q      Perrin numbers      A001608
R      R(m,n) = repunit in base m with length n
S      S(m,n) = (Smarandache numbers) the concatenate the first n integers in base m
T      Ramanujan's tau function      A000594
U      U(n,p,q) = Lucas sequence U_n(p,q)
V      V(n,p,q) = Lucas sequence V_n(p,q)
W      W(m,n) = (Wolstenholme numbers) numerator of 1 + 1/(2^m) + 1/(3^m) + ... + 1/(n^m)
X      X(m,n) = (Smarandache-Wellin numbers) the concatenate the first n primes in base m
Y      Y(m,n) = n-th m-step Lucas numbers      A000032 A001644 A073817 A074048 ...
Z      Motzkin numbers      A001006
!      Factorial
#      Primorial
%      Modulo operator
\      Integer division
@      n@ = n-th prime
&      Narayana's cows sequence      A000930
$      Padovan sequence      A000931

Last fiddled with by sweety439 on 2022-05-21 at 08:20
sweety439 is offline   Reply With Quote
Old 2022-05-22, 23:13   #545
sweety439
 
sweety439's Avatar
 
"99(4^34019)99 palind"
Nov 2016
(P^81993)SZ base 36

22·863 Posts
Default

Quote:
Originally Posted by Happy5214 View Post
Unless you're also immediately posting the Primo certs or doing P-1/P+1 proofs, please don't. Additions like those create extra work for the cert elves and are part of the overall problem.
P-1 and P+1 are "integer factoring" algorithm

N-1 and N+1 are "primality testing" algorithm

They are different (but I doubt whether they are related? After all, "integer factoring" algorithm also has ECM, and "primality testing" algorithm also has ECPP, and both of them uses elliptic curves, however, they are found by different people, P-1 is by Pollard, P+1 is by Williams, N-1 is by Pocklington, N+1 is by Morrison)
sweety439 is offline   Reply With Quote
Old 2022-05-22, 23:48   #546
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

100110100000002 Posts
Default

Quote:
Originally Posted by sweety439 View Post
wiki
wiki
They are different
The revenge of ...
Attached Thumbnails
Click image for larger version

Name:	CaptainO.jpg
Views:	41
Size:	65.8 KB
ID:	26912  
Batalov is offline   Reply With Quote
Old 2022-05-27, 12:04   #547
Happy5214
 
Happy5214's Avatar
 
"Alexander"
Nov 2008
The Alamo City

22×7×29 Posts
Default

Quote:
Originally Posted by sweety439 View Post
P-1 and P+1 are "integer factoring" algorithm

N-1 and N+1 are "primality testing" algorithm

[,,,]
I was late for a meeting when I wrote that and didn't have time to proofread. I don't need the extended response.

Quote:
Originally Posted by sweety439 View Post
Not delete the modulo operator (%), but just fix this operator [...]
Can you (or anyone) demonstrate any useful purpose for this operator that justifies its continued existence on this website, especially in the face of all the trouble it's caused? IMO all entries using it need to be purged.
Happy5214 is offline   Reply With Quote
Old 2022-05-27, 21:35   #548
Stargate38
 
Stargate38's Avatar
 
"Daniel Jackson"
May 2011
14285714285714285714

70810 Posts
Default

I know of a reason to keep it. Since we don't have a built-in floor or ceiling function, we can represent it as floor(a/b)=(a-(a%b))/b, and ceil(a/b)=(a-(a%b))/b+1. We can use this to calculate floor(M521/10^100): http://www.factordb.com/index.php?id...00000824396765. That's far shorter than "(M521-4463459185543183397656052122559640661454554977296311391480858037121987999716643812574028291115057151)/10^100".

Last fiddled with by Stargate38 on 2022-05-27 at 21:43
Stargate38 is offline   Reply With Quote
Old 2022-05-28, 04:38   #549
sweety439
 
sweety439's Avatar
 
"99(4^34019)99 palind"
Nov 2016
(P^81993)SZ base 36

22×863 Posts
Default

Quote:
Originally Posted by Stargate38 View Post
I know of a reason to keep it. Since we don't have a built-in floor or ceiling function, we can represent it as floor(a/b)=(a-(a%b))/b, and ceil(a/b)=(a-(a%b))/b+1. We can use this to calculate floor(M521/10^100): http://www.factordb.com/index.php?id...00000824396765. That's far shorter than "(M521-4463459185543183397656052122559640661454554977296311391480858037121987999716643812574028291115057151)/10^100".
I suggest to add "\" (integer division)

Also, factordb has "n##" (product of the first n primes) but does not have "n@" (the n-th prime), I really do not know why, it is not reasonable! Thus I think that factordb should add "n@" for the n-th prime.
sweety439 is offline   Reply With Quote
Old 2022-05-28, 15:02   #550
charybdis
 
charybdis's Avatar
 
Apr 2020

22×11×17 Posts
Default

There is a common theme here:
When people post here, nothing gets done. When people email Markus, he pays attention. It's pretty clear that Markus doesn't read this thread.

In other words, for those who would like the modulo operator fixed/removed, I suggest dropping Markus an email.
(Sweety: please don't spam him with lots of stupid suggestions. That might make him less willing to pay attention to serious suggestions.)
charybdis is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
A suggestion for factordb. enzocreti FactorDB 21 2022-06-08 18:35
Extending Factordb carpetpool FactorDB 6 2017-01-23 11:04
FactorDB PRP's smh FactorDB 231 2015-07-28 02:30
bugged sequence in factordb firejuggler Aliquot Sequences 2 2010-06-15 14:03
FactorDB question Raman Factoring 15 2010-01-28 10:24

All times are UTC. The time now is 15:42.


Wed Jun 29 15:42:38 UTC 2022 up 76 days, 13:43, 2 users, load averages: 1.59, 1.51, 1.59

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.

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