n = 8. -----Original Message----- From: math-fun-admin@mailman.xmission.com [mailto:math-fun-admin@mailman.xmission.com]On Behalf Of Richard Guy Sent: Wednesday, January 22, 2003 12:17 To: Mr. Nayandeep Deka Baruah Cc: Jonathan m. Borwein; Math Fun; Number Theory List Subject: [math-fun] Re: your mail I'll make a wild guess that it can be proved that no such n exists; I'll copy this to some people who may be able to confirm or deny this. R. On Wed, 22 Jan 2003, Mr. Nayandeep Deka Baruah wrote:
Dear Professors Guy and Borwein,
I would like to know from you whether the following result is still a conjecture or has been proved by somebody.
There exists a composite integer n such that for each prime divisor p of n (p+1)|(n+1).
If it is true then what is the smallest such number? Are such numbers are infinitely many?
I would be extremely grateful for your help.
With best regards,
Nayandeep Deka Baruah Dept. of Math. Sciences, Tezpur University Napaam-784028 Assam, INDIA.
_______________________________________________ math-fun mailing list math-fun@mailman.xmission.com http://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun