Bhargava factorial¶

A factorial sequence attached to an arbitrary subset of the integers through p-orderings, generalizing n-factorial while preserving divisibility and integer-valued-polynomial properties.

Version: v2 · 2026-09-19 · History
Domain-specific #: 3448
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomain: Number Theory and Integer Valued Polynomials → Mathematics

Core Idea¶

Bhargava factorials encode local p-adic spacing of a set, are independent of choices within the p-ordering construction, recover ordinary factorial on all integers, and support generalized binomial coefficients and Polya-type theory. For each prime, a sequence greedily minimizes the p-adic valuation of products of differences from earlier chosen elements; the resulting prime exponents combine into the generalized factorial. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.

How would you explain it like I'm…

No faithful explanation at this level. Two of three generators mark this N/A (A dissents): any five-year-old picture reduces to "multiply some chosen numbers" or "pick numbers far apart", which teaches plain products and ordinary distance, whereas the Bhargava factorial is assembled prime by prime from greedy p-orderings measuring divisibility (p-adic spacing) of differences.

Custom Factorials for Number Sets

A factorial, like 4! = 1 × 2 × 3 × 4 = 24, is a basic tool in math. The Bhargava factorial gives every set of whole numbers — for example just the squares, or just the odd numbers — its own version of the factorial. To build it, for each prime number you pick numbers from the set one by one, each time choosing the one that is 'least divisible' by that prime when you compare it with the ones you already picked. Collecting the results for all primes gives the new factorial. The neat part is that the answer doesn't depend on which of the tied choices you make, and for the set of all whole numbers you get the usual factorial back.

Generalized Factorial via p-Orderings

The Bhargava factorial generalizes n! from the integers to an arbitrary infinite subset S of the integers (and further, to Dedekind domains). For each prime p, you build a p-ordering: a sequence of elements of S chosen greedily so that each new element minimizes the power of p dividing the product of its differences with all previously chosen elements. The powers of p that appear form a p-sequence, and a key theorem says this sequence does not depend on which choices you made when there were ties. Multiplying the prime powers across all primes at step k gives the generalized factorial k!_S. For S equal to all integers this recovers k!, and the generalized versions keep useful divisibility properties, such as producing integer-valued generalized binomial coefficients.

Given an infinite subset S of ℤ (or a subset of a Dedekind domain), fix a prime p. A p-ordering of S is a sequence a_0, a_1, … in which each a_k minimizes the p-adic valuation of ∏_{i<k}(a_k − a_i) among elements of S; the resulting p-adic values v_k(S, p) form the p-sequence. Although p-orderings are not unique, the p-sequence is an invariant of S and p. Bhargava's factorial is then k!_S = ∏_p p^{v_k(S,p)}, assembling the prime exponents over all primes, with explicit conventions for the zeroth and positive indices. For S = ℤ it reduces to the ordinary factorial, and the construction preserves key divisibility properties: for instance, products of generalized factorials divide related ones, and generalized binomial coefficients are integers. These generalized factorials encode the local p-adic spacing of S and underlie Pólya-type results about integer-valued polynomials on S. Finite-set and non-integer variants exist but require their own conventions and should not be conflated with the basic construction.

Scope of Application¶

Bhargava factorial belongs to number theory and integer valued polynomials and is useful where the analyst can specify the typed number theory and integer valued polynomials carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, then evaluate the infinite integer subset or Dedekind-domain generalization, prime p, p-ordering and choice rule, difference products, p-sequence invariance, prime-exponent assembly, zero and positive index conventions, recovery of ordinary factorial, divisibility properties, and finite or noninteger variants are explicit.

Clarity¶

The abstraction clarifies a crowded vocabulary by making the infinite integer subset or Dedekind-domain generalization, prime p, p-ordering and choice rule, difference products, p-sequence invariance, prime-exponent assembly, zero and positive index conventions, recovery of ordinary factorial, divisibility properties, and finite or noninteger variants are explicit the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test.

Manages Complexity¶

Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Bhargava factorial. Bhargava factorial compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.

Abstract Reasoning¶

Identify the carrier. State what the elements, states, objects, or observations are: the typed number theory and integer valued polynomials carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets. Reject examples whose alleged carrier belongs to a different problem. 2.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of number theory and integer valued polynomials because they reuse the typed number theory and integer valued polynomials carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, For each prime, a sequence greedily minimizes the p-adic valuation of products of differences from earlier chosen elements; the resulting prime exponents combine into the generalized factorial., and type the carrier, state every parameter and convention in the definition, test that the infinite integer subset or Dedekind-domain generalization, prime p, p-ordering and choice rule, difference products, p-sequence invariance, prime-exponent assembly, zero and positive index conventions, recovery of ordinary factorial, divisibility properties, and finite or noninteger variants are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions¶

Current abstraction Bhargava factorial Domain-specific

Parents (1) — outgoing typed relations

Bhargava factorial is a kind of Abstraction Prime

It remains its own entry because its identity is fixed by the infinite integer subset or Dedekind-domain generalization, prime p, p-ordering and choice rule, difference products, p-sequence invariance, prime-exponent assembly, zero and positive index conventions, recovery of ordinary factorial, divisibility properties, and finite or noninteger variants.

Hierarchy path (1) — routes to 1 parentless root

Bhargava factorial → is a kind of Abstraction

Neighborhood in Abstraction Space¶

Bhargava factorial sits in a crowded region of the domain-specific corpus (12^th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Integer Classifications & Arithmetic Functions (45 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-25