Description: For any positive integer x, which number divisors denoted n (x). E.g., n (1) 1, n (6) 4. If a positive integer x full
Foot: for any i (0 <i <x) has n (i) <n (x), x is called emirp.
Now a given interval [a, b], please obtain the intervals so that x n (x) maximum.
To Search:
File list (Check if you may need any files):
antiprime_反素数\antiprime_反素数.cpp
................\antiprime_反素数.dsp
................\antiprime_反素数.dsw
................\antiprime_反素数.ncb
................\antiprime_反素数.opt
................\antiprime_反素数.plg
................\Debug\antiprime_反素数.exe
................\.....\antiprime_反素数.ilk
................\.....\antiprime_反素数.obj
................\.....\antiprime_反素数.pch
................\.....\antiprime_反素数.pdb
................\.....\StdAfx.obj
................\.....\vc60.idb
................\.....\vc60.pdb
................\ReadMe.txt
................\StdAfx.cpp
................\StdAfx.h
................\Debug
antiprime_反素数
Download