绝对能看懂
DKwtno
努力是有瘾的(github同名)
展开
-
证明[0,1]与(0,1)等势
创建集合A1={12,13,14,...}A_1=\{ \frac{1}{2},\frac{1}{3},\frac{1}{4},...\}A1={21,31,41,...}A2={0,1,12,13,14,...}A_2=\{0,1,\frac{1}{2},\frac{1}{3},\frac{1}{4},...\}A2={0,1,21,31,41,...}有:(0,1)=A1⋃B(0,1)=A_1 \bigcup B(0,1)=A1⋃B[0,1]=A2⋃B[0,1]=A_2 \b原创 2020-09-24 15:03:13 · 4970 阅读 · 0 评论 -
证明:dim(Null(A))+rank(A)=0
假设A为nxn方阵。当r(A)=n时,Ax=0的解集是{0}。由定义可知,dim({0})={0}的基的个数=0,所以0+n=n。当r(A)=0时,Ax必然等于0,用X表示x的解空间,则由dim(X)=n,所以n+0=n。当r(A)=r时,A必定由r个非零行,不妨假设前r行为非零行,利用高斯消元法可将后n-r行化成0,因此方程组必有n-r个自由未知数,即基础解系中包含n-r个解向量,所以dim(X)=n-r,故r+n-r=0综上,dim(Null(A))+rank(A)=0。...原创 2020-09-23 20:59:03 · 1866 阅读 · 2 评论 -
[绝对能看懂!]Deciphering Password(积性函数+线性筛+素数分解)
描述Xiaoming has just come up with a new way for encryption, by calculating the key from a publicly viewable number in the following way:Let the public key N = A^B, where 1 <= A, B <= 1000000, a...原创 2018-12-08 20:40:58 · 246 阅读 · 0 评论 -
Mysql 每天凌晨对数据库中过期的旅行团设置
Mysql事件调度器show variables like '%event_scheduler%';set global event_scheduler=1;/*每天凌晨1点对数据库group表内数据项进行检查,若start_time小于当天日期,则置状态为0,表示旅游团已关闭*/CREATE EVENT IF NOT EXISTS update_group_activated ...原创 2018-12-15 14:00:25 · 272 阅读 · 0 评论