“分子有理化”的应用

在教学中,“分母有理化”的解题技巧常常给予强调并广为同学们所运用;但对“分子有理化”,一种特殊的解题技巧却没有给予注意和介绍。致使不少同学面对用“分子有理化”这把“刀子”就能迎刃而解的习题感到十分棘手。下面通过数例介绍“分子有理化”在解题中的应用。例1.判定函数y=lg(x+(x~2+1)~(1/2))的奇偶性。解:∵f(-x)=lg(-x+((-x)~2+1)~(1/2)) =lg((x~2+1)~(1/2)-x)=lg(1/((x~2+1)~(1/2)+x)) =lg((x~2+1)~(1/2)+x)~(-1)=-f(x)。     

一类无理函数的积分

<正> 众所周知,在不定积分的计算中,形如integral f(√a~2-x~2)dx,integral f(√x~2+a~2)dx 和integral f(x~2-a~2)~(1/2)dx 的积分可作代换x=asint(或x=acost),x=atgt(或x=asht)和x=asect(或x=acht)将其积出。而形如integral f((a-x)~(1/2),(b-x)~(1/2))dx,integral f((x-a)~(1/2),     

同时求解多项式所有二次因子的迭代法

1. 引言 如所周知,从初始近似值x~((0))出发,使用Newton法 x~((m+1))=x~((m))-f(x~((m)))/f′(x~((x))) (m=0,1,…)求函数f(x)的根时,在单根附近二阶收敛。 当f(x)是首项系数为1的N次多项式     

由一道常见题想到的

<正>常见这道习题:已知f(x+(1/x))=x~2+(1/x~2),求f(x).对其往往采用先配方再换元来求f(x).f(x+(1/x))=x~2+(1/x~2)=(x+(1/x))~2-2.令u=x+(1/x),则f(u)=u~2-2,|u|=|x+(1/x)|=|x|+(1/|x|)≥2.     

求值问题巧解

一些求值问题设字母替换来解,方法别具一格。今举例给予说明。例1 求(2+3~(1/2))~(1/2)+(2-3~(1/2))~(1/2)的值。解:设x=(2+3~(1/2))~(1/2)+(2-3~(1/2))~(1/2)则 x~2=((2+3~(1/2))~(1/2)+(2-3~(1/2))~(1/2))~2=2+3~(1/2)+2(((2+3~(1/2))((2-3~(1/2)))~(1/2)+2-3~(1/2) =4+2(2~2-(3~(1/2))~2)=6 ∴x=±6~(1/2) (-(6~(1/2))不合题意舍去) 因此,原式=6~(1/2)。例2 求 (4-3((4-3((4-3)~(1/3))~(1/3)))~(1/3)…的值。解:设x=(4-3((4-3((4-3)~(1/3))~(1/3)))~(1/3) 则 x~3=4-3((4-3((4-3~(1/3))))~(1/3)…即 x~3=4-3x。∴x=1注:例2应该先证其存在性之后才能设,这     

一个等价的萊布尼茲定理

§1.设函数f(x),g(x)在区间ι上高阶可微,则下列恆等式成立: f′g十fg′=(fg)′, f″g十fg″=(fg)″-2(f′g′), f′″g+fg″′=(fg)″′-3(f′g′)′, f″″g+fg″″=(fg)″″-4(f′g′)″+2(f″g″),它们之间有关系 f~(n)g+fg~(n)=(f~(n-1)g+fg~(n-1))′--(f~(n-1)g′+f′g~(n-1))。§2.现在我们规定 f~(n)g+fg~(n)=A_0(fg~(n)+A_1(f′g′)~(n-2)+…++A_[n/2]~(f~([n/2])g~([n/2]))(n-2([n/2])),其中高斯记号[n/2]表示不超过n/2的最大正整数。由于未定系数A_0,A_1,…,A_[n/2]的数值函数f(x),g(x)无关,不妨选取 f(x)=e~(ax),g(x)=e~(bx),就有 f~(n)g+fg~(n)=(a~n+b~n)e~((a+b)x),以及 (f~(ι)g~(ι))~((n-2ι))=(a+b)~(n-2ι)(ab)~ιe~((a+b)x)(ι=1,2,…,[n/2])。代入规定的等式中,两边约去公因子e~((a+b)x)以后,立刻得到     

求函数解析式的几种方法

已知一个函数适合某种性质或某种关系,求这个函数的解析式,对这个问题学生感到困难。现就这个问题介绍几种求函数解析式的方法: 一、定义法例1 已知f(1+x/x)=1+x~2/x+1/x,求f(x)。解:∵f(1+x/x)=1+x~2/x~2+1/x=(x~2+2x+1)-2x/x~2+1/x=(x+1/x)~2-x+1/x+1     

具有共振的边值问题解的存在性

利用Mawhin的重合度理论,研究具有共振的n-阶m-点边值问题x~((n))(t)=f(t,x(t),x′(t),…,x~((n-1))(t)),t∈(0,1)x(0)=x(η),x′(0)=x″(0)=…=x~((n-2))(0)=0,x~((n-1))(1)=α_ix~((n-1))(ξ_i)解的存在性,其中n≥2,m≥3,f:[0,1]×R~n→R将有界集映为有界集,且当x(t)∈C~(n-1)[0,1]时,f(t,x(t),x′(t),…,x~((n-1))(t))∈L~1[0,1],0<ξ_1<ξ_2<…<ξ_(m-2)<1,0<η<1,α_i∈R.在这里并不要求f具有连续性.     

一类问题的纠错为什么这么难——关于函数f(x)=log_2g(x)的值域为R的教学

问题已知函数f(x)=log_2(x~2+kx+2) (x∈R)的值域为R,求实数k的取值范围。错解要使函数f(x)的值域为R,只需g(x)= x~2+kx+2>0对一切x∈R恒成立,所以有△=k~2-8<0,解得-2 2~(1/2)相似文献   

余数定理的引伸及其应用

在中学数学课本里有一条定理叫余数定理“多项式f(x)除以x-b所得的余数等于f(b)”,证明时引用了下列恒等式 f(x)=(x-b)·Q(x)+R (1)当x=b时,f(b)=R。现在我们把关系式(1)引伸一下,设 f(x)=B(x)·Q(x)+R(x) (2)是一个关于x的恒等式,如果当x=b时,我们有B(b)=0,则得f(b)=R(b)。由于我们所讨论的是一元多项式,当B(x)的次数低于f(x)的次数时,R(x)的次数将低于B(x)的次数而更低于f(x)的次数,因此,求函数f(x)当x=b的值时,可以不直接代入f(x)计算而可以代入较为简单的式子R(x)里去计算,这样就方便得多了。例1. 已知 x=1/(3~(1/2)+2~(1/2)),求 f(x)=x~5+x~4-10x~3-10x~2+2x+1的值。解:x=1/(3~(1/2)+2~(1/2))=(3~(1/2)-2~(1/2)。     

An explicit class of codes with good parameters and their duals

We study a class of codes with good parameters and their duals explicitly. We give direct constructions of the dual codes and obtain self-orthogonal codes with good parameters.     

The nonexistence of near-extremal formally self-dual codes

A code is called formally self-dual if and have the same weight enumerators. There are four types of nontrivial divisible formally self-dual codes over , and . These codes are called extremal if their minimum distances achieve the Mallows-Sloane bound. S. Zhang gave possible lengths for which extremal self-dual codes do not exist. In this paper, we define near-extremal formally self-dual (f.s.d.) codes. With Zhang’s systematic approach, we determine possible lengths for which the four types of near-extremal formally self-dual codes as well as the two types of near-extremal formally self-dual additive codes cannot exist. In particular, our result on the nonexistence of near-extremal binary f.s.d. even codes of any even length n completes all the cases since only the case 8|n was dealt with by Han and Lee.      

A generalization of quasi-twisted codes: Multi-twisted codes

Cyclic codes and their various generalizations, such as quasi-twisted (QT) codes, have a special place in algebraic coding theory. Among other things, many of the best-known or optimal codes have been obtained from these classes. In this work we introduce a new generalization of QT codes that we call multi-twisted (MT) codes and study some of their basic properties. Presenting several methods of constructing codes in this class and obtaining bounds on the minimum distances, we show that there exist codes with good parameters in this class that cannot be obtained as QT or constacyclic codes. This suggests that considering this larger class in computer searches is promising for constructing codes with better parameters than currently best-known linear codes. Working with this new class of codes motivated us to consider a problem about binomials over finite fields and to discover a result that is interesting in its own right.