Recent changes
Jump to navigation
Jump to search
Track the most recent changes to the wiki on this page.
List of abbreviations:
- N
- This edit created a new page (also see list of new pages)
- m
- This is a minor edit
- b
- This edit was performed by a bot
- (±123)
- The page size changed by this number of bytes
15 May 2024
|
|
07:07 | (Upload log) [Kvrmnks; Liuexp (2×)] | |||
|
|
07:07 Kvrmnks talk contribs uploaded a new version of File:Computational Method 2024 Assignments 6.pdf | ||||
|
|
05:33 Liuexp talk contribs uploaded a new version of File:计算方法10-2024.pdf | ||||
|
|
05:30 Liuexp talk contribs uploaded File:计算方法11-谱图论-2024.pdf | ||||
|
|
05:33 | (Deletion log) [Liuexp (2×)] | |||
|
|
05:33 Liuexp talk contribs deleted page File:计算方法10-2024.pdf (Deleted old revision 20240515053301!计算方法10-2024.pdf: Duplicated file: content before blanking was: "") | ||||
|
|
05:33 Liuexp talk contribs deleted page File:计算方法10-2024.pdf (Deleted old revision 20240508105333!计算方法10-2024.pdf: Duplicated file: content before blanking was: "") | ||||
| 05:31 | 计算方法 Numerical method (Spring 2024) diffhist +66 Liuexp talk contribs (→Lecture Notes) | ||||
14 May 2024
| 17:15 | 组合数学 (Fall 2023)/Problem Set 3 diffhist −1 Roundgod talk contribs (→Problem 1) | ||||
|
|
N 17:15 | 组合数学 (Spring 2024)/Problem Set 3 3 changes history +2,925 [Roundgod; Gispzjz (2×)] | |||
|
|
17:15 (cur | prev) −1 Roundgod talk contribs (→Problem 1) | ||||
|
|
15:55 (cur | prev) +1 Gispzjz talk contribs (→Problem 5) | ||||
| N |
|
15:55 (cur | prev) +2,925 Gispzjz talk contribs (Created page with "== Problem 1 == Solve the following two existence problems: * You are given <math>n</math> integers <math>a_1,a_2,\dots,a_n</math>, such that for each <math> 1\leq i\leq n</math> it holds that <math>i-n\leq a_i\leq i-1</math>. Show that there exists a '''nonempty''' subsequence (not necessarily consecutive) of these integers, whose sum is equal to <math> 0 </math>. (Hint: Consider <math> b_i=a_i-i </math>) * You are given two '''multisets''' <math> A </math> and <ma...") | |||
|
|
17:13 | 组合数学 (Spring 2024) 7 changes history +424 [Gispzjz; Etone; Roundgod (5×)] | |||
|
|
17:13 (cur | prev) +201 Roundgod talk contribs (→Announcement) | ||||
|
|
15:24 (cur | prev) +61 Gispzjz talk contribs (→Assignments) | ||||
|
|
13:06 (cur | prev) +2 Roundgod talk contribs (→Assignments) Tag: Manual revert | ||||
|
|
13:05 (cur | prev) +2 Roundgod talk contribs (→Assignments) | ||||
|
|
13:04 (cur | prev) −4 Roundgod talk contribs (→Assignments) Tag: Manual revert | ||||
|
|
13:04 (cur | prev) +4 Roundgod talk contribs (→Assignments) | ||||
|
|
09:38 (cur | prev) +158 Etone talk contribs (→Lecture Notes) | ||||
| N 16:06 | 计算方法 Numerical method (Spring 2024)/Homework5 提交名单 diffhist +2,091 Kvrmnks talk contribs (Created page with " 如有错漏请邮件联系助教. <center> {| class="wikitable" |- ! 学号 !! 姓名 |- | 191240047 || 孙宇飞 |- | 201240036 || 钱儒凡 |- | 211240013 || 李昀芃 |- | 211240020 || 朱睿骐 |- | 211240035 || 王祉天 |- | 211294003 || 倪昀 |- | 221180133 || 黄可唯 |- | 221220002 || 沈均文 |- | 221220003 || 林涵坤 |- | 221220019 || 洪观澜 |- | 221220027 || 蒋宇阳 |- | 221220029 || 陈俊翰 |- | 221220033 || 孙一鸣 |- | 22122003...") | ||||
|
|
16:06 | 计算方法 Numerical method (Spring 2024) 3 changes history +269 [Kvrmnks (3×)] | |||
|
|
16:06 (cur | prev) +95 Kvrmnks talk contribs (→Assignments) | ||||
|
|
08:33 (cur | prev) 0 Kvrmnks talk contribs (→Assignments) | ||||
|
|
08:29 (cur | prev) +174 Kvrmnks talk contribs (→Assignments) | ||||
| N 13:06 | 组合数学 (Spring 2024)/Problem Set 2 diffhist +5,164 Roundgod talk contribs (Created page with "== Problem 1 == Count the number of lattice paths from <math>(0, 0)</math> to <math>(n, n)</math> with steps up and to the right, when two paths are considered equal if one can be moved on top of the other by a rotation or reflection. For example: center|frameless (Hint: Represent a path as a sequence of <math>0</math>s and <math>1</math>s and determine the group that acts on these sequences.) == Problem 2 == Suppose we are given <math>m</math> <math>n<...") | ||||
| N 13:05 | 组合数学 (Spring 2024)/Problem Set 1 diffhist +1,789 Roundgod talk contribs (Created page with "== Problem 1 == How many <math>n\times m</math> matrices of <math>0</math>'s and <math>1</math>'s are there, such that every row and column contains an even number of <math>1</math>'s? An odd number of <math>1</math>'s? == Problem 2 == * There is a set of <math>2n</math> people: <math>n</math> male and <math>n</math> female. A good party is a set with the same number of male and female. How many possibilities are there to build such a good party? * Try to express the a...") | ||||
| N 09:38 | 组合数学 (Fall 2024)/Extremal graph theory diffhist +18,939 Etone talk contribs (Created page with "== Forbidden Cliques == Extremal graph theory studies the problems like "how many edges that a graph <math>G</math> can have, if <math>G</math> has some property?" === Mantel's theorem === We consider a typical extremal problem for graphs: the largest possible number of edges of '''triangle-free''' graphs, i.e. graphs contains no <math>K_3</math>. {{Theorem|Theorem (Mantel 1907)| :Suppose <math>G(V,E)</math> is graph on <math>n</math> vertice without triangles. Then <m...") | ||||
|
|
08:35 | (Upload log) [Kvrmnks (2×)] | |||
|
|
08:35 Kvrmnks talk contribs uploaded a new version of File:Computational Method 2024 Assignments 6.pdf | ||||
|
|
08:28 Kvrmnks talk contribs uploaded File:Computational Method 2024 Assignments 6.pdf | ||||