关于奇完全数和孤立数的几个命题

设E(a,b,m)=1/m(a~(2~n)+b~(2n)),这里a,b,m,,n是正整数适合gcd(a,b)=1,ab,m是a~(2~n)+b~(2n)的因数,且当2+ab时,m≡2(mod 4),当2|ab时,m≡1(mod2).运用初等方法证明了:i)当nlog_2log_2log_2a时,E(a,b,m)都不是奇完全数;ii)当nmax{7,logloga}或nmax{5,3 logloga}时,E(a,1,m)都是孤立数.从而改进了相关文献中的结果.     

关于丢番图方程(na)~x+(nb)~y=(nc)~z（英文）

设(a,b,c)为本原的商高数组,满足a~2+b~2=c~2且2|b.1956年,Jesmanowicz猜想:对任给的正整数n,丢番图方程(na)~x+(nb)~y=(nc)~z仅有正整数解x=y=z=2.令P(n)表示n的所有不同素因子乘积.对商高数组(a,b,c)=(p~(2r)-4,4p~r,p~(2r)+4),其中p为大于3的素数且p■1(mod 8),本文证明在条件P(a)|n或者P(n)a下,Jesmanowicz猜想成立.     

与Euler函数φ(n)有关的非线性方程的正整数解

在Euler函数φ(n)的性质的基础上,利用整数分解的方法证明了对任意的正整数m,n,非线性方程φ(mn)=aφ(m)+bφ(n)+c~2(a,b,c为勾股数且gcd(a,b,c)=1)当(a,b,c)=(3,4,5),(5,12,13),(7,24,25)时无正整数解,并证明了当a,b为任意的一奇一偶,c为任意的奇数,且满足a~2+b~2=c~2,gcd(a,b)=1,2|b时,方程无正整数解.     

奇完全数的两个猜想

运用初等方法讨论有关奇完全数的两个猜想.证明了:(i)如果n=p~αq_1~(2β_1)q_2~(2β_2)…q_s~(2β_s)是奇完全数,其中P,q_1,q_2,…,q_s是不同的奇素数,α,β_1,β_2,…,β_s是正整数,p≡α≡1(mood4),而且q_i≡-1(mod m)(i=1,2,…,s),m是大于2的正整数,则.1/2σ(p~α)必为合数;(ii)如果n=a~2~x+b~2~x,其中a,b,x是适合ab,gcd(a,6)=1,2|ab的正整数,则当x≥log_2log_2log_2 a时,n不是奇完全数.     

问题与解答

一、本期问题 1.若c+b+c=0,a~2+b~2+c~2=0,a~3+b~3+c~3=k,求a~4+b~4+c~4的值;设n为正整数,求a~n+b~n+c~n的值。 2.设x+y+z=0,ax+by+cz=0(其中a、b、c是两两互异的实数),求x~2/yz的值。 3.设n为任意正奇数,m为任意整数,试证明(n+2m)~2-(n+2m)是24的倍数。 4.设正数A、B、C的常用对数分别是a、b、c,且a+b+c=0,证明A~(1/b+1/a)B~(1/a+1/a)C~(1/a+1/b)=1/1000。江苏吴江平望镇五金文具店顾幼元提供 5.已知x+1/y=y+1/z=z+1/x,求证x~2y~2z~2=1。     

问题与解答

一本期问题 1.设a、m、n是正整数,n是奇数。证明数a~n-1和a~m+1的最大公因数不大于2。 2.证明数2~(5n+1)+5~(n+2)当n=0,1,2,…时,可以被27整除。 3.求出一个形如的整数的九位数,此数是四个不同素数的平方之积,且,(a_1≠0)。     

一道初中数学竞赛题的推广

一九八六年全国初中数学竞赛中最后一道题是:设a、b、c是三个互不相等的正整数,求证:在a~3b-ab~3、b~3c-bc~3、c~3a-ca~3三个数中,至少有一个数能被10整,除(证法从略)。此道题可推广为:设a、b、c是三个互不相等的正整数,n是自然数,求证:在口a~(3n)b~n-a~nb~(3n)、b~(3n)c~n-(b~nc~(3n))、(c~(3n)a~n)-(c~na~(3n))三个数中,至少有一个数能被10整除。证明∵a~(3n)b~n-a~nb~(3n)=a~nb~n(a~(2n)-b~(2n)) b~(3n)c~n-b~nc~(3n)=b~nc~n(b~(2n)-c~(2n)) c~(3n)a~n-c~na~(3n)=c~na~n(c~(2n)-a~(2n))∴在a、b、c中有偶数,或者都为奇数时,上述三个式子所表示的数总能被2整除。     

一类p~3阶群的Burnside环之增广商群

群环理论将群论和环论有机地结合了起来,是代数学中的重要分支之一,其中增广理想和增广商群是群环理论中的一个经典课题.设G有限群,分别记的Burnside环及其增广理想为Ω(G)和Δ(G).本文对任意正整数n,具体构造了Δ~n(I_p)作为自由交换群的一组基,并确定了商群Δ~n(I_p)/Δ~(n+1)(I_p)的结构,其中I_p=〈a,b|a~(p~2)=b~p=1,b~(-1)ab=a~(p+1)〉,p为奇素数.     

重要不等式的变式在数学竞赛中的应用

将基本不等式a~2 b~2≥2ab(当且仅当a= b时等号成立)的两边加上a~2 b~2得:2(a~2 b~2)≥(a b)~2,即(a~2 b~2)/2≥((a b)/2)~2,当且仅当a =b时等号成立.不等式(a~2 b~2)/2≥((a b)/2)~2的左边为两个实数的平方的平均值,右边为此两个实数的平均值的平方.因而,我们称此不等式为     

二项式展开式迭加的应用

将二项式(a b)~n和(a-b)~n展开后“迭加”,可得 (a b)~n (a-b)~n =2(C_n~0a~n C_n~2a~(n-2)b~2 C_n~4a~(n-4)b~4 …)此式有以下特点: 1 右边字母b的指数为偶数; 2 n为偶数时,右边a、b的指数都是偶数:     

关于亲和数的一个注记

本文研究了一类整数序列(2n)2n 1的某些性质,利用费玛数和数论函数的某些性质,获得了验证此类整数是否是亲和数和完全数的方法,既不与其他正整数构成亲和数对也不是完全数.     

The Pseudoachromatic Number of a Graph

The pseudoachromatic number of a graph G is the maximum size of a vertex partition of G (where the sets of the partition may or may not be independent) such that, between any two distinct parts, there is at least one edge of G. This parameter is determined for graphs such as cycles, paths, wheels, certain complete multipartite graphs, and for other classes of graphs. Some open problems are raised.AMS Subject Classification (1991): primary 05C75 secondary 05C85     

Weak Hausdorff Gaps and the 𝔭 ≤ t Problem

We find topological characterizations of the pseudointersection number ?? and the tower number t of the real line and we show that ?? < t iff there exists a compact separable T₂ space X of π-weight < ?? that can be covered by < t nowhere dense sets iff there exists a weak Hausdorff gap of size K < t, i. e., a pair ({A : i ≠ k}, {B_J : j ε K}) C [W]^W X [U]W such that A = {A_i : i ε K} is a decreasing tower, B = {B_j : j ε K) is a family of pseudointersections of A, and there is no pseudointersection S of A meeting each member of B in an infinite set.     

Remarks on restrained domination and total restrained domination in graphs

The restrained domination number ^r(G) and the total restrained domination number _t ^r (G) of a graph G were introduced recently by various authors as certain variants of the domination number (G) of (G). A well-known numerical invariant of a graph is the domatic number d(G) which is in a certain way related (and may be called dual) to (G). The paper tries to define analogous concepts also for the restrained domination and the total restrained domination and discusses the sense of such new definitions.This research was supported by Grant MSM 245100303 of the Ministry of Education, Youth and Sports of the Czech Republic.     

关于调和数的一个结论

设n是大于1的正常数,并且设n=pα11p2α2…ptαt,其中pi为素数,i=1,2,…,t,ω(n)表示n的不同素因子的个数,即ω(n)=t.若n的所有因子的倒数和为整数,即0≤∑ij≤αjj=1,2,…,t1p1i1pi22…ptit为整数,称n是调和数.证明了和调和数相关的一个结论.     

The upper traceable number of a graph

For a nontrivial connected graph G of order n and a linear ordering s: v ₁, v ₂, …, v _n of vertices of G, define . The traceable number t(G) of a graph G is t(G) = min{d(s)} and the upper traceable number t ⁺(G) of G is t ⁺(G) = max{d(s)}, where the minimum and maximum are taken over all linear orderings s of vertices of G. We study upper traceable numbers of several classes of graphs and the relationship between the traceable number and upper traceable number of a graph. All connected graphs G for which t ⁺(G) − t(G) = 1 are characterized and a formula for the upper traceable number of a tree is established. Research supported by Srinakharinwirot University, the Thailand Research Fund and the Commission on Higher Education, Thailand under the grant number MRG 5080075.     

On the relations of graph parameters and its total parameters

In this paper we get some relations between α（G）, α＇（G）, β（G）, β＇（G） and αT（G）, βT（G）. And all bounds in these relations are best possible, where α（G）, α＇（G）,/3（G）, β（G）, αT（G） and βT（G） are the covering number, edge-covering number, independent number, edge-independent number （or matching number）, total covering number and total independent number, respectively.     

Rainbow Numbers for Cycles with Pendant Edges

A subgraph of an edge-colored graph is called rainbow if all of its edges have different colors. For a graph H and a positive integer n, the anti-Ramsey number f (n, H) is the maximum number of colors in an edge-coloring of K _n with no rainbow copy of H. The rainbow number rb(n, H) is the minimum number of colors such that any edge-coloring of K _n with rb(n, H) number of colors contains a rainbow copy of H. Certainly rb(n, H) = f(n, H) + 1. Anti-Ramsey numbers were introduced by Erdős et al. [4] and studied in numerous papers. We show that for n ≥ k + 1, where C _k ⁺ denotes a cycle C _k with a pendant edge.     

A Note on the Bondage Number of a Graph

ＡＮｏｔｅｏｎｔｈｅＢｏｎｄａｇｅＮｕｍｂｅｒｏｆａＧｒａｐｈ￥ＬｉＹｕｑｉａｎｇ（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，ＧｕａｎｇｚｈｏｕＴｅａｃｈｅｒ＇ｓＣｏｌｌｅｇｅ）Ａｂｓｔｒａｃｔ：Ｔｈｅｂｏｎｄａｇｅｎｕｍｂｅｒｂ（Ｇ）ｏｆａｇ...