Prove that the number between prime pair is always divisible by 6

Question

indyboy · Accepted Answer

Not true for (3,5)

matho · Answer

let  x and x+2 be the prime pairs......so we have to prove that if x+1 is divisible by 6. 
which can be done by proving that if  x+1 is divisible by 2 and 3 both....

now in nos. x,x+1,x+2 at least 1 should be divisible by 2 and /or 3 . since x and x+2 being prime are divisible by 1 and themselves the only left option is x+1. hence divisible by 3 and 2 both.

RN · Answer

TRUE (with one exception)
(2,3) not considered as prime pair as 2 is even prime number.
(3,5) is the only exception but rest all other can be represented as [(6n-1), (6n+1)] : so the sandwiched number is always divisible by 6.

Ashit Juneja · Answer

Add the pairs and check if they are divisible by 6. the pairs should be greater than 6.
11+13=24
29+31=60

Juniper Networks

Pergunta de entrevista da empresa Juniper Networks

Respostas da entrevista

Empresas seguidas

Buscas de vagas