MathDB
compute f(n)

Source: Ireland 1996

July 1, 2009
modular arithmeticgreatest common divisornumber theoryrelatively primenumber theory proposed

Problem Statement

For each positive integer n n, let f(n) f(n) denote the greatest common divisor of n!\plus{}1 and (n\plus{}1)!. Find, without proof, a formula for f(n) f(n).