Rocksolid Light

Welcome to RetroBBS

mail  files  register  newsreader  groups  login

Message-ID:  

Are you having fun yet?


devel / comp.lang.fortran / fortran code

SubjectAuthor
* fortran codeMantu Sah
`- Re: fortran codeThomas Koenig

1
fortran code

<32baea99-2612-468a-b2fe-c64ca2026042n@googlegroups.com>

  copy mid

https://www.rocksolidbbs.com/devel/article-flat.php?id=2877&group=comp.lang.fortran#2877

  copy link   Newsgroups: comp.lang.fortran
X-Received: by 2002:a05:622a:13d3:b0:35a:6c40:da6d with SMTP id p19-20020a05622a13d300b0035a6c40da6dmr25120906qtk.253.1663137868529;
Tue, 13 Sep 2022 23:44:28 -0700 (PDT)
X-Received: by 2002:a0c:f388:0:b0:4ac:ae7e:b70c with SMTP id
i8-20020a0cf388000000b004acae7eb70cmr12677291qvk.43.1663137868319; Tue, 13
Sep 2022 23:44:28 -0700 (PDT)
Path: i2pn2.org!i2pn.org!usenet.blueworldhosting.com!feed1.usenet.blueworldhosting.com!peer01.iad!feed-me.highwinds-media.com!news.highwinds-media.com!news-out.google.com!nntp.google.com!postnews.google.com!google-groups.googlegroups.com!not-for-mail
Newsgroups: comp.lang.fortran
Date: Tue, 13 Sep 2022 23:44:28 -0700 (PDT)
Injection-Info: google-groups.googlegroups.com; posting-host=202.54.54.240; posting-account=KYyUtwoAAABRzZiQyLi8z1MCXtnQH1ir
NNTP-Posting-Host: 202.54.54.240
User-Agent: G2/1.0
MIME-Version: 1.0
Message-ID: <32baea99-2612-468a-b2fe-c64ca2026042n@googlegroups.com>
Subject: fortran code
From: mn2iacs@gmail.com (Mantu Sah)
Injection-Date: Wed, 14 Sep 2022 06:44:28 +0000
Content-Type: text/plain; charset="UTF-8"
X-Received-Bytes: 1173
 by: Mantu Sah - Wed, 14 Sep 2022 06:44 UTC

The 3n+1 problem/ Collatz Conjecture. Take a positive integer n, if its odd do 3n+1, otherwise in case of even divide it by 2. Perform this repeatedly and verify the number of sequence always reaches to 4->2->1

Re: fortran code

<tfsn6s$10nh$1@newsreader4.netcologne.de>

  copy mid

https://www.rocksolidbbs.com/devel/article-flat.php?id=2880&group=comp.lang.fortran#2880

  copy link   Newsgroups: comp.lang.fortran
Path: i2pn2.org!i2pn.org!aioe.org!news.uzoreto.com!newsreader4.netcologne.de!news.netcologne.de!.POSTED.2a0a-a540-1471-0-7285-c2ff-fe6c-992d.ipv6dyn.netcologne.de!not-for-mail
From: tkoenig@netcologne.de (Thomas Koenig)
Newsgroups: comp.lang.fortran
Subject: Re: fortran code
Date: Wed, 14 Sep 2022 14:07:24 -0000 (UTC)
Organization: news.netcologne.de
Distribution: world
Message-ID: <tfsn6s$10nh$1@newsreader4.netcologne.de>
References: <32baea99-2612-468a-b2fe-c64ca2026042n@googlegroups.com>
Injection-Date: Wed, 14 Sep 2022 14:07:24 -0000 (UTC)
Injection-Info: newsreader4.netcologne.de; posting-host="2a0a-a540-1471-0-7285-c2ff-fe6c-992d.ipv6dyn.netcologne.de:2a0a:a540:1471:0:7285:c2ff:fe6c:992d";
logging-data="33521"; mail-complaints-to="abuse@netcologne.de"
User-Agent: slrn/1.0.3 (Linux)
 by: Thomas Koenig - Wed, 14 Sep 2022 14:07 UTC

Mantu Sah <mn2iacs@gmail.com> schrieb:

> The 3n+1 problem/ Collatz Conjecture. Take a positive integer
> n, if its odd do 3n+1, otherwise in case of even divide it by
> 2. Perform this repeatedly and verify the number of sequence always
> reaches to 4->2->1

That code is straightforward to write (but you have to watch for
overflow). It is also a question if (3*n+1)/2 should be called
a single step.

Or are you asking us to write it for you?

1
server_pubkey.txt

rocksolid light 0.9.81
clearnet tor