Question

How many times should I jump each day, before and after 9 PM, so I have the same number of jumps every day in both time zones (UTC and GMT -3)?

score 75 · Answer 1 · 2026-04-01 05:46:45

75

Views

How many times should I jump each day, before and after 9 PM, so I have the same number of jumps every day in both time zones (UTC and GMT -3)?

Published on 01 Apr 2026 - 5:46

score 166 · Answer 2 · 2023-06-19 11:09:41

166

Views

Any Strategies to Factorise Expressions (, Faster)?

Published on 19 Jun 2023 - 11:09

score 86 · Answer 3 · 2026-03-26 03:01:27

86

Views

Let $a$ be a sequence where $a_0 = 21$, $a_1 = 35$, and $a_{n+2} = 4a_{n+1} − 4a_n + n^2$ for $n ≥ 2$. Compute $a_{2006} \pmod {100}$

Published on 26 Mar 2026 - 3:01

score 24 · Answer 4 · 2026-03-31 10:07:34

24

Views

Spot the error in this derivation! Multiple markov chains 'racing' on the same state space.

Published on 31 Mar 2026 - 10:07

score 55 · Answer 5 · 2026-03-28 14:53:40

55

Views

Help with translating this wordproblem into mathematical terms or equations and finding a general solution.

Published on 28 Mar 2026 - 14:53

score 216 · Answer 6 · 2023-06-23 11:18:21

216

Views

How can I compute every possible tuple of lists from the elements V, V, V, M, M, M?

Published on 23 Jun 2023 - 11:18

score 49 · Answer 7 · 2026-03-30 21:15:54

49

Views

Finding the roots of an equation / continuous function

Published on 30 Mar 2026 - 21:15

score 68 · Answer 8 · 2026-03-27 14:52:33

68

Views

Is there any way to solve this equation for $x$?: $\sum_{k\in K} e^k \left(\frac{a}{(1+be^{c(x+k)})}-d\right)=0$

Published on 27 Mar 2026 - 14:52

score 74 · Answer 9 · 2023-06-30 15:59:14

74

Views

Probability of finding 1 ball in N boxes choosing randomly n boxes

Published on 30 Jun 2023 - 15:59

score 248 · Answer 10 · 2026-03-27 07:13:50

248

Views

Prerequisites for Apostol's and Spivak's Calculus

Published on 27 Mar 2026 - 7:13

score 227 · Answer 11 · 2023-07-01 21:35:29

227

Views

A candle burns for an hour, and $M$ burnt candles can make a new candle. For how long can $N$ candles keep the room lit?

Published on 01 Jul 2023 - 21:35

score 49 · Answer 12 · 2026-03-27 04:21:58

49

Views

Expected number of cards fixed in a deck after a certain operation, Paul Zeitz, 3.1.28, pg 69, Art and Craft of Problem Solving

Published on 27 Mar 2026 - 4:21

score 98 · Answer 13 · 2026-03-27 07:20:20

98

Views

How to decrease the randomness when solving a math problem?

Published on 27 Mar 2026 - 7:20

score 56 · Answer 14 · 2026-03-29 20:16:29

56

Views

Given $n$ nodes and $k$ edges where $n\geq 3$ and $k \geq n-1$, what is the maximum number of distinct paths that visit each node exactly once?

Published on 29 Mar 2026 - 20:16

score 117 · Answer 15 · 2023-07-08 18:24:29

117

Views

Approach to inequality proofs

Published on 08 Jul 2023 - 18:24

List Question

How many times should I jump each day, before and after 9 PM, so I have the same number of jumps every day in both time zones (UTC and GMT -3)?

Any Strategies to Factorise Expressions (, Faster)?

Let $a$ be a sequence where $a_0 = 21$, $a_1 = 35$, and $a_{n+2} = 4a_{n+1} − 4a_n + n^2$ for $n ≥ 2$. Compute $a_{2006} \pmod {100}$

Spot the error in this derivation! Multiple markov chains 'racing' on the same state space.

Help with translating this wordproblem into mathematical terms or equations and finding a general solution.

How can I compute every possible tuple of lists from the elements V, V, V, M, M, M?

Finding the roots of an equation / continuous function

Is there any way to solve this equation for $x$?: $\sum_{k\in K} e^k \left(\frac{a}{(1+be^{c(x+k)})}-d\right)=0$

Probability of finding 1 ball in N boxes choosing randomly n boxes

Prerequisites for Apostol's and Spivak's Calculus

A candle burns for an hour, and $M$ burnt candles can make a new candle. For how long can $N$ candles keep the room lit?

Expected number of cards fixed in a deck after a certain operation, Paul Zeitz, 3.1.28, pg 69, Art and Craft of Problem Solving

How to decrease the randomness when solving a math problem?

Given $n$ nodes and $k$ edges where $n\geq 3$ and $k \geq n-1$, what is the maximum number of distinct paths that visit each node exactly once?

Approach to inequality proofs

Trending Questions

Popular # Hahtags

Popular Questions