数轴(Number Line)

在数学中,可以用一条直线上的点表示数,这条直线叫做数轴,并且每一个实数都可以用数轴上的一个点来表示:

数轴只是一条特殊的直线,只要这条直线拥有以下三要素,它就可以被称为数轴(缺一不可):

①原点(也就是0)

②正方向。如上图,正方向在右侧(箭头所指方向)

③单位长度。如上图,它们的单位长度为1,也就是每个相邻单位的步幅都为1。

正方向的数总是大于其负方向的数(通常来说,数轴正方向都在右边或上边),而且除原点外,每一个点的数都是成对的,例如-1 和 1,如此类推。那么,只有符号不同的两个数叫做互为相反数,其中的一个数叫做另一个数的相反数(Opposite Number)。相反数拥有一个特征, a + (-a) = a - a  = 0。所以我们也可以这么理解,两个数相加和为0 的数互为相反数(所以0 的相反数为0)。

在数轴上表示一个数的点离原点的距离就叫做这个数的绝对值(Absolute Value),例如5 或-5  等离原点的距离就是所谓的绝对值了,因为计算的是离原点的距离,所以这段距离是没负数一说的。正数的绝对值是它本身,一个负数的绝对值是它的相反数,0的绝对值是0。绝对值用“ | |” 符号来表示,例如: | 1 | = 1, |-1| = 1。

时间: 2024-08-04 01:30:00

数轴(Number Line)的相关文章

[LeetCode] Reach a Number 达到一个数字

You are standing at position 0 on an infinite number line. There is a goal at position target. On each move, you can either go left or right. During the n-th move (starting from 1), you take n steps. Return the minimum number of steps required to rea

754. Reach a Number

You are standing at position 0 on an infinite number line. There is a goal at position target. On each move, you can either go left or right. During the n-th move (starting from 1), you take n steps. Return the minimum number of steps required to rea

词汇——统计学/数学

dispersion[d?'sp???(?)n][统计][数] 离差 Dispersion is the spreading of people or things over a wide area. (对人群的)驱散; 散布 quartile四分位数['kw??ta?l]number line 数轴 variance 方差 deviation 标准差[di?v?'e??(?)n]n. 偏差:误差 a variation that deviates from the standard or no

hdu 2717 Catch That Cow(广搜bfs)

题目链接:http://i.cnblogs.com/EditPosts.aspx?opt=1 Catch That Cow Time Limit: 5000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7909    Accepted Submission(s): 2498 Problem Description Farmer John has been inform

USACO抓牛catchcow (bfs)

这题是黄巨大出的比赛题. http://poj.org/problem?id=3278 Description Farmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a point N (0 ≤ N ≤ 100,000) on a number line and the cow is at a point K (0 ≤ K ≤

POJ 3278 Catch That Cow(BFS,板子题)

Catch That Cow Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 88732   Accepted: 27795 Description Farmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a point N (0 ≤ N ≤ 100,00

POJ 3278: Catch That Cow

Catch That Cow Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 44613   Accepted: 13946 Description Farmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a point N (0 ≤ N ≤ 100,00

bzoj 1986

1986: [USACO2004 Dec] Dividing the Path 划区灌溉 Time Limit: 1 Sec  Memory Limit: 64 MBSubmit: 145  Solved: 89[Submit][Status] Description Farmer John's cows have discovered that the clover growing along the ridge of the hill in his field is particularly

BZOJ 1646: [Usaco2007 Open]Catch That Cow 抓住那只牛( BFS )

BFS... -------------------------------------------------------------------------------------------- #include<cstdio> #include<cstring> #include<algorithm> #include<iostream> #include<queue> #define rep( i , n ) for( int i = 0