MHB Prove a_n=⌊2^n√2⌋ contains infinitely many composite numbers

  • Thread starter Thread starter lfdahl
  • Start date Start date
  • Tags Tags
    Composite Numbers
lfdahl
Gold Member
MHB
Messages
747
Reaction score
0
Prove, that the sequence:

$a_n = \left\lfloor{2^n\sqrt{2}}\right\rfloor,\;\;\;\;n = 1,2,3,..$- contains infinitely many composite numbers.
 
Mathematics news on Phys.org
Suggested solution:
Suppose that the sequence ${a_n}$ contains only finitely many composite numbers, i.e. there exists an $N$ such that for all $n>N$, $a_n$ is odd.

Consider the binary representation of $a_n$ ($n>N$). The last digit of $a_n$ must be $1$, which in turn implies, that the fractional part of binary representation of $\sqrt{2}$ has all its digits equal to $1$ after the $N$´th position. This contradicts the irrationality of $\sqrt{2}$.
 
lfdahl said:
Suggested solution:
Suppose that the sequence ${a_n}$ contains only finitely many composite numbers, i.e. there exists an $N$ such that for all $n>N$, $a_n$ is odd.

Consider the binary representation of $a_n$ ($n>N$). The last digit of $a_n$ must be $1$, which in turn implies, that the fractional part of binary representation of $\sqrt{2}$ has all its digits equal to $1$ after the $N$´th position. This contradicts the irrationality of $\sqrt{2}$.

Hats off to you
 
kaliprasad said:
Hats off to you

The solution is not mine :o
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
Back
Top