Processing math: 100%
 

GingerAle

avatar
BenutzernameGingerAle
Punkte2234
Membership
Stats
Fragen 4
Antworten 740

 #11
avatar+2234 
+1

Wow! We are having a meltdown, aren’t we? What happened? Did you lose your canteen privileges?

 

My answer is the same as Sir Alan’s?  Did you use a computer to analyze this or did you do it the old-fashioned way?  Never mind, I already know the answer.  Of course, my answer is the same as Sir Alan’s, because brilliant minds think alike. Our answers are both correct, so they have to be the same.

 

 Why do you think this is plagiarism?  In this post:  http://web2.0calc.com/questions/big-cheese#r4  I used an analogy of embezzlement to explain plagiarism to you.  This was reasonable because you were a banker, and you’re probably in the “Big House” for this very reason, so, it seemed like you would understand this.  In that post, I said, “It’s always a good idea to make sure the answer you are copying is the correct answer, because you are less likely to get caught (most of us learn that in grade school). . .”

 

See, Sir Alan’s answer was correct and mine was not, so that kind of, sort of contradicts your accusation, unless I purposely did that to throw the bloodhounds off the scent.   Yep, we brilliant, genetically enhanced chimps will do things like that when we have a mind to.  We know how to use our noodles! We also post parallel solutions when a student has a problem understanding a presentation, or just when we blŏŏdy well feel like practicing. 

 

Anyway, I can understand why you think having the same answer as someone else is plagiarism.  You post computer generated answers, usually preceded by blarney of the most useless kind, believing them to be solutions.  The only time you ever post a true solution is when you’ve plagiarized it. It’s the “Thick as Thieves” theory. Thieves (embezzlers) usually believe everyone else is a thief, too.  The same applies to plagiarists.   

 

I am surprised you use the “phony as a $3 bill” cliché.  I would think you being a banker would know $3 notes were issued by several banks in the mid-nineteenth century –there is nothing phony about them.  Of course, you were a little boy then and probably not too bright or aware.

 

Anyway, Mr. Banker, It is a sad thought to be a “has been.” However, I want you to know I do not think of you as a “has been,” nope, not at all.  I think of you as a “never were.”

 

Well, I think I’ll have a snack: a few gingersnaps and some Canada Dry Ginger Ale. You should try it, after your canteen privileges are restored. 

 

Until next time, Mr. Banker, don’t take any wooden nickels. Cheers.

17.03.2017
 #9
avatar+2234 
+3
16.03.2017
 #7
avatar+2234 
+8

Solution for original velocities of father & son, via kinetic energy

 

(a)vf velocity of father. vs velocity of son. 12mf(vf+1.0)2=2×½mfv2f(vf+1.0)2=2v2fvf+1=2vf | square root of both sidesvf+11.4142vfvf2.4143vf0.4142vf1vf1.4143 (b)12v2s=212(mfv2f)14v2s=v2fv2s=4v2fvs=2vf4.8286m/s

 

Theory & Formulas: Complements of Gottfried Wilhelm Leibniz, with Christiaan Huygens & René Descartes.  (Amazingly, there is very little of Sir Isaac Newton in this.) Produced by Lancelot Link and company. Directed by GingerAle. Sponsored by Naus Corp. Tortoise and Hair Dye:  Artificial intelligence formula for slow blondes and some mathematicians.  New formula now works for red-heads. (Helps to prevent communist sympathies, too.) 

.
15.03.2017
 #4
avatar+2234 
+9

Solution for (n) (smallest positive integer that satisfies the system of congruencies).

n mod 1103 = 1041

n mod 1303 = 859

n mod 2003 = 1095

 

n1041(mod1103)n859(mod1303)n1095(mod2003)Let m=110313032003=2878729627

1103, 1303, and 2003 are coprime numbers (they are actually prime).

n=104113032003[(13032003)φ(1103)1(mod1103)]=modulo inverse (13032003)mod1103=(13032003)11031mod1103=(13032003)1102mod1103=(2609909(mod1103))1102mod1103=(211)1102mod1103=988+85911032003[(11032003)φ(1303)1(mod1303)]=modulo inverse (11032003)mod1303=(11032003)13021mod1303=(11032003)1301mod1303=(2209309(mod1303))1301mod1303=(724)1301mod1303=9+109511031303[(11031303)φ(2003)1(mod2003)]=modulo inverse (11031303)mod2003=(11031303)20021mod2003=(11031303)2001mod2003=(1437209(mod2003))2001mod2003=(1058)2001mod2003=195n=104113032003[988]+85911032003[9]+109511031303[195]n=2684312285772+17080167879+306880051725n=3008272505376n(modm)=3008272505376(mod2878729627)=45161n=45161+k2878729627kZnmin=45161

 

--------------------------------------------

 

Related formulas and principles compliments of Leonhard Euler (totient function),Euclid of Alexandria (Extended Euclidean algorithm), and Brilliant Chinese mathematicians “Chinese Remainder Theorem” LaTex layout and coding adapted from Heureak’s mathematical solution and Latex presentation:http://web2.0calc.com/questions/find-the-smallest-positive-integer-that-satisfies-the-system-of-congruences Produced by Lancelot Link & Co.Directed by GingerAleSponsored by Nause Corp pharmaceuticals: Makers of  Quantum Vaccines for spooky dumbness at a distance and related contagious dumbness diseases (rCDDs). and Master Blarney Filters. Now filters most toxins emitted by blarney bankers and related dumb-dumbs. 

.
13.03.2017