Maths

posted by .

For how many odd positive integers n<1000 does the number of positive divisors of n divide n?

Respond to this Question

First Name
School Subject
Your Answer

Similar Questions

  1. Maths

    in the following rings find all units, Zero divisors and idompotent elements and determine whether the ring is a field. a)Z2 b)Z5 c)Z10 NB z is integers( positive or negatives including zero z is integers( positive or negatives including …
  2. maths

    Let σ(n) be the sum of the positive divisors of an integer n and ϕ(n) be the number of positive integers smaller than n that are coprime to n. If p is a prime number, what is the maximum value σ(p)ϕ(p)?
  3. Maths

    Find the number of positive integers <1000 that can be expressed as 2^k−2^m, where k and m are non-negative integers.
  4. MATHS!!!!

    For how many odd positive integers n<1000 does the number of positive divisors of n divide n?
  5. Maths

    The number 1000 can be written in several ways as a sum of one or more consecutive positive integers, for instance, 1000=1000 (one summand) or 1000=198+199+200+201+202 (five summands). Find the largest possible number of summands in …
  6. algebra!!!! please help me!!!!

    The smallest possible positive value of 1−[(1/w)+(1/x)+(1/y)+(1/z)] where w, x, y, z are odd positive integers, has the form a/b, where a,b are coprime positive integers. Find a+b.
  7. discrete math

    Let f:ℤ+ → ℤ+ be the function defined by: for each x ∈ ℤ+, f(x) is the number of positive divisors of x. - find integers m, n, nd k so tha f(m)=3, f(n) = 4 anf f(k) = 5 -is f one-to one?
  8. math

    Let f:ℤ+ → ℤ+ be the function defined by: for each x ∈ ℤ+, f(x) is the number of positive divisors of x. - find integers m, n, nd k so tha f(m)=3, f(n) = 4 anf f(k) = 5 -is f one-to one?
  9. math help please

    Let f:ℤ+ → ℤ+ be the function defined by: for each x ∈ ℤ+, f(x) is the number of positive divisors of x. - find integers m, n, and k so tha f(m)=3, f(n) = 4 anf f(k) = 5 -is f one-to one?
  10. maths

    the non- decreasing sequence of odd integers {a1, a2, a3, . . .} = {1,3,3,3,5,5,5,5,5,...} each positive odd integer k appears k times. it is a fact that there are integers b, c, and d such that, for all positive integers n, aƱ = …

More Similar Questions