I have an answer from dropping the floor function is summing to be $\left({1 - \frac{1}{p}}\right) N + 2 \left({p - 1}\right)$. Not certain if the order of part should be $\mathcal{O} \left({1}\right)$. Also $N \ge p$ and $N$ and $p$ are positive integers.
2026-04-03 08:26:17.1775204777
What is the full asymptotic expansion of $\sum\limits_{a = 1}^{p - 1} \lfloor{\frac{N + a}{p}}\rfloor$ as $N \rightarrow \infty$
104 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in ASYMPTOTICS
- 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
- How to find the asymptotic behaviour of $(y'')^2=y'+y$ as $x$ tends to $\infty$?
- Correct way to prove Big O statement
- Proving big theta notation?
- Asymptotics for partial sum of product of binomial coefficients
- Little oh notation
- Recurrence Relation for Towers of Hanoi
- proving sigma = BigTheta (BigΘ)
- What's wrong with the boundary condition of this $1$st order ODE?
- Every linearly-ordered real-parametrized family of asymptotic classes is nowhere dense?
Related Questions in CEILING-AND-FLOOR-FUNCTIONS
- System of simultaneous equations involving integral part (floor)
- Is there a limit?
- Largest value of sequence
- Does $x+\sqrt{x}$ ever round to a perfect square, given $x\in \mathbb{N}$?
- Fractional part of integer multiples
- Proof regarding the ceiling function.
- Find number of solutions of $(x-1)^2+\lceil x \rceil=4$
- Let $n$ is a natural number. Find $\int_0^n 2x \lfloor x \rfloor dx$
- Inverse cosine inside floor function derivative
- Floor function problem
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?
Edit After the comment by reuns, I added details for the closed-form after the asymptotic bounds. We will first show that $$ \boxed{\sum_{a=1}^{p-1} \left\lfloor \frac{N+a}{p}\right\rfloor = \left(\,1-\frac{1}{p}\,\right)N + O(1)}$$ and then, with the implications of the comment, we will show explicitly that $$ \boxed{\sum_{a=1}^{p-1} \left\lfloor \frac{N+a}{p}\right\rfloor = N - \left\lfloor \frac{N}{p}\right\rfloor}$$
Original There is a slight mistake in your upperbound, but I'll address it. We may obtain bounds: $$ \sum_{a=1}^{p-1} \left(\, \frac{N+a}{p} - 1 \,\right) \leq \sum_{a=1}^{p-1}\left\lfloor\frac{N+a}{p}\right\rfloor \leq \sum_{a=1}^{p-1} \frac{N+a}{p} $$ where the left hand side becomes: $$(p-1)\frac{N}{p} + \frac{\tfrac12 p(p-1)}{p} - (p-1) = \left(1-\frac1p\right)N - \frac{p-1}{2} $$ and the right hand side: $$(p-1)\frac{N}{p} + \frac{\tfrac12 p(p-1)}{p} = \left(1-\frac1p\right)N + \frac{p-1}{2} $$
This gives: $$\left(1-\frac1p\right)N - \frac{p-1}{2} \leq\sum_{a=1}^{p-1}\left\lfloor\frac{N+a}{p}\right\rfloor \leq \left(1-\frac1p\right)N + \frac{p-1}{2}$$
so this simple approximation gives that $$\sum_{a=1}^{p-1}\left\lfloor\frac{N+a}{p}\right\rfloor \sim \left(1-\frac1p\right)N + O(1)$$ in particular, $$ \sup_N \left|\, \sum_{a=1}^{p-1}\left\lfloor\frac{N+a}{p}\right\rfloor - \left(1-\frac1p\right)N\,\right| \leq \frac{p-1}{2}$$
Added I haven't seen the result given by reuns in the comment section, so I'll give a quick proof that I came up with, but it was sufficiently obvious that I suspect this is a standard approach. $f(x)= x-\lfloor x\rfloor$ is a sawtoothed periodic wave, with a Fourier series given by $$\frac12 -\frac{1}{\pi} \sum_{n=1}^{\infty} \frac{1}{n}\sin (2n\pi x)$$ which converges to $f$ except at the integers, where $f$ has a jump discontinuity. Fourier series converge to the middle of a jump: there is a jump from $1$ to $0$ at each integer, so the series converges to $\frac12$.
If we let $a$ go over $1,\dotsc, p$ instead, then $\frac{N+a}{p}$ is an integer exactly once, so we may adjust for the $\frac12$ and sum over the Fourier series:
\begin{align} &\sum_{a=1}^p \left(\,\frac{N+a}{p} - \left\lfloor \frac{N+a}{p}\right\rfloor\,\right)\\ &= \sum_{a=1}^p\left(\, \frac12 -\frac{1}{\pi} \sum_{n=1}^{\infty} \frac{1}{n}\sin \left(2n\pi \frac{N+a}{p}\right)\,\right) - \frac12\\ &= \frac{p-1}{2} - \frac{1}{\pi} \sum_{n=1}^{\infty} \sum_{a=1}^p \frac{1}{n}\sin \left(\, \frac{2n\pi N}{p} + \frac{2n\pi a}{p}\,\right)\\ &= \frac{p-1}{2} - \frac{1}{\pi} \sum_{n=1}^{\infty} \sum_{a=1}^p \frac{1}{n}\sin\frac{2n\pi N}{p} \cos \frac{2n\pi a}{p} - \frac{1}{\pi} \sum_{n=1}^{\infty} \sum_{a=1}^p \frac{1}{n}\sin\frac{2n\pi a}{p} \cos \frac{2n\pi N}{p}\\ &= \frac{p-1}{2} - \frac{1}{\pi} \sum_{n=1}^{\infty} \frac{1}{n}\sin\frac{2n\pi N}{p} \underbrace{\sum_{a=1}^p \cos \frac{2n\pi a}{p}}_{=\; 0} - \frac{1}{\pi} \sum_{n=1}^{\infty} \frac{1}{n} \cos \frac{2n\pi N}{p} \underbrace{\sum_{a=1}^p \sin\frac{2n\pi a}{p}}_{=\; 0} \end{align} where the latter step may be easily seen by considering the real and imaginary parts of the geometric series expansion of $$0 = \frac{1 - \left(e^{i\tfrac{2\pi n}{p}}\right)^p}{1-e^{i\tfrac{2\pi n}{p}}}$$
Now, applying this to the original bounds: \begin{align} \sum_{a=1}^{p-1} \left(\,\frac{N+a}{p} - \left\lfloor \frac{N+a}{p}\right\rfloor\,\right) &= \frac{p-1}{2} - \left(\,\frac{N+p}{p} - \left\lfloor \frac{N+p}{p}\right\rfloor \,\right)\\ &= \frac{p-1}{2} - \left(\,\frac{N}{p} - \left\lfloor \frac{N}{p}\right\rfloor \,\right) \end{align} Finally allowing us to compute: \begin{align} \sum_{a=1}^{p-1} \left\lfloor \frac{N+a}{p}\right\rfloor &= \sum_{a=1}^{p-1} \frac{N+a}{p} - \frac{p-1}{2} + \frac{N}{p} - \left\lfloor \frac{N}{p}\right\rfloor\\ &= \left(\,1-\frac1p\,\right) N + \frac{p-1}{2} - \frac{p-1}{2} + \frac{N}{p} - \left\lfloor \frac{N}{p}\right\rfloor\\ &= N - \left\lfloor \frac{N}{p}\right\rfloor \end{align}