EPTThe Big Programming Thread - Page 849
| Forum Index > General Forum |
Thread Rules 1. This is not a "do my homework for me" thread. If you have specific questions, ask, but don't post an assignment or homework problem and expect an exact solution. 2. No recruiting for your cockamamie projects (you won't replace facebook with 3 dudes you found on the internet and $20) 3. If you can't articulate why a language is bad, don't start slinging shit about it. Just remember that nothing is worse than making CSS IE6 compatible. 4. Use [code] tags to format code blocks. | ||
|
Deleted User 3420
24492 Posts
| ||
|
Manit0u
Poland17548 Posts
 | ||
|
Nesserev
Belgium2760 Posts
| ||
|
Blisse
Canada3710 Posts
I mean, not like we have anything else to talk about... I'm on team allocation for a new job :| it's a very nervous time | ||
|
Manit0u
Poland17548 Posts
| ||
tofucake
Hyrule19184 Posts
 | ||
|
Mr. Wiggles
Canada5894 Posts
 | ||
|
Liebig
France738 Posts
On February 21 2017 06:06 travis wrote: for my last one, does this work for a proof? do the contrapositive: if n is not congruent to 0 (mod 7) then n^3 is not congruent to 0 (mod 7) then just do the cases where n = 1, n = 2, n = 3, n = 4, n = 5, n = 6 proving that the contrapositive holds true for each of these cases? A bit late, your proof can work but it's actually true for any prime number other than 7 :p If a=b[k] and c=d[k] then ac=bd[k] Therefore if n=a[p] then n^3=a^3[p] and a^3=0[p] with a < p a must be 0 because of the fundamental theorem of arithmetic | ||
|
Acrofales
Spain18159 Posts
Good thread title, though  | ||
|
mantequilla
Turkey781 Posts
 | ||
|
Silvanel
Poland4736 Posts
| ||
|
Torte de Lini
Germany38463 Posts
| ||
|
Deleted User 3420
24492 Posts
<3 | ||
|
slmw
Finland233 Posts
| ||
|
Khalum
Austria831 Posts
| ||
|
Manit0u
Poland17548 Posts
| ||
|
Aerisky
United States12129 Posts
| ||
|
Nesserev
Belgium2760 Posts
| ||
|
Acrofales
Spain18159 Posts
| ||
|
Deleted User 3420
24492 Posts
Things went pretty well I think. A couple places seemed desperate. I'd love to get an internship with the John Hopkins University Applied Physics Laboratory. Having a previous security clearance seems to be a big help in generating interest from employers(though I don't actually want to work for the DoD long term...). Oh and here's a question. Debugging for C. Valgrind? Anything else? I haven't actually used gdb yet, is it actually necessary? | ||
| ||
