Questions tagged [factoring]
This tag describes challenges related to factoring numbers and polynomials. Not related to the Factor programming language.
39
questions
9
votes
5
answers
2k
views
Random factorized numbers
Input
The code should take an integer \$n\$ between 1 and 1000.
Output
The code should output positive integers with \$n\$ bits. Accompanying each integer should be its full factorization. Each ...
13
votes
25
answers
1k
views
Find the Prime Signature
The Prime Signature of a number is the list of the exponents of the prime factors of a number, sorted in descending order (exponents of 0 are ignored). Inspired by ...
16
votes
11
answers
1k
views
Carryless factors
Carryless multiplication is an operation similar to binary long multiplication, but with XOR instead of addition:
...
12
votes
7
answers
826
views
Prime Factorization - but on the exponents too
Though there is a prime factorization challenge and it's here, this, I feel, will be a bit more interesting than that one.
To understand this, let's have an example; I will use 5,184 for this. \$5184 =...
0
votes
4
answers
211
views
Prime Factorization [duplicate]
Although there was a prime factors challenge posted ten years ago, it has tedious I/O and restricted time. In this challenge, your task is to write a program or function which takes an integer \$n \ge ...
9
votes
8
answers
373
views
Squarefree Palindromes [closed]
Create the shortest function, program, or expression that calculates a sequence of squarefree palindromic numbers.
A squarefree number is one which is not evenly divisible by a square number (i.e. ...
23
votes
28
answers
3k
views
"Factorise" a quadratic [duplicate]
When learning to factorise quadratics in the form \$x^2 + ax + b\$, a common technique is to find two numbers, \$p, q\$ such that
$$pq = b \\
p + q = a$$
as, for such numbers, \$x^2 + ax + b = (x + p)(...
32
votes
20
answers
3k
views
Looks prime to me!
Figuring out whether a given number is prime, while not very complicated, is kind of hard. But making a guess doesn't need to be.
Seeing whether a number is a multiple of 2 or 5 is easy - you can just ...
-7
votes
1
answer
187
views
No. Of Factors Does the Number Have [duplicate]
Create a function which takes in a input integer and then returns the number of factors it has, like if you pass 25 then it will return ...
14
votes
11
answers
852
views
Output Distinct Factor Cuboids
Output Distinct Factor Cuboids
Today's task is very simple: given a positive integer, output a representative of each cuboid formable by its factors.
Explanations
A cuboid's volume is the product ...
29
votes
18
answers
4k
views
Infinitely many primes
Since Euclid, we have known that there are infinitely many primes. The argument is by contradiction: If there are only finitely many, let's say \$p_1,p_2,...,p_n\$, then surely \$m:=p_1\cdot p_2\cdot.....
9
votes
0
answers
269
views
Fastest way to iterate over sublattice of discrete lattice
I need to construct a functor that iterates over the linear representation of a sub-lattice of size \$d_x,d_y,d_z,d_q\$ embedded in a lattice of size \$n_x,n_y,n_z,n_q\$. The sub-lattice corner is ...
2
votes
1
answer
198
views
Find all diagonal counts in only one direction [closed]
If I need to get the number of diagonal squares in all directions:
I do the following formula 2 N − 2 − |x − y| − |x + y − N − 1|
The above example has 13 and ...
38
votes
66
answers
10k
views
Am I not good enough for you?
Background:
The current Perfect Numbers challenge is rather flawed and complicated, since it asks you to output in a complex format involving the factors of the number. This is a purely decision-...
16
votes
12
answers
994
views
Generate some rough numbers
Background
A number n can be described as B-rough if all of the prime factors of n strictly ...