503 Service Unavailable
No server is available to handle this request.503 Service Unavailable
No server is available to handle this request.503 Service Unavailable
No server is available to handle this request.Additive and Multiplicative Partitions
Additive and Multiplicative Partitions
For any positive integer n let A(n) denote the number of distinct
ways in which n can be expressed as a sum of positive integers,
without regard to the ordering of the terms.
Thus the function A(n)
signifies the number of distinct additive partitions of n.
also define a(n) the same as A(n) except that distinct orderings of
the terms are counted as distinct partitions.
To illustrate, with
n=5 we have the following seven partitions
so A(5) = 7.
On the other hand, if we take the ordering of the
terms into account, we see that the expression "5" still contributes
just one partition, but each of the expressions "4+1" and "3+2"
contribute two partitions, because we can reverse the order of the
Likewise each of the expressions "3+1+1" and "2+2+1"
have three distinct permutations, the expression "2+1+1+1" has four,
and the expression "1+1+1+1+1" has only one.
Thus the total number
of additive partitions of 5, taking order into account, is
1 + 2 + 2 + 3 + 3 + 4 + 1
In general we can see that a(n) = 2^(n-1), because if we place n
objects in a line the number of additive partitions is just the number
of ways that we can place "walls" in the n-1 gaps between the objects.
Therefore, this function is quite simple to compute.
However, the
function A(n) is not quite so trivial.
Goldbach once wrote to Euler asking him to characterize the values
of A(n) for any integer n.
In his usual creative fashion, Euler
originated the method of "generating functions" to provide an answer.
He considered the infinite product
(1 + x + x^2 + ...)(1 + x^2 + x^4 + ...)(1 + x^3 + x^6 + ...)...
If we expand this product we see that the coefficient of x^n is
the number of ways in which n can be expressed as a sum of one number
from each of the sets {0,1,2,...}, {0,2,4,...}, {0,3,6,...}, and so on.
This equals A(n), because each of these sums uniquely corresponds to a
distinct sum of a certain number of 1's, a certain number of 2's, a
certain number of 3's, and so on. Thus these sums represent all the
partitions of n, so the coefficient of x^n in the expanded product is
precisely A(n).
Euler remembered that, as Euclid showed, the geometric series can be
expressed formally as
1 + x + x^2 + x^3 + x^4 + ...
and likewise the infinite sum 1 + x^2 + x^4 + ... can be expressed as
1/(1 - x^2), and so on.
Thus we have
( ----- )( ------- )( ------- )...
A(0) + A(1)x + A(2)x^2 + ...
It's also worth noting that if we include just the first k factors
on the left hand side, then the coefficient of n is the number of
partitions of n into k or fewer parts.
We will call this A_k(n).
Euler's generating function for the partitions of n is certainly
clever, and leads to many powerful techniques in combinatorics, but
it isn't the easiest way to compute A(n) or A_k(n).
Some other ways
are discussed in , but here we will
just mention one very elementary methods.
A table of A_k(n) can be
constructed quite simply based on the following two observations:
(1) The number of partitions into k or fewer parts is equal
to the number of partitions into exactly k parts plus the
number of partitions into k-1 or fewer parts.
(2) Given a partition of n into exactly k parts, we can
subtract 1 from each part, leaving a partition of n-k
in k or fewer parts.
Thus there is a one-to-one
correspondence between the partitions of n into
exactly k parts and the partitions of n-k into k
or fewer parts.
Putting these two facts together, we have the simple recurrence
A_{k-1}(n)
with which we can easily generate a table such as shown below.
--- --- --- --- --- --- --- --- --- --- --- --- --- ---
99 100 101 101
90 105 116 123 128 131 133 134 135
The total number of partitions A(n) is obviously just A_n(n) from
this table, so we have the sequence of values for A(n) for n=1,2,...
The above discussion focused on additive partitions, but we can also
consider multiplicative partitions, i.e., the number of ways in which
a positive integer n can be expressed as a product of integers (each
greater than 1).
Let M(n) denote the number of multiplicative
partitions if the ordering of the factors is NOT taken into account,
and let m(n) denote the number of multiplicative partitions of n if
the ordering IS taken into account.
Neither of these functions of
entirely trivial.
Clearly the number of multiplicative partitions of the integer
n = (p1^a1)(p2^a2)...(pk^ak)
depends only on the non-zero exponents a1,a2,..,ak.
Therefore, it's
more appropriate to write m(n) as m(a1,a2,..,ak).
These numbers can
most efficiently be generated by means of recurrence relations,
similar to those that generate the binomial coefficients.
In general,
m(a1,a2,..,ak) is the sum of all the m(b1,b2,..,bk) for bj ranging
from 0 to aj, excluding the single cell with bj=aj for j=1,2,..,k.
Consequently, the values of M can be generated by a recurrence based
on the surrounding values using inclusion-exclusion.
For example,
in the trivial case k=1 we have
m(a1) = 2 [ m(a1-1) ]
with the initial value F(0) = 1/2.
This generates the sequence of
m(a1) = (1/2) 1
Likewise with k=2 we have the recurrence
m(a1,a2) = 2 [ m(a1-1,a2) + m(a1,a2-1) - m(a1-1,a2-1) ]
and we can take the initial value m(0,0)=1/2 to generate all subsequent
slices (although this assignment messes up the sum of the rectangles
discussed below.)
This generates the symmetrical array
Notice that each cell in this table is the corner of a rectangle of
which the opposite corner is the (0,0) cell, and the number in the
cell equals the sum of all the other entries in that rectangle.
enables us to determine the recurrence formula noted above.
find m(2,2) we simply compute m(2,2) = 2[8+8-3] = 26.
Likewise to find
m(2,3) we just compute m(2,3) = 2[26+20-8] = 76.
(By the way, note
that it's helpful to set m(0,0) = 1/2 instead of 1 to be consistent
with the recurrence formulas.)
With k=3 we consider a three-dimensional array of numbers, and each
value of M is the sum of all the other values inside the rectangular
box containing the origin.
This leads to the recurrence formula
m(a1,a2,a3) = 2 [ m(a1-1,a2,a3) + m(a1,a2-1,a3) + m(a1,a2,a3-1)
- m(a1-1,a2-1,a3) - m(a1-1,a2,a3-1) - m(a1,a2-1,a3-1)
+ m(a1-1,a2-1,a3-1) ]
again setting the initial value m(0,0,0) = 1/2 to simplify the initial
conditions.
For k=3 the a3=0 plane is identical to the k=2 array
shown above, (as are the a1=0 and a2=0 planes, by symmetry).
the a3=1 plane is
20 132 604
In general, we have a recurrence for m(a1,a2,..,ak) as an inclusion-
exclusion sum of 2^k - 1 terms.
Of course, we don't really need to
save the whole array, because of all the symmetry.
To cover numbers
whose sum of exponents in their prime factorizations are
s = a1 + a2 + ... + ak
we need only give A(s) numbers, where A(s) is the number of additive
partitions of s.
So we can make a little table of the non-zero
exponents, without regard to order
a1 a2 a3 a4 a5 a6 a7
m(a1,a2,..)
-- -- -- -- -- -- --
-----------
10404 = (102)^2
This covers any number whose sum of exponents is 7 or less, and this
table can easily be extended indefinitely.
For example that to
determine m(2,1,1,1) in the above table, we proceed like this
m(2,1,1,1) = 2[ m(1,1,1,1) + 3m(2,1,1) - 3m(1,1,1) - 3m(2,1)
+ m(2) + 3m(1,1) - m(1) ]
Likewise to compute m(1,1,1,1,1) we proceed like this
m(1,1,1,1,1) = 2[ 5m(1,1,1,1) - 10m(1,1,1) + 10m(1,1)
- 5m(1) + m(0) ]
If we neglect the ordering of factors, then M(a1,a2,..) represents the
number of multiplicative partitions of n = p1^a1 p2^a2.. pk a^k.
we can define M_d(a1,a2,...) as the number of partitions into d or
fewer factors.
Some of these values are obvious.
For example, we
clearly have
At the other extreme, if p1,p2,...,pk are all distinct primes, then
M(1,1,...,1) =
---------------------------------------
(1!)^c1 c1! (2!)^c2 c2! ... (k!)^ck ck!
where the summation is taken over all sets of non-negative integers
ci such that
For more general sets of exponents, the multiplicative partitions are
as tabulated below for s ranging from 1 to 8.
M_d - M_{d-1}
i =1 2 3 4 5 6 7 8
M(a1,a2,..)
- - - - - - - -
----------
1 1 1 1 1 1
31 104 102
35 128 135
2 1 1 1 1 1
47 196 215
1 1 1 1 1 1 1
63 301 350 140
29 108 132
31 120 152
35 148 198 124
40 183 259 163
39 164 206 123
47 224 310 191
53 274 403 251
3 1 1 1 1 1
63 342 496 300
2 2 1 1 1 1
71 416 643 397 117
2 1 1 1 1 1 1
1 1 1 1 1 1 1 1
1 127 966 6 28 1
For an interesting application of both the additive and multiplicative
partition functions, see .
Incidentally, if we run the recurrence for m(a1,a2) in reverse to
determine the coefficients of progressively earlier cells, we find the
Each row, column, and hypotenuse of each of these arrays is
proportional to a row of Pascal's triangle.当前位置： &
凌派最低10.48万元起售 价格直降1万
来源:&汽车点评
;08U 07:15
　　[汽车点评 福州行情&原创] 近日，编辑从福州地区广汽4S店获悉，店内现车充足销售，颜色可选。售价方面，时下购车部分车型可优惠1万元。感兴趣的朋友可以到店咨询购买，详情见下表：
凌派最新价格变化表
指导价（万元）
现价（万元）
凌派 2015款 1.8L 自动超配限量版
凌派 2015款 1.8L 自动豪华版
凌派 2015款 1.8L 自动舒适版
凌派 2015款 1.8L 自动版
凌派 2015款 1.8L 手动豪华版
凌派 2015款 1.8L 手动舒适版
福州地区4S经销商 日行情
　　在保养方面，广汽本田凌派享受厂商提供的三年或10万公里整车质保，常规保养周期为5000公里/次，更换机油机滤的小保养费用在400元左右；更换机油三滤的大保养费用在1000元上下。
&&凌派细节展示
● 编辑点评：
　　广汽本田凌派可视为本田Concept C的量产版车型，外观方面与、等车型相比更加时尚，运动，而大面积的镀铬装饰也能给消费者留下深刻的印象。另外，在尺寸方面，×1505mm的长×宽×高、2650mm的轴距与东本旗下旗鼓相当。
　　注：汽车市场价格多变，文章内的价格信息为编辑在市场上采集到的当日实时价格，以当日为准。同时此价格是经销商的个体行为，所以文中价格仅供参考。另外，文中图片为车型资料图片，价格信息与图片拍摄地点无关。
加入福州汽车点评网团购QQ群：
通过汽车点评网团报名可享受本市最低团购优惠政策。
团购报名咨询热线：
商家名称：广汽本田汽车福州闽都特约销售服务店咨询电话：400-830-8670店面地址：福新东路360号（茶会小区斜对面/亚太汽配城旁）
［支持键盘“← →”键翻页］
责任编辑：卓林美
*意向车型：
请选择品牌
请选择车系
请选择车型
请选择意向车型
*您的城市：
请选择省份
请选择城市
请选择您的城市
*您的姓名：
女士请填写您的姓名
*手机号码：
请填写您的手机号码
(信息保密，不会对外公开)
提交成功，请等待经销商联系您。
奥兹莫比尔