mersenneforum.org  

Go Back   mersenneforum.org > Fun Stuff > Puzzles

Reply
 
Thread Tools
Old 2015-04-01, 23:29   #1
henryzz
Just call me Henry
 
henryzz's Avatar
 
"David"
Sep 2007
Cambridge (GMT/BST)

2·2,897 Posts
Default Factorial puzzle

I just noticed that 10!=6!*7!.
Are there any other instances where x!=y!*z! with y and z > 1?
If not can anyone prove this?
henryzz is offline   Reply With Quote
Old 2015-04-01, 23:41   #2
henryzz
Just call me Henry
 
henryzz's Avatar
 
"David"
Sep 2007
Cambridge (GMT/BST)

2×2,897 Posts
Default

Just realised that there is an infinite number of examples where (n!)!=n!*(n!-1)!
Are there any more apart from this trivial form?
henryzz is offline   Reply With Quote
Old 2015-04-02, 00:22   #3
science_man_88
 
science_man_88's Avatar
 
"Forget I exist"
Jul 2009
Dumbassville

26×131 Posts
Default

Quote:
Originally Posted by henryzz View Post
Just realised that there is an infinite number of examples where (n!)!=n!*(n!-1)!
Are there any more apart from this trivial form?
well one condition on this occuring is that one of the factorials involved has to involve the last prime below the factorial being divided by other factorials so for example the condition for example the reason 10!=6!*7! works is because one of the factorials involves 7 a prime number no solution can leave this out. also a key part is that the other factorial has to include possible factorizations of the rest so 8*9*10 = 8*90 = (2*4)*(5*6*3) which means it can barely fall below sqrt(number) when trying to find solutions to number! okay I made an error but I was trying to limit the cases.

Last fiddled with by science_man_88 on 2015-04-02 at 00:53
science_man_88 is offline   Reply With Quote
Old 2015-04-02, 02:27   #4
science_man_88
 
science_man_88's Avatar
 
"Forget I exist"
Jul 2009
Dumbassville

26·131 Posts
Default

Numbers n such that n! can be written as the product of smaller factorials.
science_man_88 is offline   Reply With Quote
Old 2015-04-02, 12:02   #5
ATH
Einyen
 
ATH's Avatar
 
Dec 2003
Denmark

3·17·59 Posts
Default

Quote:
Originally Posted by henryzz View Post
I just noticed that 10!=6!*7!.
Are there any other instances where x!=y!*z! with y and z > 1?
If not can anyone prove this?
No other examples for y,z < 10000 except the trivial cases.
ATH is offline   Reply With Quote
Old 2015-04-02, 12:58   #6
science_man_88
 
science_man_88's Avatar
 
"Forget I exist"
Jul 2009
Dumbassville

100000110000002 Posts
Default

Quote:
Originally Posted by ATH View Post
No other examples for y,z < 10000 except the trivial cases.
using pari I've checked for solutions using up to the last 10000 factorials before a factorial up to 30000! I think:

Code:
factorfactorial(e=0)={
a=parvector(10000,n,(n+e)!);
parfor(x=10,#a,
              d=precprime(x);x-d,
              c,
              if(c==0||c>=10000,next());
              b=setintersect(vector(c-1,t,a[x]/a[x+t-(c+1)]),a);
              if(b==[],,
                   print(x","b)
                   )
                 );
                  e=e+#a;
                  print(e);
                  factorfactorial(e)
};
doh I see an error now and it might of been slowing it down.

Last fiddled with by science_man_88 on 2015-04-02 at 13:58
science_man_88 is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Factorial primes Unregistered Information & Answers 2 2011-09-11 21:32
Factorial mfgoode Puzzles 6 2007-07-24 14:24
Factorial in C programming Unregistered Programming 7 2005-04-09 20:13
factorial puzzle (requires maths) graeme Puzzles 7 2003-08-19 20:40
Factorial problem xilman Puzzles 12 2003-07-20 20:22

All times are UTC. The time now is 13:13.

Fri Jan 22 13:13:35 UTC 2021 up 50 days, 9:24, 0 users, load averages: 1.47, 2.11, 1.94

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.