Talk:László Kalmár

Kalmár's composition constant
I'm not quite sure what this is - it appears to be related to the number of ways to factorize n. Looking at the brief paper in, I would guess that it is the constant &rho; referred to by the sentence in the third paragraph:


 * The number m(n) of multiplicative compositions [...] asymptotically satisfies
 * $$\sum_{n=1}^{N}{m(n)} \thicksim \frac{-1}{\rho \zeta \prime (\rho)} N^{\rho} = (0.3181736521...) N^{\rho}$$
 * where &rho;=1.7286472389... is the unique solution of &zeta;(x)=2 with x>1 and &zeta;(x) is Riemann's zeta function. This result was first deduced by Kalmár [...].

It would be great if somebody with surer information could add a note about it. Hv (talk) 10:01, 21 April 2010 (UTC)

Confusing reference to reduction of the decision problem?
"he proved that the predicate calculus could be formulated using a single binary predicate" must refer to the reduction of the decision problem to the case of one binary predicate. But it is not clearly expressed. I've added citations to the relevant papers of Kalmár and Quine. Relevant if my reading is correct that is. My thanks to Franz Fritschee for the Kalmár reference. 31.49.9.212 (talk) 18:17, 30 December 2019 (UTC)