We prove some 3-adic congruences for binomial sums,which were conjectured by Zhi-Wei Sun.For example,for any integer m≡1（mod 3）and any positive integer n,we have v3（1/n ∑n-1X k=0 1/mk 2k/ k〉））≥min{3（n）,3（...We prove some 3-adic congruences for binomial sums,which were conjectured by Zhi-Wei Sun.For example,for any integer m≡1（mod 3）and any positive integer n,we have v3（1/n ∑n-1X k=0 1/mk 2k/ k〉））≥min{3（n）,3（m-1）-1},where 3（n）denotes the 3-adic order of n.In our proofs,we use several auxiliary combinatorial identities and a series converging to 0 over the 3-adic field.展开更多
This paper presents a unified bination algorithms （such as FrankWolfe problems. Global convergence results are framework of the nonmonotone convex comAlgorithm） for solving the traffic assignment established under m...This paper presents a unified bination algorithms （such as FrankWolfe problems. Global convergence results are framework of the nonmonotone convex comAlgorithm） for solving the traffic assignment established under mild conditions. The line search procedure used in our algorithm includes the nonmonotone Armijo rule, the non- monotone Goldstein rule and the nonmonotone Wolfe rule as special cases. So, the new algorithm can be viewed as a generalization of the regular convex combination algorithm.展开更多
基金supported by National Natural Science Foundation of China (Grant Nos. 11271185,11171140 and 11226277)the Initial Founding of Scientific Research for the Introduction of Talents of Nanjing Institute of Technology,China (Grant No. YKJ201115)
文摘We prove some 3-adic congruences for binomial sums,which were conjectured by Zhi-Wei Sun.For example,for any integer m≡1（mod 3）and any positive integer n,we have v3（1/n ∑n-1X k=0 1/mk 2k/ k〉））≥min{3（n）,3（m-1）-1},where 3（n）denotes the 3-adic order of n.In our proofs,we use several auxiliary combinatorial identities and a series converging to 0 over the 3-adic field.
基金This research is partly supported by National Outstanding Young Investigator Grant(70225005) of National Natural Science Foundation of China and the Project(70471088) of National Natural Science Foundation of China.
文摘This paper presents a unified bination algorithms （such as FrankWolfe problems. Global convergence results are framework of the nonmonotone convex comAlgorithm） for solving the traffic assignment established under mild conditions. The line search procedure used in our algorithm includes the nonmonotone Armijo rule, the non- monotone Goldstein rule and the nonmonotone Wolfe rule as special cases. So, the new algorithm can be viewed as a generalization of the regular convex combination algorithm.
