probably a tough crowd, but…. New version of my preprint, about abundance of Erdős–Straus solutions: Lean now verifies abundance for almost all integers, with a sharper exceptional-set bound: O(N(log log N)^3/(log N)^3) → O(N(log log N)^2/(log N)^3). One log-log factor.
Discovery
Learnings
- auto_storiesStories
- categoryAreas
- helpFAQ
- forumConversations
- descriptionPapers
- mailNewsletters
- video_libraryVideos
- timelineTimeline
Guidance
- codeTechnology of APIs
- business_centerBusiness of APIs
- campaignEvangelism of APIs
- gavelGovernance of APIs
- historyHistory of APIs
- account_balancePolitics of APIs
Toolbox
- domainProviders
- apiAPIs
- cloudSolutions
- buildTools
- verifiedStandards
- gavelRegulations
- horizontal_ruleHeaders
- layersOverlays
- extensionExtensions
- schemaSchema
- policyPolicies
- ruleRules