An IMO Divisibility Problem [IMO 1964 Problem 1]

preview_player
Показать описание
Today we solve problem 1 from IMO 1964. This problem asks us to find all positive integers n such that 2^n-1 is divisible by 7, and to prove that there are no positive integers n so that 2^n+1 is divisible by 7. We'll solve both parts of the problem using modular congruence! Stay tuned for more IMO problems and solutions!

0:00 The Intro
0:36 The Titlecard
0:46 The Entrance
0:52 The Sip
0:57 The Problem
13:16 The Dance
13:26 The End

#MathProblems #IMO

Math olympiad problems, all sorts of other math competition problems, and more challenging math problems are soon to come in future episodes! The International Mathematical Olympiad, MATHCOUNTS, the Putnam Exam, AMC, and more! What problem do you want to see next?

Thanks to Nasser Alhouti, Robert Rennie, Barbara Sharrock, and Lyndon for their generous support on Patreon!

I hope you find this video helpful, and be sure to ask any questions down in the comments!

+WRATH OF MATH+

Follow Wrath of Math on...

Рекомендации по теме
Комментарии
Автор

Modulous or whatever it’s called is my favorite operator in programming! It tests for evens, odds, and is also a counter!

cheatyhotbeef
Автор

Awesome video
Could do it myself thankfully 😅
But that said one of the best explanation of mod i have seen :)

pralay
welcome to shbcf.ru