← Complete problem index

PROJECT EULER · #0995

A Particular Pair of Polynomials

Statement only · UnsolvedOriginal problem ↗

For each prime p and each positive integer n define two polynomials:

fp(x)=i=0p1xign(x)=1+dnxd

Let S(p) be the smallest positive integer s such that fp(x) divides gs(x). For example, S(2)=1 as f2(x)=g1(x). Also S(5)=8 because f5(x)(x4x3+1)=g8(x).

Define T(m) to be the product of S(p) over all primes p<m. You are given that T(20)=1348422598656 and T(100)1.37451e123.

Find T(20000), giving your answer in scientific notation rounded to five significant digits after the decimal point. Use a lowercase e to separate the mantissa and the exponent.

Write-up coming later

The complete problem is available here. An approach, code, and answer will be added later.