Dirichlet‘s Theorem on Arithmetic Progressions

于 2021-12-21 09:13:22 发布
阅读量261 收藏
点赞数 1
文章标签： c语言
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/Rukio/article/details/122054443
版权
这篇博客介绍了Dirichlet定理，即在互质的两个正整数a和d组成的等差数列中存在无穷多个质数。文章通过示例解释定理，并提供了一个编程任务，要求编写程序找到该等差数列中第n个质数。还给出了样例输入和输出，并分享了实现算法的思路，包括为何放弃使用质数数组而选择使用标志数组来标记质数。
摘要由CSDN通过智能技术生成

Description

If a and d are relatively prime positive integers, the arithmetic sequence beginning with a 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 the nth prime number in this arithmetic sequence for given positive integ

最低0.47元/天 解锁文章
Rukio
关注
  • 1
    点赞
  • 踩
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
POJ 3006 Dirichlet's Theorem on Arithmetic Progressions（我的水题之路——加i个d后的第几个素数）
02-13 724
Dirichlet's Theorem on Arithmetic Progressions Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 11068   Accepted: 5539 Description If a and d are relatively
POJ3006-Dirichlet's Theorem on Arithmetic Progressions
07-29
北大POJ3006-Dirichlet's Theorem on Arithmetic Progressions 解题报告+AC代码
POJ3006-Dirichlet's Theorem on Arithmetic Progressions解题报告
princeyuan的专栏
07-17 876
Dirichlet's Theorem on Arithmetic Progressions Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 11749   Accepted: 5923 Description If a and d are relatively p
Dirichlet's Theorem on Arithmetic Progressions
你就是根号四的博客
07-31 493
K - Dirichlet’s Theorem on Arithmetic Progressions Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%lld & %llu SubmitStatus Description If a and d are relatively prime positive integ
poj 3006 Dirichlet's Theorem on Arithmetic Progressions
weixin_30859423的博客
11-22 78
Dirichlet's Theorem on Arithmetic Progressions Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 10814 Accepted: 5388 Description If a and d are relatively p...
DP.rar_Dirichlet_dirichlet process
09-14
**Dirichlet过程（Dirichlet Process）**是一种在概率论和统计学中广泛使用的无穷分布，特别是在非参数贝叶斯方法中。它允许我们处理无穷维的概率分布，而无需指定具体的维数。Dirichlet过程是混合模型的基础，常...
dirichlet process K-means_Kmeans_dirichlet process
最新发布
09-23
标题中的“Dirichlet Process K-means”和“Kmeans_dirichlet process”指的是将狄利克雷过程（Dirichlet Process）与经典的K-means聚类算法相结合的一种拓展方法。这种结合允许我们在不知道确切类别数量的情况下...
Dirichlet 过程与中国餐馆过程
08-30
对Dirichlet 过程进行了简单的介绍，其中，结合与中国餐馆过程对其进行了形象的解释，希望对用到的人能够有帮助。
O - Dirichlet's Theorem on Arithmetic Progressions
nwpuyxf的博客
02-06 207
判断素数的时候记忆一下，之后再用到的时候省时间，否则会超时
poj3006 Dirichlet's Theorem on Arithmetic Progressions
08-31 518
题目描述： 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
poj3006Dirichlet's Theorem on Arithmetic Progressions
alven‘s bookcase
09-08 398
今晚上就水题消遣了吧。。。。 #include #include #include using namespace std; int a,d,n,i,j,save=0; bool sets[1500000]; int main(){ memset(sets,
Dirichlet's Theorem on Arithmetic Progressions(素数筛)
Rocky0429
09-30 1731
Dirichlet's Theorem on Arithmetic Progressions Time Limit: 1000ms   Memory limit: 65536K  有疑问？点这里^_^ 题目描述 Good evening, contestants. If a and d are relatively prime positive integers, t
POJ 3006：Dirichlet's Theorem on Arithmetic Progressions题解报告（C++）
一步一脚印
05-28 252
原题网址：http://poj.org/problem?id=3006题目描述：DescriptionIf a and d are relatively prime positive integers, the arithmetic sequence beginning with a and increasing by d, i.e., a, a + d, a + 2d, a + 3d, a + ...
POJ3006 Dirichlet's Theorem on Arithmetic Progressions【筛选法】
海岛Blog
01-05 624
Dirichlet's Theorem on Arithmetic Progressions Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 19673   Accepted: 9836 Description If a and d are relatively
POJ 3006 Dirichlet‘s Theorem on Arithmetic Progressions（又双叒叕是素数筛）
Defepe
07-08 148
Dirichlet’s Theorem on Arithmetic Progressions If a and d are relatively prime positive integers, the arithmetic sequence beginning with a and increasing by d, i.e., a, a + d, a + 2d, a + 3d, a + 4d, …, contains infinitely many prime numbers. This fact is
打表问题O - Dirichlet's Theorem on Arithmetic Progressions
Nice_punch的博客
03-23 298
打表问题O - Dirichlet's Theorem on Arithmetic Progressions If a and d are relatively prime positive integers, the arithmetic sequence beginning with a and increasing by d, i.e., a, a + d, a + 2d, a
理解Latent Dirichlet Allocation：贝叶斯统计与Dirichlet分布
"Latent Dirichlet Allocation (LDA)笔记" Latent Dirichlet Allocation (LDA)是一种主题模型，用于发现文本数据中的隐藏主题结构。它属于概率图模型和混合模型，常用于自然语言处理领域。LDA基于贝叶斯统计学，...
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值