Related papers: A simple finitary proof of Goodstein's Theorem

Goodstein sequences are numerical sequences in which a natural number m, expressed as the complete normal form to a given base a, is modified by increasing the value of the base a by one unit and subtracting one unit from the resulting…

Goodstein's argument is essentially that the hereditary representation m_{[b]} of any given natural number m in the natural number base b can be mirrored in Cantor Arithmetic, and used to well-define a finite decreasing sequence of…

The classical Goodstein process gives rise to long but finite sequences of natural numbers whose termination is not provable in Peano arithmetic. In this manuscript we consider a variant based on the Ackermann function. We show that…

Goodstein's principle is arguably the first purely number-theoretic statement known to be independent of Peano arithmetic. It involves sequences of natural numbers which at first appear to grow very quickly, but eventually decrease to zero.…

Let G be a finite group with exactly k elements of largest possible order m. Let q(m) be the product of gcd(m,4) and the odd prime divisors of m. We show that |G|\le q(m)k^2/\phi(m) where \phi denotes Euler's totient function. This…

The goal of this note is to provide yet another proof of the following theorem of Golod: there exists an infinite finitely generated group $G$ such that every element of $G$ has finite order. Our proof is based on the Nielsen-Schreier index…

We prove that, for any prime number $p\geq 5$, the set of natural numbers $n$ such that $p\mid H_n$ is finite.

The well-known Landau's theorem states that, for any positive integer $k$, there are finitely many isomorphism classes of finite groups with exactly $k$ (conjugacy) classes. We study variations of this theorem for $p$-regular classes as…

Geoffrion's theorem is a fundamental result from mathematical programming assessing the quality of Lagrangian relaxation, a standard technique to get bounds for integer programs. An often implicit condition is that the set of feasible…

We provide a simple and short proof of the Karush-Kuhn-Tucker theorem with finite number of equality and inequality constraints. The proof relies on an elementary linear algebra lemma and the local inverse theorem.

We define a variant of the Goodstein process based on fast-growing functions and show that it terminates, but this fact is not provable in Kripke-Platek set theory or other theories of strength the Bachmann-Howard ordinal. We moreover show…

Landau's theorem on conjugacy classes asserts that there are only finitely many finite groups, up to isomorphism, with exactly $k$ conjugacy classes for any positive integer $k$. We show that, for any positive integers $n$ and $s$, there…

Let $G$ be a finite group and $k$ be a field. Let $G$ act on the rational function field $k(x_g:g\in G)$ by $k$-automorphisms defined by $g\cdot x_h=x_{gh}$ for any $g,h\in G$. Noether's problem asks whether the fixed field $k(G)=k(x_g:g\in…

Let $k$ be a perfect field such that for every $n$ there are only finitely many field extensions, up to isomorphism, of $k$ of degree $n$. If $G$ is a reductive algebraic group defined over $k$, whose characteristic is very good for $G$,…

Zeckendorf proved that every positive integer has a unique partition as a sum of non-consecutive Fibonacci numbers. Similarly, every natural number can be partitioned into a sum of non-consecutive terms of the Lucas sequence, although such…

We prove the following result. Let k be an infinite perfect field of positive characteristic and assume that strong resolution of singularities holds over k. Let R be a localization of a commutative d-dimensional k-algebra of finite type…

We present variants of Goodstein's theorem that are equivalent to arithmetical comprehension and to arithmetical transfinite recursion, respectively, over a weak base theory. These variants differ from the usual Goodstein theorem in that…

We prove the so-called inverse conjecture for the Gowers U^{s+1}-norm in the case s = 3 (the cases s < 3 being established in previous literature). That is, we establish that if f : [N] -> C is a function with |f(n)| <= 1 for all n and || f…

The classical Goodstein process, defined via hereditary base-$k$ exponential normal form, is a well-known example of a principle unprovable in Peano Arithmetic. In this paper, we generalize this framework by constructing a new Goodstein…

A rather easy yet rigorous proof of a version of G\"odel's first incompleteness theorem is presented. The version is "each recursively enumerable theory of natural numbers with 0, 1, +, *, =, logical and, logical not, and the universal…