- #1
Deanmark
- 16
- 0
Compute the remainder of 2^(2^17) + 1 when divided by 19. The book says to first compute 2^17 mod 18 but I don’t understand why we go to mod 18. Advice would be appreciated
Deanmark said:Compute the remainder of 2^(2^17) + 1 when divided by 19. The book says to first compute 2^17 mod 18 but I don’t understand why we go to mod 18. Advice would be appreciated
The purpose of finding the remainder when divided by 19 is to determine the value that is left over after dividing a number by 19. This can be useful in various mathematical calculations, such as modular arithmetic or finding the smallest period of a repeating decimal.
To find the remainder when divided by 19, you can use the modulo operator (%) in most programming languages or use long division by hand. The modulo operator returns the remainder after dividing two numbers, while long division involves repeatedly subtracting multiples of 19 from the original number until you reach a remainder of less than 19.
The number 19 is significant in finding the remainder because it is the divisor in the given problem. The remainder when dividing by 19 can range from 0 to 18, making it a useful number in various mathematical calculations.
In computer science, finding the remainder when divided by 19 is important because it is used in many algorithms and data structures. For example, it can be used in hash functions, where the remainder is taken after dividing by a prime number (such as 19) to reduce the likelihood of collisions.
Yes, finding the remainder when divided by 19 can be used to solve real-world problems. For example, it can be used in financial calculations, such as calculating interest rates or determining the number of payments needed to pay off a loan. It can also be used in physics and engineering, such as determining the period of a repeating waveform or the number of rotations in a mechanical system.