jonas

Since 2025-12-21 · 130 days · Last sync 2026-03-19 13:59

Overview
6,325
Reviews
95.3%
Retention
0
Day Streak
33.2h
Study Time
3,027
Cards
454
Mature
18.9s
Avg Time
16.3d
Avg Interval
31d
Best Streak
1,425
Due Now
Activity
Review Activity — Last 12 Months
Study Hours (All Time)
Upcoming Reviews 1,425 overdue
Card Analysis
Card States
Answer Buttons
Interval Distribution
Card Progress by Deck 9.1% overall
Deck Introduced New Left Total Progress
ETH1. SemesterA&D 112 425 537
20.9%
ETH2. SemesterPProg 0 339 339
0.0%
ETH1. SemesterLinAlg 237 229 466
50.9%
ETH1. SemesterEProg 0 205 205
0.0%
ETH2. SemesterDDCA 14 157 171
8.2%
ETH2. SemesterA&W 11 106 117
9.4%
ETH2. SemesterAnalysis 48 63 111
43.2%
ETHScience in PerspectiveAdvanced Finance 0 39 39
0.0%
ETHMajor: Information and Data ProcessingIML 0 26 26
0.0%
ETH1. SemesterDiskMat 1,016 0 1,016
100.0%
Review Insights
Review Time vs Answer Button
Speed by Deck
Deck Reviews Median Avg <3s 3–10s 10–20s 20–30s 30s+ Trend
ETH1. SemesterDiskMat 4,871 12.0s 19.0s 2.5% 38.8% 28.0% 10.7% 20.1%
ETH1. SemesterLinAlg 795 10.5s 17.5s 4.2% 43.4% 24.2% 10.3% 18.0%
ETH1. SemesterA&D 458 10.9s 17.9s 3.1% 42.8% 26.9% 9.4% 17.9%
ETH2. SemesterAnalysis 126 13.2s 22.7s 0.8% 38.9% 21.4% 9.5% 29.4%
ETH2. SemesterDDCA 54 15.4s 25.2s 7.4% 22.2% 27.8% 9.3% 33.3%
ETH2. SemesterA&W 21 37.1s 34.8s 0.0% 23.8% 9.5% 14.3% 52.4%
Sessions
119
Sessions
26.3m
Avg Session
Session Length Distribution
Intra-Session Fatigue Curve
Fun Stats
Evening Fucker
2,054 reviews 6-11pm
4.5%
Sticky — 148 lapses across all reviews
Deep Thinker
11.8s median — 2.8% under 3s, 20.0% over 30s
0
Zen Master — sessions ending in 3+ consecutive fails
0
Cards Buried — 0 by you, 0 by scheduler
67.1m
Machine — 228 cards on 2026-01-09
22:00
Peak Study Hour
10.3%
Reviews After Midnight
0.3
Lapses / Mature Card
2.8%
Sub-3s Reviews
12.0m
Avg Session (5m gap)
0
Worst Again Streak
0
User Buried Now
0
Sched Buried Now
Review Speed Distribution
Marathon Session Types
Fastest Cards
Front Avg Time Ease Interval Reviews
Path 2.4s 280% 28d 3
How many primes exist? (Theorem 4.9) 3.4s 265% 27d 5
What are the two trivial equivalence relations on a set \(A\)?{{c1:: Comple 3.7s 265% 42d 3
Cycle 3.7s 250% 32d 3
What is the double negation law? 3.7s 280% 60d 3
A function is {{c1::bijective (one-to-one correspondence)}} if it is {{c2::both injective and surjec 3.8s 265% 36d 4
Inverse in a group:Addition {{c1::\(-a\)}}Multiplication  3.9s 250% 25d 4
The set \(\mathcal{C} = {{c1::\text{Im}(E)}}\) is called the {{c2::set of codewords}}. 3.9s 250% 21d 5
Walk 4.2s 265% 34d 3
{{c1::\( \neg (A \lor B) \) }} \( \equiv \) {{c2::\( \neg A \land \neg B\)}} 4.2s 265% 44d 3
{{c1::A partial order}} on a set \(A\) is a relation that is:{{c2::reflexive}} 4.2s 250% 30d 3
{{c1::\(\exists x \, \exists y \, F \)}}\(\equiv\){{c2::\(\exists y \, \exists x \, F\)}}. 4.4s 250% 23d 3
For formulas \(F\) and \(H\), where \(x\) does not occur free in&nbs 4.5s 265% 24d 4
\(\mathbb{R}^+ = {{c1:: (0, \infty)}}\)\(\mathbb{R}^+_0 = {{c2::[0, \infty)}}\) 4.6s 265% 32d 3
Is \(\mathbb{N} \times \mathbb{N}\) countable? 4.7s 250% 35d 3
Hardest Cards
Front Lapses Ease Interval Reviews
Consider the poset \((A;\preceq)\). If \(\{a,b\}\) has a {{c2::least upper bound}} 4 170% 9d 14
 A cyclic group of order \(n\) {{c1::is isomorphic to \(\langle \mathbb{Z}_n,\op 4 170% 3d 19
In propositional logic, the {{c1::free symbols of a formula}} are {{c2::all the 4 170% 7d 19
What property does every finite field \(\text{GF}(q)\) have (and what does \(q\) satisfy)? 3 145% 4d 17
For what \(m\) is \(\mathbb{Z}^*_m\) cyclic? (Theorem 5.15) 3 175% 8d 18
State Corollary 5.11 about groups of prime order (what property, what does each element satisfy). 3 175% 8d 11
The {{c1::empty clause \(\emptyset\) (formula with no literals)}} corresponds to an { 3 175% 3d 11
The characteristic of a ring is {{c1::the order of \(1\) in the additive 3 190% 8d 13
What is the number of subgroups of \(\mathbb{Z}_n\)? 3 190% 4d 13
Number of subgroups of \(\langle \mathbb{Z}_m \times \mathbb{Z}_n \rangle\) 3 190% 1d 10
Consider the poset \((A; \preceq)\) and \( S \subseteq A\).\(a \in A\) i 2 165% 9d 13
What important property do equivalence classes have? 2 180% 9d 12
Which operations preserve countability?Let \(A\) and \(A_i\) for \( 2 180% 8d 9
Why does \(ax \equiv_m 1\) have no solution when \(\text{gcd}(a, m) = d > 1\)? 2 195% 8d 12
Proof method: "Indirect Proof of an Implication" 2 195% 8d 11