Open mathematical problems which cannot be stated formally as they refer to intuitive meanings of mathematical formulae and the current mathematical knowledge

Simple item record

Full item record

dc.contributor.authorTyszka, Apoloniusz
dc.contributor.organizationUniversity of Agriculture in Krakow, Faculty of Production and Power Engineeringen
dc.date.accessioned2020-01-27T10:40:47Z
dc.date.available2020-01-27T10:40:47Z
dc.date.issued2020-01-26
dc.description.abstractLet \beta=((24!)!)!, and P_{n^2+1} denote the set of all primes of the form n^2+1. Let M denote the set of all positive multiples of elements of the set P_{n^2+1} \cap (\beta,\infty). The set X={0,...,\beta} \cup M satisfies the following conditions: (1) card(X) is greater than a huge positive integer and it is conjectured that X is infinite, (2) we do not know any algorithm deciding the finiteness of X, (3) a known and short algorithm for every n \in \mathbb{N} decides whether or not n \in X, (4) a known and short algorithm returns an integer n such that X is infinite if and only if X contains an element greater than n. The following problem is open: define a set X \subseteq \mathbb{N} such that X satisfies conditions (1)-(4) and a known and simple formula \phi(x) satisfies X={n \in \mathbb{N}: \phi(n)}, where \phi(n) has the same intuitive meaning for every n \in \mathbb{N} (5). The statements \phi(n) in condition (5) have always the same intuitive meaning, if the predicate \phi(x) expresses a natural property, the term propounded by the philosopher David Lewis (1941-2001). Let f(3)=4, and let f(n+1)=f(n)! for every integer n \geq 3. For an integer n \geq 3, let \Psi_n denote the following statement: if a system of equations S \subseteq {x_i!=x_{i+1}: 1 \leq i \leq n-1} \cup {x_i \cdot x_j=x_{j+1}: 1 \leq i \leq j \leq n-1} has only finitely many solutions in positive integers x_1,...,x_n, then each such solution (x_1,...,x_n) satisfies x_1,...,x_n \leq f(n). We prove that for every statement \Psi_n the bound f(n) cannot be decreased. The author's guess is that the statements \Psi_3,...,\Psi_9 are true. We prove that the statement \Psi_9 implies that the set X of all non-negative integers n whose number of digits belongs to P_{n^2+1} satisfies conditions (1)-(5).en
dc.identifier.urihttps://open.icm.edu.pl/handle/123456789/17854
dc.language.isoen
dc.rightsDozwolony użytek*
dc.subjectcomputable set X \subseteq \mathbb{N} whose finiteness remains conjectureden
dc.subjectcomputable set X \subseteq \mathbb{N} whose infiniteness remains conjectureden
dc.subjectDavid Lewis's notion of a natural propertyen
dc.subjecthuge integers for which arithmetical operations cannot be performed by any physical processen
dc.subjectintuitive meaning of a mathematical formulaen
dc.subjectZenkin's super-inductionen
dc.titleOpen mathematical problems which cannot be stated formally as they refer to intuitive meanings of mathematical formulae and the current mathematical knowledgeen
dc.typearticle
Files for this record
Original bundle
Now showing 1 - 1 of 1
Name: a_tyszka_january_26.pdf
Size: 144.4 KB
Format: Adobe Portable Document Format
Description:
Download
License files
Name: license.txt
Size: 228 B
Format: Item-specific license agreed upon to submission
Description:
Download
Belongs to collection
Artykuły / Articles