Sum of series - Determine the sum of the integers among the first 1000 positive integers which are not divisible by 4 or are not divisible by 9. (This is not an exclusive or)
Discrete mathematics - Proper walk through of following proofs required ( for a better understanding )
---
1) Prove that if n is an odd integer then n2 = 1 mod 8
2) Prove that 5n+3 is divisible by 4 for all intege ...
Discrete mathematics proof - (See attached file for full problem description)
---
Let d,m and n be positive integers with m>1 and m≡ 1 (mod d), let
n= c0+mc1+m2c2+m3c3+…+mrcr
be the base=m expansion of n, and le ...
Testing for Divisibility (Without using a Calculator!) - Test the following for divisibility by 2,3,4,5,6,8,9,and 10. (No calculator, explain your thinking).
i. 6 543 210
b. What is the smallest whole number that is divisible by 2,3,4,5,6,8,9 and 10 ...