Search Results Heading

MBRLSearchResults

mbrl.module.common.modules.added.book.to.shelf
Title added to your shelf!
View what I already have on My Shelf.
Oops! Something went wrong.
Oops! Something went wrong.
While trying to add the title to your shelf something went wrong :( Kindly try again later!
Are you sure you want to remove the book from the shelf?
Oops! Something went wrong.
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
    Done
    Filters
    Reset
  • Discipline
      Discipline
      Clear All
      Discipline
  • Is Peer Reviewed
      Is Peer Reviewed
      Clear All
      Is Peer Reviewed
  • Item Type
      Item Type
      Clear All
      Item Type
  • Subject
      Subject
      Clear All
      Subject
  • Year
      Year
      Clear All
      From:
      -
      To:
  • More Filters
      More Filters
      Clear All
      More Filters
      Source
    • Language
448 result(s) for "Sury"
Sort by:
Polynomial Identities for Binomial Sums of Harmonic Numbers of Higher Order
We study the formulas for binomial sums of harmonic numbers of higher order ∑k=0nHk(r)nk(1−q)kqn−k=Hn(r)−∑j=1nDr(n,j)qjj. Recently, Mneimneh proved that D1(n,j)=1. In this paper, we find several different expressions of Dr(n,j) for r≥1.
Lower Bound for the Least Common Multiple
It is well known that the prime number theorem can be phrased as the statement that the least common multiple (lcm) of the first n natural numbers is asymptotic to the exponential of n. Suitable weaker bounds of this lcm already suffice to deduce certain striking properties of primes such as the existence of a prime between n and 2n for sufficiently large n. In this note we prove in an elementary manner that the lcm of the first n natural numbers is bigger than when n is bigger than 6.