Google Groups no longer supports new Usenet posts or subscriptions. Historical content remains viewable.
Dismiss
391 is special too
22 views
Skip to first unread message
Dale Shoults
May 21, 2013, 7:40:54 PM5/21/13
to
I came across a website that listed something special about each positive integer up to 391, and about many greater than 391, bur not for 391. So here's something that is potentially interesting or special about 391:
The 3rd, 9th & 1st digits of 391^((9/3 + 9/1 + 3/1)^2) are 3, 9 & 1, respectively.
The 3rd, 9th & 1st digits of 391^((9/3 + 9/1 + 3/1)^2) are 3, 9 & 1, respectively.
William Elliot
May 21, 2013, 10:00:35 PM5/21/13
to
On Tue, 21 May 2013, Dale Shoults wrote:
> I came across a website that listed something special about each
> positive integer up to 391, and about many greater than 391, bur not for
> 391. So here's something that is potentially interesting or special
> about 391:
Theorem. All integers are interesting.
> I came across a website that listed something special about each
> positive integer up to 391, and about many greater than 391, bur not for
> 391. So here's something that is potentially interesting or special
> about 391:
Proof. Assume there's an uninteresting integer.
Then there's a least uninteresting integer which, being
the least uninteresting integer, is interesting. QED.
Roland Franzius
May 21, 2013, 11:24:02 PM5/21/13
to
Am 22.05.2013 01:40, schrieb Dale Shoults:
> I came across a website that listed something special about each positive integer up to 391, and about many greater than 391, bur not for 391. So here's something that is potentially interesting or special about 391:
>
> The 3rd, 9th & 1st digits of 391^((9/3 + 9/1 + 3/1)^2) are 3, 9 & 1, respectively.
>
So we have to discard 391 as the conjectured smallest number, having no
> I came across a website that listed something special about each positive integer up to 391, and about many greater than 391, bur not for 391. So here's something that is potentially interesting or special about 391:
>
> The 3rd, 9th & 1st digits of 391^((9/3 + 9/1 + 3/1)^2) are 3, 9 & 1, respectively.
>
interesting properties at all.
--
Roland Franzius
Peter Percival
May 22, 2013, 7:07:05 AM5/22/13
to
William Elliot wrote:
> On Tue, 21 May 2013, Dale Shoults wrote:
>
>> I came across a website that listed something special about each
>> positive integer up to 391, and about many greater than 391, bur not for
>> 391. So here's something that is potentially interesting or special
>> about 391:
>
> Theorem. All integers are interesting.
>
> Proof. Assume there's an uninteresting integer.
> Then there's a least uninteresting integer
I think you need to say positive integer.
> On Tue, 21 May 2013, Dale Shoults wrote:
>
>> I came across a website that listed something special about each
>> positive integer up to 391, and about many greater than 391, bur not for
>> 391. So here's something that is potentially interesting or special
>> about 391:
>
> Theorem. All integers are interesting.
>
> Proof. Assume there's an uninteresting integer.
> Then there's a least uninteresting integer
> which, being
> the least uninteresting integer, is interesting. QED.
>
>> The 3rd, 9th & 1st digits of 391^((9/3 + 9/1 + 3/1)^2) are 3, 9 & 1,
>> respectively.
>
>
I think I am an Elephant,
Behind another Elephant
Behind /another/ Elephant who isn't really there....
A.A. Milne
William Elliot
May 23, 2013, 1:09:08 AM5/23/13
to
On Wed, 22 May 2013, Peter Percival wrote:
> William Elliot wrote:
> >
> > Theorem. All integers are interesting.
> >
> > Proof. Assume there's an uninteresting integer.
> > Then there's a least uninteresting integer
>
> I think you need to say positive integer.
>
Yup, any bounded below set of integers.
> William Elliot wrote:
> >
> > Theorem. All integers are interesting.
> >
> > Proof. Assume there's an uninteresting integer.
> > Then there's a least uninteresting integer
>
> I think you need to say positive integer.
>
Actually the argument can be reused to show there's
no uninteresting negative number.
Pfs...@aol.com
May 23, 2013, 11:04:25 AM5/23/13
to
0 new messages