<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[editorc的博客]]></title><description><![CDATA[]]></description><link>https://blog.csdn.net/editorc</link><language>zh-cn</language><generator>https://blog.csdn.net/</generator><copyright><![CDATA[Copyright &copy; editorc]]></copyright><item><title><![CDATA[论文阅读：LightPool: A NVMe-oF-based High-performance and Lightweight Storage Pool Architecture for Cloud]]></title><link>https://blog.csdn.net/editorc/article/details/144595071</link><guid>https://blog.csdn.net/editorc/article/details/144595071</guid><author>editorc</author><pubDate>Thu, 19 Dec 2024 21:09:19 +0800</pubDate><description><![CDATA[​	2024 年 3 月 2 日至 3 月 6 日，在英国爱丁堡举行了第30届IEEE高性能计算机体系结构国际研讨会HPCA（30th IEEE International Symposium on High-Performance Computer Architecture），HPCA是计算机体系结构领域的四大顶级会议之一。]]></description><category></category></item><item><title><![CDATA[通过windows Docker部署hadoop集群实现数据重删]]></title><link>https://blog.csdn.net/editorc/article/details/144593629</link><guid>https://blog.csdn.net/editorc/article/details/144593629</guid><author>editorc</author><pubDate>Thu, 19 Dec 2024 20:03:18 +0800</pubDate><description><![CDATA[其中Slave节点包含DataNode和NodeManager两种角色。Client节点是用来操作的节点，所有操作都尽量在这个节点上进行。以上共10个节点，7种角色。由于官方apache/hadoop容器过于精简缺少一些hadoop运行所需的工具，所有先构建一个可以正常运行hadoop的模板镜像，再通过该模板镜像构建以上10个容器。]]></description><category></category></item><item><title><![CDATA[CINTA作业六]]></title><link>https://blog.csdn.net/editorc/article/details/122025333</link><guid>https://blog.csdn.net/editorc/article/details/122025333</guid><author>editorc</author><pubDate>Sun, 19 Dec 2021 17:46:18 +0800</pubDate><description><![CDATA[1. 设G是群，H是G的子群。任取g1,g2∈Gg_1,g_2\in Gg1​,g2​∈G，则g1H=g2Hg_1H=g_2Hg1​H=g2​H当且仅当g1−1g2∈Hg_1^{-1}g_2\in Hg1−1​g2​∈H
证明充分性：
因为g1H=g2Hg_1H=g_2Hg1​H=g2​H，所以∃h1,h2∈Hg2h2=g1h1⇔g1−1g2h2=h1⇔g1−1g2=h1h2−1\exist h_1,h_2\in H\\g_2h_2=g_1h_1\Leftrightarrow g_1^{-1}g_2h_2=]]></description><category></category></item><item><title><![CDATA[CINTA作业九]]></title><link>https://blog.csdn.net/editorc/article/details/121912741</link><guid>https://blog.csdn.net/editorc/article/details/121912741</guid><author>editorc</author><pubDate>Mon, 13 Dec 2021 21:26:37 +0800</pubDate><description><![CDATA[CINTA作业九
1.证明命题 11.2。
证明：
(1)封闭性：
∀&nbsp;a,b∈QRp&nbsp;,∃&nbsp;x,y∈Zx2≡a(mod&nbsp;p),y2≡b(mod&nbsp;p)&nbsp;,则a×b≡x2×y2=(x×y)2故a×b∈QRp\forall\  a,b\in QR_p\ ,\exist\ x,y\in Z\\
x^2\equiv a(mod\ p),y^2\equiv b(mod \ p)\ ,\\
则a\times b\equiv x^2\times y^2=(x\t]]></description><category></category></item><item><title><![CDATA[CINTA作业8]]></title><link>https://blog.csdn.net/editorc/article/details/121737052</link><guid>https://blog.csdn.net/editorc/article/details/121737052</guid><author>editorc</author><pubDate>Sun, 05 Dec 2021 22:32:21 +0800</pubDate><description><![CDATA[CINTA作业8
1.手动计算2000^2019 (mod 221)，不允许使用电脑或者其他电子设备。
解：
20002019(mod221)=(2000mod221)2019(mod221)=112019(mod221)
2000^{2019}(mod221)=(2000mod221)^{2019}(mod221)=11^{2019}(mod221)
20002019(mod221)=(2000mod221)2019(mod221)=112019(mod221)
根据中国剩余定理，定义从Zn 到Zp ×Z]]></description><category></category></item><item><title><![CDATA[CINTA作业7]]></title><link>https://blog.csdn.net/editorc/article/details/121364685</link><guid>https://blog.csdn.net/editorc/article/details/121364685</guid><author>editorc</author><pubDate>Tue, 16 Nov 2021 20:33:43 +0800</pubDate><description><![CDATA[CINTA作业7
3. 如果H1 和H2 是群G的正规子群，证明H1H2 也是群G的正规子群
证明：
因为H1 和H2 是群G的正规子群，所以对任意g∈G，有
gH1g−1=H1,gH2g−1=H2，即gH1g−1gH2g−1=gH1H2g−1=H1H2
gH_{1}g^{-1}=H_1,gH_2g^{-1}=H_2，即gH_{1}g^{-1}gH_2g^{-1}=gH_{1}H_2g^{-1}=H_1H_2
gH1​g−1=H1​,gH2​g−1=H2​，即gH1​g−1gH2​g−1=gH1​H2​g−]]></description><category></category></item><item><title><![CDATA[CINTA 作业五]]></title><link>https://blog.csdn.net/editorc/article/details/121215417</link><guid>https://blog.csdn.net/editorc/article/details/121215417</guid><author>editorc</author><pubDate>Mon, 08 Nov 2021 20:28:45 +0800</pubDate><description><![CDATA[CINTA 作业五
1、请心算列举出群 Z10 的所有生成元。
Z10的阶为10，ϕ(10)=4,即Z10有4个生成元。由心算得Z10的所有生成元是1、3、7、9.
Z_{10}的阶为10，\phi (10)=4,即Z_{10}有4个生成元。由心算得Z_{10}的所有生成元是1、3、7、9.
Z10​的阶为10，ϕ(10)=4,即Z10​有4个生成元。由心算得Z10​的所有生成元是1、3、7、9.
2、群 Z_17^*有多少个生成元?已知 3 是其中一个生成元，请问 9 和 10 是否生成元
Z17∗的阶为]]></description><category></category></item><item><title><![CDATA[CINTA作业四]]></title><link>https://blog.csdn.net/editorc/article/details/120962698</link><guid>https://blog.csdn.net/editorc/article/details/120962698</guid><author>editorc</author><pubDate>Mon, 25 Oct 2021 23:06:01 +0800</pubDate><description><![CDATA[CINTA作业四
1.命题6.6证明
设G为群，且a,b,c ∈G。如果ba = ca，则b = c；并且，如果ab = ac，则b = c
证：
因为G为群，且a,b,c ∈G,所以
∃a−1∈G，使得a⋅a−1=e=a−1⋅a
\exist a^{-1}∈G，使得a ·a^{-1} = e = a^{-1}·a\\
∃a−1∈G，使得a⋅a−1=e=a−1⋅a
又因为ba=ca,所以
baa−1=caa−1即b=a
baa^{-1}=caa^{-1}即b=a
baa−1=caa−1即b=a
同理因为ab]]></description><category></category></item><item><title><![CDATA[CINTA作业三]]></title><link>https://blog.csdn.net/editorc/article/details/120734619</link><guid>https://blog.csdn.net/editorc/article/details/120734619</guid><author>editorc</author><pubDate>Tue, 12 Oct 2021 23:31:13 +0800</pubDate><description><![CDATA[CINTA作业三
1、实现求乘法逆元的函数，给定a和m，求a模m的乘法逆元，无解时请给出无解提示，并且只返回正整数。进而给出求解同余方程（ax = b mod m）的函数，即给定a，b，m，输出满足方程的x，无解给出无解提示。
#include&lt;iostream&gt;
using namespace std;

int gcd(int x, int y)
{
	if (x &lt; y)swap(x, y);
	int tem = 0;
	while (y != 0)
	{
		tem = x % ]]></description><category></category></item><item><title><![CDATA[CINTA作业二]]></title><link>https://blog.csdn.net/editorc/article/details/120631368</link><guid>https://blog.csdn.net/editorc/article/details/120631368</guid><author>editorc</author><pubDate>Wed, 06 Oct 2021 23:46:24 +0800</pubDate><description><![CDATA[Bezout定理的完整证明
求证：a、b是非零整数，存在整数r、s使得gcd(a,b)=ar+bs
证明：
令S={am+bn:m,n∈Z,且am+bn≥0}
令S=\{am + bn : m, n \in Z,且am + bn ≥ 0\}
令S={am+bn:m,n∈Z,且am+bn≥0}
因为am+bn是a,b的线性组合，所以存在m,n∈Z，使得am+bn≥0.
即集合S非空，根据良序原则，取其中最小值 d = ar + bs.
令q=⌊a/d⌋,令t=a&nbsp;mod&nbsp;d=a−q(am+]]></description><category></category></item><item><title><![CDATA[CINTA作业一]]></title><link>https://blog.csdn.net/editorc/article/details/120514557</link><guid>https://blog.csdn.net/editorc/article/details/120514557</guid><author>editorc</author><pubDate>Mon, 27 Sep 2021 21:45:05 +0800</pubDate><description><![CDATA[迭代版本的简单乘法
#include&lt;iostream&gt;
#include"math.h"
using namespace std;

int multiply(int a, int b)
{
	int sign=1;
	if (a == 0 || b == 0)return 0;
	if (a &lt; 0 &amp;&amp; b&gt;0 || a &gt; 0 &amp;&amp; b &lt; 0) {
		sign = -1;
		a = abs(a);
		b = abs(b);
]]></description><category></category></item><item><title><![CDATA[使用GMP库生成随机大素数]]></title><link>https://blog.csdn.net/editorc/article/details/120384111</link><guid>https://blog.csdn.net/editorc/article/details/120384111</guid><author>editorc</author><pubDate>Sun, 19 Sep 2021 20:11:03 +0800</pubDate><description><![CDATA[题目：
生成两个随机的大素数p和q，分别有512比特长。
把p和q相乘，赋值为n。
求比n小且与n互素的整数的个数，记为euler，并输出：p、q、n和euler
#include &lt;stdio.h&gt;
#include &lt;gmp.h&gt;
#include&lt;time.h&gt;

int main()
{
    clock_t time = clock();
    gmp_randstate_t grt;
    gmp_randinit_default(grt);
    g]]></description><category></category></item><item><title><![CDATA[2021-08-04]]></title><link>https://blog.csdn.net/editorc/article/details/119377816</link><guid>https://blog.csdn.net/editorc/article/details/119377816</guid><author>editorc</author><pubDate>Wed, 04 Aug 2021 10:35:45 +0800</pubDate><description><![CDATA[插入排序
void insertionSort(int *p,int len)
{
	for (int j = 1; j &lt; len; j++)
	{
		for (int i = j - 1; i &gt;= 0 &amp;&amp; p[i] &gt; p[i + 1]; i--)
		{
			int tem = p[i];
			p[i] = p[i + 1];
			p[i + 1] = tem;
		}
	}
}

二进制转换
void to_binary(int n)
{
	if (n ]]></description><category></category></item><item><title><![CDATA[2021-07-30]]></title><link>https://blog.csdn.net/editorc/article/details/119257809</link><guid>https://blog.csdn.net/editorc/article/details/119257809</guid><author>editorc</author><pubDate>Fri, 30 Jul 2021 23:36:33 +0800</pubDate><description><![CDATA[请用归纳法证明以下定理：
对任意的正整数n,
12+22+32+⋯+n2=n(2n+1)(n+1)6
1^2+2^2+3^2+\cdots+n^2=\frac{n(2n+1)(n+1)}{6}
12+22+32+⋯+n2=6n(2n+1)(n+1)​
1.
n=1时,
1=1∗2∗36
1=\frac{1*2*3}{6}
1=61∗2∗3​
等式成立
2.
假设n=k时，结论成立，即
12+22+32+⋯+k2=k(2k+1)(k+1)6
1^2+2^2+3^2+\cdots+k^2=\frac{k(2k+]]></description><category></category></item></channel></rss>