首页> 外国专利> Prime number finding formula for use as searching program in computer, has structure common to all prime numbers, where successive application of formula on prime numbers permits to exclude products of prime numbers from set

Prime number finding formula for use as searching program in computer, has structure common to all prime numbers, where successive application of formula on prime numbers permits to exclude products of prime numbers from set

机译:素数查找公式,用作计算机中的搜索程序,具有所有素数共有的结构,对素数连续应用公式允许从集合中排除素数的乘积

摘要

The formula has a structure common to all prime numbers. The successive application of the formula on the prime numbers permits to exclude products of the prime numbers from a set. The application of the formula permits to know prime numbers comprised in the range between 1 and square of next prime number to be applied by the formula and generates an exclusion algorithm, where the prime number applied by the formula is a factor.
机译:该公式具有所有素数共有的结构。在素数上连续应用公式可以从一组中排除素数的乘积。公式的应用允许知道介于1和要由公式应用的下一个素数的平方之间的范围内的素数,并生成排除算法,其中公式所应用的素数是一个因子。

著录项

  • 公开/公告号FR2918778A1

    专利类型

  • 公开/公告日2009-01-16

    原文格式PDF

  • 申请/专利权人 CREWS RICHARD;

    申请/专利号FR20070005007

  • 发明设计人 CREWS RICHARD;

    申请日2007-07-10

  • 分类号G06F17/10;

  • 国家 FR

  • 入库时间 2022-08-21 19:07:26

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号