Rocksolid Light

Welcome to novaBBS (click a section below)

mail  files  register  newsreader  groups  login

Message-ID:  

Birds are entangled by their feet and men by their tongues.


interests / rec.puzzles / Re: Why is a (factorial - 1) rarely a square ? ---------- ( _losopher of _sic in _na ... )

SubjectAuthor
* Why is a (factorial - 1) rarely a square ? ---------- (henh...@gmail.com
+* Re: Why is a (factorial - 1) rarely a square ? ---------- (Richard Tobin
|+* Re: Why is a (factorial - 1) rarely a square ? ---------- ( _losopherRichard Heathfield
||`* Re: Why is a (factorial - 1) rarely a square ? ---------- ( _losopherRichard Tobin
|| `- Re: Why is a (factorial - 1) rarely a square ? ---------- ( _losopherRichard Heathfield
|+* Re: Why is a (factorial - 1) rarely a square ? ---------- ( _losopherRichard Heathfield
||`- Re: Why is a (factorial - 1) rarely a square ? ---------- ( _losopherhenh...@gmail.com
|`- Re: Why is a (factorial - 1) rarely a square ? ---------- ( _losopherhenh...@gmail.com
`- Re: Why is a (factorial - 1) rarely a square ? ---------- (Richard Tobin

1
Why is a (factorial - 1) rarely a square ? ---------- ( _losopher of _sic in _na ... )

<4973fd1a-3e40-4214-993d-96247bd175e8n@googlegroups.com>

 copy mid

https://www.novabbs.com/interests/article-flat.php?id=356&group=rec.puzzles#356

 copy link   Newsgroups: rec.puzzles
X-Received: by 2002:a05:622a:204:b0:31f:3bb:3294 with SMTP id b4-20020a05622a020400b0031f03bb3294mr15344584qtx.436.1658859744460;
Tue, 26 Jul 2022 11:22:24 -0700 (PDT)
X-Received: by 2002:a05:6214:1c8c:b0:46e:15b2:3f35 with SMTP id
ib12-20020a0562141c8c00b0046e15b23f35mr16231830qvb.76.1658859744298; Tue, 26
Jul 2022 11:22:24 -0700 (PDT)
Path: i2pn2.org!i2pn.org!usenet.blueworldhosting.com!feed1.usenet.blueworldhosting.com!peer03.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: rec.puzzles
Date: Tue, 26 Jul 2022 11:22:23 -0700 (PDT)
Injection-Info: google-groups.googlegroups.com; posting-host=2601:648:8600:bc00:965:b94d:13cf:b58e;
posting-account=YjTkGAoAAAA4_fbAISfvtIqrYbghMeBx
NNTP-Posting-Host: 2601:648:8600:bc00:965:b94d:13cf:b58e
User-Agent: G2/1.0
MIME-Version: 1.0
Message-ID: <4973fd1a-3e40-4214-993d-96247bd175e8n@googlegroups.com>
Subject: Why is a (factorial - 1) rarely a square ? ---------- (
_losopher of _sic in _na ... )
From: henha...@gmail.com (henh...@gmail.com)
Injection-Date: Tue, 26 Jul 2022 18:22:24 +0000
Content-Type: text/plain; charset="UTF-8"
X-Received-Bytes: 1404
 by: henh...@gmail.com - Tue, 26 Jul 2022 18:22 UTC

https://i.redd.it/fbnsyfvp5id91.png ( _losopher of _sic in _na ........ )

Why is a (factorial) rarely a square ?

Why is a (factorial - 1) rarely a square ?

Why is a (factorial + 1) rarely a square ?

( 4 ! + 1 ) = 25 = 5*5

Re: Why is a (factorial - 1) rarely a square ? ---------- ( _losopher of _sic in _na ... )

<tbpecf$1msc$1@macpro.inf.ed.ac.uk>

 copy mid

https://www.novabbs.com/interests/article-flat.php?id=357&group=rec.puzzles#357

 copy link   Newsgroups: rec.puzzles
Path: i2pn2.org!i2pn.org!news.niel.me!nntp.terraraq.uk!nntp-feed.chiark.greenend.org.uk!ewrotcd!usenet.inf.ed.ac.uk!.POSTED!not-for-mail
From: rich...@cogsci.ed.ac.uk (Richard Tobin)
Newsgroups: rec.puzzles
Subject: Re: Why is a (factorial - 1) rarely a square ? ---------- (
_losopher of _sic in _na ... )
Date: Tue, 26 Jul 2022 19:13:19 +0000 (UTC)
Organization: Language Technology Group, University of Edinburgh
Lines: 10
Message-ID: <tbpecf$1msc$1@macpro.inf.ed.ac.uk>
References: <4973fd1a-3e40-4214-993d-96247bd175e8n@googlegroups.com>
NNTP-Posting-Host: macaroni.inf.ed.ac.uk
X-Trace: macpro.inf.ed.ac.uk 1658862799 56204 129.215.197.42 (26 Jul 2022 19:13:19 GMT)
X-Complaints-To: usenet@macpro.inf.ed.ac.uk
NNTP-Posting-Date: Tue, 26 Jul 2022 19:13:19 +0000 (UTC)
X-Newsreader: trn 4.0-test76 (Apr 2, 2001)
Originator: richard@cogsci.ed.ac.uk (Richard Tobin)
 by: Richard Tobin - Tue, 26 Jul 2022 19:13 UTC

In article <4973fd1a-3e40-4214-993d-96247bd175e8n@googlegroups.com>,
henh...@gmail.com <henhanna@gmail.com> wrote:

>Why is a (factorial) rarely a square ?

For n>1, n! is never a square. This follows trivially [walks away,
returns a couple of minutes later], yes trivially, from Bertrand's
postulate.

-- Richard

Re: Why is a (factorial - 1) rarely a square ? ---------- ( _losopher of _sic in _na ... )

<tbphev$25ufh$1@dont-email.me>

 copy mid

https://www.novabbs.com/interests/article-flat.php?id=358&group=rec.puzzles#358

 copy link   Newsgroups: rec.puzzles
Path: i2pn2.org!i2pn.org!eternal-september.org!reader01.eternal-september.org!.POSTED!not-for-mail
From: rjh...@cpax.org.uk (Richard Heathfield)
Newsgroups: rec.puzzles
Subject: Re: Why is a (factorial - 1) rarely a square ? ---------- ( _losopher
of _sic in _na ... )
Date: Tue, 26 Jul 2022 21:05:51 +0100
Organization: Fix this later
Lines: 18
Message-ID: <tbphev$25ufh$1@dont-email.me>
References: <4973fd1a-3e40-4214-993d-96247bd175e8n@googlegroups.com>
<tbpecf$1msc$1@macpro.inf.ed.ac.uk>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
Injection-Date: Tue, 26 Jul 2022 20:05:51 -0000 (UTC)
Injection-Info: reader01.eternal-september.org; posting-host="b54550fc9e2705ea1bd4eb5066981f2c";
logging-data="2292209"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX18O435J/JFaiFtipGAGwtcS3eY75KPbhAUc2txJkzDGgg=="
User-Agent: Mozilla/5.0 (X11; Linux x86_64; rv:91.0) Gecko/20100101
Thunderbird/91.11.0
Cancel-Lock: sha1:tfPnksP0F7+RKEdAqEZFuHa25bU=
Content-Language: en-GB
In-Reply-To: <tbpecf$1msc$1@macpro.inf.ed.ac.uk>
 by: Richard Heathfield - Tue, 26 Jul 2022 20:05 UTC

On 26/07/2022 8:13 pm, Richard Tobin wrote:
> In article <4973fd1a-3e40-4214-993d-96247bd175e8n@googlegroups.com>,
> henh...@gmail.com <henhanna@gmail.com> wrote:
>
>> Why is a (factorial) rarely a square ?
>
> For n>1, n! is never a square. This follows trivially [walks away,
> returns a couple of minutes later], yes trivially, from Bertrand's
> postulate.

I have a truly marvelous proof of Mr Tobin's statement, which
Usenet is too narrow to contain.

--
Richard Heathfield
Email: rjh at cpax dot org dot uk
"Usenet is a strange place" - dmr 29 July 1999
Sig line 4 vacant - apply within

Re: Why is a (factorial - 1) rarely a square ? ---------- ( _losopher of _sic in _na ... )

<tbrgoj$2hgte$1@dont-email.me>

 copy mid

https://www.novabbs.com/interests/article-flat.php?id=359&group=rec.puzzles#359

 copy link   Newsgroups: rec.puzzles
Path: i2pn2.org!i2pn.org!eternal-september.org!reader01.eternal-september.org!.POSTED!not-for-mail
From: rjh...@cpax.org.uk (Richard Heathfield)
Newsgroups: rec.puzzles
Subject: Re: Why is a (factorial - 1) rarely a square ? ---------- ( _losopher
of _sic in _na ... )
Date: Wed, 27 Jul 2022 15:06:11 +0100
Organization: Fix this later
Lines: 66
Message-ID: <tbrgoj$2hgte$1@dont-email.me>
References: <4973fd1a-3e40-4214-993d-96247bd175e8n@googlegroups.com>
<tbpecf$1msc$1@macpro.inf.ed.ac.uk>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
Injection-Date: Wed, 27 Jul 2022 14:06:11 -0000 (UTC)
Injection-Info: reader01.eternal-september.org; posting-host="17c207c70080aee8bb9f15ad46149ba2";
logging-data="2671534"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1/DnOeRtTdjj9VVUT2ek4/CGp4/fzaTi9oeadmHZjvLfw=="
User-Agent: Mozilla/5.0 (X11; Linux x86_64; rv:91.0) Gecko/20100101
Thunderbird/91.11.0
Cancel-Lock: sha1:ybJtU7Bd7qjg2CDa0o+BB9fNN0E=
Content-Language: en-GB
In-Reply-To: <tbpecf$1msc$1@macpro.inf.ed.ac.uk>
 by: Richard Heathfield - Wed, 27 Jul 2022 14:06 UTC

On 26/07/2022 8:13 pm, Richard Tobin wrote:
> In article <4973fd1a-3e40-4214-993d-96247bd175e8n@googlegroups.com>,
> henh...@gmail.com <henhanna@gmail.com> wrote:
>
>> Why is a (factorial) rarely a square ?
>
> For n>1, n! is never a square.

I note in passing that it comes close four or five times, notably
7!, which is just 1 shy of 71^2.

I further note in passing that the subject line asks about n!-1
rather than n! itself, but I tried it both ways and it turns out
to matter little.

> This follows trivially [walks away,
> returns a couple of minutes later], yes trivially, from Bertrand's
> postulate.

I think I can trivialise this still further.

#include <stdio.h>
#include <limits.h>

int main(void)
{ printf("%lu\n", ULONG_MAX);
return 0;
}

yields 18446744073709551615, the largest available positive
integer without going to ridiculous (and indeed non-trivial)
extremes like departing from C89.

The largest non-trivial factorial is therefore 20! or
2432902008176640000.

(21 is 51090942171709440000, which is simply too big to be
trivial; let us not exceed our brief.)

1! = 1 IS a square: root 1^2 is out by 0
2! = 2 is NOT a square: root 1^2 is out by 1
3! = 6 is NOT a square: root 2^2 is out by 2
4! = 24 is NOT a square: root 5^2 is out by 1
5! = 120 is NOT a square: root 11^2 is out by 1
6! = 720 is NOT a square: root 27^2 is out by 9
7! = 5040 is NOT a square: root 71^2 is out by 1
8! = 40320 is NOT a square: root 201^2 is out by 81
9! = 362880 is NOT a square: root 602^2 is out by 476
10! = 3628800 is NOT a square: root 1905^2 is out by 225
11! = 39916800 is NOT a square: root 6318^2 is out by 324

I ran it all the way up to and including 20. After 11!, the
discrepancy between the factorial and the square of its nearest
integer root (which discrepancy must be 0 for a solution)
continues to climb by amounts that increase by, on average, close
to an order of magnitude per factorial.

And, unless you want to get non-trivial, them's all the numbers
there is. QED.

--
Richard Heathfield
Email: rjh at cpax dot org dot uk
"Usenet is a strange place" - dmr 29 July 1999
Sig line 4 vacant - apply within

Re: Why is a (factorial - 1) rarely a square ? ---------- ( _losopher of _sic in _na ... )

<e4b423d6-b040-44e6-8e13-6f5b02af288cn@googlegroups.com>

 copy mid

https://www.novabbs.com/interests/article-flat.php?id=361&group=rec.puzzles#361

 copy link   Newsgroups: rec.puzzles
X-Received: by 2002:a05:6214:27ef:b0:474:9aa:9e4d with SMTP id jt15-20020a05621427ef00b0047409aa9e4dmr20380502qvb.82.1658946308349;
Wed, 27 Jul 2022 11:25:08 -0700 (PDT)
X-Received: by 2002:a05:622a:1495:b0:31e:f274:6d24 with SMTP id
t21-20020a05622a149500b0031ef2746d24mr19603477qtx.684.1658946308149; Wed, 27
Jul 2022 11:25:08 -0700 (PDT)
Path: i2pn2.org!i2pn.org!usenet.blueworldhosting.com!feed1.usenet.blueworldhosting.com!peer02.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: rec.puzzles
Date: Wed, 27 Jul 2022 11:25:07 -0700 (PDT)
In-Reply-To: <tbrgoj$2hgte$1@dont-email.me>
Injection-Info: google-groups.googlegroups.com; posting-host=2601:648:8600:bc00:3cd1:5ab5:e379:dbee;
posting-account=YjTkGAoAAAA4_fbAISfvtIqrYbghMeBx
NNTP-Posting-Host: 2601:648:8600:bc00:3cd1:5ab5:e379:dbee
References: <4973fd1a-3e40-4214-993d-96247bd175e8n@googlegroups.com>
<tbpecf$1msc$1@macpro.inf.ed.ac.uk> <tbrgoj$2hgte$1@dont-email.me>
User-Agent: G2/1.0
MIME-Version: 1.0
Message-ID: <e4b423d6-b040-44e6-8e13-6f5b02af288cn@googlegroups.com>
Subject: Re: Why is a (factorial - 1) rarely a square ? ---------- ( _losopher
of _sic in _na ... )
From: henha...@gmail.com (henh...@gmail.com)
Injection-Date: Wed, 27 Jul 2022 18:25:08 +0000
Content-Type: text/plain; charset="UTF-8"
X-Received-Bytes: 7514
 by: henh...@gmail.com - Wed, 27 Jul 2022 18:25 UTC

On Wednesday, July 27, 2022 at 7:06:14 AM UTC-7, Richard Heathfield wrote:
> On 26/07/2022 8:13 pm, Richard Tobin wrote:
> > In article <4973fd1a-3e40-4214...@googlegroups.com>,
> > henh...@gmail.com <henh...@gmail.com> wrote:
> >
> >> Why is a (factorial) rarely a square ?
> >
> > For n>1, n! is never a square.
> I note in passing that it comes close four or five times, notably
> 7!, which is just 1 shy of 71^2.
>
> I further note in passing that the subject line asks about n!-1
> rather than n! itself, but I tried it both ways and it turns out
> to matter little.
> > This follows trivially [walks away,
> > returns a couple of minutes later], yes trivially, from Bertrand's
> > postulate.
> I think I can trivialise this still further.
>
> #include <stdio.h>
> #include <limits.h>
>
> int main(void)
> {
> printf("%lu\n", ULONG_MAX);
> return 0;
> }
>
> yields 18446744073709551615, the largest available positive
> integer without going to ridiculous (and indeed non-trivial)
> extremes like departing from C89.
>
> The largest non-trivial factorial is therefore 20! or
> 2432902008176640000.
>
> (21 is 51090942171709440000, which is simply too big to be
> trivial; let us not exceed our brief.)
>
> 1! = 1 IS a square: root 1^2 is out by 0
> 2! = 2 is NOT a square: root 1^2 is out by 1
> 3! = 6 is NOT a square: root 2^2 is out by 2
> 4! = 24 is NOT a square: root 5^2 is out by 1
> 5! = 120 is NOT a square: root 11^2 is out by 1
> 6! = 720 is NOT a square: root 27^2 is out by 9
> 7! = 5040 is NOT a square: root 71^2 is out by 1
> 8! = 40320 is NOT a square: root 201^2 is out by 81
> 9! = 362880 is NOT a square: root 602^2 is out by 476
> 10! = 3628800 is NOT a square: root 1905^2 is out by 225
> 11! = 39916800 is NOT a square: root 6318^2 is out by 324
>
> I ran it all the way up to and including 20. After 11!, the
> discrepancy between the factorial and the square of its nearest
> integer root (which discrepancy must be 0 for a solution)
> continues to climb by amounts that increase by, on average, close
> to an order of magnitude per factorial.
>
> And, unless you want to get non-trivial, them's all the numbers
> there is. QED.
> --

> 10! = 3628800 is NOT a square: root 1905^2 is out by 225
> 11! = 39916800 is NOT a square: root 6318^2 is out by 324

i'm wondering ... After these... When does it get close again ?

11! = 39916800 ( 12311 , 324 ) ( 97.44 , 2.56 ) %
27! = 10888869450418352160768000000 ( 204033398880671 , 4666092737476 ) ( 97.76 , 2.24 ) %

(27!) is already so big that 2% doesn't seem so close anymore.

_________________________

1! = 1 ( 0 , 3 ) ( 0 , 100.0 ) %

2! = 2 ( 1 , 2 ) ( 33.33 , 66.67 ) %

3! = 6 ( 2 , 3 ) ( 40.0 , 60.0 ) %

4! = 24 ( 8 , 1 ) ( 88.89 , 11.11 ) %

5! = 120 ( 20 , 1 ) ( 95.24 , 4.76 ) %

6! = 720 ( 44 , 9 ) ( 83.02 , 16.98 ) %

7! = 5040 ( 140 , 1 ) ( 99.29 , 0.71 ) %

8! = 40320 ( 320 , 81 ) ( 79.8 , 20.2 ) %

9! = 362880 ( 476 , 729 ) ( 39.5 , 60.5 ) %

10! = 3628800 ( 3584 , 225 ) ( 94.09 , 5.91 ) %

11! = 39916800 ( 12311 , 324 ) ( 97.44 , 2.56 ) %

12! = 479001600 ( 4604 , 39169 ) ( 10.52 , 89.48 ) %

13! = 6227020800 ( 74879 , 82944 ) ( 47.44 , 52.56 ) %

14! = 87178291200 ( 414119 , 176400 ) ( 70.13 , 29.87 ) %

15! = 1307674368000 ( 2071775 , 215296 ) ( 90.59 , 9.41 ) %

16! = 20922789888000 ( 5703551 , 3444736 ) ( 62.35 , 37.65 ) %

17! = 355687428096000 ( 11551671 , 26167684 ) ( 30.63 , 69.37 ) %

18! = 6402373705728000 ( 45680444 , 114349225 ) ( 28.54 , 71.46 ) %

19! = 121645100408832000 ( 442548224 , 255004929 ) ( 63.44 , 36.56 ) %

20! = 2432902008176640000 ( 1960632176 , 1158920361 ) ( 62.85 , 37.15 ) %

21! = 51090942171709440000 ( 2657058876 , 11638526761 ) ( 18.59 , 81.41 ) %

22! = 1124000727777607680000 ( 24923993276 , 42128246889 ) ( 37.17 , 62.83 ) %

23! = 25852016738884976640000 ( 130518272975 , 191052974116 ) ( 40.59 , 59.41 ) %

24! = 620448401733239439360000 ( 1478154932316 , 97216010329 ) ( 93.83 , 6.17 ) %

25! = 15511210043330985984000000 ( 5446454455004 , 2430400258225 ) ( 69.15 , 30.85 ) %

26! = 403291461126605635584000000 ( 38610655379975 , 1553580508516 ) ( 96.13 , 3.87 ) %

27! = 10888869450418352160768000000 ( 204033398880671 , 4666092737476 ) ( 97.76 , 2.24 ) %

28! = 304888344611713860501504000000 ( 538347188396016 , 565986718738441 ) ( 48.75 , 51.25 ) %

29! = 8841761993739701954543616000000 ( 3809155729331900 , 2137864362693921 ) ( 64.05 , 35.95 ) %

30! = 265252859812191058636308480000000 ( 27460809907547975 , 5112360635841936 ) ( 84.3 , 15.7 ) %

31! = 8222838654177922817725562880000000 ( 52607402757814775 , 128752335378056196 ) ( 29.01 , 70.99 ) %

32! = 263130836933693530167218012160000000 ( 260599968274292919 , 765325637086434064 ) ( 25.4 , 74.6 ) %

33! = 8683317618811886495518194401280000000 ( 4946344303884983516 , 947149606797163441 ) ( 83.93 , 16.07 ) %

34! = 295232799039604140847618609643520000000 ( 11268404003386411164 , 23096275482364893649 ) ( 32.79 , 67.21 ) %

35! = 10333147966386144929666651337523200000000 ( 49693019852305886759 , 153611165706045517584 ) ( 24.44 , 75.56 ) %

36! = 371993326789901217467999448150835200000000 ( 569123601332903497271 , 650701512017204928784 ) ( 46.66 , 53.34 ) %

37! = 13763753091226345046315979581580902400000000 ( 5553210888420637223900 , 1866695604582180947481 ) ( 74.84 , 25.16 ) %

38! = 523022617466601111760007224100074291200000000 ( 8221172400438234781599 , 37518203085748767234304 ) ( 17.97 , 82.03 ) %

39! = 20397882081197443358640281739902897356800000000 ( 66477907253778706052351 , 219164401105451883320836 ) ( 23.27 , 76.73 ) %

40! = 815915283247897734345611269596115894272000000000 ( 315962139518370239927900 , 1490598441528274577343321 ) ( 17.49 , 82.51 ) %

41! = 33452526613163807108170062053440751665152000000000 ( 4303974373003395286935119 , 7263657469887146344632100 ) ( 37.21 , 62.79 ) %

Re: Why is a (factorial - 1) rarely a square ? ---------- ( _losopher of _sic in _na ... )

<tbs6k7$5rj$1@macpro.inf.ed.ac.uk>

 copy mid

https://www.novabbs.com/interests/article-flat.php?id=362&group=rec.puzzles#362

 copy link   Newsgroups: rec.puzzles
Path: i2pn2.org!i2pn.org!aioe.org!news.uzoreto.com!2.eu.feeder.erje.net!feeder.erje.net!feeds.news.ox.ac.uk!news.ox.ac.uk!usenet.inf.ed.ac.uk!.POSTED!not-for-mail
From: rich...@cogsci.ed.ac.uk (Richard Tobin)
Newsgroups: rec.puzzles
Subject: Re: Why is a (factorial - 1) rarely a square ? ---------- ( _losopher
of _sic in _na ... )
Date: Wed, 27 Jul 2022 20:19:19 +0000 (UTC)
Organization: Language Technology Group, University of Edinburgh
Lines: 28
Message-ID: <tbs6k7$5rj$1@macpro.inf.ed.ac.uk>
References: <4973fd1a-3e40-4214-993d-96247bd175e8n@googlegroups.com> <tbpecf$1msc$1@macpro.inf.ed.ac.uk> <tbphev$25ufh$1@dont-email.me>
NNTP-Posting-Host: macaroni.inf.ed.ac.uk
X-Trace: macpro.inf.ed.ac.uk 1658953159 6003 129.215.197.42 (27 Jul 2022 20:19:19 GMT)
X-Complaints-To: usenet@macpro.inf.ed.ac.uk
NNTP-Posting-Date: Wed, 27 Jul 2022 20:19:19 +0000 (UTC)
X-Newsreader: trn 4.0-test76 (Apr 2, 2001)
Originator: richard@cogsci.ed.ac.uk (Richard Tobin)
 by: Richard Tobin - Wed, 27 Jul 2022 20:19 UTC

In article <tbphev$25ufh$1@dont-email.me>,
Richard Heathfield <rjh@cpax.org.uk> wrote:

>> For n>1, n! is never a square. This follows trivially [walks away,
>> returns a couple of minutes later], yes trivially, from Bertrand's
>> postulate.

>I have a truly marvelous proof of Mr Tobin's statement, which
>Usenet is too narrow to contain.

The basic idea is simple: any prime factor of a square must occur
twice (or 4 times, or 6 ...). (We had an example of that the other
day: any even square is a multiple of 4.)

Consider even n (= 2N, say).

(2N)! = 1 x 2 x .... x (N-1) x N x (N+1) x ... x (2N-1) x 2N

If there is a prime p in the second half - N+1 ... 2N - it will only
occur once, as 2p would be bigger than n. So if there is a prime
in N+1 ... 2N, (2N)! is not a sqare.

Bertrand's postulate tells you almost exactly that - there is always
a prime in N+1 ... 2N-1 (for N>1).

You can easily see it works for odd n too.

-- Richard

Re: Why is a (factorial - 1) rarely a square ? ---------- ( _losopher of _sic in _na ... )

<tbscnq$2l21j$1@dont-email.me>

 copy mid

https://www.novabbs.com/interests/article-flat.php?id=363&group=rec.puzzles#363

 copy link   Newsgroups: rec.puzzles
Path: i2pn2.org!i2pn.org!eternal-september.org!reader01.eternal-september.org!.POSTED!not-for-mail
From: rjh...@cpax.org.uk (Richard Heathfield)
Newsgroups: rec.puzzles
Subject: Re: Why is a (factorial - 1) rarely a square ? ---------- ( _losopher
of _sic in _na ... )
Date: Wed, 27 Jul 2022 23:03:38 +0100
Organization: Fix this later
Lines: 21
Message-ID: <tbscnq$2l21j$1@dont-email.me>
References: <4973fd1a-3e40-4214-993d-96247bd175e8n@googlegroups.com>
<tbpecf$1msc$1@macpro.inf.ed.ac.uk> <tbphev$25ufh$1@dont-email.me>
<tbs6k7$5rj$1@macpro.inf.ed.ac.uk>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
Injection-Date: Wed, 27 Jul 2022 22:03:38 -0000 (UTC)
Injection-Info: reader01.eternal-september.org; posting-host="78ae535749c466e3ee6e6da630c1a2dd";
logging-data="2787379"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX19tnO5QPAb0P/YkHX6t5ISMDETXzGHnBJYBJwfw7baw1A=="
User-Agent: Mozilla/5.0 (X11; Linux x86_64; rv:91.0) Gecko/20100101
Thunderbird/91.11.0
Cancel-Lock: sha1:mF2AaKB5KZqpOn3t0BKA7w1EZcM=
In-Reply-To: <tbs6k7$5rj$1@macpro.inf.ed.ac.uk>
Content-Language: en-GB
 by: Richard Heathfield - Wed, 27 Jul 2022 22:03 UTC

On 27/07/2022 9:19 pm, Richard Tobin wrote:
> In article <tbphev$25ufh$1@dont-email.me>,
> Richard Heathfield <rjh@cpax.org.uk> wrote:
>
>>> For n>1, n! is never a square. This follows trivially [walks away,
>>> returns a couple of minutes later], yes trivially, from Bertrand's
>>> postulate.
>
>> I have a truly marvelous proof of Mr Tobin's statement, which
>> Usenet is too narrow to contain.
>
> The basic idea is simple: any prime factor of a square must occur
> twice (or 4 times, or 6 ...).

You're a sly old fox, sir.

--
Richard Heathfield
Email: rjh at cpax dot org dot uk
"Usenet is a strange place" - dmr 29 July 1999
Sig line 4 vacant - apply within

Re: Why is a (factorial - 1) rarely a square ? ---------- ( _losopher of _sic in _na ... )

<tbtstl$12s3$1@macpro.inf.ed.ac.uk>

 copy mid

https://www.novabbs.com/interests/article-flat.php?id=364&group=rec.puzzles#364

 copy link   Newsgroups: rec.puzzles
Path: i2pn2.org!i2pn.org!aioe.org!nntp.terraraq.uk!nntp-feed.chiark.greenend.org.uk!ewrotcd!usenet.inf.ed.ac.uk!.POSTED!not-for-mail
From: rich...@cogsci.ed.ac.uk (Richard Tobin)
Newsgroups: rec.puzzles
Subject: Re: Why is a (factorial - 1) rarely a square ? ---------- (
_losopher of _sic in _na ... )
Date: Thu, 28 Jul 2022 11:45:57 +0000 (UTC)
Organization: Language Technology Group, University of Edinburgh
Lines: 29
Message-ID: <tbtstl$12s3$1@macpro.inf.ed.ac.uk>
References: <4973fd1a-3e40-4214-993d-96247bd175e8n@googlegroups.com>
NNTP-Posting-Host: macaroni.inf.ed.ac.uk
X-Trace: macpro.inf.ed.ac.uk 1659008757 35715 129.215.197.42 (28 Jul 2022 11:45:57 GMT)
X-Complaints-To: usenet@macpro.inf.ed.ac.uk
NNTP-Posting-Date: Thu, 28 Jul 2022 11:45:57 +0000 (UTC)
X-Newsreader: trn 4.0-test76 (Apr 2, 2001)
Originator: richard@cogsci.ed.ac.uk (Richard Tobin)
 by: Richard Tobin - Thu, 28 Jul 2022 11:45 UTC

In article <4973fd1a-3e40-4214-993d-96247bd175e8n@googlegroups.com>,
henh...@gmail.com <henhanna@gmail.com> wrote:

>Why is a (factorial) rarely a square ?
>
>Why is a (factorial - 1) rarely a square ?
>
>Why is a (factorial + 1) rarely a square ?

Ignoring the proof that n! is never square for n>1, what would
we expect?

Since the gap between (n-1)^2 and n^2 is 2n-1, and the gap between n^2
and (n+1)^2 is 2n+1, we can say in a hand-wavy sort of way that the
probability of k being a square is 1 / 2sqrt(k).

So in a similarly rigorous manner we can say that the expected number
of factorials (>1!) that are squares is

1 / 2 sqrt(2!) + 1 / 2 sqrt(3!) + ...

The denominators go up much faster than n^(any fixed power), and even
sum 1/n^2 is finite and small, so this will converge to a small number
- less than 2 in fact. So on purely statistical grounds we would
expect only a finite, small number of square factorials, and the same
goes for n! +/- 1.

-- Richard

Re: Why is a (factorial - 1) rarely a square ? ---------- ( _losopher of _sic in _na ... )

<8a3115df-647b-42a5-934b-2a770db43791n@googlegroups.com>

 copy mid

https://www.novabbs.com/interests/article-flat.php?id=365&group=rec.puzzles#365

 copy link   Newsgroups: rec.puzzles
X-Received: by 2002:a05:620a:4053:b0:6b5:df8f:3573 with SMTP id i19-20020a05620a405300b006b5df8f3573mr21295304qko.578.1659029991343;
Thu, 28 Jul 2022 10:39:51 -0700 (PDT)
X-Received: by 2002:ae9:e906:0:b0:6b5:f0ec:ed92 with SMTP id
x6-20020ae9e906000000b006b5f0eced92mr21185886qkf.59.1659029991184; Thu, 28
Jul 2022 10:39:51 -0700 (PDT)
Path: i2pn2.org!i2pn.org!usenet.blueworldhosting.com!feed1.usenet.blueworldhosting.com!peer03.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: rec.puzzles
Date: Thu, 28 Jul 2022 10:39:50 -0700 (PDT)
In-Reply-To: <tbpecf$1msc$1@macpro.inf.ed.ac.uk>
Injection-Info: google-groups.googlegroups.com; posting-host=2601:648:8600:bc00:d553:a91f:7c52:51bc;
posting-account=YjTkGAoAAAA4_fbAISfvtIqrYbghMeBx
NNTP-Posting-Host: 2601:648:8600:bc00:d553:a91f:7c52:51bc
References: <4973fd1a-3e40-4214-993d-96247bd175e8n@googlegroups.com> <tbpecf$1msc$1@macpro.inf.ed.ac.uk>
User-Agent: G2/1.0
MIME-Version: 1.0
Message-ID: <8a3115df-647b-42a5-934b-2a770db43791n@googlegroups.com>
Subject: Re: Why is a (factorial - 1) rarely a square ? ---------- ( _losopher
of _sic in _na ... )
From: henha...@gmail.com (henh...@gmail.com)
Injection-Date: Thu, 28 Jul 2022 17:39:51 +0000
Content-Type: text/plain; charset="UTF-8"
X-Received-Bytes: 2179
 by: henh...@gmail.com - Thu, 28 Jul 2022 17:39 UTC

On Tuesday, July 26, 2022 at 12:15:02 PM UTC-7, Richard Tobin wrote:
> In article <4973fd1a-3e40-4214...@googlegroups.com>,
> henh...@gmail.com <henh...@gmail.com> wrote:
>
> >Why is a (factorial) rarely a square ?
> For n>1, n! is never a square. This follows trivially [walks away,
> returns a couple of minutes later], yes trivially, from Bertrand's
> postulate.
>
> -- Richard

thanks!

Bertrand's postulate states that there is a prime p between n and 2n ( for n > 2 ).

-------------- ( for n > 2 ) ... <--- this doesn't seem right

Why is a (factorial - 1) rarely a square ? ------- i'm guessing that this one is much easier to show than Bertrand's postulate

Why is a (factorial + 1) rarely a square ? ----------- e.g. ( 4 ! + 1 ) = 25 = 5*5, 11^2, 71^2

1
server_pubkey.txt

rocksolid light 0.9.7
clearnet tor