mersenneforum.org (https://www.mersenneforum.org/index.php)
-   sweety439 (https://www.mersenneforum.org/forumdisplay.php?f=137)

 sweety439 2022-01-16 17:13

Off-topic

Like [URL="https://homes.cerias.purdue.edu/~ssw/cun/index.html"]Cunningham table[/URL] to various bases, is there any interest to factor the numbers similar to Fibonacci numbers [URL="https://oeis.org/A000045"]A000045[/URL]? e.g. Pell numbers [URL="https://oeis.org/A000129"]A000129[/URL], 3-Fibonacci numbers [URL="https://oeis.org/A006190"]A006190[/URL], 5-Fibonacci numbers [URL="https://oeis.org/A052918"]A052918[/URL], 6-Fibonacci numbers [URL="https://oeis.org/A005668"]A005668[/URL], etc. (Note: 4-Fibonacci numbers [URL="https://oeis.org/A001076"]A001076[/URL] do not need their own table, since their factorization can be converted to the factorization of the Fibonacci numbers: F(4,n) = F(1,3*n)/2, like that the [URL="https://oeis.org/A001597"]perfect power[/URL] bases do not need their own Cunningham table. The k-Fibonacci number do not need their own table if and only if [URL="https://oeis.org/A013946"]A013946[/URL](k) is the same as a previous term, like that b^n+-1 do not need their own Cunningham table if and only if [URL="https://oeis.org/A052410"]A052410[/URL](b) is the same as a previous term)

 sweety439 2022-02-01 06:35

Some sequences like the Motzkin numbers [URL="https://oeis.org/A001006"]A001006[/URL]:

* Fubini numbers [URL="https://oeis.org/A000670"]A000670[/URL]: For n<=12000, a(n) is prime only for n = 2, 3, 5, 7, 9, 13, see [URL="https://oeis.org/A290376"]A290376[/URL]

* Bell numbers [URL="https://oeis.org/A000110"]A000110[/URL]: For n<=100000, a(n) is prime only for n = 2, 3, 7, 13, 42, 55, 2841, see [URL="https://oeis.org/A051130"]A051130[/URL]

* Euler zigzag numbers [URL="https://oeis.org/A000111"]A000111[/URL]: For n<=69574, a(n) is prime only for n = 3, 4, 6, 38, 454, 510, see [URL="https://oeis.org/A103234"]A103234[/URL] (for odd n, a(n) is even, thus the only prime is a(3) = 2)

There are only very few primes in these four sequences, unlike the Fibonacci numbers [URL="https://oeis.org/A000045"]A000045[/URL], the Pell numbers [URL="https://oeis.org/A000129"]A000129[/URL], the Jacobsthal numbers [URL="https://oeis.org/A001045"]A001045[/URL], the Perrin numbers [URL="https://oeis.org/A001608"]A001608[/URL], the Padovan numbers [URL="https://oeis.org/A000931"]A000931[/URL], the Narayana numbers [URL="https://oeis.org/A000930"]A000930[/URL], there are many primes in these six sequences.

[B]Can you find the next Fubini (probable) prime after [URL="https://oeis.org/A000670"]A000670[/URL](13) = 526858348381?[/B]

 mathwiz 2022-02-01 18:04

[QUOTE=sweety439;599188][B]Can you find the next Fubini (probable) prime after [URL="https://oeis.org/A000670"]A000670[/URL](13) = 526858348381?[/B][/QUOTE]

Why are you asking us? If you're interested, why don't you search for them?

 Uncwilly 2022-02-01 19:52

[QUOTE=mathwiz;599217]Why are you asking us? If you're interested, why don't you search for them?[/QUOTE]
You are free to ignore any posts in this subforum. It will make your life easier.

 tuckerkao 2022-02-04 05:50

[QUOTE=mathwiz;599217]Why are you asking us? If you're interested, why don't you search for them?[/QUOTE]
This thread is under Blogorrhea which has been more of the personal space granted to sweety439, just in case you don't know, sweety439 also enjoys to play around the dozenal math stuffs.

 Batalov 2022-02-04 06:40

[QUOTE=tuckerkao;599353]This thread is under Blogorrhea ...[/QUOTE]
...but he didn't post here.
He posted in completely irrelevant threads - and mods [I](plural![/I]) moved his non-sequiturs here.

 sweety439 2022-02-04 10:58

[QUOTE=charybdis;599348]I don't know if this is the same issue that you were having, but the DB is being flooded. Someone is adding millions of 4x-digit numbers, many of the form 10^46+n, along with their factorizations, and there is now a backlog of millions of unproved small PRPs which is preventing other PRPs from being proved. I've dropped Markus an email. If the user responsible happens to be reading this forum, please could you stop?[/QUOTE]

How to (use bot to) add many numbers in a sequence to factordb? I want to add [URL="https://oeis.org/A000110"]Bell[/URL](n), [URL="https://oeis.org/A000111"]Euler[/URL](n), [URL="https://oeis.org/A000129"]Pell[/URL](n), [URL="https://oeis.org/A000073"]Tribonacci[/URL](n), [URL="https://oeis.org/A006190"]BronzeFibonacci[/URL](n), [URL="https://oeis.org/A000078"]Tetranacci[/URL](n), [URL="https://oeis.org/A001608"]Perrin[/URL](n), [URL="https://oeis.org/A000931"]Padovan[/URL](n), [URL="https://oeis.org/A000930"]Narayana[/URL](n), [URL="https://oeis.org/A000670"]Fubini[/URL](n), [URL="https://oeis.org/A001006"]Motzkin[/URL](n), [URL="https://oeis.org/A007406"]Wolstenholme[/URL](n), [URL="https://oeis.org/A003422"]![/URL](n), [URL="https://oeis.org/A005165"]A[/URL](n), [URL="https://oeis.org/A007489"]K[/URL](n), [URL="https://oeis.org/A000522"]A000522[/URL](n), [URL="https://oeis.org/A000041"]Partition[/URL](n), [URL="https://oeis.org/A000009"]DistinctPartition[/URL](n), [URL="https://oeis.org/A007908"]Sm[/URL](n), [URL="https://oeis.org/A019518"]SmWl[/URL](n), [URL="https://oeis.org/A000422"]RSm[/URL](n), [URL="https://oeis.org/A038394"]RSmWl[/URL](n), and [URL="https://oeis.org/A000521"]A000521[/URL](n) in factordb, for all 1<=n<=10000 (Sm(n) and SmWl(n) and RSm(n) and RSmWl(n) include their analog in bases 2<=b<=36), also the first n digits for many mathematical constants (pi, e, gamma, sqrt(2), ln(2), golden ratio, ...) in bases 2<=b<=36 for all 1<=n<=10000

(I try to use [URL="https://www.tohodo.com/autofill/form.html"]Autofill[/URL] for this, but no success, for the options, I selected "JavaScript" for type and typed these texts for value:

[CODE]
var x = document.querySelector('input[name="query"]');
x.value = '123';
document.querySelector('[type="submit"][value="Factorize!"]').click();

var y = document.querySelector('input[name="query"]');
y.value = '456';
document.querySelector('[type="submit"][value="Factorize!"]').click();

var z = document.querySelector('input[name="query"]');
z.value = '789';
document.querySelector('[type="submit"][value="Factorize!"]').click();
[/CODE]

(I will use PARI/GP program to change "123" and "456" and "789" to the [URL="https://oeis.org/A000110"]Bell numbers[/URL], the [URL="https://oeis.org/A000111"]Euler zigzag numbers[/URL], the [URL="https://oeis.org/A000670"]Fubini numbers[/URL], etc. (my PARI/GP programs can compute them, and can print the codes) also all [URL="http://fatphil.org/maths/rtp/rtp.html"]right-truncatable primes in bases 2<=b<=90[/URL] and all known [URL="https://github.com/RaymondDevillers/primes"]minimal primes in bases 2<=b<=50[/URL] (both datas are available online), and change the variables "x" and "y" and "z" to "x1", "x2", "x3", ...)

but why the factordb only enters 789 to factorize, and does not enter 123 and 456?)

 mathwiz 2022-02-04 21:09

[QUOTE=Uncwilly;599220]You are free to ignore any posts in this subforum. It will make your life easier.[/QUOTE]

The question was honest and non-rhetorical.

I am wondering why OP does not test these sequences {him,her}self. Or, if for a lack of compute resources: why are they important enough that others should test them?

 Uncwilly 2022-02-04 21:20

There are theoretical physics and there are experimental ones. Just maybe the person in question leans to the theoretical end of maths.

 tuckerkao 2022-02-04 23:00

[QUOTE=mathwiz;599404]The question was honest and non-rhetorical.

I am wondering why OP does not test these sequences {him,her}self. Or, if for a lack of compute resources: why are they important enough that others should test them?[/QUOTE]
Sweety439 may just have his own favorite preference digging into certain areas which aren't important to other people at all.

I saw a mechanical product online recently and it showed the product number of 48-53-2837 - [URL="https://www.pinterest.com/pin/501236633550226758/"]https://www.pinterest.com/pin/501236633550226758/[/URL]

So I've decided that I want to run a PRP test of 2[SUP]48,532,837[/SUP] - 1 myself(This exponent is a decimal composite but a dozenal prime with a different interpretation), my reason won't be good enough to convince anyone else, glad I have to plenty computing resources under my roof to finish it without bothering Kriesel again.

 paulunderwood 2022-02-04 23:07

[QUOTE=tuckerkao;599408]

So I've decided that I want to run a PRP test of 2[SUP]48,532,837[/SUP] - 1 myself(This exponent is a decimal composite but a dozenal prime with a different interpretation), my reason won't be good enough to convince anyone else, glad I have to plenty computing resources under my roof.[/QUOTE]

:crank::rakes:

:wrong:

:missingteeth:

All times are UTC. The time now is 07:39.