Let π(x) be the number of primes not exceeding x. We prove that for , and that for sufficiently large We finally prove that for and k = 2, 3,…, 147297098200000, the closed interval [(k – 1)x, kx] contains at least one prime number, i.e. the Bertrand's postulate holds for x and k as above.