Location:
Search - 6174
Search list
Description: 汇编程序-
6174算法
很详细的，便于大家学习
-Assembler-the 6174 arithmatic is depicted in detail, so it is convenient for your study.
Platform: |
Size: 1165 |
Author: 阿韦 |
Hits:
Description: 验证卡布列克运算。任意一个四位数，只要它们各个位
上的数字是不全相同的，就有这样的规律：
1)将组成该四位数的四个数字由大到小排列，形成由这四个
数字构成的最大的四位数；
2)将组成该四位数的四个数字由小到大排列，形成由这四个
数字构成的最小的四位数(如果四个数中含有0，则得到的数不足
四位)；
3)求两个数的差，得到一个新的四位数(高位零保留)。
重复以上过程，最后得到的结果是6174，这个数被称为卡布
列克数。-certification Roman computing. A four-digit arbitrary, as long as they all place on the same figure is incomplete, this is the law : a) the composition of the four four-digit figures with 7,10,13, formed by four of the greatest figures of the four-digit; 2) The composition of the four four-digit figures headed arranged by the formation of the four figures constitute the smallest of the four-digit (if 4 contains a few 0, then the less than 4); 3) 2 for the number of poor, received a new four-digit (high-reservations). Repeat the above process, the final result is 6,174, a figure known as the Roman few.
Platform: |
Size: 1577 |
Author: 姚紫欣 |
Hits:
Description: 黑洞数又称陷阱数，是类具有奇特转换特性的整数。
任何一个数字不全相同整数，经有限次“重排求差”操作，总会得某一个或一些数，这些数即为黑洞数。\"重排求差\"操作即组成该数得排后的最大数去重排的最小数。
印度数学家研究过四位黑洞数，得到的黑洞数为6174。用这个程序验证这一下这个黑洞数。-few black hole known as traps, and are kind of peculiar characteristics of the integer conversion. Any incomplete figures the same integer, limited by the "rearrangement Difference" operation, in a Federation or a few, These few black hole shall be few. "Rearrangement Difference" operation that is composed of several in the row after the largest number of rearrangement to the smallest number. Indian mathematician studied for four black hole, the black hole at 6,174. Use this to verify this number into the black hole.
Platform: |
Size: 1138 |
Author: Eurik |
Hits:
Description: 6174问题6174问题6174问题6174问题6174问题6174问题6174问题6174问题6174问题6174问题6174问题6174问题
Platform: |
Size: 457 |
Author: unchiha.itachi@qq.com |
Hits:
Description: 汇编程序-
6174算法
很详细的，便于大家学习
-Assembler-the 6174 arithmatic is depicted in detail, so it is convenient for your study.
Platform: |
Size: 1024 |
Author: 阿韦 |
Hits:
Description: 验证卡布列克运算。任意一个四位数，只要它们各个位
上的数字是不全相同的，就有这样的规律：
1)将组成该四位数的四个数字由大到小排列，形成由这四个
数字构成的最大的四位数；
2)将组成该四位数的四个数字由小到大排列，形成由这四个
数字构成的最小的四位数(如果四个数中含有0，则得到的数不足
四位)；
3)求两个数的差，得到一个新的四位数(高位零保留)。
重复以上过程，最后得到的结果是6174，这个数被称为卡布
列克数。-certification Roman computing. A four-digit arbitrary, as long as they all place on the same figure is incomplete, this is the law : a) the composition of the four four-digit figures with 7,10,13, formed by four of the greatest figures of the four-digit; 2) The composition of the four four-digit figures headed arranged by the formation of the four figures constitute the smallest of the four-digit (if 4 contains a few 0, then the less than 4); 3) 2 for the number of poor, received a new four-digit (high-reservations). Repeat the above process, the final result is 6,174, a figure known as the Roman few.
Platform: |
Size: 1024 |
Author: 姚紫欣 |
Hits:
Description: 黑洞数又称陷阱数，是类具有奇特转换特性的整数。
任何一个数字不全相同整数，经有限次“重排求差”操作，总会得某一个或一些数，这些数即为黑洞数。"重排求差"操作即组成该数得排后的最大数去重排的最小数。
印度数学家研究过四位黑洞数，得到的黑洞数为6174。用这个程序验证这一下这个黑洞数。-few black hole known as traps, and are kind of peculiar characteristics of the integer conversion. Any incomplete figures the same integer, limited by the "rearrangement Difference" operation, in a Federation or a few, These few black hole shall be few. "Rearrangement Difference" operation that is composed of several in the row after the largest number of rearrangement to the smallest number. Indian mathematician studied for four black hole, the black hole at 6,174. Use this to verify this number into the black hole.
Platform: |
Size: 1024 |
Author: Eurik |
Hits:
Description: 从0-9中任意选取4个不完全相同的数
比如，不能是5 5 5 5，可以是1 2 2 2
用这4个数排列出最大的数，2221，最小的数1222
最大减最小：2221-1222=0999
用0 9 9 9这四个数继续重复上述步骤
最多7步，将得到6174这个数字 -From 0-9 in the arbitrarily selected four non-identical number, for example, can not be 5555, which can be 1222 used the number 4 ranked the greatest number, 2221, the smallest number of 1222 maximum minus minimum: 2221-1222 = 0999 by 0999 the number of these four to continue to repeat the above steps up to 7 steps, this number will be 6174
Platform: |
Size: 6144 |
Author: 音乐 |
Hits:
Description: 编写程序验证6174猜想，要求使用函数。6174猜想的内容大致为：任意一个大于1000的4位数，若每位不全部相等，经过最多7次K变换可以变为6174。K变换是把4位数从大到小重新排列减去从小到大重新排列并求值。如：4948
1: 9844 - 4489 = 5355
2: 5553 - 3555 = 1998
3: 9981 - 1899 = 8082
4: 8820 - 288 = 8532
5: 8532 - 2358 = 6174-Write a program 6174 conjecture, validation request use function. The content of 6174 guess roughly include: any more than 1,000 4 digits, if each not all equal, after seven times most commutation can become 6174 K. K transform is sending four digits from large to small rearrange minus childhood rearrange and evaluated. Such as: 4948
1:9844-4489 = 5355
2: 5553- 3555 = 1998
3: 9981- 1899 = 8082
4: 8820- 288 = 8532
5: 8532- 2358 = 6174
Platform: |
Size: 166912 |
Author: zhu |
Hits:
Description: 6174问题， 6174问题，6174问题-6174 Problem
Platform: |
Size: 2048 |
Author: iwdj |
Hits:
Description: 用于解决6174问题的代码，非常简洁，可读性强-The code used to solve the 6174 problem, very concise, readable
Platform: |
Size: 2048 |
Author: 徐杰灵 |
Hits:
Description: 6174问题,通过这个程序任意输入一个数据可以判断这个数是否为 这种数-the question of 6174
Platform: |
Size: 3072 |
Author: xiaoxiang |
Hits:
Description:
Platform: |
Size: 1024 |
Author: jjaw2013 |
Hits:
Description: 220个经典C程序源码，供大家学习使用- puts("* This program is to verify Comgrich Content. *")
puts("* That is any 4-digit number whose digitals are not the same*")
puts("* has the rule: (1) range the 4 digits to get the maximum *")
puts("* 4-digit number, (2) range the 4 digits to get the minimum *")
puts("* 4-digit number, (3) get the difference of these two numbers*")
puts("* that is a new 4-digit number. Continute to calculate with *")
puts("* (1)-(3),the result in the end is 6174,the Comgrich Content.*")
Platform: |
Size: 1944576 |
Author: fg |
Hits:
Description: 数学黑洞6174
已知：一个任意的四位正整数。将数字重新组合成一个最大的数和最小的数相减，重复这个过程，最多七步必得6174。即：7641-1467=6174。将永远出不来。
求证：所有四位数数字（全相同的除外），均能得到6174。输出掉进黑洞的步数-6174 known mathematical black hole: an arbitrary four positive integer. The re-assembled into a digital number and the maximum number of minimum subtraction process is repeated up to seven steps must 6174. That :7641-1467 = 6174. Will never get out. Prove: All four-digit number (except identical), and can get 6174. Output fell into the black hole of the number of steps
Platform: |
Size: 2048 |
Author: txx |
Hits:
Description: 写出一个4位数，把它整理一下，其办法是：把这个数的各位数字按大到小顺序重新排列，结果不为6174；将这个数组合成最大数和一个最小数，用最大数减去最小数，最后结果为6174；否则继续
重复上面步骤；最后输出重复了几次！-Write a 4-digit, sort it, and its approach is: you put this figure at large to the small number rearrange the order, the result is not 6174 the maximum number of array synthesis, and a minimum number, with the greatest number of minus to the minimum number, the final result is 6174 otherwise continue
Repeat the above steps final output is repeated a few times!
Platform: |
Size: 1024 |
Author: 张家豪 |
Hits:
Description: 高次快速求幂，卡片游戏，Cantor的数表，6174代码实现，蛇形填数等问题的代码实现-High times faster exponentiation, card games, Cantor number of tables, 6174 code, the code number and other serpentine fill implementation issues
Platform: |
Size: 2048 |
Author: 甄永贺 |
Hits:
Description: 无限驱动，关于 高通
6174的驱动-driver for Qualcomm Atheros QCA6174
Platform: |
Size: 71680 |
Author: 吴江 |
Hits:
Description: 用于解决6174问题的代码，非常简洁，可读性强-The code used to solve the 6174 problem, very concise, readable
Platform: |
Size: 2048 |
Author: fanga97iu504 |
Hits:
Description: 验证卡布列克数
卡布列克常数是一个非常简单的数字，共有两个，一个是495，一个是6174。这两个数字都具有特殊的规律，对于任何各位数字不全相同的三位数字或四位数字，都可以通过一定规律的运算得到这两个数字。其运算规律为：首先，将所选数的各位数字从大到小排列组成一个新的三位数x，然后，再将各位数字按从小到大排列得到另一个新的三位数y，然后，使用大的数字减去小的数字：x-y z。得到差值z之后，对得到的结果z继续执行上述运算，直到每次都得到相同的数字为止。-Cabo Cabo lek lek verification number is a very simple constant numbers, there are two, one is 495, one is 6174. Both figures have a special law for any incomplete digits of the same three-digit or four-digit number can be obtained by certain rules of operation of these two figures. Its operation rules: First, the digits of the selected numbers in descending order to form a new three-digit number x, then, and then you press the numbers in ascending order to get another new three-digit y, then using large numbers subtract small numbers: xy z. After obtaining a difference z, z of the results obtained to continue the implementation of the operation, until the same numbers each time have been reached.
Platform: |
Size: 2048 |
Author: 水云间 |
Hits: