Question

Completely lost on using strong induction for this proof regarding a recursive algorithm.

score 242 · Answer 1 · 2026-04-11 09:52:15

242

Views

Completely lost on using strong induction for this proof regarding a recursive algorithm.

Published on 11 Apr 2026 - 9:52

score 29 · Answer 2 · 2026-04-13 07:09:45

29

Views

Find a permutation making the sum of products to equal a given value

Published on 13 Apr 2026 - 7:09

score 272 · Answer 3 · 2026-04-13 05:28:17

272

Views

Given any set S of 6 natural numbers, must there be two numbers in S that have the same remainder when divided by 8?

Published on 13 Apr 2026 - 5:28

score 67 · Answer 4 · 2026-04-03 06:20:03

67

Views

Proving by Contrapositive (specific question within)

Published on 03 Apr 2026 - 6:20

score 33 · Answer 5 · 2026-04-12 08:31:15

33

Views

Does relation S is transitive

Published on 12 Apr 2026 - 8:31

score 72 · Answer 6 · 2026-04-12 04:16:02

72

Views

How many people have to be gathered to ensure at least 9 people have the same first letter of their first name?

Published on 12 Apr 2026 - 4:16

score 162 · Answer 7 · 2026-03-25 15:22:44

162

Views

Showing that a greatest common divisor must be 1 or 2 using pigeonhole principle

Published on 25 Mar 2026 - 15:22

score 1.2k · Answer 8 · 2026-04-13 05:35:04

1.2k

Views

Show that distinct subsets of a set have equal sums using pigeonhole principle

Published on 13 Apr 2026 - 5:35

score 117 · Answer 9 · 2026-03-27 01:44:57

117

Views

Prove that $2005|\underbrace{55 \ldots5}_{800\text{ digits}}$

Published on 27 Mar 2026 - 1:44

score 220 · Answer 10 · 2026-04-03 17:55:31

220

Views

how many permutation of the letters PQRSTUVWX contain the string VWX or WX

Published on 03 Apr 2026 - 17:55

score 88 · Answer 11 · 2026-04-13 11:50:18

Prove that number $\underbrace{11 \ldots1}_{100} \underbrace{22 \ldots2}_{100}$ is product of two consecutive numbers

score 92 · Answer 12 · 2026-03-30 08:58:53

Show that: $a·c \equiv b·c\ (\text{mod }m)$ with $a, b, c$ and $m$ integers with $m \ge 2$ does not imply $a \equiv b\ (\text{mod }m)$

score 314 · Answer 13 · 2018-11-16 18:05:07

314

Views

Write a bijection to match the set of positive integers with the set of positive integers excluding the multiples of 4.

Published on 16 Nov 2018 - 18:05

score 218 · Answer 14 · 2026-04-12 16:46:44

218

Views

Tile 1xn walkway with selective repetition

Published on 12 Apr 2026 - 16:46

score 357 · Answer 15 · 2026-04-12 16:19:34

357

Views

Show that distinct subsets of a specific-cardinality subset have equal sums

Published on 12 Apr 2026 - 16:19

List Question

Completely lost on using strong induction for this proof regarding a recursive algorithm.

Find a permutation making the sum of products to equal a given value

Given any set S of 6 natural numbers, must there be two numbers in S that have the same remainder when divided by 8?

Proving by Contrapositive (specific question within)

Does relation S is transitive

How many people have to be gathered to ensure at least 9 people have the same first letter of their first name?

Showing that a greatest common divisor must be 1 or 2 using pigeonhole principle

Show that distinct subsets of a set have equal sums using pigeonhole principle

Prove that $2005|\underbrace{55 \ldots5}_{800\text{ digits}}$

how many permutation of the letters PQRSTUVWX contain the string VWX or WX

Prove that number $\underbrace{11 \ldots1}_{100} \underbrace{22 \ldots2}_{100}$ is product of two consecutive numbers

Show that: $a·c \equiv b·c\ (\text{mod }m)$ with $a, b, c$ and $m$ integers with $m \ge 2$ does not imply $a \equiv b\ (\text{mod }m)$

Write a bijection to match the set of positive integers with the set of positive integers excluding the multiples of 4.

Tile 1xn walkway with selective repetition

Show that distinct subsets of a specific-cardinality subset have equal sums

Trending Questions

Popular # Hahtags

Popular Questions