ConGCD: Arithmetic, Algorithms, and Discovery

• ConGCD is a cross-disciplinary term referring to both the greatest common divisor of sums in generalized Fibonacci sequences and constrained GCD frameworks in computational algebra.
• In number theory, it characterizes consecutive-sum properties using Fibonacci identities, modular periodicity, and efficient O(log k) algorithms.
• In machine learning, ConGCD names a consensus-aware architecture for generalized category discovery that improves recognition of novel classes through reconstruction loss and consensus units.

ConGCD is not a single universally standardized term. In the literature represented here, it most concretely denotes the greatest common divisor of all sums of $k$ consecutive terms in a generalized Fibonacci sequence, written $\mathcal{G}_{G_0,G_1}(k)$, but it also appears as an editorial label for constrained, conditional, or congruence-based greatest-common-divisor frameworks in computational algebra, arithmetic geometry, and explicit arithmetic formulas, and it is the explicit name of a consensus-aware architecture for generalized category discovery in machine learning (Guyer et al., 2021, Tang et al., 14 Aug 2025). This coexistence makes ConGCD a cross-disciplinary term whose precise meaning is determined by context.

1. Consecutive-sum GCD in generalized Fibonacci sequences

In its most precise number-theoretic use, ConGCD denotes the quantity

$\mathcal{G}_{G_0,G_1}(k):=\gcd\{S_{n,k}:n\ge 0\},$

where $(G_n)_{n\ge 0}$ is the generalized Fibonacci sequence defined by $G_n=G_{n-1}+G_{n-2}$ for $n\ge 2$ with integral initial conditions $G_0,G_1$, and

$S_{n,k}:=\sum_{i=n}^{n+k-1}G_i.$

The specializations $G_0=0,G_1=1$ and $G_0=2,G_1=1$ recover the Fibonacci and Lucas sequences, respectively. A basic telescoping identity,

$\mathcal{G}_{G_0,G_1}(k)$0

reduces the problem of gcds of consecutive sums to differences of two terms of the same recurrence. The paper proves two equivalent characterizations: $\mathcal{G}_{G_0,G_1}(k)$1 and

$\mathcal{G}_{G_0,G_1}(k)$2

where $\mathcal{G}_{G_0,G_1}(k)$3 is the generalized Pisano period modulo $\mathcal{G}_{G_0,G_1}(k)$4 (Guyer et al., 2021).

A convenient bridge to classical Fibonacci arithmetic is the representation

$\mathcal{G}_{G_0,G_1}(k)$5

with the convention $\mathcal{G}_{G_0,G_1}(k)$6. This allows ConGCD to be expressed entirely through fixed-index generalized Fibonacci values or, equivalently, through modular periodicity data.

2. Structural theorems, residue classes, and consequences

The main structural analysis proceeds by rewriting

$\mathcal{G}_{G_0,G_1}(k)$7

so the full family of consecutive sums is generated by two fixed integers $\mathcal{G}_{G_0,G_1}(k)$8 and $\mathcal{G}_{G_0,G_1}(k)$9. Since $\mathcal{G}_{G_0,G_1}(k):=\gcd\{S_{n,k}:n\ge 0\},$0 for every $\mathcal{G}_{G_0,G_1}(k):=\gcd\{S_{n,k}:n\ge 0\},$1, the common divisor of all $\mathcal{G}_{G_0,G_1}(k):=\gcd\{S_{n,k}:n\ge 0\},$2 is exactly $\mathcal{G}_{G_0,G_1}(k):=\gcd\{S_{n,k}:n\ge 0\},$3. This linear-recurrence reduction explains why the apparently different gcd and Pisano-period formulas coincide (Guyer et al., 2021).

For non-coprime initial conditions, if $\mathcal{G}_{G_0,G_1}(k):=\gcd\{S_{n,k}:n\ge 0\},$4, then every $\mathcal{G}_{G_0,G_1}(k):=\gcd\{S_{n,k}:n\ge 0\},$5 is divisible by $\mathcal{G}_{G_0,G_1}(k):=\gcd\{S_{n,k}:n\ge 0\},$6 and

$\mathcal{G}_{G_0,G_1}(k):=\gcd\{S_{n,k}:n\ge 0\},$7

Hence the essential structure is already visible for coprime initial values. In that case, the even-$\mathcal{G}_{G_0,G_1}(k):=\gcd\{S_{n,k}:n\ge 0\},$8 behavior is controlled by residue classes modulo $\mathcal{G}_{G_0,G_1}(k):=\gcd\{S_{n,k}:n\ge 0\},$9. If $(G_n)_{n\ge 0}$0, then

$(G_n)_{n\ge 0}$1

independent of the coprime initial pair. If $(G_n)_{n\ge 0}$2, then

$(G_n)_{n\ge 0}$3

where

$(G_n)_{n\ge 0}$4

This yields $(G_n)_{n\ge 0}$5 for Fibonacci data and $(G_n)_{n\ge 0}$6 for Lucas data on the residue classes $(G_n)_{n\ge 0}$7. Under the hypothesis that all generalized Pisano periods are even—which holds for Fibonacci and Lucas, and more generally when the generalized Cassini invariant $(G_n)_{n\ge 0}$8 equals $(G_n)_{n\ge 0}$9—odd $G_n=G_{n-1}+G_{n-2}$0 is much more rigid: $G_n=G_{n-1}+G_{n-2}$1 for $G_n=G_{n-1}+G_{n-2}$2 and $G_n=G_{n-1}+G_{n-2}$3 for $G_n=G_{n-1}+G_{n-2}$4 (Guyer et al., 2021).

Several corollaries are arithmetically striking. For odd $G_n=G_{n-1}+G_{n-2}$5, one has

$G_n=G_{n-1}+G_{n-2}$6

for any coprime initial pair. The classical Ruggles divisibility phenomenon is recovered as the case $G_n=G_{n-1}+G_{n-2}$7: for Fibonacci numbers, every sum of $G_n=G_{n-1}+G_{n-2}$8 consecutive terms is divisible by $G_n=G_{n-1}+G_{n-2}$9, and $n\ge 2$0 is the exact common divisor.

3. Computation and algorithmics for $n\ge 2$1

The recommended algorithm is the direct gcd formula. One computes $n\ge 2$2 and $n\ge 2$3 by fast doubling, then forms

$n\ge 2$4

and returns

$n\ge 2$5

with $n\ge 2$6. The running time is $n\ge 2$7 integer operations, with the usual caveat that exact integer arithmetic requires bit lengths growing like $n\ge 2$8 in naive worst-case analysis (Guyer et al., 2021).

For Fibonacci and Lucas inputs, the residue-class theorems provide immediate shortcuts. For Fibonacci,

• $n\ge 2$9 gives $G_0,G_1$0,
• $G_0,G_1$1 gives $G_0,G_1$2,
• odd $G_0,G_1$3 gives $G_0,G_1$4,
• all other odd $G_0,G_1$5 give $G_0,G_1$6.

For Lucas, the odd-$G_0,G_1$7 pattern is the same, while even classes $G_0,G_1$8 acquire the extra factor $G_0,G_1$9. An optional Pisano-period method computes

$S_{n,k}:=\sum_{i=n}^{n+k-1}G_i.$0

by factoring $S_{n,k}:=\sum_{i=n}^{n+k-1}G_i.$1, working modulo prime powers, and combining periods with the Chinese Remainder Theorem. The paper presents this as theoretically illuminating but generally harder than the direct gcd formula. Edge cases are also explicit: $S_{n,k}:=\sum_{i=n}^{n+k-1}G_i.$2 throughout, and for $S_{n,k}:=\sum_{i=n}^{n+k-1}G_i.$3 the quantity reduces to $S_{n,k}:=\sum_{i=n}^{n+k-1}G_i.$4 (Guyer et al., 2021).

4. Constrained and numerical GCD in computational algebra

In computational algebra, ConGCD is also used in secondary summaries for constrained or numerical gcd computation, although the underlying papers do not always introduce that exact name. One line of work studies the numerical gcd of noisy univariate polynomials $S_{n,k}:=\sum_{i=n}^{n+k-1}G_i.$5 and $S_{n,k}:=\sum_{i=n}^{n+k-1}G_i.$6 by regularizing exact gcd computation, which is ill-posed because pairs with fixed gcd degree form differentiable manifolds of positive codimension inside the ambient coefficient space. The numerical gcd $S_{n,k}:=\sum_{i=n}^{n+k-1}G_i.$7 is defined through backward nearness, maximum codimension, and minimum distance, and is computed by the blackbox algorithm uvGCD: first estimate degree through structured Sylvester-matrix rank tests, then project onto the corresponding gcd manifold by Gauss–Newton refinement. The paper proves strong well-posedness, Lipschitz continuity, and convergence, and gives overall $S_{n,k}:=\sum_{i=n}^{n+k-1}G_i.$8 complexity for combined degree $S_{n,k}:=\sum_{i=n}^{n+k-1}G_i.$9 (Zeng, 2021).

A distinct constrained variant assumes that one polynomial $G_0=0,G_1=1$0 is exact and only $G_0=0,G_1=1$1 may be perturbed. In that setting, the quotient-ring operator $G_0=0,G_1=1$2 of multiplication by $G_0=0,G_1=1$3 modulo $G_0=0,G_1=1$4 becomes the central object. Under the squarefree assumption on $G_0=0,G_1=1$5, the nullity of $G_0=0,G_1=1$6 equals $G_0=0,G_1=1$7, so the approximate gcd problem is converted into enforcing a prescribed null-space dimension in a structured matrix. The paper develops this through generalized companion matrices, Bezout/Barnett formulas, and the fact that $G_0=0,G_1=1$8 is Toeplitz-like with displacement rank $G_0=0,G_1=1$9, yielding quadratic complexity with respect to polynomial degree (Boito et al., 2011).

These two computational lines are conceptually different. The regularized numerical-gcd framework treats both inputs symmetrically and emphasizes manifold geometry, Sylvester matrices, and structured least squares. The generalized-companion approach is explicitly asymmetric and exploits the stronger assumption that $G_0=2,G_1=1$0 is exact. A common misconception is to treat them as the same method; the data instead support two separate ConGCD-style paradigms.

5. Generalized gcd as height, divisibility, and arithmetic structure

In arithmetic geometry and arithmetic dynamics, ConGCD-like constructions replace the classical gcd of two integers by a height-theoretic object. One paper studies

$G_0=2,G_1=1$1

for polynomial or rational dynamical orbits and, assuming Vojta’s Conjecture together with genericity and non-exceptionality hypotheses, proves that for every $G_0=2,G_1=1$2 there exists $G_0=2,G_1=1$3 such that

$G_0=2,G_1=1$4

The key device is Silverman’s generalized gcd height on blowups of $G_0=2,G_1=1$5, which converts local valuation minima into global height bounds (Huang, 2017).

A related extension concerns integral points on complements of numerically parallel divisors. There the gcd-type quantity is encoded by heights $G_0=2,G_1=1$6, counting functions $G_0=2,G_1=1$7, and proximity functions $G_0=2,G_1=1$8 for codimension-$G_0=2,G_1=1$9 subschemes $\mathcal{G}_{G_0,G_1}(k)$00. The paper proves inequalities such as

$\mathcal{G}_{G_0,G_1}(k)$01

outside proper Zariski closed subsets, after reduction to the torus $\mathcal{G}_{G_0,G_1}(k)$02 and application of known gcd-height bounds there (2207.14432).

The same broad enlargement of gcd into structural constraint appears in integer programming. Systems with constraints of the form

$\mathcal{G}_{G_0,G_1}(k)$03

where $\mathcal{G}_{G_0,G_1}(k)$04 and $\mathcal{G}_{G_0,G_1}(k)$05 are linear polynomials, are shown to have feasibility in NP, and any optimal solution for a linear objective has polynomial bit length when it exists. The paper derives this by translating gcd constraints into existential divisibility formulas, then using a local-to-global principle and a Chinese-remainder-type theorem for systems of congruences and non-congruences (Defossez et al., 2023).

6. Explicit arithmetic formulas, special gcd families, and matrix-theoretic variants

Several papers attach ConGCD-style meaning to explicit arithmetic or combinatorial gcd constructions. The discrete Fourier transform of the gcd,

$\mathcal{G}_{G_0,G_1}(k)$06

is shown to equal

$\mathcal{G}_{G_0,G_1}(k)$07

and to count ordered pairs $\mathcal{G}_{G_0,G_1}(k)$08 such that $\mathcal{G}_{G_0,G_1}(k)$09. This function generalizes both the gcd-sum function and Euler’s totient (Kelly, 2012).

An explicit arithmetic-term representation of $\mathcal{G}_{G_0,G_1}(k)$10 is given by

$\mathcal{G}_{G_0,G_1}(k)$11

valid for $\mathcal{G}_{G_0,G_1}(k)$12, together with a pure modular-term variant and analogous formulas for $\mathcal{G}_{G_0,G_1}(k)$13 away from $\mathcal{G}_{G_0,G_1}(k)$14 (Prunescu et al., 2024). A separate paper proposes fixed-length elementary formulas for gcd and semiprime factor extraction by simplifying Mazzanti’s formula and using Kronecker substitution; those gcd formulas are presented as conjectural (Shunia, 2024).

Specialized gcd families have also received exact characterizations.

Family	Exact criterion	Paper
$\mathcal{G}_{G_0,G_1}(k)$15	$\mathcal{G}_{G_0,G_1}(k)$16, $\mathcal{G}_{G_0,G_1}(k)$17	(Guo et al., 22 Jun 2026)
$\mathcal{G}_{G_0,G_1}(k)$18	explicit squarefree formula under stated congruence conditions	(Wu, 18 Jun 2026)
constrained multinomial family	gcd is product of primes with $\mathcal{G}_{G_0,G_1}(k)$19 or $\mathcal{G}_{G_0,G_1}(k)$20	(Mosley, 2014)

Another matrix-theoretic extension studies power GCD and power LCM matrices on gcd-closed sets. If $\mathcal{G}_{G_0,G_1}(k)$21 is gcd-closed and satisfies condition $\mathcal{G}_{G_0,G_1}(k)$22, and if $\mathcal{G}_{G_0,G_1}(k)$23, then the $\mathcal{G}_{G_0,G_1}(k)$24th-power GCD matrix $\mathcal{G}_{G_0,G_1}(k)$25 and the $\mathcal{G}_{G_0,G_1}(k)$26th-power LCM matrix $\mathcal{G}_{G_0,G_1}(k)$27 are both divisible by $\mathcal{G}_{G_0,G_1}(k)$28 in $\mathcal{G}_{G_0,G_1}(k)$29, confirming Hong’s conjecture in that setting (Zhu, 27 Mar 2026).

7. ConGCD in generalized category discovery

Outside arithmetic, ConGCD is the explicit name of a machine-learning framework for generalized category discovery. In that setting, GCD means generalized category discovery rather than greatest common divisor. The method introduces primitive-oriented representations through self-deconstruction and multiplex consensus, while leaving the baseline GCD learning objectives unchanged. A frozen DINOv1 or DINOv2 Vision Transformer provides token features, a slot-attention-like module discovers $\mathcal{G}_{G_0,G_1}(k)$30 visual primitives, a lightweight decoder reconstructs the token representation with reconstruction loss

$\mathcal{G}_{G_0,G_1}(k)$31

and the final architecture inserts dominant and contextual consensus units into the last two ViT blocks (Tang et al., 14 Aug 2025).

The dominant consensus unit keeps top-response tokens masked by primitive regions, while the contextual unit retains weak-response tokens to capture distributional invariants. A consensus scheduler routes them through a softmax gate and an activation-separation distributor: $\mathcal{G}_{G_0,G_1}(k)$32 The total loss is

$\mathcal{G}_{G_0,G_1}(k)$33

with $\mathcal{G}_{G_0,G_1}(k)$34, and the default number of primitives is $\mathcal{G}_{G_0,G_1}(k)$35. Evaluation uses Balanced Semi-Supervised K-means and the Hungarian algorithm, reporting ACC on All, Known, and Novel subsets.

The reported results emphasize novel-class gains. On fine-grained benchmarks with DINOv1, the average improvement across baselines is $\mathcal{G}_{G_0,G_1}(k)$36 pp on All and $\mathcal{G}_{G_0,G_1}(k)$37 pp on Novel, with $\mathcal{G}_{G_0,G_1}(k)$38 pp on Known; one example is SelEx on CUB-200, where All improves from $\mathcal{G}_{G_0,G_1}(k)$39 to $\mathcal{G}_{G_0,G_1}(k)$40 and Novel from $\mathcal{G}_{G_0,G_1}(k)$41 to $\mathcal{G}_{G_0,G_1}(k)$42. On coarse-grained benchmarks with DINOv1, the average improvement is $\mathcal{G}_{G_0,G_1}(k)$43 pp on All, $\mathcal{G}_{G_0,G_1}(k)$44 pp on Novel, and $\mathcal{G}_{G_0,G_1}(k)$45 pp on Known; one example is SPTNet on CIFAR-100, where All improves from $\mathcal{G}_{G_0,G_1}(k)$46 to $\mathcal{G}_{G_0,G_1}(k)$47, Novel from $\mathcal{G}_{G_0,G_1}(k)$48 to $\mathcal{G}_{G_0,G_1}(k)$49, and Known from $\mathcal{G}_{G_0,G_1}(k)$50 to $\mathcal{G}_{G_0,G_1}(k)$51 (Tang et al., 14 Aug 2025).

A recurrent misconception is that this ConGCD is related to gcd arithmetic. It is not: it is a consensus-aware paradigm for representation learning in generalized category discovery. The overlap is terminological rather than mathematical.

Across these uses, ConGCD names either a specific arithmetic invariant, $\mathcal{G}_{G_0,G_1}(k)$52, or a broader family of gcd-centered constructions under additional structure: noise models, divisibility constraints, blowup heights, modular or combinatorial families, matrix divisibility, or consensus-aware representation learning. The term is therefore best read as context-sensitive rather than monolithic.