Intereting Posts

Divisibility of polynomial
Proving an Inequality Involving Integer Partitions
What is $\lim_{n \to \infty} n a_n$?
Geometric interpretations of $||z||_p = 1$?
Why study cardinals, ordinals and the like?
Evaluating $\int_0^{\infty} {\frac{\sin{x}\sin{2x}\sin{3x}\cdots\sin{nx}\sin{n^2x}}{x^{n+1}}}\ dx$
Why is the trace of a matrix the sum along its diagonal?
Equivalent characterizations of ordinals of the form $\omega^\delta$
Integral $\int_{1}^{2011} \frac{\sqrt{x}}{\sqrt{2012 – x} + \sqrt{x}}dx$
Solution of functional equation $f(x+y)=f(x)+f(y)+y\sqrt{f(x)}$
Rigidity of the category of fields
Why is $(2+\sqrt{3})^{50}$ so close to an integer?
Invariant subspaces if $f$ is defined by more than one matrix
Uniform convergence, but no absolute uniform convergence
If the series $\sum_0^\infty a_n$ converges, then so does $\sum_1^\infty \frac{\sqrt{a_n}}{n} $

Motivated by the question

Is there any result, that says that $\lfloor e^{n} \rfloor$ is never a prime for $n>2$?, take a real number $a>1$ and consider the sequence $\lfloor a^{n} \rfloor$.

- Does it always contains a prime number?
- Does it always contain an infinite number of primes?

As mentioned in the comments, to avoid trivial cases, $a$ cannot be an integer.

As this is probably too hard to have been answered in general, I’d be interested in partial results for interesting numbers such as $e$, $\pi$, $\sqrt 2$, $3/2$.

- Is my conjecture true? : Every primorial is a superior highly regular number, and every superior highly regular number is a primorial.
- Divisibility rules and congruences
- Origin and use of an identity of formal power series: $\det(1 - \psi T) = \exp \left(-\sum_{s=1}^{\infty} \text{Tr}(\psi^{s})T^{s}/s\right)$
- Multiplicative Euclidean Function for an Euclidean Domain
- Clarification of a remark of J. Steel on the independence of Goldbach from ZFC
- Are primes randomly distributed?

- integer partitions
- Any odd number is of form $a+b$ where $a^2+b^2$ is prime
- $x^3-9=y^2$ find integral solutions
- Every Real number is expressible in terms of differences of two transcendentals
- Prove that powers of any fixed prime $p$ contain arbitrarily many consecutive equal digits.
- If $g$ is a primitive root of $p^2$ where $p$ is an odd prime, why is $g$ a primitive root of $p^k$ for any $k \geq 1$?
- How is the set of all closed intervals countable?
- Proving Gauss' polynomial theorem (Rational Root Test)
- Is $72!/36! -1$ divisible by 73?
- Do monic irreducible polynomials assume at least one prime value?

This sequence not necessarily contains a prime number.

We will prove that there is a number $a\in [4,5]$ such that $\lfloor a^n \rfloor$ is even for all $n$.

The idea is that for $a\in[4,5]$, the set of possible values of $a^2$ is the interval $[4^2,5^2]$, which contains a even number. So, in the interval $[4,5]$ there is a subrange of values for $a$ such that $\lfloor a^2 \rfloor$ is even. Now, in that subrange, there will exist another subrange such that $\lfloor a^3 \rfloor$ is even for $a$ in this subrange, and so on. If we intersect all these subranges and use the nested intervals theorem, we will find a real $a$ such that all $\lfloor a\rfloor, \lfloor a^2\rfloor,\lfloor a^3\rfloor…$ are even.

Of course this is just the idea, see below the formal proof (I hope it is not too confusing):

Starting with the interval $I_1=[4.1,4.9]$ (we choose this initial interval to make sure $a$ is not an integer), we will construct inductively a infinite sequence of closed intervals $I_1,I_2,…$ satisfying the following conditions:

1) $ I_{n} \subset I_{n-1}$

2) If $I_n=[a_n,b_n]$, then $b_n^{n+1}-a_n^{n+1}\ge3$

3) The interval $[a_n^n,b_n^n]$ is contained in a interval of the form $[2k,2k+0.9]$ for some integer $k$.

The basis of induction is easily verified. Now, given $I_1,I_2,…I_n$, let’s construct $I_{n+1}$:

Since $b_n^{n+1}-a_n^{n+1}\ge3$, the interval $[a_n^{n+1},b_n^{n+1}]$ must contain a interval of the form $[2k,2k+1]$ for some integer $k$. Then define $I_{n+1}$ to be $[a_{n+1},b_{n+1}]$ where $a_{n+1}=\sqrt[n+1]{2k}$ and $b_{n+1}=\sqrt[n+1]{2k+0.9}$.

3) Clearly holds for this interval

1) Holds because $a_{n+1}=\sqrt[n+1]{2k}\ge \sqrt[n+1]{a_n^{n+1}}=a_n$, and

$b_{n+1}=\sqrt[n+1]{2k+0.9}<\sqrt[n+1]{2k+1}\le \sqrt[n+1]{b_n^{n+1}}=b_n$

Finally, 2) holds because

$b_{n+1}^{n+2}-a_{n+1}^{n+2}=

(2k+1)b_{n+1}-2ka_{n+1}=2k(b_{n+1}-a_{n+1})+b_{n+1}>b_{n+1}>4$ (because

$I_{n+1}\subset[4,5]$)

So we are done with our induction. Now, by the nested intervals theorem, there must exist a real number $a$ such that $a\in I_n$ for all $n$. But if $a\in I_n$, $then a^n\in [a_n^n,b_n^n]$. Since the last is contained in a interval of the form $[2k,2k+1]$, it follows that for this $a$, $\lfloor a^n \rfloor$ is even for all $n$.

- Generalized Pell's Equation: Why is 4 special?
- Find a closed form for this infinite sum: $ 1+\frac 1 2 +\frac{1 \times2}{2 \times 5}+\frac{1 \times2\times 3}{2 \times5\times 8}+ \dots$
- Nice proof for étale of degree 1 implies isomorphism.
- Calculating $\lim_{x\to+\infty}(\sqrt{x^2-3x}-x)$
- The spectrum of normal operators in $C^*$-algebras
- The shape of Pringles potato chip
- Reversing the Order of Integration and Summation
- Proof for the formula of sum of arcsine functions $ \arcsin x + \arcsin y $
- curve of constant curvature on unit sphere is planar curve?
- Finding connected components of the graph
- Sphere eversion and Smale-Hirsch theorem
- Proving ${p-1 \choose k}\equiv (-1)^{k}\pmod{p}: p \in \mathbb{P}$
- A Book of Neat Theorems for Laymen
- For every prime of the form $2^{4n}+1$, 7 is a primitive root.
- Volumes using triple integration