foryourhealth111-pixel/cs-foundations
bundled/skills/cs-foundations/SKILL.md
Master discrete mathematics, logic, formal proofs, and computational thinking. Build the mathematical foundation for all computer science.
$ install --global
skillsauthnpx skillsauth add foryourhealth111-pixel/vco-skills-codex cs-foundationsInstall this skill globally with one command. Works with Claude Code, Cursor, and Windsurf.
Security Scan Results
3 of 9 scanners reported clean
Some scanners were skipped, did not run, or reported a non-clean status. Review each row below.
3
Scanners Passed
9
Scanners in report
Clean
TrivyContainer and dependency vulnerability scanner
95%
Clean
SemgrepStatic code analysis for vulnerabilities
95%
Clean
mcp-scan (Snyk)Model Context Protocol security validation
95%
Skipped
Snyk (dep)Open source security scanning
50%
Skipped
Socket.devSupply chain security analysis
50%
Skipped
VirusTotalMulti-engine malware detection
50%
Skipped
CrowdStrikeAdvanced threat intelligence
50%
Skipped
OSV-ScannerOpen Source Vulnerability database check
50%
Skipped
OWASP Dep-Check
50%
Last scanned: Apr 14, 2026, 2:52 AM36.5s1 file scanned
SKILL.md
- name:
- cs-foundations
- description:
- Master discrete mathematics, logic, formal proofs, and computational thinking. Build the mathematical foundation for all computer science.
- sasmp_version:
- 1.3.0
- bonded_agent:
- 01-cs-foundations-expert
- bond_type:
- PRIMARY_BOND
CS Foundations Skill
Skill Metadata
skill_config:
version: "1.0.0"
category: theoretical
prerequisites: []
estimated_time: "6-8 weeks"
difficulty: intermediate
parameter_validation:
topic:
type: string
enum: [logic, proofs, sets, functions, combinatorics, number-theory, graphs]
required: true
depth:
type: string
enum: [intro, standard, advanced]
default: standard
retry_config:
max_attempts: 3
backoff_strategy: exponential
initial_delay_ms: 500
observability:
log_level: INFO
metrics: [topic_usage, proof_verification_rate, exercise_completion]
Quick Start
Computer science is built on mathematics. Master these fundamentals:
Core Topics
Discrete Mathematics
- Set theory and operations
- Logic and proof techniques
- Combinatorics and counting
- Number theory basics
- Relations and functions
Computational Thinking
- Problem decomposition
- Abstraction and generalization
- Pattern recognition
- Algorithmic thinking
Formal Logic
- Propositional logic
- Predicate logic
- Proof by induction
- Truth tables and logical equivalence
Learning Path
Week 1: Logic Basics
- Boolean algebra
- Truth tables
- Logical operators
- Inference rules
Week 2: Proof Techniques
- Direct proof
- Proof by contradiction
- Mathematical induction
- Strong induction
Week 3: Set Theory
- Set operations (∪, ∩, complement)
- Cartesian product
- Relations
- Equivalence relations
Week 4: Functions
- Function notation
- Domain, codomain, range
- One-to-one and onto
- Function composition
Week 5: Combinatorics
- Counting principles
- Permutations
- Combinations
- Pigeonhole principle
Week 6: Number Theory
- Modular arithmetic
- Prime numbers
- GCD and Euclidean algorithm
- Congruence
Practice Problems
- Prove by induction that 1+2+...+n = n(n+1)/2
- Prove √2 is irrational
- Show A ∪ (B ∩ C) = (A ∪ B) ∩ (A ∪ C)
- Count functions from {1,2,3} to {a,b}
- Solve: x ≡ 5 (mod 12) and x ≡ 3 (mod 8)
Troubleshooting
| Issue | Root Cause | Resolution | |-------|------------|------------| | Proof stuck | Missing case or wrong direction | Check base case, verify induction step | | Set operation confusion | ∪ vs ∩ mix-up | Draw Venn diagram | | Counting error | Overcounting duplicates | Distinguish P(n,r) vs C(n,r) | | Modular arithmetic error | Forgot wraparound | Work with remainders explicitly |
Key Concepts
- Axioms: Statements we assume true
- Theorems: Statements we prove
- Lemmas: Helper theorems
- Corollaries: Results that follow easily
Why It Matters
These foundations enable:
- Understanding algorithm correctness
- Analyzing computational complexity
- Designing new algorithms
- Proving algorithm properties
- Understanding what's computable
Interview Prep
- Explain mathematical induction
- Prove that a function is injective
- Count permutations with constraints
- Solve modular equations
- Apply pigeonhole principle
Related Skills
foryourhealth111-pixel/zarr-python
development
VerifiedTrustedCommunity
Chunked N-D arrays for cloud storage. Compressed arrays, parallel I/O, S3/GCS integration, NumPy/Dask/Xarray compatible, for large-scale scientific computing pipelines.
2,438SKILL.mdUpdated Jul 23, 2026
foryourhealth111-pixel/yeet
tools
VerifiedTrustedCommunity
Use only when the user explicitly asks to stage, commit, push, and open a GitHub pull request in one flow using the GitHub CLI (`gh`).
2,438SKILL.mdUpdated Jul 23, 2026
foryourhealth111-pixel/xlsx
tools
VerifiedTrustedCommunity
Spreadsheet toolkit (.xlsx/.csv). Create/edit with formulas/formatting, analyze data, visualization, recalculate formulas, for spreadsheet processing and analysis.
2,438SKILL.mdUpdated Jul 23, 2026
foryourhealth111-pixel/xan
tools
VerifiedTrustedCommunity
High-performance CSV processing with xan CLI for large tabular datasets, streaming transformations, and low-memory pipelines.
2,438SKILL.mdUpdated Jul 23, 2026