scientific article; zbMATH DE number 740351
From MaRDI portal
Publication:4327098
zbMath0824.11008MaRDI QIDQ4327098
Publication date: 4 April 1995
Full work available at URL: https://eudml.org/doc/34397
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Binomial coefficients; factorials; (q)-identities (11B65) Decidability (number-theoretic aspects) (11U05)
Related Items
On Pascal triangles modulo a prime power ⋮ Theories of generalized Pascal triangles ⋮ A list of arithmetical structures complete with respect to the first-order definability
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Answer to a problem raised by J. Robinson: The arithmetic of positive or negative integers is definable from successor and divisibility
- On the number of solutions of the generalized Ramanujan-Nagell equation $x²-D = 2^{n+2}$
- Notes on Binomial Coefficients Iii-Any Integer Divides Almost All Binomial Coefficients†
- Definability and decision problems in arithmetic