一元二次方程单元目标检测题

一、填空题（每小题４分,共３２分）１方程３ｙ２＝２４的根为;方程ｘ－ｘ２８＝０的根为．２方程１３ｘ＝１－５ｘ２的两根之和是,两根之积是３当ｔ时,分式ｔ２＋２ｔ－３｜ｔ｜－３的值为零４当ｐ时,分式方程ｘｘ－３＝ｐ２ｘ－３＋２会产生增根５应用求根公式计算方程ａｘ２＋ｂｘ＋ｃ＝０（ａ≠０）的二根ｘ１与ｘ２的差的绝对值可得｜ｘ１－ｘ２｜＝．６代数式１９９９ｘ－１９９８与１９９８－１９９９ｘ的值相等,则ｘ＝．７方程（２ｘ－１）２＋２（１－２ｘ）－３＝０的解为;方程组ｘ＋ｙ＝１１ｘｙ＝－…     

十二省市(辽宁、云南、湖南、乌鲁木齐、昆明、哈尔滨、山西、广西、西宁、河南、嘉兴等、甘肃)选择题集萃

数与式１．若ａ≠０,则下列运算正确的是（　）．（Ａ）ａ４·ａ２＝ａ８　　（Ｂ）ａ２＋ａ２＝ａ４（Ｃ）（－３ａ４）２＝９ａ６（Ｄ）（－ａ）４÷（－ａ）２＝ａ２２．下列各式中计算错误的是（　）．（Ａ）ａｂ＝ａｃｂｃ（ｃ≠０）（Ｂ）ａ＋ｂａｂ＝ａ２＋ａｂａ２ｂ（Ｃ）０．５ａ＋ｂ０．２ａ－０．３ｂ＝５ａ＋１０ｂ２ａ－３ｂ（Ｄ）ｘ－ｙｘ＋ｙ＝ｙ－ｘｙ＋ｘ３．化简１２－３的结果是（　）．　　（Ａ）－２＋３　　（Ｂ）－２－３（Ｃ）２＋３（Ｄ）２－３４．２ｘ２·３ｘ３等于（　）．（Ａ）６ｘ５　（Ｂ）６ｘ６　（Ｃ…     

二维紧致具有非正曲率Riemann流形Euler数的一个计算公式

设Ｍ是二维紧致、曲率Ｋ（Ｍ）≤０的Ｒｉｅｍａｎｎ流形．对任一ｘ　Ｍ,在Ｍ上类数≥３的点集非空且只有有限个点｛α１,α２,…;αｄ｝．用Ｋｊ表示αｊ的类数,即αｊ到ｘ的最短测地线的条数．那么,Ｍ的Ｅｕｌｅｒ数Ｘ（Ｍ）可以表示为：Ｘ（Ｍ）＝（ｄ＋１）＝Ｋｊ．如果Ｍ上类数２３的点只有一个,那么这个点是Ｍ上距离ｘ最远的点．     

关于任意K（K≥5）个连续Fibonacci数的猜想

关于任意Ｋ（Ｋ≥５）个连续Ｆｉｂｏｎａｃｃｉ数的猜想刘元宗（河南洛阳师专４７１０２２）文［１］指出，１９９１年美国Ｍｒ．Ａ．ＤｉＤｏｍｅｎｉｃｏ教授利用数学归纳法证明了五个连续Ｆｉｂｏｎａｃｃｉ数的几个公式，即（１）ＦｎＦｎ＋４－Ｆｎ＋１Ｆｎ＋３＝２...     

关于Q（√4k^2n＋1）的理想类群的循环子群

设ｄ,ａ,ｋ,ｎ是适合４ｋ＾２ｎ＋１＝ｄａ＾２,ｋ〉１,ｎ〉２,ｄ无平方因子的正整数;又设Ｃ（Ｋ）和ｈ（Ｋ）分别是实二次域Ｋ＝Ｑ（√ｄ）的理想类群和类数。本文证明了：当ａ〈０．５ｋ＾０．５６ｎ时,则ｈ（Ｋ）≡０（ｍｏｄ ｎ）和Ｃ（Ｋ）必有ｎ阶循环子群。     

一元二次方程单元检测题

一、填空（每题４分,共４０分）１一元二次方程的一般形式是（其中）它的求根公式为（其中）２已知关于ｘ的方程ｘ２－ｐｘ＋２ｐ＝０的一个根为１,则ｐ＝,它的另一个根为３直接写出下列方程的解（１）２（ｘ－１）（ｘ＋３）＝０（２）３ｘ２＋４ｘ－１＝０４三个连续奇数中,中间一个奇数用２ｋ＋１表示,则其余两个奇数为和５某厂今年用电５万度,为节约能源,计划每年要比上一年节约ｘ％,预计明年用电万度,后年用电万度６一元二次方程３ｘ２－５ｘ－１＝０的△＝,此方程的根的情况是７在实数范围内分解…     

关于Q(4k~(2n)+1)的理想类群的循环子群

设ｄ,ａ,ｋ,ｎ是适合４ｋ２ｎ＋１＝ｄａ２,ｋ＞１,ｎ＞２,ｄ无平方因子的正整数;又设Ｃ（Ｋ）和ｈ（Ｋ）分别是实二次域Ｋ的理想类群和类数．本文证明了：当ａ＜０．５ｋ０．５６ｎ时,则ｈ（ｋ）＝０（ｍｏｄｎ）和Ｃ（Ｋ）必有ｎ阶循环子群．     

二维带形无界区域中Navier—Stokes方程整体吸引子及其维数估计

该文讨论二维无界带形区域中Ｎａｖｉｅｒ－Ｓｔｏｋｅｓ方程（Ⅰ）｛ｕｔ－△ｕ＋ｕｉэｕэｘｉ＝－△ｐ＋ｆ（ｘ，ｔ）∈Ω×Ｒ＋（１）ｄｉｖｕ＝０（２）ｕ（Ｘ，ｔ）∈（Ｈ＾１０（Ω）ｆｏｒ ｔ〉０（３）ｕ（ｘ，０）＝ｕ０（ｘ）∈Ｈ（４）其中Ω＝（０，ｄ）×Ｒ，ｄ〉０为一常数，ｕ与ｐ为未知量，其中ｕ＝（ｕ１，ｕ２）为速度场，ｐ表示压力。我们证明了当ｕ０∈Ｈ，ｆ∈Ｖ且ｆ「ｌｏｇ（ｅ＋│ｘ│＾２）」＾１２∈Ｌ     

关于连续Fibonacci数的公式

关于连续Ｆｉｂｏｎａｃｃｉ数的公式简超（武汉铁路成人中专４３００１２）设Ｆｎ表示Ｆｉｂｏｎａｃｃｉ数：Ｆ１＝Ｆ２＝１，Ｆｎ＋２＝Ｆｎ＋Ｆｎ＋１，ｎ＝１，２，３，…并约定Ｆ０＝０．本文给出关于连续Ｆｉｂｏｎａｃｃｉ数的几类公式，并证明文［１］的猜想成立...     

新题征展(3)

题组新编１．（１）设Ｍ＝｛ｘ｜ｆ（ｘ）＝０｝、Ｎ＝｛ｘ｜ｇ（ｘ）＝０｝,则｛ｘ｜ｆ（ｘ）·ｇ（ｘ）＝０｝为（　　）;（Ａ）Ｍ　（Ｂ）Ｎ　（Ｃ）Ｍ∪Ｎ　（Ｄ）以上都不对（２）设ｆ（ｘ）＝ｘ－１ｘ＋３,ｇ（ｘ）＝ｘ＋３ｘ－１,则集合｛ｘ｜ｆ（ｘ）·ｇ（ｘ）＝０｝＝　　;（３）设函数ｆ（ｘ）、ｇ（ｘ）的定义域依次是Ｆ、Ｇ,且Ｍ＝｛ｘ｜ｆ（ｘ）＝０｝、Ｎ＝｛ｘ｜ｇ（ｘ）＝０｝,则｛ｘ｜ｆ（ｘ）·ｇ（ｘ）＝０｝＝　　．２．（１）设ｍ、ｋ∈Ｎ,则Ｃｎｎ＋Ｃｎｎ＋１＋Ｃｎｎ＋２＋…＋Ｃｎｎ＋ｋ＝　　;（２）求…     

关于亲和数的一个注记

本文研究了一类整数序列(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.     

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.     

关于调和数的一个结论

设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是调和数.证明了和调和数相关的一个结论.     

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

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