maths
posted by rohit .
What is the sum of all integer values of n such that 3n+15/(n−1)(n−5) is also an integer

since (n1)(n5) <= 3n+15 for 1 <= n <= 10, that limits our choices
listing the values of n, (3n+15) and (n1)(n5), we have
1 12 14 no
0 15 5 YES
1 18 0 no
2 21 3 YES
3 24 4 YES
4 27 3 YES
5 30 0 no
6 33 5 no
7 36 12 YES
8 39 21 no
9 42 32 no
10 45 45 YES
0+2+3+4+7+10 = 26
Respond to this Question
Similar Questions

maths
What is the sum of all integer values of n satisfying 1≤n≤100, such that n2−1 is a product of exactly two distinct prime numbers? 
Maths
What is the sum of all integer values of n satisfying 1≤n≤100, such that n2−1 is a product of exactly two distinct prime numbers? 
Maths
What is the sum of all integer values of n satisfying 1≤n≤100, such that n2−1 is a product of exactly two distinct prime numbers? 
Maths
What is the sum of all integer values of n satisfying 1≤n≤100, such that n^2−1 is a product of exactly two distinct prime numbers? 
math
Find the sum of all integers m that are less than 1000 and equal to n!+1−−−−−√ for some positive integer n. 
maths
f(x) is a polynomial with integer coefficients and degree at most 10. There are N distinct integer values for which f(n)=2, and M distinct integer values for which f(m)=−2. What is the maximum possible value of NM? 
Algebra
What is the sum of all possible integer values of x such that (x^2−35x+305)^(x^2−42x+416)=1? 
Exponential
What is the sum of all integer values of x such that (x^2−17x+71)^(x^2−34x+240)=1? 
math
For every prime p consider all polynomials f(x) with integer coefficients from 1 to p and degree at most p−1, such that for all integers x the number f(2x)−f(x) is divisible by p. Find the sum of all primes p<1000 such … 
math
For every prime p consider all polynomials f(x) with integer coefficients from 1 to p and degree at most p−1, such that for all integers x the number f(2x)−f(x) is divisible by p. Find the sum of all primes p<1000 such …