Intereting Posts

Good Textbooks for Real Analysis and Topology.
Prove that $(n-1)! \equiv -1 \pmod{n}$ iff $n$ is prime
Using Octave to solve systems of two non-linear ODEs
What does it mean when two functions are “orthogonal”, why is it important?
Tricky (extremal?) combinatorics problem
Some questions about Hartshorne chapter 2 proposition 2.6
Possibly rotated parabola from three points
Determine and classify all singular points
Fourier Series $\sin(\sin(x))$
Does there exist such an invertible matrix?
In most geometry courses, we learn that there's no such thing as “SSA Congruence”.
If $f^3=\rm id$ then it is identity function
Are all values of the totient function for composite numbers between two consecutive primes smaller than the totient values of those primes?
Proof of Angle in a Semi-Circle is of $90$ degrees
What is the new probability density function by generating a random number by taking the reciprocal of a uniformly random number between 0 and 1?

Via induction I need to prove an expression is true. the expression is:

$n \leq 2^k \longrightarrow a_n \leq 3 \cdot k2^k + 4 \cdot

2^k-1$

for all $n,k \in \mathbb{Z^+}$

- Explicit solution of the recursion $x_n = x_{n-1}^2 - 2$ with $x_0>2$
- Gnarly equality proof? Or not?
- Prove that if m and n are positive integers, and x is a real number, then: ceiling((ceiling(x)+n)/m) = ceiling((x+n)/m)
- Let $f:\mathbb{R} \to \mathbb{R}$ be a function, so that $f(x)=\lfloor{2\lceil{\frac x2}\rceil}+\frac 12 \rfloor$ for every $x \in \mathbb{R}$.

$a_n$ is a recursive function where

$a_1 = 3$

$a_n = a_{\lfloor \frac{n}{2} \rfloor} + a_{\lceil \frac{n}{2} \rceil} + 3n+1$

I am stuck at the point where I need to prove that $P(n+1)$ is true

$a_{\lfloor \frac{n+1}{2} \rfloor} + a_{\lceil \frac{n+1}{2} \rceil} + 3(n+1) + 1 \leq 3 \cdot k 2^k + 4 \cdot 2^k -1 $

It is the fact that I don’t know how to rewrite the floor and ceiling functions to something else.

Can someone give me some ideas how to proceed with this?

- Limit of sequence with floor function problem
- Evaluate $\lim_{x \to 0} (x\lfloor\frac{1}{x}\rfloor)$
- Does $\lim_{x \to 0+} \left(x\lfloor \frac{a}{x} \rfloor\right)=a?$
- Finding the summation of the floor of the series identity
- Floor function properties: $ = + $ and $ = \sum_{k = 0}^{n - 1} $
- Does $\lfloor \sqrt{p} \rfloor$ generate all natural numbers?
- Proving a limit of a trigonometric function: $\lim_{x \to 2/\pi}\lfloor \sin \frac{1}{x} \rfloor=0$
- How many numbers less than $x$ have a prime factor that is not $2$ or $3$
- Is there a closed form of the sum $\sum _{n=1}^x\lfloor n \sqrt{2}\rfloor$
- How do I evaluate this sum(involving the floor function)?

Hint: Your induction should be for $k$, not for $n$

$P(k): n \leq 2^k \Longrightarrow a_n \leq 3 \cdot k2^k + 4 \cdot

2^k-1$

For $k=1$ it is trivial

Suppose $P(k)$ is true and prove that $P(k+1)$ is true

$P(k+1): n \leq 2^{k+1} \Longrightarrow a_n \leq 3 \cdot (k+1)2^{k+1} + 4 \cdot

2^{k+1}-1$

But if $n\le 2^{k+1}$ then both $\lfloor n/2\rfloor\le 2^k$ and $\lceil n/2\rceil\le 2^k$. Next, write the recurrence and apply the induction hypothesis.

$a_n = a_{\lfloor \frac{n}{2} \rfloor} + a_{\lceil \frac{n}{2} \rceil} + 3n+1 \le 2\cdot(3 \cdot k2^k + 4 \cdot

2^k-1)+3n+1\le 3 \cdot (k+1)2^{k+1} + 4 \cdot

2^{k+1}-1$

After simplifications, the last inequality is equivalent with $n\le 2^{k+1}$, which is true by assumption.

- Is taking projective closure a functor?
- Prove that $H$ is a subgroup of an abelian group $G$
- A nice pattern for the regularized beta function $I(\alpha^2,\frac{1}{4},\frac{1}{2})=\frac{1}{2^n}\ $?
- Entire function with vanishing derivatives?
- Summation of Fibonacci numbers $F_n$ with $n$ odd vs. even
- Norm $L^2$ of a multivariate function
- (undergraduate) Algebraic Geometry Textbook Recommendations
- The number of grid points near a circle.
- $L^p$-norm of a non-negative measurable function
- Prove that any set of vectors $S \subset \mathbb{R}^n$ containing the zero vector cannot be linearly independent
- Circular determinant problem
- What are the most prominent uses of transfinite induction outside of set theory?
- First Order Logic: Prove that the infinitely many twin primes conjecture is equivalent to existence of infinite primes
- Prove that $G \cong\mathrm{Inn}(G)$ if and only if $Z(G)$ is trivial
- an example of an interesting connected topological space