All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Just Math > Calculus
A prime factorization problem (Posted on 2006-08-07) Difficulty: 4 of 5
Define polynomials Fn(x) such that for all nonnegative integers n:

F0(x)=1, Fn+1(0)=0 and

F'n+1(x) = (n+1)Fn(x+1)

Find the prime factorization of F300(7).

See The Solution Submitted by K Sengupta    
Rating: 4.0000 (2 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
Solution Spoiler Comment 1 of 1
Starting with F_0 and working one's way up step by step, one finds F_1(x)=x, F_2(x)=x(x+2), F_3(x)=x(x+3)^2. So one conjectures that F_n(x)=x(x+n)^(n-1), and this is readily seen to satsify the given differential-difference equations.

Hence F_300(7)=7*(307)^299 and this is already the prime factorization since 307 is a prime.

  Posted by Richard on 2006-08-07 13:45:55
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (13)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2024 by Animus Pactum Consulting. All rights reserved. Privacy Information