惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

S
Securelist
O
OpenAI News
Threat Intelligence Blog | Flashpoint
Threat Intelligence Blog | Flashpoint
T
Threat Research - Cisco Blogs
D
Darknet – Hacking Tools, Hacker News & Cyber Security
Google Online Security Blog
Google Online Security Blog
C
CXSECURITY Database RSS Feed - CXSecurity.com
N
News and Events Feed by Topic
S
Security Affairs
SecWiki News
SecWiki News
Project Zero
Project Zero
L
Lohrmann on Cybersecurity
P
Proofpoint News Feed
P
Palo Alto Networks Blog
L
LINUX DO - 最新话题
H
Hacker News: Front Page
Recent Commits to openclaw:main
Recent Commits to openclaw:main
I
Intezer
Simon Willison's Weblog
Simon Willison's Weblog
W
WeLiveSecurity
T
The Exploit Database - CXSecurity.com
K
Kaspersky official blog
The GitHub Blog
The GitHub Blog
I
InfoQ
云风的 BLOG
云风的 BLOG
雷峰网
雷峰网
B
Blog
IT之家
IT之家
AWS News Blog
AWS News Blog
Jina AI
Jina AI
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
Google DeepMind News
Google DeepMind News
Spread Privacy
Spread Privacy
N
News and Events Feed by Topic
Security Latest
Security Latest
美团技术团队
C
Check Point Blog
WordPress大学
WordPress大学
T
Tenable Blog
S
Security @ Cisco Blogs
Last Week in AI
Last Week in AI
博客园 - 聂微东
月光博客
月光博客
博客园 - 【当耐特】
S
Schneier on Security
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
S
Secure Thoughts
Schneier on Security
Schneier on Security
C
Cisco Blogs
Cyberwarzone
Cyberwarzone

Show HN

暂无文章

From Observation to General Law
el Issaoui, Bilal · 2026-06-13 · via Show HN

Published June 12, 2026 | Version v1

Preprint Open

Description

The A-C Coupling Theorem

presents a general law for n-dimensional linear Diophantine systems of the form N = Σ cᵢ · xᵢ.

Two structural conditions are identified as jointly sufficient for a direct, single-step determination of the minimum starting value A₀ = N mod c₂:

Condition one (Foundation): the top coefficient must satisfy c₁ ≡ 1 (mod c₂). This renders the top layer transparent modulo c₂, making the steering value independent of the highest coefficient.

Condition two (Chain): the remaining coefficients must form an exact divisibility chain cₙ | cₙ₋₁ | ... | c₂. This guarantees that every remainder at every layer is absorbable without gaps.

Two families of instances are examined in detail:

the euro family (modulus 9, coefficients 19, 9, 3, 3, 1) where A₀ equals the digital root, and the clock family (modulus 12, coefficients 25, 12, 4, 1) where A₀ = N mod 12. Concrete examples from 2D through 6D and beyond verify both conditions through modular arithmetic.

The law is general:

for any valid coefficients and any N, A₀ is determinable in O(1) time. The digital root is not a property of any specific system, it is a consequence of the structure itself.

The paper includes a formal proof of the general theorem, with explicit inductive steps for both the Foundation Lemma and the Attainability Lemma.

Files

General_Law_for_n-Dimensional.pdf

Files (35.6 kB)

Additional details

A General Law for n-Dimensional Linear Diophantine Systems