Deutsch English Français Italiano |
<86msdfoq3b.fsf@linuxsc.com> View for Bookmarking (what is this?) Look up another Usenet article |
Path: ...!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!eternal-september.org!.POSTED!not-for-mail From: Tim Rentsch <tr.17687@z991.linuxsc.com> Newsgroups: comp.lang.c Subject: Re: Suggested method for returning a string from a C program? Date: Thu, 20 Mar 2025 05:15:36 -0700 Organization: A noiseless patient Spider Lines: 24 Message-ID: <86msdfoq3b.fsf@linuxsc.com> References: <vrd77d$3nvtf$2@dont-email.me> <20250319123647.000035ed@yahoo.com> MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Injection-Date: Thu, 20 Mar 2025 13:15:37 +0100 (CET) Injection-Info: dont-email.me; posting-host="7c01e97b5d1836204810413d59dbf156"; logging-data="3257331"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1/7M9/dzonW9P37dPI4UrgK93i4P/W7ng8=" User-Agent: Gnus/5.11 (Gnus v5.11) Emacs/22.4 (gnu/linux) Cancel-Lock: sha1:Bz9PLXiLebXKcB+EADW5ZqGSouY= sha1:jBBcEkKHqb+yof65iepaL4gESQU= Bytes: 1972 Michael S <already5chosen@yahoo.com> writes: > On Tue, 18 Mar 2025 21:38:55 -0400 > DFS <nospam@dfs.com> wrote: > >> I'm doing these algorithm problems at >> https://cses.fi/problemset/list/ >> >> For instance: Weird Algorithm >> https://cses.fi/problemset/task/1068 > > It is not an interesting programming exercise. But it looks to me as a > challenging math exercise. I mean, how could we give a not too > pessimistic estimate for upper bound of length of the sequence that > starts at given n without running a full sequence? Or estimate for > maximal value in the sequence? > So far, I found no answers. You may console yourself with the knowledge that no one else has either, even some of the most brilliant mathematicians of the last hundred years. In fact it isn't even known that all starting points eventually terminate; as far as what has been proven goes, some starting points might just keep going up forever.