Dirichlet's Theorem on Arithmetic Progressions
来源:互联网 发布:js中动态生成表格 编辑:程序博客网 时间:2024/05/17 02:22
Description
If a and d are relatively prime positive integers, the arithmetic sequence beginning witha and increasing by d, i.e., a, a + d,a + 2d, a + 3d, a + 4d, ..., contains infinitely many prime numbers. This fact is known as Dirichlet's Theorem on Arithmetic Progressions, which had been conjectured by Johann Carl Friedrich Gauss (1777 - 1855) and was proved by Johann Peter Gustav Lejeune Dirichlet (1805 - 1859) in 1837.
For example, the arithmetic sequence beginning with 2 and increasing by 3, i.e.,
2, 5, 8, 11, 14, 17, 20, 23, 26, 29, 32, 35, 38, 41, 44, 47, 50, 53, 56, 59, 62, 65, 68, 71, 74, 77, 80, 83, 86, 89, 92, 95, 98, ... ,
contains infinitely many prime numbers
2, 5, 11, 17, 23, 29, 41, 47, 53, 59, 71, 83, 89, ... .
Your mission, should you decide to accept it, is to write a program to find thenth prime number in this arithmetic sequence for given positive integersa, d, and n.
Input
The input is a sequence of datasets. A dataset is a line containing three positive integersa, d, and n separated by a space. a and d are relatively prime. You may assumea <= 9307, d <= 346, and n <= 210.
The end of the input is indicated by a line containing three zeros separated by a space. It is not a dataset.
Output
The output should be composed of as many lines as the number of the input datasets. Each line should contain a single integer and should never contain extra characters.
The output integer corresponding to a dataset a, d, n should be thenth prime number among those contained in the arithmetic sequence beginning witha and increasing by d.
FYI, it is known that the result is always less than 106 (one million) under this input condition.
Sample Input
367 186 151179 10 203271 37 39103 230 127 104 185253 50 851 1 19075 337 210307 24 79331 221 177259 170 40269 58 1020 0 0
Sample Output
928096709120371039352314503289942951074127172269925673
#include <iostream>#include <math.h>#include <string>using namespace std;int main(){int a,d,n;while(cin>>a>>d>>n&&(a||d||n)){int i,j,k=1,sushu[100001];int m;for(i=a;i<=1000001;i=i+d){m=int(sqrt((double)i)); for(j=2;j<=m;j++){if(i%j==0)break;}if(j>m&&i!=1){sushu[k]=i;if(k==n)break;k++;}}cout<<sushu[n]<<endl;}return 0;}
- POJ3006 Dirichlet's Theorem on Arithmetic Progressions
- POJ3006:Dirichlet's Theorem on Arithmetic Progressions
- Dirichlet's Theorem on Arithmetic Progressions
- Dirichlet's Theorem on Arithmetic Progressions
- Dirichlet's Theorem on Arithmetic Progressions
- poj3006 Dirichlet's Theorem on Arithmetic Progressions
- Dirichlet's Theorem on Arithmetic Progressions
- POJ3006 Dirichlet's Theorem on Arithmetic Progressions
- Dirichlet's Theorem on Arithmetic Progressions
- 3006. Dirichlet's Theorem on Arithmetic Progressions
- POJ 3006 Dirichlet's Theorem on Arithmetic Progressions(素数表)
- poj 3006 Dirichlet's Theorem on Arithmetic Progressions
- POJ 3006 Dirichlet's Theorem on Arithmetic Progressions
- POJ 3006 Dirichlet's Theorem on Arithmetic Progressions 素数
- POJ 3006 Dirichlet's Theorem on Arithmetic Progressions
- poj 3006 Dirichlet's Theorem on Arithmetic Progressions
- POJ3006-Dirichlet's Theorem on Arithmetic Progressions解题报告
- POJ 3006 Dirichlet's Theorem on Arithmetic Progressions
- <<Oracle Applications DBA 基础(第二期)>>Week 15 exercise
- swfupload组件后台获取中文文件名乱码的问题解决
- 黑马程序员----Overload和Override、可变参数、枚举
- 黑马程序员--IO流(下)
- POJ1328
- Dirichlet's Theorem on Arithmetic Progressions
- 神经网络与SVMs在医学领域的应用实例
- openstack_ice之wsgi详解(paste从ini配置文件->routesr具体发布流程)
- 一个C语言程序的编译过程
- UVA10785 The Mad Numerologist
- Win7下编译Hadoop1.2.1源码
- 【转载】ACE中的Double Checked Locking模式
- 第九章 两种模式的比较
- android 打开蓝牙设备 显示已经配对的蓝牙设备 ,并将已配对的蓝牙设备显示在textview中