包含标签:math 的文章
-
crimboi[22] 你什么拓扑?
funny problem from model theory problem sheet 题面 Let L be a countable language, T a theory. Let c_1,c_2,... be new constants, L'=L\cup\lbrace c_1,...\rbrace, and let X be the set of all complete theories of L' with T\subset t. Enumerate the L' se…… -
crimboi[21] 模仿大赛
Rotman algebraic topology上的题, 个人认为出的非常好, 极大增进了读者对\pi_1(S^1)计算过程的理解. 题面 A group G which is also a topology space is called a topological group if \mu:G\times G\to G:(x,y)\mapsto xy and i:G\to G:x\mapsto x^{-1} are contin…… -
crimboi[20] 泛函分析心犯寒
Dieudonne的题, 真实难度不好说, 回顾一下发现其实挺简单的. 题面 Let E be a Hilbert space, F a dense linear subspace of E, distinct from E. (For example E space of l^2 sum of a suitable countable linear independent set and F space of finite sum of thi…… -
小科普之Principal Ideal Domain is not necessarily Euclidean Domain
It's a well known fact that Euclidean domains are principal ideal domain by taking the element in a certain ideal with smallest \varphi value. Yet the converse is false, and one counterexample just lies among our familiar algebraic integer rings, \…… -
crimboi[19] 吃屎绕大弯
题目背景 为证一个非零吃大师 题面 Assuming AC, prove that for a integral domain R, if any nonzero prime ideal P contains a nonzero prime (p), R is UFD. 先想再看提示哦 提示 Let S be the set of elements that are prime factori…… -
微科普之Necessary and sufficient condition for a sequence to be graphic
This proof is due to Choudum. A sequence of nonnegative integers (d_1,...,d_n) is called graphic if there is a simple graph G with V(G)=\lbrace v_1,...,v_n\rbrace and d(v_i)=d_i. It's very easy to show that if a nonincreasing sequence, i.e. d_1\ge …… -
[indiscipline][2] 初中不等式
飞机上半昏迷状态下以为无法调整, 暴力算出来的搞笑解答. 非常具有统计色彩 (nod) 题面 A simple graph G is called complete k-partite if there's a partion of V(G): A_1,..., A_k s.t. for all i there's no edge with both vertices in A_i , and for any v\in A…… -
2024春南京大学信计强基离散数学期末考试题目速报(Prof. Yuan Zhang, Penghui Yao)
2小时,100分满分,内容是图论,开卷,可带电子设备,可查阅课程笔记和资料,不可上网。点击长图查看: -
南京大学 2024综合评价考试游记
大家好,这里是潜水已久的Zzzyt。虽然高考已经烂完了,NJU上不了一点,但是综评已经交了钱,不得不品尝,当作旅游罢了。 笔者报考的是 特长类 计算机科学与技术 笔者考场应到36人,实到28人。计科似乎有三个考场。 试题回忆 去年真题传送门 居然改题型,狡猾!!题目…… -
中科普之alternating group is simple for n>=5
It's a well-known fact that the alternating groups, A_n, are simple for n\neq 4, with small cases like A_1, A_2, A_3 very easy to verify. Yet most proofs of n\geq 5, including Hungerford's, relies heavily on 'magical' permutation composition, which……