oddnumber

Odd numbers are integers that are not divisible by 2. They have a remainder of 1 when divided by 2. The set of odd numbers includes negative values as well: -5, -3, -1, 1, 3, 5, and so on. Every odd number can be expressed in the form 2n + 1 for some integer n, and equivalently, an odd number is congruent to 1 modulo 2.

Examples of odd numbers include 1, 3, 5, 7, and -1, -3, -5. In modular arithmetic, odd numbers are characterized by the condition n mod 2 = 1. The representation 2n + 1 accounts for all odd integers, positive and negative.

Arithmetic with odd numbers follows simple parity rules. The sum of two odd numbers is even. The difference of two odd numbers is even. The sum of an odd and an even number is odd. The product of two odd numbers is odd, while the product of an odd and an even number is even. These rules extend to more complex expressions and are fundamental to parity arguments in proofs and problem solving.

Relation to other concepts includes their role in prime numbers, where 2 is the only even prime, making all other primes odd. Odd numbers also form an arithmetic progression with a common difference of 2, and they are a basic element in modular arithmetic and divisibility tests. Applications appear in computer algorithms, cryptography, and various branches of number theory where parity is a useful invariant.