Let n, m be an element of Z+ and a,b be elements of Z. Suppose that a=b(modn) and a =b(modm) and that (n,m)=1. Prove that a=b(mod nm)
Answer Z+ means positive integers. Proof. (a – b) is divisible by n. (a – b) = pn…
-
-
Hyperbola problems?
Question About focus directrix and other information Answer The hyperbola is the least known and used of the…
-
What is the minimum value of X + 1/X=?
Answer Let’s assume further that x is positive real. We start with a simple fact that ANY squares…
-
A famous one: 10:3=3.3333~ /a:b=c / why is c*b not a?
Answer It’s because strictly speaking c*b is NOT defined. Why? Multiplication is Not defined for a number with…
-
Which is greater: 2^3,000,000 or 3^2,000,000 ???
Answer The Answer : 3^(2,000,000) Here’s a simple way. 3,000,000 = 3 x 1,000,000 2,000,000 = 2 x…
-
In the 6 day model of creation, when did God create angels?
Answer An one liner: “Most probably when He created the Heavens… The first day. Because i think the…
-
Disprove 3=2, please!?
Question Can U disprove the following illustration? 3=2 ?? See this illustration: -6 = -6 9-15 = 4-10…
-
Major city tour problem?
Question A tourist wants to visit 3 or more of the 5 major cities in india : Delhi,Mumbai,Chennai,Kolkata,…
-
Do the prime numbers refer to anything existing outside of the world of mathematics?
Answer The greatest secrets in banks, internet security, commerce and governments are protected by codes built on extremely…
-
Compute the following for the given Z(n)?
Question Write your answer in the from [a] where 0 is greater or = to a, and a…