Skip to main content
Search type Search syntax
Tags [tag]
Exact "words here"
Author user:1234
user:me (yours)
Score score:3 (3+)
score:0 (none)
Answers answers:3 (3+)
answers:0 (none)
isaccepted:yes
hasaccepted:no
inquestion:1234
Views views:250
Code code:"if (foo != bar)"
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Saves in:saves
Status closed:yes
duplicate:no
migrated:no
wiki:no
Types is:question
is:answer
Exclude -[tag]
-apples
For more details on advanced search visit our help page
Results tagged with
Search options not deleted user 315

The challenge involves mathematics in some central way. Also consider using more specific tags, listed in the tag wiki info.

3 votes

Solving Systems of Equations using Cramer's Rule

Mathematica 40 Setting up the problem in your reference link: s = {{2, 1, 1}, {1, -1, -1}, {1, 1, 1}}; r = {3, 0, 0}; The algorithm (spaces not needed): i = 1; (a = s; a[[All, i++]] = r; Det@ …
Dr. belisarius's user avatar
2 votes

Set Theory Operations Union Only

Mathematica, 1 Chars It's a built-in feature:
Dr. belisarius's user avatar
2 votes
Accepted

Print n weird numbers

Mathematica 99 94 87 Spaces not needed. Slow!: j = i = 0; While[j<#, i++; If[Union@Sign[Tr /@ Subsets@Most@Divisors@i-i]=={-1, 1}, j++; Print@i]]& At the expense of a few chars this is a faster …
Dr. belisarius's user avatar
1 vote

Generate Pascal's Pyramid

Mathematica 65 64 c=Column;c[c@Table[n~Binomial~k,{n,0,p},{k,0,n}]~Table~{p,0,#}]& Usage c=Column;c[c@Table[n~Binomial~k,{n,0,p},{k,0,n}]~Table~{p,0,#}]&@5
Dr. belisarius's user avatar
1 vote

Evaluate the binomial theorem!

Mathematica 36 InputForm@Expand[(#1 a + #2 b )^#3] & Usage InputForm@Expand[(#1 a + #2 b )^#3] &[5, .5, 6] Result: 15625*a^6 +9375.*a^5*b +2343.75*a^4*b^2 +312.5*a^3*b^3 +23.4375*a^2*b^4 + 0.93 …
Dr. belisarius's user avatar
7 votes

Meta Length Logarithms

Mathematica: 2.079.. (length in bytes = 8) 8~Log~#& Usage 8~Log~# &@8 (* 1 *)
Dr. belisarius's user avatar
4 votes

Give the smallest number that has N divisors

Mathematica 38 36 (For[i=1,DivisorSum[++i,1&]!=#,];i)& Usage: (For[i=1,DivisorSum[++i,1&]!=#,];i)&@200 Result: 498960 Edit Some explanation: DivisorSum[n,form] represents the sum of f …
Dr. belisarius's user avatar
2 votes

Gregorian to Noxu Time System Conversion

Mathematica 152 Still has some format issues. Spaces added for clarity Flatten@{#[[5]], {Looplab, Sevit, Hexteria, Sinpad}[[#[[4, 2]] + 1]], N[#[[3, 2]] + #[[2, 2]]/864, 4]} &@ …
Dr. belisarius's user avatar
2 votes

Maclaurin series of Black Box Function

Mathematica, 39 chars InputForm@N@Normal@Series[#1,{x,0,#2}]& Usage %[Sin[x], 8] Output x - 0.16666666666666666*x^3 + 0.008333333333333333*x^5 - 0.0001984126984126984*x^7
Dr. belisarius's user avatar
5 votes

Multiples of 67 in a constructed array of arrays?

Mathematica 82 chars Count[Mod[#,67]==0&/@Flatten@NestList[2MovingAverage[#,2]&,Range[1,99,2],49],True] -> 17
Dr. belisarius's user avatar
1 vote

My Word can beat up your Word

Mathematica Some details still missing a = {"ZOO"}; b = {"NO"} f = FixedPoint[IntegerDigits@Total@# &, #] & If[(s = f /@ NestWhile[(# /. Max@# -> 0 &) /@ # &, (ToCharacterCode @@ # - 64 …
Dr. belisarius's user avatar
3 votes

Perfect powers in more than one way?

Mathematica: 103 chars Spaces can be removed Select[Flatten@ Table[ Solve[Log@#/Log@b == k, k, Integers] /. k -> #, {b, 2, #}] & /@ Range@#, Length@# > 2 &][[All, 1, 1]] & Us …
Dr. belisarius's user avatar