[seqfan] Re: cute Superseeker hit

Alonso Del Arte alonso.delarte at gmail.com
Mon Mar 17 13:32:21 CET 2014


If it can be proven to be the same, then you have found a way to simplify a
5-line program to a single line. I have a hunch Wilson's theorem may be of
use here.

Al


On Mon, Mar 17, 2014 at 7:44 AM, Wouter Meeussen <wouter.meeussen at telenet.be
> wrote:

> 'Super' hit on  Amarnath Murthy's A061303(n)+1  (see
> http://oeis.org/A061303 ) with
> gcd( n!, Phi(n!) )===gcd( (n+1)!, Phi((n+1)!) )
>
> or in Mma lingo:
> Select[Range[120], GCD[#!, EulerPhi[#!] ]===GCD[ (#+1)! ,EulerPhi[(#+1)!]
> ]&  ]
> {1,4,12,16,18,30,36,40,42,60,66,70,72,78,88,96,100,108,112}
> It is not clear to me whether this is self-evident or not.
> Any insight most welcome.
>
> Wouter.
>
> _______________________________________________
>
> Seqfan Mailing list - http://list.seqfan.eu/
>



-- 
Alonso del Arte
Author at SmashWords.com<https://www.smashwords.com/profile/view/AlonsoDelarte>
Musician at ReverbNation.com <http://www.reverbnation.com/alonsodelarte>



More information about the SeqFan mailing list