Is it true that there are infinitely many square numbers in the sequence $\left \lfloor n \sqrt{2} \right \rfloor $ with $n$ is a whole number? If not, how can we prove it?
2026-03-25 04:43:56.1774413836
Is it true that there are infinitely many square numbers of the form $\lfloor n\sqrt{2}\rfloor$?
756 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in SEQUENCES-AND-SERIES
- How to show that $k < m_1+2$?
- Justify an approximation of $\sum_{n=1}^\infty G_n/\binom{\frac{n}{2}+\frac{1}{2}}{\frac{n}{2}}$, where $G_n$ denotes the Gregory coefficients
- Negative Countdown
- Calculating the radius of convergence for $\sum _{n=1}^{\infty}\frac{\left(\sqrt{ n^2+n}-\sqrt{n^2+1}\right)^n}{n^2}z^n$
- Show that the sequence is bounded below 3
- A particular exercise on convergence of recursive sequence
- Proving whether function-series $f_n(x) = \frac{(-1)^nx}n$
- Powers of a simple matrix and Catalan numbers
- Convergence of a rational sequence to a irrational limit
- studying the convergence of a series:
Related Questions in COMBINATORICS
- Using only the digits 2,3,9, how many six-digit numbers can be formed which are divisible by 6?
- The function $f(x)=$ ${b^mx^m}\over(1-bx)^{m+1}$ is a generating function of the sequence $\{a_n\}$. Find the coefficient of $x^n$
- Name of Theorem for Coloring of $\{1, \dots, n\}$
- Hard combinatorial identity: $\sum_{l=0}^p(-1)^l\binom{2l}{l}\binom{k}{p-l}\binom{2k+2l-2p}{k+l-p}^{-1}=4^p\binom{k-1}{p}\binom{2k}{k}^{-1}$
- Algebraic step including finite sum and binomial coefficient
- nth letter of lexicographically ordered substrings
- Count of possible money splits
- Covering vector space over finite field by subspaces
- A certain partition of 28
- Counting argument proof or inductive proof of $F_1 {n \choose1}+...+F_n {n \choose n} = F_{2n}$ where $F_i$ are Fibonacci
Related Questions in NUMBER-THEORY
- Maximum number of guaranteed coins to get in a "30 coins in 3 boxes" puzzle
- Interesting number theoretical game
- Show that $(x,y,z)$ is a primitive Pythagorean triple then either $x$ or $y$ is divisible by $3$.
- About polynomial value being perfect power.
- Name of Theorem for Coloring of $\{1, \dots, n\}$
- Reciprocal-totient function, in term of the totient function?
- What is the smallest integer $N>2$, such that $x^5+y^5 = N$ has a rational solution?
- Integer from base 10 to base 2
- How do I show that any natural number of this expression is a natural linear combination?
- Counting the number of solutions of the congruence $x^k\equiv h$ (mod q)
Related Questions in CONTINUED-FRACTIONS
- Formula for the simple reapeted infinitely continued fractions
- Infinite continued fractions and convergents
- Convergence of $\ln\frac{x}{\ln\frac{x}{\ln x...}}$
- Find $\frac{a}{b} \in \mathbb{Q}$ such that $ |\,\frac{a}{b} - \sqrt{2}|_3 < \epsilon $
- $\sqrt{\frac{\pi e}{2}}=\frac{1}{1+\mathrm{K}_{i=1}^{\infty}{\frac{i}{1}}}+\sum_{n=0}^{\infty}{\frac{1}{(2n+1)!!}}$ implies $\sqrt{\pi e/2}\notin Q$?
- is there an algorithm that generates the continued fraction of a product of convergent continued fractions?
- continued fraction of $\sqrt{41}$
- Fundamental solution to specific Pell equation
- Continued fraction of binomial function $(1+z)^{1/4}$
- How does the convergence sector of a continued fraction depend on the order where it is truncated?
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
Interesting question. Beatty sequences give that every positive natural number is either of the form $\lfloor \sqrt{2}\,a\rfloor$ or of the form $\lfloor (2+\sqrt{2})\,b\rfloor$, for some $a,b\in\mathbb{N}$. If we assume that only a finite number of squares belong to the first sequence, we have that every large enough square is of the form $\lfloor (2+\sqrt{2})\,b\rfloor$ for some $b\in\mathbb{N}$. Now we may use the general properties of continued fractions to derive a contradiction. We have that $$ \sqrt{2}=[1;2,2,2,2,\ldots] $$ and if $\left\{\frac{p_k}{q_k}\right\}$ is the sequence of convergents of such continued fraction, $$ q_k^2 \sqrt{2}-p_k q_k = \frac{(-1)^k}{2\sqrt{2}}+o(1) $$ as $k\to +\infty$. Similarly, $$ \frac{1}{2+\sqrt{2}}=[0;3,2,2,2,\ldots] $$ and if $\left\{\frac{p_k}{q_k}\right\}$ is the sequence of convergents of such continued fraction, $$ \frac{q_k^2}{2+\sqrt{2}}-p_k q_k = \frac{(-1)^k}{2\sqrt{2}}+o(1) $$ as $k\to +\infty$. Assuming that $q_k^2$ belongs to the complementary Beatty sequence we get $$ b \leq \frac{q_k^2}{2+\sqrt{2}} \leq b+\frac{1}{2+\sqrt{2}},\qquad b\in\mathbb{N} $$ which contradicts the previous statement if $k$ is large and odd.
The same argument works also by switching the roles of the original Beatty sequence and its complementary sequence. In particular we have that
A more advanced approach is proving that the set $\{\lfloor n\sqrt{2}\rfloor:n\geq 0\}$ contains a difference set $S-S$ where $S\subset\mathbb{N}$ has a positive density. Indeed, by the Furstenberg-Sárközy theorem there are infinite squares in any difference set of the previous form. This is the quantitative version of the fact that the squares form a Heilbronn set, i.e. a neighbourhood of zero in the Bohr topology.
The first positive squares of the form $\lfloor \sqrt{2}\,a\rfloor$ are $$1, 4, 9, 16, 25, 36, 49, 100, 121, 144, 169, 196, 289, 400.$$ The first positive squares of the complementary form $\lfloor \left(2+\sqrt{2}\right)\,b\rfloor$ are $$64, 81, 225, 256, 324, 361, 484, 529.$$