Modular arithmetic with cardinals.

  • Thread starter cragar
  • Start date
  • Tags
    Arithmetic
In summary, the question at hand is whether operations like {\aleph_0}^{\aleph_0}mod {\aleph_0} would equal \aleph_0, but typically when dealing with periodicity, a finite period is necessary. It is suggested to explore the possibility of using a Fourier series decomposition with an infinite period, but it is not possible to do so. Further considerations should be made regarding any potential transformations, assumptions, and basis in order to determine the nature of these changes.
  • #1
cragar
2,552
3
Can I do operations like [itex] {\aleph_0}^{\aleph_0}mod {\aleph_0} [/itex]
and would this equal [itex] \aleph_0 [/itex]
 
Mathematics news on Phys.org
  • #2
That's an interesting question, but typically when we deal with periodicity, we need to have some kind of finite period to deal with.

In thinking about this, you might want to check out whether you can do a Fourier series decomposition where the period is infinite (which you should not be able to do) [Also I don't mean Fourier transform, but the decomposition into trig components].

Then you should consider why it's not possible to do this, and if it can be done with some transformation of the function, assumptions, and basis that you project to, then consider what the nature of these changes have to be.
 

1. What is modular arithmetic with cardinals?

Modular arithmetic with cardinals is a method of performing arithmetic operations on large numbers by considering only the remainder when dividing by a specified number. It is often used in computer science and cryptography.

2. How is modular arithmetic with cardinals different from regular arithmetic?

In regular arithmetic, we consider all the digits of a number when performing operations. However, in modular arithmetic with cardinals, we only consider the remainder when dividing by a specified number. This means that the result will always be a number between 0 and the specified number - 1.

3. What are the practical applications of modular arithmetic with cardinals?

Modular arithmetic with cardinals is used in computer science and cryptography for tasks such as generating keys, checking for errors in data transmission, and creating secure encryption algorithms.

4. Can you give an example of modular arithmetic with cardinals?

Sure, let's say we want to find the remainder when dividing 27 by 5. Using modular arithmetic with cardinals, we would only consider the remainder, which is 2. So the result would be 2.

5. Are there any limitations to modular arithmetic with cardinals?

Yes, modular arithmetic with cardinals only works on integers, and the specified number cannot be 0. Additionally, the result can only be between 0 and the specified number - 1. It is also important to choose a suitable specified number to avoid potential errors or limitations.

Similar threads

  • General Math
Replies
8
Views
1K
Replies
11
Views
487
  • Calculus
Replies
2
Views
1K
  • Set Theory, Logic, Probability, Statistics
Replies
7
Views
1K
  • Set Theory, Logic, Probability, Statistics
Replies
22
Views
2K
  • Set Theory, Logic, Probability, Statistics
Replies
1
Views
1K
Replies
4
Views
2K
Replies
4
Views
2K
Replies
22
Views
3K
Back
Top