Register to reply

A combinatorics Problem

by physicsmath94
Tags: combinatorics
Share this thread:
physicsmath94
#1
Apr22-11, 01:31 AM
P: 2
I am trying to find a way to calculate the number of positive integers less than n such that these numbers are not divisible by the prime numbers 2,3,5,7,11,13.

If the problem were instead for prime numbers 2,3,5, then the solution is fairly simple. I used principle of inclusion and exclusion to solve the problem.

for example if n=50

[49/2] + [49/3] + [49/5] - [49/6] - [49/10] - [49/15] + [49/30] = 35

49-35 = 14 integers under 50 that are not divisible by 2,3, or 5.

At first i thought this method might be applicable if the question included primes: 2,3,5,7,11,13. But doing principle inclusion exclusion would take a Lot of calculator bashing. is there a smarter way to solve this problem for n= 60000
Phys.Org News Partner Science news on Phys.org
Sapphire talk enlivens guesswork over iPhone 6
Geneticists offer clues to better rice, tomato crops
UConn makes 3-D copies of antique instrument parts

Register to reply

Related Discussions
Combinatorics problem Set Theory, Logic, Probability, Statistics 6
Combinatorics Problem Precalculus Mathematics Homework 4
Combinatorics problem Calculus & Beyond Homework 7
Combinatorics problem Calculus & Beyond Homework 5
Combinatorics problem Introductory Physics Homework 2