From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-1.9 required=5.0 tests=BAYES_00,FREEMAIL_FROM
	autolearn=unavailable autolearn_force=no version=3.4.4
X-Received: by 2002:a24:2107:: with SMTP id e7-v6mr28130ita.34.1541149534524;
        Fri, 02 Nov 2018 02:05:34 -0700 (PDT)
X-Received: by 2002:a9d:5e97:: with SMTP id f23mr227673otl.4.1541149534272;
 Fri, 02 Nov 2018 02:05:34 -0700 (PDT)
Path: 
 eternal-september.org!reader01.eternal-september.org!reader02.eternal-september.org!feeder.eternal-september.org!news.gegeweb.eu!gegeweb.org!usenet-fr.net!proxad.net!feeder1-2.proxad.net!209.85.166.216.MISMATCH!75-v6no359215itm.0!news-out.google.com!l70-v6ni356itb.0!nntp.google.com!75-v6no359210itm.0!postnews.google.com!glegroupsg2000goo.googlegroups.com!not-for-mail
Newsgroups: comp.lang.ada
Date: Fri, 2 Nov 2018 02:05:33 -0700 (PDT)
In-Reply-To: <a1868ec7-2a4d-4802-a28e-1ba878e54bc0@googlegroups.com>
Complaints-To: groups-abuse@google.com
Injection-Info: glegroupsg2000goo.googlegroups.com;
 posting-host=2407:7000:903a:cc37:bc3d:dc63:720e:e544;
 posting-account=g6PEmwoAAADhFsmVm6Epjviaw4MLU0b5
NNTP-Posting-Host: 2407:7000:903a:cc37:bc3d:dc63:720e:e544
References: <a1868ec7-2a4d-4802-a28e-1ba878e54bc0@googlegroups.com>
User-Agent: G2/1.0
MIME-Version: 1.0
Message-ID: <9aeebd85-25cd-434f-97e7-026e3f7a3442@googlegroups.com>
Subject: Re: Fortran 95: How do you write code to do this?
From: Anatoly Chernyshev <achernyshev@gmail.com>
Injection-Date: Fri, 02 Nov 2018 09:05:34 +0000
Content-Type: text/plain; charset="UTF-8"
Xref: reader02.eternal-september.org comp.lang.ada:54751
Date: 2018-11-02T02:05:33-07:00
List-Id: <comp.lang.ada>

The problem statement looks like a homework assignment...


On Thursday, November 1, 2018 at 6:34:25 PM UTC+13, Michae...@gmail.com wrote:
> Can you share with me both a simple program to do the following and also the best program imaginable? Please explain to me everything I need to know about the program!
> 
> 1) Define a natural integer of n bits. Where n is some value such as 10 or 12.
> 
> 2) Set the value of a boolean variable to the rightmost bit of this natural n-bit integer.
> 
> 3) Shift the n-bit natural integer once left.
> 
> Repeat steps 2 and 3, for n different boolean variables.
> 
> Thanks,
> Michael