modification to home pg

sjay05 · sjay05 · commit 9ee8fd286aad · 2023-10-05T18:16:26.000-04:00
diff --git a/_data/navigation.yml b/_data/navigation.yml
@@ -10,4 +10,4 @@ main:
   - title: "Archive"
     url: /archives/
   - title: "Github"
-    url: https://github.com/sjay05
+    url: https://github.com/sjay05?tab=repositories
diff --git a/_posts/aac1p5/2021-07-01-aac1p5.md b/_posts/aac1p5/2021-07-01-aac1p5.md
diff --git a/_posts/articles/2023-06-05-articles.md b/_posts/articles/2023-06-05-articles.md
@@ -0,0 +1,13 @@
+---
+layout: post
+title:  "My Articles"
+---
+
+### [Investigating the RSA Cipher & Diffe-Hellman Key Exchange](https://sjay05.github.io/MathEE.pdf)
+- Covered and proved Modular Arithmetic & Number Theory Essentials (FLT, CRT) to introduce the RSA Cipher and provide a proof of correctness.
+- My **Mathematics Extended Essay** that I completed for the IB Diploma
+
+### [The relationship of Temperature (˚T) on the spring constant of Polymer molecules (i.e., Rubber Bands)](https://sjay05.github.io/SL_Physics_IA.pdf)
+- Investigated an extension into Young's modulus (by comparing stress/strain under varying temperatures)
+- Outlined the limitations of Hooke's law in the real-world by considering the elasticity of rubber-like materials
+- My **Phyics Internal Assessment** that I completed for the IB Diploma (SL Physics)
diff --git a/_posts/pdigit/2022-10-24-pdigit.md b/_posts/pdigit/2022-10-24-pdigit.md
@@ -8,7 +8,7 @@ Problem Link: [https://dmoj.ca/problem/pdigit](https://dmoj.ca/problem/pdigit)
 This post will dicuss the solution for the problem linked above, that I created
 for a mini-contest in DMOJ.
 
-## Statement 
+### Statement 
 
 You are given two integers ~n~ and ~k~, and can perform operations to ~n~.
 
@@ -21,7 +21,7 @@ that ~n~ will end up being divisible by ~k~.
 Note: ~n~ and ~k~ can be fairly large with bounds ~(1 \le n, k \le 10^9)~, and 
 you are required to answer ~t~ test cases.
 
-## Subtask 1
+### Subtask 1
 
 ~1 \le k, \le 9~ 
 
@@ -30,13 +30,13 @@ each case.
 
 Note: This subtask doesn't exist in the linked problem.
 
-## Subtask 2
+### Subtask 2
 
 ~1 \le t \le 10^5~
 
 ~1 \le n, k, \le 10^9~
 
-### Step 1 
+#### Step 1 
 
 Since ~t~ can be ~10^5~, we are looking for a ~\mathcal{O}(T \cdot \log N)~, or ~\mathcal{O}(T)~ with some form of log factor, unless this problem can be solved in constant time.
 
diff --git a/articles.md b/articles.md
@@ -5,8 +5,10 @@ permalink: /articles/
 ---
 
 ### [Investigating the RSA Cipher & Diffe-Hellman Key Exchange](https://sjay05.github.io/MathEE.pdf)
-- Focusing on how Mathematical concepts are used in cryptographic solutions to achieve Information Security
-- My Mathematics Extended Essay that I completed for the IB Diploma
+- Covered and proved Modular Arithmetic & Number Theory Essentials (FLT, CRT) to introduce the RSA Cipher and provide a proof of correctness.
+- My **Mathematics Extended Essay** that I completed for the IB Diploma
 
 ### [The relationship of Temperature (˚T) on the spring constant of Polymer molecules (i.e., Rubber Bands)](https://sjay05.github.io/SL_Physics_IA.pdf)
-- My Phyics Internal Assessment that I completed for the IB Diploma (SL Physics)
+- Investigated an extension into Young's modulus (by comparing stress/strain under varying temperatures)
+- Outlined the limitations of Hooke's law in the real-world by considering the elasticity of rubber-like materials
+- My **Phyics Internal Assessment** that I completed for the IB Diploma (SL Physics)
