On the representation of 1 by binary cubic forms of positive discriminant (Q2368069)

Let \(f\in\mathbb Z[x,y]\) be an irreducible cubic form with discriminant \(D_ f\) and consider the number \(N_ f\) of solutions of (1) \(f(x,y)=1\) in \(x,y\in\mathbb Z\). In case \(D_ f<0\), \textit{T. Nagell} [Math. Z. 28, 10--29 (1928; JFM 54.0174.02)] described the behavior of \(N_ f\). The similar problem for \(D_ f>0\) is open until today. In this case \textit{A. Pethő} [Number Theory, Proc. 15th Journ. Arith., Ulm 1987, Lect. Notes Math. 1380, 185--196 (1989; Zbl 0677.10012)] made a conjecture on the possible values of \(N_ f\) and gave an infinite family of non-equivalent reversible forms \(f\) with \(N_ f\geq 5\). The main result of the paper is that the author constructs an infinite family of non-equivalent non-reversible forms \(f\) with \(N_ f\geq 4\). Using the algorithm of \textit{A. Pethő} [J. Symb. Comput. 4, 103--109 (1987; Zbl 0625.10011)] the author computes the solutions of (1) with \(| y|<C\), \(C\) in the range of \(10^{40}\) to \(10^{100}\) for about 85000 forms \(f\) with positive discriminant and based on this calculation gives a revised version of Pethő's conjecture.