Universal sums of three quadratic polynomials

Let a,b,c,d,e and f be integers with a≥ c≥ e> 0,b>-a and b≡a(mod 2),d>-c and d≡c(mod 2),f>-e and f≡e(mod 2).Suppose that b≥d if a=c,and d≥f if c=e.When b(a-b),d(c-d) and f(e-f) are not all zero,we prove that if each n∈N={0,1,2,...} can be written as x(ax+b)/2+y(cy+d)/2+z(ez+f)/2 with x,y,z∈N then the tuple(a,b,c,d,e,f) must be on our list of 473 candidates,and show that 56 of them meet our purpose.When b∈[0,a),d∈[0,c) and f∈[0,e),we investigate the universal tuples(a,b,c,d,e,f) over Z for which any n∈N can be written as x(ax+b)/2+y(cy+d)/2+z(ez+f)/2 with x,y,z∈Z,and show that there are totally 12,082 such candidates some of which are proved to be universal tuples over Z.For example,we show that any n∈N can be written as x(x+1)/2+y(3y+1)/2+z(5z+1)/2 with x,y,z∈Z,and conjecture that each n∈N can be written as x(x+1)/2+y(3y+1)/2+z(5z+1)/2 with x,y,z∈N.     

Arithmetic properties of overpartition triples

Let p_3(n) be the number of overpartition triples of n. By elementary series manipulations,we establish some congruences for p_3(n) modulo small powers of 2, such as p_3(16 n + 14) ≡ 0(mod 32), p_3(8 n + 7) ≡ 0(mod 64).We also find many arithmetic properties for p_3(n) modulo 7, 9 and 11, involving the following infinite families of Ramanujan-type congruences: for any integers α≥ 1 and n ≥ 0, we have p_3 (3~(2α+1)(3n + 2))≡ 0(mod 9 · 2~4), p_3(4~(α-1)(56 n + 49)) ≡ 0(mod 7),p_3 (7~(2α+1)(7 n + 3))≡ p_3 (7~(2α+1)(7 n + 5))≡ p_3 (7~(2α+1)(7 n + 6))≡ 0(mod 7),and for r ∈ {1, 2, 3, 4, 5, 6},p_3(11 · 7~(4α-1)(7 n + r)≡ 0(mod 11).     

关于函数f(x)=|a-2x|的周期轨的个数

设函数 f(x)=|α-2x|,α>0,x∈[0,α].设 m 为大于1的奇数,A_m={x|x/α=h/m,h相似文献   

环的交换性定理

本文证明了: 定理1 设R是有左单位元e的结合环的而N为其诣零元集合,如果R中恒有。(i) x~(n(x))-x∈N x∈R此处n(x)是大于1的依赖于x的整数;(ii) x≡y(mod N)就导致x~i=y~i x~j=y~j i=i(x,y) j=j(x,y) (i,j)=1是与x,y有关的大于2的整数或者x,y与N中每一元都可交换。则R为交换环. 定理2 若R是kothe半单环,a,b∈R,存在k≥m=m(a,b)≥1;l≥n=n(a,b)》1使得[(ab)~m(ba)~n]∈Z(R)且R之特征为p(素数),则R为交换环。     

ON THE DIOPHANTINE EQUATION X4-Dy2=1(II)

For the Diophantine equation x^4 — Dy^2 = 1 (1) where D>0 and is not a perfect square, we prove the following theorems in this paper. Theorem 1. If D\[{\not \equiv }\]7 (mod 8)，D=p1p2...ps，s≥2，where pi（i = 1，…，s) are distincyt primes，p1≡1(mod 4) such that either 2p1=a^2+b^2，а≡\[ \pm \]3(mod 8)，b三\[ \pm \]3(mod 8) or there is a j(2≤j≤s), for which Legendre symbal \[\left( {\frac{{{p_j}}}{{{p_1}}}} \right) = - 1\],and pi≡7(mod8) (i=2,..., s) or pi≡3(mod 8) (i=2,..., s), then (1) has no solutions in positive integer x,y. Theorem 2. If D=p1...ps,s≥2, where pi（i = 1，…，s) are distinct primes, and pi≡3(mod 4)（i = 1，…，s), then (1) has no solutions in positive integer x, y. Theorem 3. The equation (1) with D=2p1...ps has no solutions in positive integer x, y, if (1) p1≡(mod 4), pi≡7(mod 8) (i = 2, ???, s), snch that either 2p1 = a^2+b^2 a≡\[ \pm \]3(mod 8)，b≡\[ \pm \]3(mod 8)or there is a j (2≤j≤s)，for which \[\left( {\frac{{{p_j}}}{{{p_1}}}} \right) = - 1\]; or (2) p1≡5(mod8),pi≡3(mod8) (i = 2,..., s)； or ⑶p1≡5(mod8)，pi≡7(mod 8) (i=2，…，s). Corollary of theorem 3. If D = 2pq, p≡5(mod 8), q≡3(mod 4), where p, q are distinct primes, then (1) has no solutions in positive integer x, y. Theorem 4. If D=2p1...ps, pi≡3(mod 4)(0 = 1,...,s), then (1) has no solutions In positive integer x, y.     

K_m∨的最小直径定向(英文)

For a graph G,let D denote an orientation of G having minimum diameter. Define f(G)=diamD.In this paper,we concentrate on exploring the minimum diameter of K_m∨(m≥1,n≥1).Some special cases are known:f(K_m∨)=∞,2,3, where m=1 and n≥1,m=2 or m≥4 and n=1,m=3 and n=1,respectively. So we only consider the case when m≥2 and n≥2.The following results are obtained. (1) f(K_m∨)=3,where m=2,3,n≥2 and m=n=4.(2) f(K_m∨)=2, where m≥5 and m is odd,2≤n≤■-m.(3) f(K_m∨)=2,where m≥4 and m≡0(mod4),2≤n≤■-(m/2 1).(4) f(K_m∨)=2,where m≥6 and m≡2(mod4),2≤n≤■-m/2.(5) f(K_m∨)=3,where m≥4,n>■.     

数学问题解答

20 0 0年 3月号问题解答(解答由问题提供人给出 )1 2 4 1 .求函数 y=sinnx cosnx ( n∈ N )的最值 .解　 ( 1 )当 n=1时 ,y=sinx cosx=2 sin( x π4)∴　 ymax=2 ,ymin=- 2 .( 2 )当 n=2 k 1 ( k∈N)时 ,| y| =| sinnx cosnx|≤ | sinnx| | cosnx|≤ | sinx| 2 | cosx| 2 =1∴　 - 1≤y≤ 1∴　 ymax=1 ,ymin=- 1 .( 3)当 n=2 k( k∈N)时 ,y=sinnx cosnx≤sin2 x cos2 x=1 ,∴　ymax=1 ;∵　 sin2 x cos2 x=2× 12 ,∴　设 sin2 x=12 - d,cos2 x=12 d.∴　 y =sinnx cosnx=( sin2 x) k ( cos2 x) k=( 12 - d) k ( 12 d…     

数学问题解答北大核心

2017年12月号问题解答（解答由问题提供人给出）2396形如n=16a（16b+15）（a,b∈N）的正整数不能表示成14个整数的四次方和.（浙江省富阳二中许康华311400）证明由x4≡0,1（mod16）,得对任意的x1,x2,…,x14∈Z,都有x14+x24+…+x144≡0,1,2,…,14（mod16）假设当a=l∈N,b∈N结论都成立.当a=l+1时,如果存在某个b∈N。     

趣味数学几例

1.今年元旦是星期日,试问今年元旦后的第1984~(1984)天是星期几。解:∵1984~(1984)=(283×7+3)~(1984) =7m+3~(1984),m∈N。而 3~6≡1(mod7),3~(1984)=3~4×3~(6×330) 3~4≡4(mod7),∴1984~(1984)≡4 (mod7)。答:今年元旦后的第1984~(1984)天是丛期四。 2.若f(x+1)=|x-1|,求f(1984)。解:令 x+1=1984,则x-1=1982, ∴ f(1984)=1982。 3.已知 f(x)=3x+1,g(x)=2x-1,h(g〔f(x)〕)=f(x)。求h(1984)。解:∵ f(y)=3y+1, ∴ g〔f(y)〕=2(3y+1)-1=6y+1, 故h(6y+1)=3y+1。令6y+1=1984,     

关于根式和下确界的三个不等式

文 [1 ]、[2 ]都对根式和下界不等式的证法进行过探讨 ,文 [3 ]利用高阶导数等高等数学知识进行了研究 .本文运用中学数学方法 ,给出证明根式和下界不等式的更为一般的公式 ,使曾在众多书刊中出现的若干不等式均为其特例 ,简捷解决有关根式和下确界问题 .引理　设 0≤ x≤λ≤ a,r≥ 1 ,n≥ 2 ,n∈ N,则 n ar - xr≥ n ar - xt;其中等号成立当且仅当 x =0或λ.其中t=1λ(n ar - n ar -λr) .证明　当 x =0时 ,式中等号成立 ,下设x >0 ,　 f (x) =n ar - n ar - xrx ,∵　 0 相似文献   

关于特定同余式方程解数的余项（英文）

Let f(x) be an irreducible polynomial of degree m ≥ 2 with integer coefficients,and let r(n) denote the number of solutions x of the congruence f(x) ≡ 0(mod n) satisfying0 ≤ x n. Define ?(x) =Σ 1≤n≤x r(n)-αx, where α is the residue of the Dedekind zeta function ζ(s, K) at its simple pole s = 1. In this paper it is shown that ∫_1~X?~2(x)dx? ε{X~(3-6/m+3+ε)if m ≥ 3,X~(2+ε) if m = 2,for any non-Abelian polynomial f(x) and any ε 0. This result constitutes an improvement upon that of Lü for the error terms on average.     

On the Factorizations of （mg, mf）-graph

Let G be an (mg, mf)-graph, where g and f are integer-valued functions defined on V(G) and such that 0≤g(x)≤f(x) for each x ∈ V(G). It is proved that(1) If Z ≠ , both g and f may be not even, G has a (g, f)-factorization, where Z = {x ∈ V(G): mf(x)-dG(x)≤t(x) or dG(x)-mg(x)≤ t(x), t(x)= f(x)-g(x)>0}.(2) Let G be an m-regular graph with 2n vertices, m≥n. If (P1, P2,..., Pr) is a partition of m, P1 ≡ m (mod 2), Pi ≡ 0 (mod 2), i = 2,..., r, then the edge set E(G) of G can be parted into r parts E1 , E2,...,Er of E(G) such that G[Ei] is a Pi-factor of G.     

一个不等式的加强及证明

文[1]给出了一个猜想:若a b=1,a,b>0,则32<11 an 11 bn≤2n 12n 1(1)文[2]给出了(1)式的证明.文[3]给出了(1)式的高维形式:若x1 x2 … xm=1,x1,x2,…,xm>0,则m 1m<1x1n 1 1x2n 1 … 1xmn 10,则1x1n 1 1x2n 1 … 1xmn 1>m-12,其中m≥2,n≥2且m∈N,n∈R.证因为0相似文献   

代数数域中的均值定理

设 K 是 n 次代数数域.令Ψ(x,u,η)=(?)∧(b),其中 u～b mod η(?)α、β∈Z_k,α≡β(modη),α(?)0,β(?)0,(α,η)=(β,η)=1,(α)u=(β)b、h(η)表等价类 modη的类数,T(η)=(U∶U＇),其中 U 表示域 K 中全体单位所成的群,U＇={ε|ε∈U,ε(?)0,ε≡1(modη}.我们证明了下述定理:对于任一正常数 A,存在一正常数 B=B(A)>0,当 Q=x~(1/(n+1))(log x)~(-B),x≥1时有sum from Nη≤Q(?)1/(T(η))|ψ(z,u,η)-z/(h(η))|(?)x/(log~Ax).     

有向圈的笛卡尔积有向图的双控制数

Let γ*(D) denote the twin domination number of digraph D and let Cm Cn denote the Cartesian product of C_m and C_n, the directed cycles of length m, n ≥ 2. In this paper, we determine the exact values: γ*(C_2?C_n) = n; γ*(C_3 ?C_n) = n if n ≡ 0(mod 3),otherwise, γ*(C_3?C_n) = n + 1; γ*(C_4?C_n) = n + n/2 if n ≡ 0, 3, 5(mod 8), otherwise,γ*(C_4?C_n) = n + n/2 + 1; γ*(C_5?C_n) = 2n; γ*(C_6?C_n) = 2n if n ≡ 0(mod 3), otherwise,γ*(C_6?C_n) = 2n + 2.     

On the diophantine equation x 2 − Dy 2 = n

We propose a method to determine the solvability of the diophantine equation x2-Dy2=n for the following two cases:(1) D = pq,where p,q ≡ 1 mod 4 are distinct primes with(q/p)=1 and(p/q)4(q/p)4=-1.(2) D=2p1p2 ··· pm,where pi ≡ 1 mod 8,1≤i≤m are distinct primes and D=r2+s2 with r,s ≡±3 mod 8.     

高三数学期中自测题

选择题　 (每小题 5分 ,12小题共 6 0分 .在每小题给出的四个选项中 ,只有一项是符合题目要求的 )1.集合M ={x|x =2n ,n∈Z} ,N ={x|x =2n +1,n∈Z} ,P ={x|x =4n +1,n∈Z} ,x∈M ,y∈N ,则必有 (　　 )(A)x +y∈M .(B)x +y∈N .(C)x +y∈P .(D)x +y M ,N ,P任何一个 .2 .已知集合M =- 1,0 ,1,f是从M到M的映射 ,则满足 f(- 1) +f(0 ) +f(1) =0的映射有(　　 )(A) 6个 .　 (B) 7个 .　 (C) 8个 .　 (D) 9个 .3.已知f0 (x ) =f (x ) =x +1(x≤ 1) ,-x +3(x >1) ,fn +1(x) =f [fn (x ) ],则f2 (- 12 ) = (　　 )(A) - 12 . (B) 32 …     

一个代数不等式的指数推广

文 [1 ]中 ,程龙海先生证明了下面不等式 :若 0≤ x,y≤ 1 ,则x2 y2 ( 1 - x) 2 y2 x2 ( 1 - y) 2 ( 1 - x) 2 ( 1 - y) 2≤ 2 2 . ( 1 )本文将 ( 1 )式作如下推广定理　若 0≤ x,y≤ 1 ,n≥ 2 ,n∈ N,则n xn yn n ( 1 - x) n yn n xn ( 1 - y) n n ( 1 - x) n ( 1 - y) n≤ 2 n 2 . ( 2 )引理　若 u≥υ≥ 0 ,n≥ 2 ,n∈ N,则n un υn ≤ u ( n 2 - 1 )υ. ( 3)证明　因为 u≥υ≥ 0 ,所以[u ( n 2 - 1 )υ]n=un ∑ni=1Cinun- i( n 2 - 1 ) ivi≥ un ∑ni=1Cin( n 2 - 1 ) iυn=un [∑ni=0Cin(…     

丢番图方程(m2+1)x+(cm2-1)y=(am)z

设m,a,c均是大于1的正整数.当am≡1(mod 4)或am≡3(mod 8),3■m或2■a,2|m,3■m时,得到了丢番图方程(m²+1)^x+(cm²-1)^y=(am)^z,1+c=a²,m≥2只有正整数解(x,y,z)=(1,1,2).特别地,当a≡1,3,5 (mod 8),a≠3或a≡7 (mod 8),a≡2(mod 3)时,方程2^x+(a²-2)^y=(a)^z只有正整数解(x,y,z)=(1,1,2).     

一个猜想不等式的加细与推广

文 [1 ]提出如下猜想　设 x1,x2 ,… ,xn ∈ R+ ,x1+ x2 +… + xn =1 ,n≥ 3,n∈ N,则　 ∏ni=1( 1xi- xi)≥ ( n - 1n) n. ( 1 )戴承鸿、刘兵华在文 [2 ]中证明了上述猜想不等式成立 .本文给出该不等式的一个加细及推广形式 .定理　设 x1+ x2 +… + xn=k,n≥ 3,n∈ N;若 k≤ 1 ,x1,x2 ,… ,xn ∈ R+ ,则　 ∏ni=1( 1xi- xi)≥ ( nk - kn) n ( ∏ni=1nxik) 1n-13≥ ( nk - kn) n ( 2 )若 k≥ n - 1 ,x1,x2 ,… ,xn ∈ ( 0 ,1 ) ,则∏ni=1( 1xi- xi)≤ ( nk - kn) n .　　 ( ∏ni=1n - nxin - k) 13 -1n ≤ ( nk - kn) n. ( 3)为证定理 ,先…