Scribd
Upload
99 views

Problem 468 - Project Euler

The document defines a function F(n) that sums the largest smooth divisors of binomial coefficients from r=0 to n, where a number is considered smooth if its prime factors are less than or equal to B. It provides examples of calculating F(n) for some values of n. The problem asks to calculate the value of F(11 111 111) modulo 1 000 000 993.

Uploaded by

Abasiemeka
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
99 views

Problem 468 - Project Euler

The document defines a function F(n) that sums the largest smooth divisors of binomial coefficients from r=0 to n, where a number is considered smooth if its prime factors are less than or equal to B. It provides examples of calculating F(n) for some values of n. The problem asks to calculate the value of F(11 111 111) modulo 1 000 000 993.

Uploaded by

Abasiemeka
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

4/24/2014 Problem 468 - Project Euler

http://projecteuler.net/problem=468 1/1


Smooth divisors of binomial coefficients
An integer is called B-smooth if none of its prime factors is greater than B.
Let S
B
(n) be the largest B-smooth divisor of n.
Examples:
S
1
(10) = 1
S
4
(2100) = 12
S
17
(2496144) = 5712
Define F(n) =
1 B n

0 r n
S
B
(C(n,r)). Here, C(n,r) denotes the binomial coefficient.
Examples:
F(11) = 3132
F(1 111) mod 1 000 000 993 = 706036312
F(111 111) mod 1 000 000 993 = 22156169
Find F(11 111 111) mod 1 000 000 993.
Problem 468

You might also like