Intereting Posts

Constructing the reciprocal of a segment
Show that $\lim _{r \to 0} \|T_rf−f\|_{L_p} =0.$
Prove that the empirical measure is a measurable fucntion
Parallelogram law in normed vector space without an inner product.
Reasons for coherence for bi/monoidal categories
Integration using residues
Prove: $\frac{x}{\sqrt{y}}+\frac{y}{\sqrt{x}}\geq \sqrt{x}+\sqrt{y}$
Determine the convergence of $ \sum_{n=1}^{\infty}\left $
application of strong vs weak law of large numbers
Soviet Russian mathematics books
On the difference between consecutive primes
Rank of the difference of matrices
Prove that $\lim_{n\rightarrow\infty}\frac{1}{n^{p+1}}\sum_{k=1}^{n}k^{p}=\frac{1}{p+1} $
Does strong law of large numbers hold for an average of this triangular array containing “almost i.i.d.” sequences?
Manifold with different differential structure but diffeomorphic

Prove that: $$6 \not\left|\ \left\lfloor\frac 1 {(\sqrt[3]{28} – 3)^{n}}\right\rfloor \ (n \in Z^+)\right.$$

($\lfloor x\rfloor$ = largest integer not exceeding $x$)

*I am very bad as English and number theory, please help me*

- Probability a product of $n$ randomly chosen numbers from 1-9 is divisible by 10.
- Prove that $2730$ divides $n^{13} - n$ for all integers $n$.
- Divide by a number without dividing.
- Divisibility criteria for $7,11,13,17,19$
- Show that $\gcd\left(\frac{a^n-b^n}{a-b},a-b\right)=\gcd(n d^{n-1},a-b)$
- Prove by induction $\vphantom{\Large A}3\mid\left(n^{3} - n\right)$

- Why does the elliptic curve for $a+b+c = abc = 6$ involve a solvable nonic?
- Prove $\gcd(a,b,c)=\gcd(\gcd(a,b),c)$.
- Proof: if $p$ is prime, and $0<k<p$ then $p$ divides $\binom pk$
- Sinha's Theorem for Equal Sums of Like Powers $x_1^7+x_2^7+x_3^7+\dots$
- Newman's “Natural proof”(Analytic) of Prime Number Theorem (1980)
- Number of Pythagorean Triples under a given Quantity
- Is there a Lucas-Lehmer equivalent test for primes of the form ${3^p-1 \over 2}$?
- What is known about these arithmetical functions?
- Suppose $a \in \mathbb{R}$, and $\exists n \in \mathbb{N}$, that $a^n \in \mathbb{Q}$, and $(a + 1)^n \in \mathbb{Q}$
- Prove that $1989\mid n^{n^{n^{n}}} - n^{n^{n}}$

Let $x=1/(\root3\of{28}-3)$. Then $\root3\of{28}=3+x^{-1}$. Cubing, $28=27+27x^{-1}+9x^{-2}+x^{-3}$, which says $x^3-27x^2-9x-1=0$. If we let $y$ and $z$ be the conjugates of $x$, and let $a_n=x^n+y^n+z^n$, then $a_n$ is an integer for all $n$, $a_n$ is the integer closest to $x^n$ (since $y^n$ and $z^n$ go to zero, quickly), and $a_n$ satisfies the recurrence $a_n=27a_{n-1}+9a_{n-2}+a_{n-3}$. Now you can figure out the initial conditions (that is, the values of $a_0,a_1,a_2$) and then you’ll be in a position to use the recurrence to work on the residue of $a_n$ modulo $6$. If you look a little more closely at $y^n$ and $z^n$, you may find that $a_n=[x^n]$, I’m not sure. Anyway, there’s some work to be done, but this looks like a promising approach.

If we set $\eta=\sqrt[3]{28}$ and $\omega=\dfrac1{\eta-3}=\dfrac{\eta^3-27}{\eta-3}=\eta^2+3\eta+9$, then, working $\bmod\ \eta^3-28$:

$$

\begin{align}

\omega^0&=1\\

\omega^1&=9+3\eta+\eta^2\\

\omega^2&=249+82\eta+27\eta^2\\

\omega^3&=6805+2241\eta+738\eta^2

\end{align}\tag{1}

$$

Solving the linear equations involved yields

$$

\omega^3-27\omega^2-9\omega-1=0\tag{2}

$$

Looking at the critical points of $x^3-27x^2-9x-1$, we see that it has one real root and two complex conjugate roots. The real root is $\omega\stackrel.=27.3306395$, and since the product of all the roots is $1$, the absolute value of the two conjugate roots is less than $\frac15$.

Let $\omega_0=\omega$ and $\omega_1$ and $\omega_2=\overline{\omega}_1$ be the roots of $x^3-27x^2-9x-1=0$. Symmetric functions and the coefficients of $(2)$ yield

$$

\begin{align}

a_0=\omega_0^0+\omega_1^0+\omega_2^0&=3\\

a_1=\omega_0^1+\omega_1^1+\omega_2^1&=27\\

a_2=\omega_0^2+\omega_1^2+\omega_2^2&=747\quad=27^2-2(-9)

\end{align}\tag{3}

$$

and, because each $\omega_k$ satisfies $(2)$,

$$

a_n=27a_{n-1}+9a_{n-2}+a_{n-3}\tag{4}

$$

Because $|\omega_1|=|\omega_2|<\frac15$, $|\,a_n-\omega^n\,|\le\frac2{5^n}$. Also, $(3)$ and $(4)$ show that $a_n\equiv3\pmod{6}$.

Therefore, $\omega^0=1$ and for $n\ge1$,

$$

\lfloor\omega^n\rfloor\in\{2,3\}\pmod{6}\tag{5}

$$

- Classification of operators
- Show that $\frac{xy}{z} + \frac{xz}{y} + \frac{yz}{x} \geq x+y+z $ by considering homogeneity
- Homology of cube with a twist
- How to justify term-by-term expansion to compute an integral
- Proving in Discrete Structures Problem that $2^N = \binom{N}{0} + \binom{N}{1} + \binom{N}{2} + \dots + \binom{N}{N}$
- How many ways to get at least one pair in a seven card hand?
- Is there a quick proof as to why the vector space of $\mathbb{R}$ over $\mathbb{Q}$ is infinite-dimensional?
- St. Petersburg Paradox
- Haar measure on O(n) or U(n)
- Expressing the roots of a cubic as polynomials in one root
- Zeros of analytic function and limit points at boundary
- How to calculate APR using Newton Raphson
- Prove that the series $\sum\limits_{n=0}^{\infty}X_n$ converges almost surely
- Evaluating $\int_0^{\pi/4} \ln(\tan x)\ln(\cos x-\sin x)dx=\frac{G\ln 2}{2}$
- The additive groups $\mathbb{R}^n$ for $n\geq 1$ are all isomorphic.