Forgot password?
 Register account
View 2120|Reply 7

[数论] 将正整数$n$拆为连续正整数之和,要如何拆?

[Copy link]

411

Threads

1623

Posts

110K

Credits

Credits
11833

Show all posts

abababa Posted 2019-9-8 20:12 |Read mode
如题,将正整数$n$拆为连续正整数之和,有多少种拆法?要如何拆?
感觉和$n$的一类约数的数量有关,但不知怎么证明。

413

Threads

1431

Posts

110K

Credits

Credits
11100

Show all posts

realnumber Posted 2019-9-8 23:28
连续正整数依次是m,m+1,...,m+t-1,其中m,t都是正整数.
2n=t(2m+t-1),问题就是给定n,有几组解(t,m)
比如n=1,解只能是(1,1),
n=2,全部解是(1,2)
n=3,(1,3),(2,1)
n=4,(1,4)
n=12,(1,12),(3,3),不知道怎么做下去了

458

Threads

951

Posts

9832

Credits

Credits
9832

Show all posts

青青子衿 Posted 2019-9-9 09:17
Last edited by 青青子衿 2019-9-9 09:28应该是要解出这个二次不定方程。
\( \dfrac{(2a+k-1)\,k}{2} =n \)
下面的代码是去掉平凡解后剩下的情形。
Table[Solve[(k (2 a + k - 1))/2 == nn && k > 1 && a > 0, {a, k},
   Integers], {nn, 1, 22}] // Column
感觉这个解与\(n\)除某数所得结果有关。
9 + 10 + 11 + 12 + 13 + 14 + 15 + 16 = 100
18 + 19 + 20 + 21 + 22 = 100

411

Threads

1623

Posts

110K

Credits

Credits
11833

Show all posts

 Author| abababa Posted 2019-9-9 19:03
回复 3# 青青子衿

应该是和$n$的正的奇约数有关,我试了几个都是这样,例如$100=2^2\cdot5^2$,有$2+1=3$个正的奇约数,就有$3-1$个解。$21=3\cdot7$,有$(1+1)(1+1)=4$个正的奇约数,就有$4-1$个解。试了3楼几个例子都是这样,能不能证明呢?

458

Threads

951

Posts

9832

Credits

Credits
9832

Show all posts

青青子衿 Posted 2019-9-26 10:49
Last edited by 青青子衿 2019-9-26 10:58回复 4# abababa
这个结论是正确的。
任意整数表为相继整数之和的方法数同它的奇因子个数一样多。(这种计数是将自身也算上的)
参见《History of the Theory of Numbers, Volume II Diophantine Analysis》第139页。

在Oeis上,有奇因子个数序列
A001227
Number of odd divisors of n.
Also number of partitions of n into consecutive positive integers
including the trivial partition of length 1
(e.g., 9 = 2+3+4 or 4+5 or 9 so a(9)=3).
(Useful for cribbage players.)

411

Threads

1623

Posts

110K

Credits

Credits
11833

Show all posts

 Author| abababa Posted 2020-11-26 16:36
回复 5# 青青子衿

我的水平读英文的还是很吃力,一边验算一边对照,最近终于读懂了这篇。
主楼这个问题经常在小学数学竞赛里出现,要说明操作过程并不难,但想证明它的原理就不太容易了。小学有些竞赛题还是挺有意思的,特别是数论和组合问题,我觉得证明上的难度比中学也不差。

3159

Threads

7941

Posts

610K

Credits

Credits
63770
QQ

Show all posts

hbghlyj Posted 2022-8-5 05:49
Also explained in an answer by André Nicolas.
Let $w$ be a positive integer. We look for integers $m\ge 0$, $n>m$ such that$$w=(1+2+\cdots +n)-(1+2+\cdots +m).$$With a little manipulation, we can rewrite this as$$2w=(n-m)(n+m+1).$$Temporarily, we allow $n-m=1$, even though this corresponds to expressing $w$ as the "sum" of one integer. The numbers $n-m$ and $n+m+1$ are of opposite parity and have product $2w$. Note also that $n-m< n+m+1$. Now take any two numbers $x$, $y$ of opposite parity whose product is $2w$. Set $n-m=x$ and $n+m+1=y$. We can solve for $n$ and $m$, and obtain a representation of $w$ as a sum of consecutive integers (again, possibly only one such integer.) We obtain such $x$, $y$ of opposite parity as follows. Let $2w=2^k q$ where $q$ is odd. Express $q$ as a product of two positive integers $u$ and $v$, not necessarily distinct. Multiply one of $u$ or $v$ (say $v$) by $2^k$, and let $x$ be the smaller of $u$ and $2^k v$, and $y$ the larger. So the number of representations of $w$ as a sum of consecutive positive integers is $d(q)$, the number of divisors of $q$. If we do not want to allow the trivial representation of $w$ as the short sum $w$, the number of representations is $d(q)-1$. If $w$ is a power of $2$, then $q=1$, and therefore there are no representations. If$$w=2^{a_0}p_1^{a_1}p_2^{a_2}\cdots p_k^{a_k},$$where the $p_1,p_2,\dots,p_k$ are distinct odd primes, then the number of non-trivial representations is$$(a_1+1)(a_2+1)\cdots(a_k+1)-1.$$In particular, if $w$ is not a power of $2$, there is at least one non-trivial representation.

3159

Threads

7941

Posts

610K

Credits

Credits
63770
QQ

Show all posts

hbghlyj Posted 2022-8-5 05:51
Nyblom, M. A. On the representation of the integers as a difference of nonconsecutive triangular numbers. Fibonacci Quarterly 39 (2001), no. 3, 256–263.

Theorem 2.1: Let $M \in \mathbb{Z} \backslash\{0\}$, then the number of distinct representations of $M$ as a difference of nonconsecutive triangular numbers is given by $N_{\Delta}(M)=D-1$, where $D$ is the number of odd divisors of $M$.

Proof: Without loss of generality, we may assume that $M$ is a positive integer. Our aim here will be to determine whether there exists $x, y \in \mathbf{N} \backslash\{0\}$ such that $M=T(x)-T(y)$. By completing the square, observe that the previous equation can be recast in the form $8 M=X^{2}-Y^{2}$, where $X=2 x+1$ and $Y=2 y+1$. To analyze the solvability of this equation, suppose $a b=8 M$, where $a, b \in \mathbf{N} \backslash\{0\}$ and consider the following system of simultaneous linear equations:
$$\tag1\label1
\begin{aligned}
&X-Y=a \\
&X+Y=b
\end{aligned}
$$
whose general solution is given by
$$
(X, Y)=\left(\frac{a+b}{2}, \frac{b-a}{2}\right) .
$$
Now, for there to exist a representation of $M$ as a difference of nonconsecutive triangular numbers, one must be able to find factorizations $a b=8 M$ for which the system \eqref{1} will yield a solution $(X, Y)$ in odd integers.
Remark 2.1: We note that it is sufficient to consider only \eqref{1}, since if for a chosen factorization $a b=8 M$ an odd solution pair $(X, Y)$ is found, then the corresponding representation $M=T(x)-$ $T(y)$ is also obtained if the right-hand side of \eqref{1} is interchanged. Indeed, one finds upon solving
$$
\begin{aligned}
&X^{\prime}-Y^{\prime}=b \\
&X^{\prime}+Y^{\prime}=a
\end{aligned}
$$
where $X^{\prime}=2 x^{\prime}+1, Y^{\prime}=2 y^{\prime}+1$ that
$$
X^{\prime}=\frac{a+b}{2} \text { and } Y^{\prime}=\frac{a-b}{2}=-Y .
$$
Thus, $x^{\prime}=x$ while $y^{\prime}=(-Y-1) / 2=-y-1$, so
$$
T\left(y^{\prime}\right)=\frac{(-y-1)(-y)}{2}=T(y) \text { and } T\left(x^{\prime}\right)-T\left(y^{\prime}\right)=T(x)-T(y)=M .
$$
We deal with the existence or otherwise of those factorizations $a b=8 M$ which give rise to an odd solution pair $(X, Y)$ of \eqref{1}. It is clear from the general solution of \eqref{1} that, for $X$ to be an odd positive integer $a, b$ must be at least chosen so that $a+b=2(2 s+1)$ for some $s \in \mathbb{N} \backslash\{0\}$. As $a b$ is even, this can only be achieved if $a$ and $b$ are also both even. Furthermore, such a choice of $a$ and $b$ will also ensure that $Y=X-\alpha$ is odd. With this reasoning in mind, it will be convenient to consider the following cases separately.
Case 1. $M=2^{n}, n \in \mathbb{N} \backslash\{0\}$.
In this instance, consider $8 M=2^{n+3}=a b$, where $(a, b)=\left(2^{i}, 2^{n+3-i}\right)$ for $i=0,1, \ldots, n+3$ with $a+b=2\left(2^{i-1}+2^{n+2-i}\right)=2(2 s+1)$ only when $i=1, n+2$. However, since both factorizations are equivalent, we need only investigate the solution of \eqref{1} when $(a, b)=\left(2,2^{n+2}\right)$. Thus, one finds
that $(X, Y)=\left(1+2^{n+1}, 2^{n+1}-1\right)$ and so $(x, y)=\left(2^{n}, 2^{n}-1\right)$. Hence, there exists only the trivial representation $M=T(M)-T(M-1)$.
Case 2. $M \neq 2^{n}$.
Clearly, $M=2^{m}(2 n+1)$ for an $n \in \mathbb{N} \backslash\{0\}$ and $m \in \mathbb{N}$. However, as there are more available factorizations of $8 M$, due to the presence of the term $2 n+1$, it will be necessary to consider the following subcases based on the possible factorizations $c d=2 n+1$.
Subcase 1. $(c, d)=(1,2 n+1)$.
Here consider $8 M=2^{m+3}(2 n+1)=a b$, where $(a, b)=\left(2^{i}, 2^{m+3-i}(2 n+1)\right)$ for $i=0,1, \ldots, m+3$ with $a+b=2\left(2^{i-1}+2^{m+2-i}(2 n+1)\right)=2(2 s+1)$ only when $i=1, m+2$. Solving (1) with $(a, b)=$ $\left(2,2^{m+2}(2 n+1)\right)$, one finds that $(x, y)=\left(2^{m}(2 n+1), 2^{m}(2 n+1)-1\right)$, which corresponds to a consecutive triangular number difference of $M$, while for $(a, b)=\left(2^{m+2}, 2(2 n+1)\right)$ we have $(x, y)=$ $\left(2^{m}+n, n-2^{m}\right)$ and so
$$
M=T\left(2^{m}+n\right)-T\left(y^{\prime}\right),
$$
where $y^{\prime}=2^{m}-n-1$ if $y<0$ and $y^{\prime}=y$ otherwise. In either situation, one has $\left|x-y^{\prime}\right|>1$, giving a nonconsecutive triangular number representation of $M$.
Subcase 2. $(c, d), c \neq 1,2 n+1$.
Here consider $8 M=2^{m+3} c d=a b$, where $(a, b)=\left(2^{i} c, 2^{m+3-i} d\right)$ for $i=0,1, \ldots, m+2$ with $a+b=2\left(2^{i-1} c+2^{m+2-i} d\right)=2(2 s+1)$ when $i=1, m+2$. Solving (1) with $(a, b)=\left(2 c, 2^{m+2} d\right)$, one has $(X, Y)=\left(c+2^{m+1} d, 2^{m+1} d-c\right)$, from which it is immediate that

Mobile version|Discuz Math Forum

2025-5-31 11:27 GMT+8

Powered by Discuz!

× Quick Reply To Top Edit