Look for numbers that meet the following conditions, and write all the numbers that meet the followi

1>1 divided by 1=1;2 divided by 2 = 2; 9 divided by 9 = 9;10 divided by 10 = divided by 10 = 123456789. A: 1234567890.

2>(1) If the last digit of an integer is or 8, then the number is divisible by 2.

2) If the sum of the digits of an integer is divisible by 3, then the integer is divisible by 3.

3) If the last two digits of an integer are divisible by 4, then the number is divisible by 4.

4) If the last digit of an integer is 0 or 5, the number is divisible by 5.

5) If an integer is divisible by 2 and 3, then the number is divisible by 6.

6) If the single digit of an integer is truncated, and then 2 times the single digit is subtracted from the remaining number, if the difference is a multiple of 7, the original number can be divisible by 7. If the difference is too large or mental arithmetic is not easy to see whether it is a multiple of 7, you need to continue the above process of truncating, multiplying, subtracting, and checking the difference until you can make a clear judgment. For example, the process of determining whether 133 is a multiple of 7 is as follows:

13 3 2 7, so 133 is a multiple of 7; Another example is the process of determining whether 6139 is a multiple of 7 as follows: 613 9 2 595 , 59 5 2 49, so 6139 is a multiple of 7, and so on.

7) If the unfinished three digits of an integer are divisible by 8, then the number is divisible by 8.

8) If the sum of the digits of an integer is divisible by 9, then the integer is divisible by 9.

9) If the last digit of an integer is 0, the number is divisible by 10.

There are too many of them, such as 1020005640

The square root is equal to plus or minus 2 3 for the number [Yu Potato 12] letter attack.

Integers greater than -three 15 and less than 11 [-2,-1,0, 1,2,3].

A non-negative integer with an absolute value less than 12 [3,2,1,0].

First of all, according to the meaning of the question, the four-digit number can be expressed as, and it can be solved according to the property of perfect square number and divisible.

Set, then, so there is a whole celery number solution, because, so.

Therefore, it is a complete flat liquid which square number, can be set, therefore, the sum is, and some of the multiples can only have or, slow pure should be obtained, substituted solution. ,.Therefore or or.

This question examines the relationship between a number and the number on its digit and the nature of a perfectly squared number. This question is more difficult, and you should pay attention to the requirements of the question when solving the problem.

(1) All integers greater than -3 and less than 2.

2) A negative integer whose absolute value is greater than 2 and less than 5.

3) All numbers on the number line with a point of -1 at a distance of 2.

4) The largest integer not to exceed the third of minus five-thirds. -5

A number is both a factor of 30 and a multiple of 3, and this tree may be (3,6,15,30).

A number smaller than 9 and a multiple of 2 and 3 at the same time is (6).

The smallest multiple of a number is 12, then its factors are (1,2,3,4,6,12).

How seventeen groups? 1 all have (17 times), by the conditions, the first group does not have the test (by the second condition), and then look at the other two conditions, get: choose 1 and then choose the four that appear most continuously from the first group, respectively:

3 (15 reps), 2 (7 reps), 7 (4 reps), 9 (2 reps). To sum up, choose 1, 3, 2, 7, 9