Questions tagged [factoring]

Question 1

Echo numbers (A383896) are positive integers k such that the largest prime factor of k-1 is a suffix of ...

Question 2

For prime p, the factorization tree is a single vertex in just one way so that a(p) = 1. For composite n, the two subtrees at n are a split of n into two factors n = d * (n/d), without order, so that $...

Question 3

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 ...

Question 4

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 ...

Question 5

Carryless multiplication is an operation similar to binary long multiplication, but with XOR instead of addition: ...

Question 6

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 =...

Question 7

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 ...

Question 8

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. ...

Question 9

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)(...

Question 10

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 ...

Question 11

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 ...

Question 12

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 ...

Question 13

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.....

Question 14

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 ...

Question 15

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 that'...

Stack Exchange Network

Questions tagged [factoring]

Output the Echo Numbers

Number of complete binary unordered tree-factorizations of n

Random factorized numbers

Find the Prime Signature

Carryless factors

Prime Factorization - but on the exponents too

Prime Factorization [duplicate]

Squarefree Palindromes [closed]

"Factorise" a quadratic [duplicate]

Looks prime to me!

No. Of Factors Does the Number Have [duplicate]

Output Distinct Factor Cuboids

Infinitely many primes

Fastest way to iterate over sublattice of discrete lattice

Find all diagonal counts in only one direction [closed]

Hot Network Questions