<lang J>groups=:[: +/\ 2 </\ 0 , *
ooze=: [ >. [ +&* [ * [: ; groups@[ <@(* * 2 < >./)/. +
...
12 KB (289 words) - 13:07, 19 August 2015
This is an alternative Perl implementation of a Formal Power Series.
print "sin^2 + cos^2 - 1 = ", $sin*$sin + $cos*$cos - 1, "\n";
...
4 KB (564 words) - 15:18, 19 December 2023
===Implementation:===
// Alternative name: "ASSembly brainF*** interpretER"
...
8 KB (848 words) - 12:06, 1 September 2022
L(i) 2 .. Int(sqrt(n))
FOR n FROM 3 BY 2 WHILE p count < required prime DO
...
27 KB (3,534 words) - 10:26, 15 April 2024
y* [[[0 1] <$> 0] ([[1 <! ([[1 2 0]] <$> 0)]] <$> 0)]
h [[[=?0 [[0]] (2 --0)]]]
...
12 KB (1,765 words) - 11:44, 24 May 2024
1 2
100 2
...
32 KB (4,309 words) - 19:05, 20 April 2024
{{Trans|FreeBASIC|Alternative version, using an OS command to print the source.}}
{{works with|ALGOL 68G|Any - tested with release 2.8.3.win32}}
...
11 KB (1,428 words) - 16:23, 7 March 2024
Let a[n] be the greatest prime dividing the n-th cubefree number for n >= 2. By convention, let a[1] = 1 even though the first cubefree number, 1, has
...urth cubefree number is 4 and it's highest prime factor is 2, hence a[4] = 2.
...
40 KB (4,414 words) - 13:50, 18 May 2024
<big>'''2<sup>7</sup> = 128'''</big> and '''7''' i
the first power of '''2''' whose leading decimal digits are '''12'''.
...
70 KB (8,328 words) - 19:25, 11 March 2024
<code>{{"Rosetta", 7}, {"Code", 4}, {"is", 2}, {"a", 1}, {"programming", 11}, {"chrestomathy", 12}, {"site", 4}}</code>
<code>{{"a", 1}, {"is", 2}, {"site", 4}, {"Code", 4}, {"Rosetta", 7}, {"programming", 11}, {"chrestom
...
40 KB (5,160 words) - 18:02, 11 March 2024
...ber ''' ''p'' ''' such that ''' ''p<sup>2</sup>'' ''' evenly divides ''' ''2<sup>(p − 1)</sup> − 1'' '''.
if V < 2 then return False; end if;
...
37 KB (4,362 words) - 10:17, 24 March 2024
V l = [1, 2, 3, 10, 100, 987654321]
[1, 2, 3, 10, 100, 987654321]
...
54 KB (6,375 words) - 08:39, 1 February 2024
L(ii) 2 .< Int(n ^ 0.5) + 3
2
...
53 KB (6,135 words) - 11:38, 4 February 2024
1 -> 2
2 -> 0
...
53 KB (6,660 words) - 08:33, 7 May 2024
...(131) + PEEK (132) * 256 + 1) + PEEK ( PEEK (131) + PEEK (132) * 256 + 2) * 256</syntaxhighlight>
...e lambda calculus equivalent of an infinite loop. That makes the following 2-bit BLC program the smallest to catch fire:
...
23 KB (3,174 words) - 17:09, 20 April 2024
30 is a Giuga number because its distinct prime factors are 2, 3 and 5 and:
* 30/2 - 1 = 14 is divisible by 2
...
70 KB (8,568 words) - 08:55, 24 April 2024
2 2
From the input above we can know that <math>A</math> is a 2 by 2 matrix.
...
46 KB (5,006 words) - 12:09, 6 February 2024
I (Row % 2 == 1 & Col % 2 == 1) | (Row % 2 == 0 & Col % 2 == 0)
for Col in M'Range (2) loop
...
34 KB (3,214 words) - 13:45, 9 May 2024
Part 2<br>
[(11, 11), (12, 11), (12, 8), (8, 4), (6, 2)]
...
148 KB (14,576 words) - 10:09, 9 June 2024
For example, representing the characters as A..Z, using N=2 we choose to use the first two characters 'AB'. <br>
print(‘superPerm(#2) len = #.’.format(n, sp.len))</syntaxhighlight>
...
82 KB (9,942 words) - 11:14, 11 February 2024