mersenneforum.org  

Go Back   mersenneforum.org > Factoring Projects > Aliquot Sequences

Reply
 
Thread Tools
Old 2021-03-06, 21:46   #958
RichD
 
RichD's Avatar
 
Sep 2008
Kansas

23·431 Posts
Default

Next is table 58.
RichD is offline   Reply With Quote
Old 2021-03-07, 00:43   #959
EdH
 
EdH's Avatar
 
"Ed Hall"
Dec 2009
Adirondack Mtns

4,001 Posts
Default

Quote:
Originally Posted by RichD View Post
Next is table 58.
Base 58 has the following merge so far:
Code:
 
58^3:i63 merges with 65436:i2
EdH is online now   Reply With Quote
Old 2021-03-07, 09:52   #960
Happy5214
 
Happy5214's Avatar
 
"Alexander"
Nov 2008
The Alamo City

10111101102 Posts
Default

Quote:
Originally Posted by henryzz View Post
I think the trick would be to prove that:
2^(2^3 * 3^2 * 5 * 7 * k + 1) - 1 == 1 mod d
3^(2^3 * 3^2 * 5 * 7 * k + 1) - 1) / 2 == 1 mod d
6^(2^3 * 3^2 * 5 * 7 * k) == 1 mod d

If this is true then s(6^(2^3 * 3^2 * 5 * 7 * k)) = (2^(2^3 * 3^2 * 5 * 7 * k + 1) - 1)*3^(2^3 * 3^2 * 5 * 7 * k + 1) - 1) / 2 - 6^(2^3 * 3^2 * 5 * 7 * k) = 1*1-1 mod d
To complete and streamline warachwe's proof, it's all provable by induction using Z_d. Note that the exponent constant resolves to 2520. 6^(2^3 * 3^2 * 5 * 7 * k) == 1 mod d relatively trivially (6^2520 = 1 mod d, and 1^k = 1 mod d for all integers k). To prove base 2, I translate it to the equivalent problem of solving 2^(2^3 * 3^2 * 5 * 7 * k + 1) = 2 mod d. In this case, 2^2521 (base case) = 2 mod d, and when 2^(2520*k+1) = 2 mod d, 2^(2520*(k+1)+1) = 2 mod d (since 2^2520 = 1 mod d and 2^(2520*(k+1)+1) = 2^(2520*k+1) * 2^2520). Similarly, 3^(2520*k+1) = 3 mod d for all integers k, a statement equivalent to the above formula in Z_d, so the three formulas are proved.

Last fiddled with by Happy5214 on 2021-03-07 at 09:54
Happy5214 is offline   Reply With Quote
Old 2021-03-07, 17:19   #961
Happy5214
 
Happy5214's Avatar
 
"Alexander"
Nov 2008
The Alamo City

2×379 Posts
Default

@Jean-Luc: Any word on the redesigned web pages (either the sequence data or the conjectures)? As an aside, do you have access to any server-side scripting languages on your website? I still think a static page generated by an offline script is the way to go given the amount of data, especially given the way the sequence data is collected, but I am curious. In fact, a script to generate the conjecture page might be better than a handwritten HTML page, since it could automatically number the conjectures. In my mock-up, that's done by a CSS counter, which while convenient unfortunately takes most of the header content (like the number and the word "conjecture") out of the DOM and is bad for semantics and screenreaders.

I do have an improvement to the generator script for the sequence page. Does the script cache sequences that have been terminated? If not, it could save time by not requesting those from FactorDB every time and just using the cached data, which will not change again once terminated.
Happy5214 is offline   Reply With Quote
Old 2021-03-07, 17:24   #962
garambois
 
garambois's Avatar
 
"Garambois Jean-Luc"
Oct 2011
France

7·97 Posts
Default

Quote:
Originally Posted by Happy5214 View Post
To complete and streamline warachwe's proof, it's all provable by induction using Z_d. Note that the exponent constant resolves to 2520. 6^(2^3 * 3^2 * 5 * 7 * k) == 1 mod d relatively trivially (6^2520 = 1 mod d, and 1^k = 1 mod d for all integers k). To prove base 2, I translate it to the equivalent problem of solving 2^(2^3 * 3^2 * 5 * 7 * k + 1) = 2 mod d. In this case, 2^2521 (base case) = 2 mod d, and when 2^(2520*k+1) = 2 mod d, 2^(2520*(k+1)+1) = 2 mod d (since 2^2520 = 1 mod d and 2^(2520*(k+1)+1) = 2^(2520*k+1) * 2^2520). Similarly, 3^(2520*k+1) = 3 mod d for all integers k, a statement equivalent to the above formula in Z_d, so the three formulas are proved.

OK, so I understand that conjecture (138) is proven.
Thanks to you for all this work !
garambois is offline   Reply With Quote
Old 2021-03-07, 17:50   #963
garambois
 
garambois's Avatar
 
"Garambois Jean-Luc"
Oct 2011
France

7×97 Posts
Default

Quote:
Originally Posted by Happy5214 View Post
@Jean-Luc: Any word on the redesigned web pages (either the sequence data or the conjectures)? As an aside, do you have access to any server-side scripting languages on your website? I still think a static page generated by an offline script is the way to go given the amount of data, especially given the way the sequence data is collected, but I am curious. In fact, a script to generate the conjecture page might be better than a handwritten HTML page, since it could automatically number the conjectures. In my mock-up, that's done by a CSS counter, which while convenient unfortunately takes most of the header content (like the number and the word "conjecture") out of the DOM and is bad for semantics and screenreaders.
I saw in your page, the automatic counter for the conjectures.
And I will make this conjectures summary page on my website according to your example.
However, I am very short on time.
Right now I'm working on conjectures and programs.
I also have to update the page regularly, which takes a long time.
And since tomorrow I'm going back to work, I don't know when I'll do the conjectures page on my website : at worst, during my next vacation in mid April.
But all these tasks are noted and pending ...



Quote:
Originally Posted by Happy5214 View Post
I do have an improvement to the generator script for the sequence page. Does the script cache sequences that have been terminated? If not, it could save time by not requesting those from FactorDB every time and just using the cached data, which will not change again once terminated.

I am totally unable to answer this question.
I'll let Karsten answer, if he sees this message and has a response.
But I think right now he's working on it and maybe he's thinking about it all.
In the meantime, I am working with the old scripts and the old page.
garambois is offline   Reply With Quote
Old 2021-03-07, 17:57   #964
garambois
 
garambois's Avatar
 
"Garambois Jean-Luc"
Oct 2011
France

10101001112 Posts
Default

Page updated.
Thanks to all for your help !

Added bases : 38 and 46.
New cycles : 39^9 and 439^46.

73 bases in total.

I also corrected a reservation error for base 15015.
I had reserved it for yoyo by mistake.
I corrected and now it is reserved for me.
garambois is offline   Reply With Quote
Old 2021-03-07, 18:52   #965
kar_bon
 
kar_bon's Avatar
 
Mar 2006
Germany

32·52·13 Posts
Default

Quote:
Originally Posted by Happy5214 View Post
Does the script cache sequences that have been terminated? If not, it could save time by not requesting those from FactorDB every time and just using the cached data, which will not change again once terminated.
The current script re-read only open sequences from FactorDB. Terminated seqs are collected with data of the last index separately.
kar_bon is offline   Reply With Quote
Old 2021-03-07, 19:33   #966
yoyo
 
yoyo's Avatar
 
Oct 2006
Berlin, Germany

2·313 Posts
Default

I'll take bases 38, 43, 46, 47.

yoyo
yoyo is offline   Reply With Quote
Old 2021-03-08, 17:48   #967
garambois
 
garambois's Avatar
 
"Garambois Jean-Luc"
Oct 2011
France

7×97 Posts
Default

Quote:
Originally Posted by yoyo View Post
I'll take bases 38, 43, 46, 47.

yoyo
OK thanks a lot.
This will be done in the next update.
garambois is offline   Reply With Quote
Old 2021-03-09, 00:54   #968
RichD
 
RichD's Avatar
 
Sep 2008
Kansas

23·431 Posts
Default

Might have a merge with 58^7.
RichD is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Broken aliquot sequences fivemack FactorDB 46 2021-02-21 10:46
Broken aliquot sequences schickel FactorDB 18 2013-06-12 16:09
A new theorem about aliquot sequences garambois Aliquot Sequences 34 2012-06-10 21:53
poaching aliquot sequences... Andi47 FactorDB 21 2011-12-29 21:11
New article on aliquot sequences schickel mersennewiki 0 2008-12-30 07:07

All times are UTC. The time now is 18:10.


Wed Oct 20 18:10:27 UTC 2021 up 89 days, 12:39, 0 users, load averages: 1.00, 1.26, 1.23

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