In this video I show that multiplying a number or its vortex sum (summing digits until a single digit is obtained) yields the exact same vortex sum. This is the cause of nearly all of the amazing vortex

In this video I show that the vortex digit sum (summing the digits until we obtain 1 digit) for any base number system can be obtained quickly by using the default Base 10 Modulo function available in

In this video I show that not only is the vortex sum (summing of digits a number until 1 digit remains) is the remainder when dividing by the largest single digit, but this same number repeats indefinitely

In this video I show how to convert between different base number systems by first writing the number in its equivalent base exponential addition form, and then changing the base. For example, converting

In this video I go over a quick overview of number systems, and show how the base or radix (Latin for "root") serves as the transition point when counting past the single digits. For example,

Math Problem: Use 3 numbers to sum to 50: 1,5,9,11,21,25. You could try every possible unordered pair and check whether that and one of the remaining numbers sums to 50. That methodology requires you to

Day 3 Problem A Math mini-contest for D.Buzz for July 2021 A random integer between -200 and +200 is multiplied by a rational number between -2 and +2. The ranges are inclusive. What is the range of the

Day 2 Problem B Math mini-contest for D.Buzz for July 2021 The decimal number 16,954.248 converts to 1,244.650 in another number system. What is the base of the other number system? The problem has originally

Win 1 HIVE for correctly answering first!

Win 1 HIVE for correctly answering first! 😁 (see rules)

In my last video I showed how to multiply numbers containing only 1's together very quickly using an amazingly easy method. In this video I go over a proof, or more like a brief explanation, showing why

Watch on 3Speak - Odysee - BitChute - Rumble - YouTube - Notes - PDF notes - Excel file - Summary - Vortex Math playlist - MES Science playlist In #MESScience 2 I cover a relatively unknown concept called

How to generate all Pythagorean triples? Read this article to find out!

Over on Quora, I answered the question "What is a program in Java to check whether a number is a sum-product number?" The correct answer, in my opinion, is the following: public static boolean

A daily puzzle from @mathematrix has as its solution a "digit sum sequence": each new term is created by adding the sum of digits of the previous number. So, for example, starting from 1 we get

trash

Over 2000 years ago Euclid was possibly the first to give a proof that there are an infinite number of primes. A proof of this is actually very simple and fairly easy to understand. It is even often touted